[[["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\u003eBooleanXorPropagator\u003c/code\u003e enforces the constraint that the XOR of a given set of literals equals a specific Boolean value.\u003c/p\u003e\n"],["\u003cp\u003ePropagation has a time complexity of O(n) but could be optimized using a two-watcher mechanism.\u003c/p\u003e\n"],["\u003cp\u003eThe class provides methods for instantiation, constraint propagation (\u003ccode\u003ePropagate\u003c/code\u003e), and registration with a literal watcher (\u003ccode\u003eRegisterWith\u003c/code\u003e).\u003c/p\u003e\n"]]],["`BooleanXorPropagator` propagates that a XOR of literals equals a given value with O(n) complexity. It uses methods like `Propagate` to return a boolean and `RegisterWith` to interact with a `GenericLiteralWatcher`. The constructor `BooleanXorPropagator` takes a vector of literals, a boolean value, a `Trail`, and an `IntegerTrail`. There is a proposed enhancement to implement a two-watcher mechanism to accelerate the propagation.\n"],null,[]]
