[[["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\u003eThe \u003ccode\u003eFixedModuloPropagator\u003c/code\u003e enforces the constraint \u003ccode\u003etarget == expr % mod\u003c/code\u003e within the CP-SAT solver, where \u003ccode\u003emod\u003c/code\u003e is a positive integer.\u003c/p\u003e\n"],["\u003cp\u003eIt propagates bounds on the involved expressions without special case handling.\u003c/p\u003e\n"],["\u003cp\u003eThe core methods include construction with an expression, modulo, and target, propagation to maintain consistency, and registration with a watcher for triggering updates.\u003c/p\u003e\n"]]],["The `FixedModuloPropagator` class in C++ handles the propagation of the constraint `target == expr % mod`, where `mod` is a positive integer. It propagates only the bounds, without special case extraction. Key actions include: the constructor `FixedModuloPropagator` that takes the expression, modulus, target, and an `IntegerTrail` as arguments. The class provides `Propagate`, which returns a boolean, and `RegisterWith`, which registers with a `GenericLiteralWatcher`.\n"],null,[]]
