Examples of LogOp

org.locationtech.geogig.api.porcelain.LogOp
Operation to query the commits logs.
The list of commits to return can be filtered by setting the following properties:
- {@link #setLimit(int) limit}: Limits the number of commits to return.
- {@link #setTimeRange(Range) timeRange}: return commits that fall in to the given time range.
- {@link #setSince(ObjectId) since}... {@link #setUntil(ObjectId) until}: Show only commits between the named two commits.
- {@link #addPath(String) addPath}: Show only commits that affect the specified path.
solver.constraints.nary.cnf.LogOp
Logical Operator, to ease clause definition.
@author Charles Prud'homme @since 23 nov. 2010

Examples of solver.constraints.nary.cnf.LogOp

        BoolVar a = VariableFactory.bool("a", solver);
        BoolVar b = VariableFactory.bool("b", solver);
        BoolVar c = VariableFactory.bool("c", solver);




        LogOp root = LogOp.ifThenElse(a, b, c);


        ILogical l = LogicTreeToolBox.toCNF(root, solver);


        Assert.assertEquals(l.toString(), "((a or c) and (b or not(a)) and (b or c))");
    }

View Full Code Here

Examples of solver.constraints.nary.cnf.LogOp

        BoolVar b = VariableFactory.bool("b", solver);
        BoolVar nb = b.not();
        BoolVar c = VariableFactory.bool("c", solver);
        BoolVar d = VariableFactory.bool("d", solver);


        LogOp root = LogOp.and(LogOp.or(a, b, na), LogOp.or(c, d), LogOp.or(b, nb));


        ILogical l = LogicTreeToolBox.toCNF(root, solver);


        Assert.assertEquals(l.toString(), "(c or d)");
    }

View Full Code Here

Examples of solver.constraints.nary.cnf.LogOp

        BoolVar na = a.not();
        BoolVar b = VariableFactory.bool("b", solver);
        BoolVar c = VariableFactory.bool("c", solver);
        BoolVar d = VariableFactory.bool("d", solver);


        LogOp root = LogOp.and(a, b, na, c, d);


        ILogical l = LogicTreeToolBox.toCNF(root, solver);


        Assert.assertEquals(l.toString(), "cste -- 0");
    }

View Full Code Here

Examples of solver.constraints.nary.cnf.LogOp

        long nbSol = solver.getMeasures().getSolutionCount();


        for (int seed = 0; seed < 2000; seed++) {
            Solver sCNF = new Solver();
            BoolVar[] rCNF = VariableFactory.boolArray("b", 3, sCNF);
            LogOp tree = LogOp.ifOnlyIf(
                    rCNF[0],
                    LogOp.and(rCNF[1], rCNF[2])
            );
            SatFactory.addClauses(tree, sCNF);
            sCNF.set(IntStrategyFactory.random_bound(rCNF, seed));

View Full Code Here

0 1 2 3

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.