Updates the state by applying or reverting a decision.
Returns false if fails, i.e. trying to apply an inconsistent decision
to an already assigned item.
[[["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\u003eKnapsackStateForCuts\u003c/code\u003e is a C++ class representing a partial solution to the knapsack problem.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods to initialize, update, and query the state of items within the knapsack solution.\u003c/p\u003e\n"],["\u003cp\u003eThe class includes functionality to track whether items are included (\u003ccode\u003eis_in\u003c/code\u003e) or excluded (\u003ccode\u003eis_bound\u003c/code\u003e) from the current solution.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eUpdateState\u003c/code\u003e allows applying or reverting decisions, ensuring consistency by preventing conflicting assignments.\u003c/p\u003e\n"]]],["`KnapsackStateForCuts` represents a partial knapsack problem solution. Key actions include initializing the state via `Init`, setting items as not bound. `UpdateState` applies or reverts a decision, returning false if inconsistent. Methods `GetNumberOfItems`, `is_bound`, and `is_in` provide information about the current number of items and if an item is bound or part of the current state. Two constructors are provided, and the assignment operator is deleted.\n"],null,[]]