@Override public boolean accept(Tuple<A, B> element) { return predicate.accept(element.second); } });
@Override public boolean accept(T element) { for (Predicate<? super T> delegate : delegates) { if (delegate.accept(element)) return true; } return false; } };
@Override public boolean accept(Tuple<A, B> element) { return predicate.accept(element.first); } });
@Override public boolean accept(T element) { for (Predicate<? super T> delegate : delegates) { if (delegate.accept(element)) return true; } return false; } };
@Override public boolean accept(Tuple<A, B> element) { return predicate.accept(element.first); } });
@Override public boolean accept(Tuple<A, B> element) { return predicate.accept(element.second); } });
@Override public Boolean map(Integer input) { return evenp.accept(input); } };
@Override public T map(S input) { Mapper<S, T> active = predicate.accept(input) ? ifAccepted : ifRejected; return active.map(input); } };
@Override public T map(S input) { Mapper<S, T> active = predicate.accept(input) ? ifAccepted : ifRejected; return active.map(input); } };
/** * @since 5.2.0 */ public static <T extends Comparable<T>> List<T> matchAndSort(Collection<? extends T> collection, Predicate<T> predicate) { assert predicate != null; List<T> result = CollectionFactory.newList(); for (T object : collection) { if (predicate.accept(object)) result.add(object); } Collections.sort(result); return result; }
/** * @since 5.2.0 */ public static <T extends Comparable<T>> List<T> matchAndSort(Collection<? extends T> collection, Predicate<T> predicate) { assert predicate != null; List<T> result = CollectionFactory.newList(); for (T object : collection) { if (predicate.accept(object)) result.add(object); } Collections.sort(result); return result; }
/** * Tries to find an element under this element (including itself) accepted by the given predicate. * * @param predicate * Predicate to accept the element * @return the element if found. null if not found. * @since 5.2.3 */ public Element getElement(Predicate<Element> predicate) { LinkedList<Element> queue = CollectionFactory.newLinkedList(); queue.add(this); while (!queue.isEmpty()) { Element e = queue.removeFirst(); if (predicate.accept(e)) return e; for (Element child : e.childElements()) { queue.addLast(child); } } // Exhausted the entire tree return null; }
@Override public LazyContinuation<T> next() { Flow<T> cursor = flow; while (!cursor.isEmpty()) { T potential = cursor.first(); if (predicate.accept(potential)) return new LazyContinuation<T>(potential, new LazyFilter<T>(predicate, cursor.rest())); cursor = cursor.rest(); } return null; } }
@Override public LazyContinuation<T> next() { Flow<T> cursor = flow; while (!cursor.isEmpty()) { T potential = cursor.first(); if (predicate.accept(potential)) return new LazyContinuation<T>(potential, new LazyFilter<T>(predicate, cursor.rest())); cursor = cursor.rest(); } return null; } }