Examples of util.objects.IntCircularQueue

util.objects.IntCircularQueue
A fix sized circular queue optimized for removing first and last elements. Some few (essential regarding the usage) methods are implemented.
Be aware of the size computation: the modulo operation is not efficient in java. On the other hand, the modulo of powers of 2 can alternatively be expressed as a bitwise AND operation:
x % 2n == x & (2n - 1)
That is why the size of the data is automatically set to the closest greater powers of 2 value. @author Charles Prud'homme @since 29 sept. 2010


    @SuppressWarnings({"NullableProblems"})
    @Override
    public void propagate() throws ContradictionException {
        int mask, aid;
        IntCircularQueue evtset;
        if (trigger.needToRun()) {
            trigger.propagate();
        }
        for (int i = nextNotEmpty(0); i > -1; i = nextNotEmpty(0)) {
            while (!pro_queue[i].isEmpty()) {
                lastProp = pro_queue[i].pollFirst();
                // revision of the variable
                aid = p2i.get(lastProp.getId());
                scheduled[aid] = 0;
                if (lastProp.reactToFineEvent()) {
                    evtset = eventsets[aid];
                    while (evtset.size() > 0) {
                        int v = evtset.pollFirst();
                        assert lastProp.isActive() : "propagator is not active:" + lastProp;
                        if (Configuration.PRINT_PROPAGATION) {
                            IPropagationEngine.Trace.printPropagation(lastProp.getVar(v), lastProp);
                        }
                        // clear event

View Full Code Here

    private Decision last; // needed to catch up the case when a subtree is closed, and this imposes the fgmt




    public PGN4Explanation(Solver solver, IntVar[] vars, long seed, int fgmtSize, int listSize) {
        super(solver, vars, seed, fgmtSize, listSize);
        queue = new IntCircularQueue(vars.length);
    }

View Full Code Here

    private Decision last; // needed to catch up the case when a subtree is closed, and this imposes the fgmt




    public RPGN4Explanation(Solver solver, IntVar[] vars, long seed, int fgmtSize, int listSize) {
        super(solver, vars, seed, fgmtSize, listSize);
        queue = new IntCircularQueue(vars.length);
    }

View Full Code Here

0 1

TOP

Related Classes of util.objects.IntCircularQueue

solver.explanations.strategies.PGN4Explanation

solver.explanations.strategies.RPGN4Explanation

solver.propagation.hardcoded.SevenQueuesPropagatorEngine

solver.propagation.hardcoded.TwoBucketPropagationEngine

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.