Unlock 30% off on Manual Testing Annual Plans this Holiday Season.

Copied to Clipboard!

Automation Advisor
Coyote
Microsoft.Coyote.Actors.BugFinding.Tests
FindSuccessorResp

How to use FindSuccessorResp class of Microsoft.Coyote.Actors.BugFinding.Tests package

Best Coyote code snippet using Microsoft.Coyote.Actors.BugFinding.Tests.FindSuccessorResp

ChordTests.cs

Source:ChordTests.cs

...225                    this.Sender = sender;226                    this.Key = key;227                }228            }229            internal class FindSuccessorResp : Event230            {231                public ActorId Node;232                public int Key;233                public FindSuccessorResp(ActorId node, int key)234                    : base()235                {236                    this.Node = node;237                    this.Key = key;238                }239            }240            internal class FindPredecessor : Event241            {242                public ActorId Sender;243                public FindPredecessor(ActorId sender)244                    : base()245                {246                    this.Sender = sender;247                }248            }249            internal class FindPredecessorResp : Event250            {251                public ActorId Node;252                public FindPredecessorResp(ActorId node)253                    : base()254                {255                    this.Node = node;256                }257            }258            internal class QueryId : Event259            {260                public ActorId Sender;261                public QueryId(ActorId sender)262                    : base()263                {264                    this.Sender = sender;265                }266            }267            internal class QueryIdResp : Event268            {269                public int Id;270                public QueryIdResp(int id)271                    : base()272                {273                    this.Id = id;274                }275            }276            internal class AskForKeys : Event277            {278                public ActorId Node;279                public int Id;280                public AskForKeys(ActorId node, int id)281                    : base()282                {283                    this.Node = node;284                    this.Id = id;285                }286            }287            internal class AskForKeysResp : Event288            {289                public List<int> Keys;290                public AskForKeysResp(List<int> keys)291                    : base()292                {293                    this.Keys = keys;294                }295            }296            private class NotifySuccessor : Event297            {298                public ActorId Node;299                public NotifySuccessor(ActorId node)300                    : base()301                {302                    this.Node = node;303                }304            }305            internal class JoinAck : Event306            {307            }308            internal class Stabilize : Event309            {310            }311            internal class Terminate : Event312            {313            }314            private class Local : Event315            {316            }317            private int NodeId;318            private HashSet<int> Keys;319            private int NumOfIds;320            private Dictionary<int, Finger> FingerTable;321            private ActorId Predecessor;322            private ActorId ManagerId;323            [Start]324            [OnEntry(nameof(InitOnEntry))]325            [OnEventGotoState(typeof(Local), typeof(Waiting))]326            [OnEventDoAction(typeof(SetupEvent), nameof(Setup))]327            [OnEventDoAction(typeof(Join), nameof(JoinCluster))]328            [DeferEvents(typeof(AskForKeys), typeof(NotifySuccessor), typeof(Stabilize))]329            private class Init : State330            {331            }332            private void InitOnEntry()333            {334                this.FingerTable = new Dictionary<int, Finger>();335            }336            private void Setup(Event e)337            {338                this.NodeId = (e as SetupEvent).Id;339                this.Keys = (e as SetupEvent).Keys;340                this.ManagerId = (e as SetupEvent).ManagerId;341                var nodes = (e as SetupEvent).Nodes;342                var nodeIds = (e as SetupEvent).NodeIds;343                this.NumOfIds = (int)Math.Pow(2, nodes.Count);344                for (var idx = 1; idx <= nodes.Count; idx++)345                {346                    var start = (this.NodeId + (int)Math.Pow(2, idx - 1)) % this.NumOfIds;347                    var end = (this.NodeId + (int)Math.Pow(2, idx)) % this.NumOfIds;348                    var nodeId = GetSuccessorNodeId(start, nodeIds);349                    this.FingerTable.Add(start, new Finger(start, end, nodes[nodeId]));350                }351                for (var idx = 0; idx < nodeIds.Count; idx++)352                {353                    if (nodeIds[idx] == this.NodeId)354                    {355                        this.Predecessor = nodes[WrapSubtract(idx, 1, nodeIds.Count)];356                        break;357                    }358                }359                this.RaiseEvent(new Local());360            }361            private void JoinCluster(Event e)362            {363                this.NodeId = (e as Join).Id;364                this.ManagerId = (e as Join).ManagerId;365                this.NumOfIds = (e as Join).NumOfIds;366                var nodes = (e as Join).Nodes;367                var nodeIds = (e as Join).NodeIds;368                for (var idx = 1; idx <= nodes.Count; idx++)369                {370                    var start = (this.NodeId + (int)Math.Pow(2, idx - 1)) % this.NumOfIds;371                    var end = (this.NodeId + (int)Math.Pow(2, idx)) % this.NumOfIds;372                    var nodeId = GetSuccessorNodeId(start, nodeIds);373                    this.FingerTable.Add(start, new Finger(start, end, nodes[nodeId]));374                }375                var successor = this.FingerTable[(this.NodeId + 1) % this.NumOfIds].Node;376                this.SendEvent(this.ManagerId, new JoinAck());377                this.SendEvent(successor, new NotifySuccessor(this.Id));378            }379            [OnEventDoAction(typeof(FindSuccessor), nameof(ProcessFindSuccessor))]380            [OnEventDoAction(typeof(FindSuccessorResp), nameof(ProcessFindSuccessorResp))]381            [OnEventDoAction(typeof(FindPredecessor), nameof(ProcessFindPredecessor))]382            [OnEventDoAction(typeof(FindPredecessorResp), nameof(ProcessFindPredecessorResp))]383            [OnEventDoAction(typeof(QueryId), nameof(ProcessQueryId))]384            [OnEventDoAction(typeof(AskForKeys), nameof(SendKeys))]385            [OnEventDoAction(typeof(AskForKeysResp), nameof(UpdateKeys))]386            [OnEventDoAction(typeof(NotifySuccessor), nameof(UpdatePredecessor))]387            [OnEventDoAction(typeof(Stabilize), nameof(ProcessStabilize))]388            [OnEventDoAction(typeof(Terminate), nameof(ProcessTerminate))]389            private class Waiting : State390            {391            }392            private void ProcessFindSuccessor(Event e)393            {394                var sender = (e as FindSuccessor).Sender;395                var key = (e as FindSuccessor).Key;396                if (this.Keys.Contains(key))397                {398                    this.SendEvent(sender, new FindSuccessorResp(this.Id, key));399                }400                else if (this.FingerTable.ContainsKey(key))401                {402                    this.SendEvent(sender, new FindSuccessorResp(this.FingerTable[key].Node, key));403                }404                else if (this.NodeId.Equals(key))405                {406                    this.SendEvent(sender, new FindSuccessorResp(407                        this.FingerTable[(this.NodeId + 1) % this.NumOfIds].Node, key));408                }409                else410                {411                    int idToAsk = -1;412                    foreach (var finger in this.FingerTable)413                    {414                        if (((finger.Value.Start > finger.Value.End) &&415                            (finger.Value.Start <= key || key < finger.Value.End)) ||416                            ((finger.Value.Start < finger.Value.End) &&417                            finger.Value.Start <= key && key < finger.Value.End))418                        {419                            idToAsk = finger.Key;420                        }421                    }422                    if (idToAsk < 0)423                    {424                        idToAsk = (this.NodeId + 1) % this.NumOfIds;425                    }426                    if (this.FingerTable[idToAsk].Node.Equals(this.Id))427                    {428                        foreach (var finger in this.FingerTable)429                        {430                            if (finger.Value.End == idToAsk ||431                                finger.Value.End == idToAsk - 1)432                            {433                                idToAsk = finger.Key;434                                break;435                            }436                        }437                        this.Assert(!this.FingerTable[idToAsk].Node.Equals(this.Id), "Cannot locate successor of {0}.", key);438                    }439                    this.SendEvent(this.FingerTable[idToAsk].Node, new FindSuccessor(sender, key));440                }441            }442            private void ProcessFindPredecessor(Event e)443            {444                var sender = (e as FindPredecessor).Sender;445                if (this.Predecessor != null)446                {447                    this.SendEvent(sender, new FindPredecessorResp(this.Predecessor));448                }449            }450            private void ProcessQueryId(Event e)451            {452                var sender = (e as QueryId).Sender;453                this.SendEvent(sender, new QueryIdResp(this.NodeId));454            }455            private void SendKeys(Event e)456            {457                var sender = (e as AskForKeys).Node;458                var senderId = (e as AskForKeys).Id;459                this.Assert(this.Predecessor.Equals(sender), "Predecessor is corrupted.");460                List<int> keysToSend = new List<int>();461                foreach (var key in this.Keys)462                {463                    if (key <= senderId)464                    {465                        keysToSend.Add(key);466                    }467                }468                if (keysToSend.Count > 0)469                {470                    foreach (var key in keysToSend)471                    {472                        this.Keys.Remove(key);473                    }474                    this.SendEvent(sender, new AskForKeysResp(keysToSend));475                }476            }477            private void ProcessStabilize()478            {479                var successor = this.FingerTable[(this.NodeId + 1) % this.NumOfIds].Node;480                this.SendEvent(successor, new FindPredecessor(this.Id));481                foreach (var finger in this.FingerTable)482                {483                    if (!finger.Value.Node.Equals(successor))484                    {485                        this.SendEvent(successor, new FindSuccessor(this.Id, finger.Key));486                    }487                }488            }489            private void ProcessFindSuccessorResp(Event e)490            {491                var successor = (e as FindSuccessorResp).Node;492                var key = (e as FindSuccessorResp).Key;493                this.Assert(this.FingerTable.ContainsKey(key), "Finger table of {0} does not contain {1}.", this.NodeId, key);494                this.FingerTable[key] = new Finger(this.FingerTable[key].Start, this.FingerTable[key].End, successor);495            }496            private void ProcessFindPredecessorResp(Event e)497            {498                var successor = (e as FindPredecessorResp).Node;499                if (!successor.Equals(this.Id))500                {501                    this.FingerTable[(this.NodeId + 1) % this.NumOfIds] = new Finger(502                        this.FingerTable[(this.NodeId + 1) % this.NumOfIds].Start,503                        this.FingerTable[(this.NodeId + 1) % this.NumOfIds].End,504                        successor);505                    this.SendEvent(successor, new NotifySuccessor(this.Id));506                    this.SendEvent(successor, new AskForKeys(this.Id, this.NodeId));507                }508            }509            private void UpdatePredecessor(Event e)510            {511                var predecessor = (e as NotifySuccessor).Node;512                if (!predecessor.Equals(this.Id))513                {514                    this.Predecessor = predecessor;515                }516            }517            private void UpdateKeys(Event e)518            {519                var keys = (e as AskForKeysResp).Keys;520                foreach (var key in keys)521                {522                    this.Keys.Add(key);523                }524            }525            private void ProcessTerminate() => this.RaiseHaltEvent();526            private static int GetSuccessorNodeId(int start, List<int> nodeIds)527            {528                var candidate = -1;529                foreach (var id in nodeIds.Where(v => v >= start))530                {531                    if (candidate < 0 || id < candidate)532                    {533                        candidate = id;534                    }535                }536                if (candidate < 0)537                {538                    foreach (var id in nodeIds.Where(v => v < start))539                    {540                        if (candidate < 0 || id < candidate)541                        {542                            candidate = id;543                        }544                    }545                }546                for (int idx = 0; idx < nodeIds.Count; idx++)547                {548                    if (nodeIds[idx] == candidate)549                    {550                        candidate = idx;551                        break;552                    }553                }554                return candidate;555            }556            private static int WrapSubtract(int left, int right, int ceiling)557            {558                int result = left - right;559                if (result < 0)560                {561                    result = ceiling + result;562                }563                return result;564            }565        }566        private class Client : StateMachine567        {568            internal class SetupEvent : Event569            {570                public ActorId ClusterManager;571                public List<int> Keys;572                public SetupEvent(ActorId clusterManager, List<int> keys)573                    : base()574                {575                    this.ClusterManager = clusterManager;576                    this.Keys = keys;577                }578            }579            private class Local : Event580            {581            }582            private ActorId ClusterManager;583            private List<int> Keys;584            private int QueryCounter;585            [Start]586            [OnEntry(nameof(InitOnEntry))]587            [OnEventGotoState(typeof(Local), typeof(Querying))]588            private class Init : State589            {590            }591            private void InitOnEntry(Event e)592            {593                this.ClusterManager = (e as SetupEvent).ClusterManager;594                this.Keys = (e as SetupEvent).Keys;595                // LIVENESS BUG: can never detect the key, and keeps looping without596                // exiting the process. Enable to introduce the bug.597                this.Keys.Add(17);598                this.QueryCounter = 0;599                this.RaiseEvent(new Local());600            }601            [OnEntry(nameof(QueryingOnEntry))]602            [OnEventGotoState(typeof(Local), typeof(Waiting))]603            private class Querying : State604            {605            }606            private void QueryingOnEntry()607            {608                if (this.QueryCounter < 5)609                {610                    if (this.RandomBoolean())611                    {612                        var key = this.GetNextQueryKey();613                        this.Logger.WriteLine($"<ChordLog> Client is searching for successor of key '{key}'.");614                        this.SendEvent(this.ClusterManager, new ChordNode.FindSuccessor(this.Id, key));615                        this.Monitor<LivenessMonitor>(new LivenessMonitor.NotifyClientRequest(key));616                    }617                    else if (this.RandomBoolean())618                    {619                        this.SendEvent(this.ClusterManager, new ClusterManager.CreateNewNode());620                    }621                    else622                    {623                        this.SendEvent(this.ClusterManager, new ClusterManager.TerminateNode());624                    }625                    this.QueryCounter++;626                }627                this.RaiseEvent(new Local());628            }629            private int GetNextQueryKey()630            {631                int keyIndex = -1;632                while (keyIndex < 0)633                {634                    for (int i = 0; i < this.Keys.Count; i++)635                    {636                        if (this.RandomBoolean())637                        {638                            keyIndex = i;639                            break;640                        }641                    }642                }643                return this.Keys[keyIndex];644            }645            [OnEventGotoState(typeof(Local), typeof(Querying))]646            [OnEventDoAction(typeof(ChordNode.FindSuccessorResp), nameof(ProcessFindSuccessorResp))]647            [OnEventDoAction(typeof(ChordNode.QueryIdResp), nameof(ProcessQueryIdResp))]648            private class Waiting : State649            {650            }651            private void ProcessFindSuccessorResp(Event e)652            {653                var successor = (e as ChordNode.FindSuccessorResp).Node;654                var key = (e as ChordNode.FindSuccessorResp).Key;655                this.Monitor<LivenessMonitor>(new LivenessMonitor.NotifyClientResponse(key));656                this.SendEvent(successor, new ChordNode.QueryId(this.Id));657            }658            private void ProcessQueryIdResp() => this.RaiseEvent(new Local());659        }660        private class LivenessMonitor : Monitor661        {662            public class NotifyClientRequest : Event663            {664                public int Key;665                public NotifyClientRequest(int key)666                    : base()667                {668                    this.Key = key;...

FindSuccessorResp

Using AI Code Generation

1using Microsoft.Coyote.Actors.BugFinding.Tests;2using System;3using System.Threading.Tasks;4using Microsoft.Coyote.Actors;5using Microsoft.Coyote.TestingServices;6using Microsoft.Coyote.TestingServices.Coverage;7using Microsoft.Coyote.TestingServices.SchedulingStrategies;8using Microsoft.Coyote.TestingServices.Runtime;9using Microsoft.Coyote.TestingServices.Runtime.Loggers;10using Microsoft.Coyote.TestingServices.Runtime.Loggers.Csv;11using Microsoft.Coyote.TestingServices.Runtime.Loggers.Json;12using Microsoft.Coyote.TestingServices.Runtime.Loggers.Xml;13using Microsoft.Coyote.TestingServices.Runtime.Loggers.Html;

Automation Testing Tutorials

Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.