Arguments:
const std::vector<IntegerVariable>& integer_variables,
IntegerValue upper_bound, LinearConstraint* result
This is not const only because non_zeros is sorted. Note that sorting the
non-zeros make the result deterministic whether or not we were in sparse
mode.
TODO(user): Ideally we should convert to IntegerVariable as late as
possible. Prefer to use GetTerms().
[[["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."],[[["`ScatteredIntegerVector` is a C++ class designed for efficient combination of linear expressions."],["It employs a sparse representation initially, transitioning to dense as the number of non-zero elements increases."],["Key methods include `Add`, `AddLinearExpressionMultiple`, `ClearAndResize`, and `ConvertToLinearConstraint` for manipulating and converting the vector."],["The class is used within the or-tools library, specifically for handling linear programming constraints."]]],["The `ScatteredIntegerVector` class efficiently combines linear expressions, switching between sparse and dense storage based on non-zero element count. Key actions include `ClearAndResize` to initialize the vector size. `Add` increments the value at a specific column, and `AddLinearExpressionMultiple` applies a multiplier to multiple terms. `ConvertToLinearConstraint` transforms the vector into a linear constraint using integer variables, while `IsSparse` checks if the vector is in sparse mode. Each operation returns a boolean when there is a potential overflow.\n"]]
