[[["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\u003eIntVarFilteredHeuristic\u003c/code\u003e is a generic filter-based heuristic applied to \u003ccode\u003eIntVars\u003c/code\u003e in constraint programming.\u003c/p\u003e\n"],["\u003cp\u003eIt utilizes a \u003ccode\u003eLocalSearchFilterManager\u003c/code\u003e to manage filters during the search process.\u003c/p\u003e\n"],["\u003cp\u003eThe heuristic builds solutions and provides statistics on search decisions and rejections.\u003c/p\u003e\n"],["\u003cp\u003eIt can be constructed with primary and secondary integer variables for more complex filtering strategies.\u003c/p\u003e\n"]]],["`IntVarFilteredHeuristic` is a class for applying filter-based heuristics to `IntVars`. Key actions include: `BuildSolution`, which attempts to find and return a solution (`Assignment`) or `nullptr` if not found. `number_of_decisions` and `number_of_rejects` provide search statistics. `IntVarFilteredHeuristic` is the constructor, accepting a solver, `IntVars`, secondary `IntVars`, and a `LocalSearchFilterManager`, and `~IntVarFilteredHeuristic` is the destructor. The class also includes a `DebugString` method.\n"],null,[]]