This method is called to check the status of the limit. A return
value of true indicates that we have indeed crossed the limit. In
that case, this method will not be called again and the remaining
search will be discarded.
[[["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."],[[["`SearchLimit` serves as the base class for all search limits in constraint programming."],["It provides essential methods for controlling and monitoring the search process, such as `Check` to determine if a limit has been reached, and `Init` for initialization."],["Limits can be copied and cloned using methods like `Copy` and `MakeClone`, ensuring flexibility in managing search behavior."],["`SearchLimit` offers functionalities for interacting with decisions during search, including `BeginNextDecision` and `RefuteDecision`, allowing for fine-grained control over exploration."]]],["The `SearchLimit` class serves as the base for all search limits. Key actions include initializing limits via `Init`, checking limit status with `Check` (returning `true` if crossed), and determining if a limit has been surpassed via `crossed`. Limits can be cloned using `MakeClone` or copied with `Copy`. Other functionalities involve `BeginNextDecision`, `PeriodicCheck`, `RefuteDecision`, `EnterSearch`, and producing a debug string via `DebugString`. It also has a constructor `SearchLimit` and destructor `~SearchLimit`.\n"]]