Java PrettyPrinter类代码示例

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
 * Usage: java examples.ConfigAssure <ipAddresses file> <subnets file>
 */
public static void main(String[] args) {
	if (args.length < 2)
		usage();
	try {
		final ConfigAssure ca = new ConfigAssure();
		final Solver solver = new Solver();
		solver.options().setBitwidth(32);
		solver.options().setSolver(SATFactory.MiniSat);

		final Formula formula = ca.requirements();
		final Bounds bounds = ca.bounds(args[0], args[1]);

		System.out.println("---explicit requirements (others are implicit in the bounds)---");
		System.out.println(PrettyPrinter.print(formula, 2));

		System.out.println("\n---solving with config files " + args[0] + " and " + args[1] + "---");

		final Solution sol = solver.solve(formula, bounds);

		System.out.println("\n---OUTCOME---");
		System.out.println(sol.outcome());

		System.out.println("\n---STATS---");
		System.out.println(sol.stats());

		if (sol.instance() != null) {
			System.out.println("\n---INSTANCE--");
			ca.display(sol.instance(), solver.options());
		}
	} catch (IOException ioe) {
		ioe.printStackTrace();
		usage();
	}
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
 * Usage: java examples.alloy.ToyFilesystem
 */
public static void main(String[] args) {
	final ToyFilesystem toy = new ToyFilesystem();
	final Formula f = toy.constraints();
	System.out.println(PrettyPrinter.print(f, 2));
	final Bounds b = toy.bounds();
	final Solver solver = new Solver();
	solver.options().setSolver(SATFactory.MiniSat);

	final Solution s = solver.solve(f, b);
	System.out.println(s);
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
void printFalse(String check, Formula formula, Bounds bounds, Solution sol) {
	print(check, formula, bounds, sol.outcome(), sol.stats());
	System.out.println("trivial core:");
	for (Node f : sol.proof().highLevelCore().values()) {
		System.out.println(PrettyPrinter.print(f, 2, 100));
	}
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
void printUnsat(String check, Formula formula, Bounds bounds, Statistics stats, Set<Formula> initialCore,
		Set<Formula> minCore, long minTime) {
	print(check, formula, bounds, Solution.Outcome.UNSATISFIABLE, stats);
	System.out.println("formulas: " + Nodes.roots(formula).size());
	System.out.println("initial core: " + initialCore.size());
	System.out.println("minimized core with " + minCore.size() + " formulas found in " + minTime + " ms:");
	for (Formula f : minCore) {
		System.out.println(PrettyPrinter.print(f, 2, 100));
	}
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
private void flushFormula(Formula formula, Bounds bounds)  {
    try {
        File f = new File(System.getProperty("java.io.tmpdir"), "kk.txt");
        OutputStream os = new BufferedOutputStream(new FileOutputStream(f));
        os.write(PrettyPrinter.print(formula, 2).getBytes());
        os.write("\n================\n".getBytes());
        os.write(bounds.toString().getBytes());
        os.flush();
        os.close();
    } catch (Exception e) {
    }
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
 * Usage: java examples.alloy.ToyFilesystem
 */
public  static void main(String[] args) {
	final ToyFilesystem toy = new ToyFilesystem();
	final Formula f = toy.constraints();
	System.out.println(PrettyPrinter.print(f, 2));
	final Bounds b = toy.bounds();
	final Solver solver = new Solver();
	solver.options().setSolver(SATFactory.MiniSat);
	
	final Solution s = solver.solve(f, b);
	System.out.println(s);
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
static final void printEncoding(ListEncoding enc) {
	
	System.out.println("\n-----------trace expressions-----------");
	System.out.println("assume invariants(this, next, data, head) && this.head != null && this.head.next != null : ");
	System.out.println(PrettyPrinter.print(enc.pre(), 2));
	System.out.println("next = "+ enc.next);
	System.out.println("head = "+ enc.head);
	
	System.out.println("\nnearNode0 = "+ enc.nearNode0());
	System.out.println("midNode0 = "+ enc.midNode0());
	System.out.println("farNode0 = "+ enc.farNode0());
	
	System.out.println("\nnext0 = "+ enc.next0());
	
	System.out.println("\nguard0 (farNode0 != null) = "+ enc.guard0());
	System.out.println("next1 = "+ enc.next1());
	System.out.println("nearNode1 = "+ enc.nearNode1());
	System.out.println("midNode1 = "+ enc.midNode1());
	System.out.println("farNode1 = "+ enc.farNode1());
	
	System.out.println("\nnext2 = "+ enc.next2());
	System.out.println("nearNode2 = "+ enc.nearNode2());
	System.out.println("midNode2 = "+ enc.midNode2());
	System.out.println("farNode2 = "+ enc.farNode2());
	System.out.println("assume loopGuard (farNode2 = null) : " + enc.loopGuard());
	
	System.out.println("\nnext3 = "+ enc.next3());
	System.out.println("head0 = "+ enc.head0());
	
	System.out.println("\nassert invariants(this, next3, data, head0) &&\n"+
			"(let nodes = this.head.*next, nodes' = this.head0.*next3, ns = nodes - nil |\n" +
			"  nodes' = nodes and next3 & (ns -> ns) = ~(next & (ns -> ns))) :" );
	System.out.println(PrettyPrinter.print(enc.post(), 2));
	System.out.println();
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
 * Usage:  java BlockedNQueens <file name>
 */
public static void main(String[] args) { 
	
	
	if (args.length < 1)
		usage();
	

	try {
					
		final BlockedNQueens2 model = new BlockedNQueens2(args[0]);
		
		final Formula f = model.rules();
		final Bounds b = model.bounds();
		final Solver s = new Solver();
		System.out.println(b);
		System.out.println(PrettyPrinter.print(f, 1));

		s.options().setSolver(SATFactory.MiniSat);
		s.options().setBitwidth(33 - Integer.numberOfLeadingZeros(b.universe().size()));
		s.options().setReporter(new ConsoleReporter());
		
		final Solution sol = s.solve(f, b);
		
		if (sol.instance()!=null) { 
			System.out.println("solution:");
			model.print(sol.instance(), s.options());
		} else {
			System.out.println("no solution");
		}
		System.out.println(sol.stats());
		
	} catch (NumberFormatException nfe) { 
		usage();
	}
	
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
	 * Usage:  java BlockedNQueens <file name>
	 */
	public static void main(String[] args) { 
		
		
		if (args.length < 1)
			usage();
		
	
		try {
						
			final BlockedNQueens model = new BlockedNQueens(args[0]);
			
			final Formula f = model.rules();
			final Bounds b = model.bounds();
			final Solver s = new Solver();
//			System.out.println(b);
			System.out.println(PrettyPrinter.print(f, 1));

			s.options().setSolver(SATFactory.MiniSat);
			s.options().setBitwidth(33 - Integer.numberOfLeadingZeros((b.universe().size()/2) - 1));
			s.options().setReporter(new ConsoleReporter());
			
			final Solution sol = s.solve(f, b);
			
			if (sol.instance()!=null) { 
				System.out.println("solution:");
				model.print(sol.instance(), s.options());
			} else {
				System.out.println("no solution");
			}
			System.out.println(sol.stats());
			
		} catch (NumberFormatException nfe) { 
			usage();
		}
		
	}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
@Override
public String unsatCore() {
    Proof proof = solution.proof();
    if (proof == null)
        return "unknown";
    ReductionStrategy strategy = new AdaptiveRCEStrategy(proof.log()); 
    proof.minimize(strategy);
    int minCore = proof.highLevelCore().size();
    StringBuilder sb = new StringBuilder(); 
    sb.append("Core (size="+minCore+"):\n");
    for(Node n : proof.highLevelCore().values()) { 
        sb.append(PrettyPrinter.print(n, 0)).append("\n");
    }
    return sb.toString();
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
 * Usage: java examples.Hotel [scope]
 */
public static void main(String[] args) {
	if (args.length < 1)
		usage();

	try {
		final int n = Integer.parseInt(args[0]);
		if (n < 1)
			usage();
		final Hotel model = new Hotel();
		final Solver solver = new Solver();
		solver.options().setSolver(SATFactory.MiniSatProver);
		solver.options().setLogTranslation(1);

		final Formula f = model.checkNoBadEntry();
		final Bounds b = model.bounds(n);

		// System.out.println(PrettyPrinter.print(f, 2, 100));

		final Solution sol = solver.solve(f, b);
		System.out.println(sol);

		if (sol.instance() == null) {
			final Proof proof = sol.proof();
			System.out.println("top-level formulas: " + proof.log().roots().size());
			System.out.println("initial core: " + proof.highLevelCore().size());
			System.out.print("\nminimizing core ... ");
			final long start = System.currentTimeMillis();
			proof.minimize(new RCEStrategy(proof.log()));
			final Set<Formula> core = Nodes.minRoots(f, proof.highLevelCore().values());
			final long end = System.currentTimeMillis();
			System.out.println("done (" + (end - start) + " ms).");
			System.out.println("minimal core: " + core.size());
			for (Formula u : core) {
				System.out.println(PrettyPrinter.print(u, 2, 100));
			}
			checkMinimal(core, b);
		} else {
			System.out.println(sol);
		}
	} catch (NumberFormatException nfe) {
		usage();
	}
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
	 * Usage: java examples.Hotel [scope]
	 */
	public static void main(String[] args) {
		if (args.length < 1)
			usage();
		
		try {
			final int n = Integer.parseInt(args[0]);
			if (n < 1)
				usage();
			final Hotel model = new Hotel();
			final Solver solver = new Solver();
			solver.options().setSolver(SATFactory.MiniSatProver);
			solver.options().setLogTranslation(1);
			
			final Formula f = model.checkNoBadEntry();
			final Bounds b = model.bounds(n);
	
//			System.out.println(PrettyPrinter.print(f, 2, 100));
			
			final Solution sol = solver.solve(f, b);
			System.out.println(sol);
		
			if (sol.instance()==null) { 
				final Proof proof = sol.proof();
				System.out.println("top-level formulas: " + proof.log().roots().size());
				System.out.println("initial core: " + proof.highLevelCore().size());
				System.out.print("\nminimizing core ... ");
				final long start = System.currentTimeMillis();
				proof.minimize(new RCEStrategy(proof.log()));
				final Set<Formula> core = Nodes.minRoots(f, proof.highLevelCore().values());
				final long end = System.currentTimeMillis();
				System.out.println("done (" + (end-start) + " ms).");
				System.out.println("minimal core: " + core.size());
				for(Formula u : core) { 
					System.out.println(PrettyPrinter.print(u, 2, 100));
				}
				checkMinimal(core, b);
			} else {
				System.out.println(sol);
			}
		} catch (NumberFormatException nfe) {
			usage();
		}
	}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
void print(Set<Formula> core) { 
	System.out.println(PrettyPrinter.print(core, 3));
}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
/**
	 * Usage:  java NQueens <number of queens> <encoding: int | log | rel>
	 */
	public static void main(String[] args) { 
		if (args.length < 2)
			usage();
		
		try {
			final int n = Integer.parseInt(args[0]);
			if (n < 1 || n <= 0)
				usage();
			
			final NQueens model; 
			if (args[1].compareToIgnoreCase("int")==0) {
				model = new IntQueens(n);
			} else if (args[1].compareToIgnoreCase("log")==0) {
				model = new LogQueens(n);
			} else if (args[1].compareToIgnoreCase("rel")==0) {
				model = new RelQueens(n);
			} else {
				usage();
				return;
			}
			
			final Formula f = model.rules();
			final Bounds b = model.bounds();
			final Solver s = new Solver();
//			System.out.println(b);
			System.out.println("encoding:");
			System.out.println(PrettyPrinter.print(f, 1));

			s.options().setSolver(SATFactory.MiniSat);
			s.options().setBitwidth(33 - Integer.numberOfLeadingZeros(n - 1));
			s.options().setReporter(new ConsoleReporter());
			
			final Solution sol = s.solve(f, b);
			
			if (sol.instance()!=null) { 
				System.out.println("solution:");
				model.print(sol.instance(), s.options());
			} else {
				System.out.println("no solution");
			}
			System.out.println(sol.stats());
			
		} catch (NumberFormatException nfe) { 
			usage();
		}
		
	}
 

import kodkod.util.nodes.PrettyPrinter; //导入依赖的package包/类
@Override
    protected IEvaluator exeSpec(ForgeExpression spec, Set<GlobalVariable> modifies, ForgeConverter fconv) {
        this.modifies = modifies;
        this.fconv = fconv;
        this.forgeScene = fconv.forgeScene();
        this.program = forgeScene.program();

        init();
        
        createRelations();
          
        Bounds bounds = createBounds();
        Log.log(printBoundsSummary(bounds));
        
        Formula formula = convertSpec(spec);
        
        Solver solver = new Solver();
        Log.log("Using bitwidth: " + fconv.bw()); 
        solver.options().setBitwidth(fconv.bw());
//        solver.options().setFlatten(false);
        solver.options().setReporter(SquanderGlobalOptions.INSTANCE.reporter.kkReporter());
        solver.options().setNoOverflow(SquanderGlobalOptions.INSTANCE.noOverflow);
        if (SquanderGlobalOptions.INSTANCE.unsat_core) {
            solver.options().setLogTranslation(1);
            solver.options().setSolver(SATFactory.MiniSatProver); // TODO: read from global options
            solver.options().setCoreGranularity(3);
        } else {
            solver.options().setLogTranslation(0);
            solver.options().setSolver(SquanderGlobalOptions.INSTANCE.sat_solver); 
        }
        
        boolean solveAll = false;
        Options opts = fconv.javaScene().methodSpec().options();
        if (opts != null)
            solveAll = opts.solveAll();
        
        if (solveAll)
            solver.options().setSymmetryBreaking(1000);
        
        Log.debug("==============================================");
        Log.debug("------------- Solving kk formula -------------");
        Log.debug("==============================================");
        Log.debug(PrettyPrinter.print(formula, 2));
        Log.debug("\n" + bounds);
        IEvaluator eval;
        //new KKSimplifier().simplify(formula, bounds);
        if (solveAll) {
            Iterator<Solution> solutions = solver.solveAll(formula, bounds);
            eval = getEval(solutions, solver.options());
        } else {
            Solution solution = solver.solve(formula, bounds);
            eval = getEval(Collections.singleton(solution).iterator(), solver.options());
        }
        return eval;
    }