[[["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\u003eBasePathFilter is a C++ class within the OR-Tools constraint solver, designed for filtering paths during routing optimization.\u003c/p\u003e\n"],["\u003cp\u003eIt utilizes the \u003ccode\u003eAccept\u003c/code\u003e method to determine acceptable paths based on given assignments and objective ranges.\u003c/p\u003e\n"],["\u003cp\u003eThe class is initialized with a vector of \u003ccode\u003eIntVar\u003c/code\u003e representing next nodes and the size of their domains.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eOnSynchronize\u003c/code\u003e is used to update the filter's internal state based on the latest assignments.\u003c/p\u003e\n"]]],["The `BasePathFilter` class in C++ includes methods for constraint solving. The constructor `BasePathFilter` takes a vector of `IntVar*` (nexts) and an integer (`next_domain_size`) as arguments. It features a destructor `~BasePathFilter`. The `Accept` method returns a boolean value based on assignment parameters, `delta` and `deltadelta`, alongside `objective_min` and `objective_max`. `OnSynchronize` takes assignment parameter delta and returns nothing.\n"],null,[]]
