Examples of TwoBucketPropagationEngine

solver.propagation.hardcoded.TwoBucketPropagationEngine
This engine handles two sets of queues. The first sets of queues manages 'fine events' (that is, calls to `propagate(int,int)' and considers three different subsets: UNARY, BINARY, TERNARY propagators are stored in the top-priority queue, LINEAR propagators are stored in the mid-priority queue, QUADRATIC, CUBIC, VERY_SLOW propagators are stored in the low priority queue.
Then, managing coarse events (that is, delayed calls to `propagate(int)') is made thanks to 4 additional queues: UNARY, BINARY, TERNARY propagators cannot be delayed! LINEAR propagators are in the top-priority queue, QUADRATIC propagators are in the second-priority queue, CUBIC propagators are in the second-priority queue, VERY_SLOW propagators are in the second-priority queue.
The engine empties the first queue, then propagates one event from the following one, and check the first queue again, etc. @author Charles Prud'homme @since 05/07/12

Examples of solver.propagation.hardcoded.TwoBucketPropagationEngine

    /**
     * This method should not be called externally. It launches the resolution process.
     */
    protected void solve(boolean stopAtFirst) {
        if (engine == NoPropagationEngine.SINGLETON) {
            this.set(new TwoBucketPropagationEngine(this));
        }
        measures.setReadingTimeCount(creationTime + System.nanoTime());
        search.launch(stopAtFirst);
    }

View Full Code Here

Examples of solver.propagation.hardcoded.TwoBucketPropagationEngine

     *
     * @throws ContradictionException
     */
    public void propagate() throws ContradictionException {
        if (engine == NoPropagationEngine.SINGLETON) {
            this.set(new TwoBucketPropagationEngine(this));
        }
        engine.propagate();
    }

View Full Code Here

Examples of solver.propagation.hardcoded.TwoBucketPropagationEngine

    }


    @Override
    public void run() {
        if (solver.getEngine() == NoPropagationEngine.SINGLETON) {
            solver.set(new TwoBucketPropagationEngine(solver));
        }
        solver.getMeasures().setReadingTimeCount(creationTime + System.nanoTime());
        solver.getSearchLoop().launch(saf);
    }

View Full Code Here

Examples of solver.propagation.hardcoded.TwoBucketPropagationEngine

        Assert.assertNotNull(solver);
    }


    @Test(groups = {"1s"})
    public void testEngine1() {
        IPropagationEngine eng = new TwoBucketPropagationEngine(new Solver());
        File file = null;
        try {
            file = write(eng);
        } catch (IOException e) {
            e.printStackTrace();

View Full Code Here

Examples of solver.propagation.hardcoded.TwoBucketPropagationEngine

    this.printDescription();
    this.createSolver();
    this.buildModel();
    this.configureSearch();
    overrideExplanation();
    solver.set(new TwoBucketPropagationEngine(solver));
    if (level.getLevel() > Level.SILENT.getLevel()) {
      SearchMonitorFactory.log(solver,
          level.getLevel() > Level.VERBOSE.getLevel(),
          level.getLevel() > Level.SOLUTION.getLevel());
    }

View Full Code Here

TOP

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.