List of usage examples for org.apache.commons.collections Predicate toString
public String toString()
From source file:com.ibm.amc.data.filter.QueryFilter.java
/** * Provide a better toString() for logging */// w ww . j a va 2s. com @Override public String toString() { StringBuilder sb = new StringBuilder("Operator="); sb.append(operator.toString()); sb.append(" Clauses="); for (Predicate predicate : clauses) { sb.append("["); if (predicate != null) { sb.append(predicate.toString()); } else { sb.append("null"); } sb.append("]"); } return sb.toString(); }
From source file:no.sesat.search.query.analyser.Scorer.java
private String toString(final Predicate predicate) { return predicate instanceof TokenPredicate ? predicate.toString() : context.getNameForAnonymousPredicate(predicate); }
From source file:test.edu.uci.ics.jung.graph.predicates.EdgePredicateTest.java
public void testEnforcesEdgePredicate() { Predicate p = new UserDatumEdgePredicate("key", "a"); Collection predicates = g.getEdgeConstraints(); assertFalse(PredicateUtils.enforcesEdgeConstraint(g, p)); v1 = g.addVertex(new SparseVertex()); try {//from w w w . j a va 2s. c o m predicates.add(p); fail("should not allow new predicates in a non-empty graph " + p); } catch (IllegalArgumentException iae) { } g.removeAllVertices(); predicates.add(p); v1 = g.addVertex(new SparseVertex()); v2 = g.addVertex(new SparseVertex()); v3 = g.addVertex(new SparseVertex()); Edge e2 = new DirectedSparseEdge(v1, v2); Edge e3 = new DirectedSparseEdge(v3, v3); Edge e4 = new DirectedSparseEdge(v2, v1); e2.addUserDatum("key", "a", UserData.SHARED); e3.addUserDatum("key", "a", UserData.SHARED); e4.addUserDatum("key", "a", UserData.SHARED); g.addEdge(e2); g.addEdge(e3); g.addEdge(e4); assertTrue(PredicateUtils.enforcesEdgeConstraint(g, p)); try { Edge e5 = new DirectedSparseEdge(v2, v3); g.addEdge(e5); fail(p.toString()); } catch (IllegalArgumentException iae) { } Edge e6 = new DirectedSparseEdge(v3, v2); e6.addUserDatum("key", "a", UserData.SHARED); g.addEdge(e6); assertTrue(predicates.remove(p)); assertFalse(predicates.remove(p)); assertTrue(PredicateUtils.satisfiesEdgeConstraint(g, p)); }
From source file:test.edu.uci.ics.jung.graph.predicates.VertexPredicateTest.java
public void testEnforcesVertexPredicate() { Predicate p = new UserDatumVertexPredicate("key", "a"); Collection predicates = g.getVertexConstraints(); assertFalse(predicates.contains(p)); try {//from ww w . j a v a 2 s .co m predicates.add(p); fail("should not be able to add predicates to a non-empty graph"); } catch (IllegalArgumentException iae) { } g.removeAllVertices(); predicates.add(p); v1 = new SparseVertex(); v2 = new SparseVertex(); v3 = new SparseVertex(); v1.addUserDatum("key", "a", UserData.SHARED); v2.addUserDatum("key", "a", UserData.SHARED); v3.addUserDatum("key", "a", UserData.SHARED); g.addVertex(v1); g.addVertex(v2); g.addVertex(v3); assertTrue(predicates.contains(p)); try { Vertex v4 = new SparseVertex(); g.addVertex(v4); fail(p.toString()); } catch (IllegalArgumentException iae) { } Vertex v5 = new SparseVertex(); v5.addUserDatum("key", "a", UserData.SHARED); g.addVertex(v5); assertTrue(predicates.remove(p)); assertFalse(predicates.remove(p)); assertTrue(PredicateUtils.satisfiesVertexConstraint(g, p)); }