[[["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\u003e\u003ccode\u003eBasePathFilter\u003c/code\u003e is a C++ class within the OR-Tools constraint solver that works with routing problems.\u003c/p\u003e\n"],["\u003cp\u003eIt utilizes a vector of \u003ccode\u003eIntVar*\u003c/code\u003e representing next nodes and their domain size for filtering.\u003c/p\u003e\n"],["\u003cp\u003eThis class includes methods like \u003ccode\u003eAccept\u003c/code\u003e and \u003ccode\u003eOnSynchronize\u003c/code\u003e for controlling search and synchronization during constraint solving.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eAccept\u003c/code\u003e determines whether a solution is accepted based on objective values and deltas, while \u003ccode\u003eOnSynchronize\u003c/code\u003e updates the filter's state.\u003c/p\u003e\n"]]],["The `BasePathFilter` class in C++ defines methods for managing path filtering. The constructor `BasePathFilter` initializes the filter with a vector of `IntVar*` (nexts) and an integer `next_domain_size`. `Accept` determines if a given assignment is acceptable, taking in assignments and objective bounds. `OnSynchronize` updates the filter based on a given assignment `delta`. `~BasePathFilter` is the destructor.\n"],null,[]]
