[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThe \u003ccode\u003eIndexPairSwapActiveOperator\u003c/code\u003e is designed for manipulating vehicle routes by inserting inactive nodes and deactivating active node pairs.\u003c/p\u003e\n"],["\u003cp\u003eIt works by selecting pairs of indices from a provided list and modifying the active/inactive status of nodes at those positions within the route.\u003c/p\u003e\n"],["\u003cp\u003eThis operator is utilized within constraint programming for tasks like vehicle routing optimization.\u003c/p\u003e\n"],["\u003cp\u003eThe operator includes methods for generating descriptions, constructing neighbors, and managing state during search.\u003c/p\u003e\n"]]],["The `IndexPairSwapActiveOperator` class manages the insertion of inactive nodes into a path and simultaneously deactivates a pair of active nodes. It has methods for creating and managing neighborhoods. Key functions include `DebugString` (returns a string representation), `MakeNeighbor` (returns a boolean), `MakeNextNeighbor` (takes two assignments as input and returns a boolean), and a constructor and destructor. It also receives variables, secondary variables, a start function, and index pairs.\n"],null,[]]
