Example usage for org.apache.commons.collections Predicate evaluate

Introduction

In this page you can find the example usage for org.apache.commons.collections Predicate evaluate.

Prototype

public boolean evaluate(T object);

Source Link

Document

Use the specified parameter to perform a test that returns true or false.

Usage

From source file:lt.kape1395.jenkins.ditz.model.IssueActivePredicateTest.java

@Test
public void testEvaluate() {
    Predicate p = new IssueActivePredicate();
    Issue i1 = new Issue("a", "b", "c", Status.CLOSED, "d");
    Issue i2 = new Issue("a", "b", "c", Status.IN_PROGRESS, "d");
    Issue i3 = new Issue("a", "b", "c", Status.PAUSED, "d");
    Issue i4 = new Issue("a", "b", "c", Status.UNSTARTED, "d");
    Issue i5 = new Issue("a", "b", "c", "some", "d");
    assertThat(p.evaluate(i1), is(false));
    assertThat(p.evaluate(i2), is(true));
    assertThat(p.evaluate(i3), is(true));
    assertThat(p.evaluate(i4), is(true));
    assertThat(p.evaluate(i5), is(true)); // unknown statuses are considered active.

    i1.setStatusChange(null); // Null is the same as unchanged
    i2.setStatusChange(null);/*from w w  w  . j  a v a2s. c om*/
    i3.setStatusChange(null);
    i4.setStatusChange(null);
    i5.setStatusChange(null);
    assertThat(p.evaluate(i1), is(false));
    assertThat(p.evaluate(i2), is(true));
    assertThat(p.evaluate(i3), is(true));
    assertThat(p.evaluate(i4), is(true));
    assertThat(p.evaluate(i5), is(true)); // unknown statuses are considered active.

    i1.setStatusChange(StatusChange.UNCHANGED);
    i2.setStatusChange(StatusChange.UNCHANGED);
    i3.setStatusChange(StatusChange.UNCHANGED);
    i4.setStatusChange(StatusChange.UNCHANGED);
    i5.setStatusChange(StatusChange.UNCHANGED);
    assertThat(p.evaluate(i1), is(false));
    assertThat(p.evaluate(i2), is(true));
    assertThat(p.evaluate(i3), is(true));
    assertThat(p.evaluate(i4), is(true));
    assertThat(p.evaluate(i5), is(true)); // unknown statuses are considered active.

    i1.setStatusChange(StatusChange.CLOSED);
    i2.setStatusChange(StatusChange.CLOSED);
    i3.setStatusChange(StatusChange.CLOSED);
    i4.setStatusChange(StatusChange.CLOSED);
    i5.setStatusChange(StatusChange.CLOSED);
    assertThat(p.evaluate(i1), is(true));
    assertThat(p.evaluate(i2), is(true));
    assertThat(p.evaluate(i3), is(true));
    assertThat(p.evaluate(i4), is(true));
    assertThat(p.evaluate(i5), is(true));

    i1.setStatusChange(StatusChange.NEW);
    i2.setStatusChange(StatusChange.NEW);
    i3.setStatusChange(StatusChange.NEW);
    i4.setStatusChange(StatusChange.NEW);
    i5.setStatusChange(StatusChange.NEW);
    assertThat(p.evaluate(i1), is(true));
    assertThat(p.evaluate(i2), is(true));
    assertThat(p.evaluate(i3), is(true));
    assertThat(p.evaluate(i4), is(true));
    assertThat(p.evaluate(i5), is(true));

    i1.setStatusChange(StatusChange.MODIFIED);
    i2.setStatusChange(StatusChange.MODIFIED);
    i3.setStatusChange(StatusChange.MODIFIED);
    i4.setStatusChange(StatusChange.MODIFIED);
    i5.setStatusChange(StatusChange.MODIFIED);
    assertThat(p.evaluate(i1), is(true));
    assertThat(p.evaluate(i2), is(true));
    assertThat(p.evaluate(i3), is(true));
    assertThat(p.evaluate(i4), is(true));
    assertThat(p.evaluate(i5), is(true));

}

---

From source file:edu.uci.ics.jung.utils.SubsetManager.java

/**
 * Creates an edge subset based on <code>p</code>.
 * @param p     the predicate defining the subset
 * @return      true if a subset was created; false if the subset already existed
 *//*w  ww .  ja  v a  2  s  .com*/
public boolean addEdgeSubset(Predicate p) {
    Map eMap = getEdgeMap();
    if (!eMap.containsKey(p)) {
        Set subset = new HashSet();
        eMap.put(p, subset);
        for (Iterator e_iter = g.getEdges().iterator(); e_iter.hasNext();) {
            ArchetypeEdge e = (ArchetypeEdge) e_iter.next();
            if (p.evaluate(e))
                subset.add(e);
        }
        return true;
    }
    return false;
}

---

From source file:edu.uci.ics.jung.utils.SubsetManager.java

/**
 * Creates a vertex subset based on <code>p</code>.
 * @param p     the predicate defining the subset
 * @return      true if a subset was created; false if the subset already existed
 *//*from   w w  w.  j a  v  a 2 s . co m*/
public boolean addVertexSubset(Predicate p) {
    Map vMap = getVertexMap();
    if (!vMap.containsKey(p)) {
        Set subset = new HashSet();
        vMap.put(p, subset);
        for (Iterator v_iter = g.getVertices().iterator(); v_iter.hasNext();) {
            ArchetypeVertex v = (ArchetypeVertex) v_iter.next();
            if (p.evaluate(v))
                subset.add(v);
        }
        return true;
    }
    return false;
}

---

From source file:com.projity.pm.graphic.spreadsheet.common.transfer.NodeListTransferHandler.java

private boolean transformSubprojectBranches(Node parent, NodeModelDataFactory dataFactory, Predicate p) {
    if (dataFactory instanceof Project && parent.getImpl() instanceof SubProj
    //               &&!((Project)dataFactory).getSubprojectHandler().canInsertProject( ((SubProj)parent.getImpl()).getSubprojectUniqueId() )
    //TODO disabled, improve paste of subprojects
    ) {/*from  ww w  .  j  a v  a 2  s  . c  o  m*/
        if (!p.evaluate(parent))
            return false;

    }
    for (Enumeration e = parent.children(); e.hasMoreElements();) {
        Node node = (Node) e.nextElement();
        if (!transformSubprojectBranches(node, dataFactory, p))
            return false;

    }
    return true;
}

---

From source file:com.projity.grouping.core.hierarchy.AbstractMutableNodeHierarchy.java

/**
 * Convenience method to convert hierarchy to a list of nodes in depth-first order.
 * @return//from w w w.java  2  s .  c om
 */
public List toList(final boolean isNode, final Predicate filter) {
    final ArrayList list = new ArrayList();
    visitAll(new Closure() {
        public void execute(Object node) {
            if (filter != null && !filter.evaluate(((Node) node).getImpl()))
                return;
            if (isNode)
                list.add(node);
            else
                list.add(((Node) node).getImpl());
        }
    });
    return list;
}

---

From source file:module.siadap.domain.SiadapEvaluationUniverse.java

protected <T extends SiadapEvaluationItem> List<T> getEvaluations(Class<T> clazz, Predicate predicate,
        Comparator<T> comparator) {
    List<T> evaluationItems = new ArrayList<T>();
    for (SiadapEvaluationItem item : getSiadapEvaluationItems()) {
        if (clazz.isAssignableFrom(item.getClass()) && (predicate == null || predicate.evaluate(item))) {
            evaluationItems.add((T) item);
        }/*from   ww  w.  ja va2 s. c  o  m*/
    }
    if (comparator == null) {
        Collections.sort(evaluationItems, SiadapEvaluationItem.COMPARATOR_BY_DATE);
    } else {
        Collections.sort(evaluationItems, comparator);
    }
    return evaluationItems;
}

---

From source file:net.javacoding.queue.DiskQueue.java

/**
 * @see org.archive.queue.Queue#deleteMatchedItems(org.apache.commons.collections.Predicate)
 */// ww w. jav a 2  s  .com
public long deleteMatchedItems(Predicate matcher) {
    // While not processed as many items as there currently are in the queue
    //  dequeue item
    //  if it does not match, requeue it.
    //  else discard it
    // end loop
    long itemsInQueue = length();
    long numberOfDeletes = 0;
    for (int i = 0; i < itemsInQueue; i++) {
        Object o = dequeue();
        if (matcher.evaluate(o) == false) {
            // Not supposed to delete this one, put it back
            enqueue(o);
        } else {
            numberOfDeletes++;
        }
    }
    return numberOfDeletes;
}

---

From source file:com.projity.script.ContextStore.java

public List<ConverterContext> getContexts(int type, Predicate filter) {
    //   System.out.println("getContext type="+type);
    //   for (int t: contexts.keySet()){
    //      System.out.println("type="+t);
    //      for (ConverterContext ctx: contexts.get(t))
    //         System.out.println("\tctx="+ctx);
    //   }//from  www. j  ava 2 s . c o  m
    List<ConverterContext> ctxs = contexts.get(type);
    List<ConverterContext> c = null;
    if (ctxs != null) {
        c = new ArrayList<ConverterContext>(ctxs.size());
        for (ConverterContext ctx : ctxs) {
            if (filter == null || filter.evaluate(ctx))
                c.add((ConverterContext) ctx.clone());
        }
    }
    return c;
}

---

From source file:net.sourceforge.fenixedu.domain.messaging.AnnouncementBoard.java

private List<Announcement> filterAnnouncements(Collection<Announcement> announcements,
        final Predicate predicate) {
    return (List<Announcement>) CollectionUtils.select(announcements, new Predicate() {
        @Override/*  w w w .  j a va2  s  . com*/
        public boolean evaluate(Object arg0) {
            Announcement announcement = (Announcement) arg0;
            return announcement.getApproved() && predicate.evaluate(arg0);
        }

    });
}

---

From source file:module.siadap.domain.wrappers.SiadapUniverseWrapper.java

private int getNrEvaluationsBasedOnPredicate(Collection<PersonSiadapWrapper> personsToEvaluatePredicateOn,
        Predicate predicate) {
    int counter = 0;
    for (PersonSiadapWrapper siadapWrapper : personsToEvaluatePredicateOn) {
        if (predicate.evaluate(siadapWrapper)) {
            counter++;//from ww w .jav a  2  s  .  c o  m
        }
    }
    return counter;
}

---

• «
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• »