How to use

filter

method

in

org.apache.drill.shaded.guava.com.google.common.collect.Sets

@Override
protected Set<Entry<K, V>> createEntrySet() {
 return Sets.filter(unfiltered.entrySet(), predicate);
}

@Override
Set<K> createKeySet() {
 return Sets.filter(unfiltered.keySet(), keyPredicate);
}

FilteredEntryMap(Map<K, V> unfiltered, Predicate<? super Entry<K, V>> entryPredicate) {
 super(unfiltered, entryPredicate);
 filteredEntrySet = Sets.filter(unfiltered.entrySet(), predicate);
}

@Override
public Iterable<JavaFileObject> list(Location location, String packageName, Set<Kind> kinds, boolean recurse) throws IOException {
 return super.list(location, packageName, Sets.filter(kinds, NO_SOURCES_KIND), recurse);
}

@Override
Set<Entry<E>> createEntrySet() {
 return Sets.filter(
   unfiltered.entrySet(),
   new Predicate<Entry<E>>() {
    @Override
    public boolean apply(Entry<E> entry) {
     return predicate.apply(entry.getElement());
    }
   });
}

static <E> Collection<E> filterCollection(
  Collection<E> collection, Predicate<? super E> predicate) {
 if (collection instanceof Set) {
  return Sets.filter((Set<E>) collection, predicate);
 } else {
  return Collections2.filter(collection, predicate);
 }
}

@Override
Set<K> createKeySet() {
 return Sets.filter(unfiltered.keySet(), keyPredicate);
}

@Override
Set<E> createElementSet() {
 return Sets.filter(unfiltered.elementSet(), predicate);
}

@Override
public Set<E> edgesConnecting(N nodeU, N nodeV) {
 Set<E> outEdgesU = outEdges(nodeU);
 Set<E> inEdgesV = inEdges(nodeV);
 return outEdgesU.size() <= inEdgesV.size()
   ? unmodifiableSet(Sets.filter(outEdgesU, connectedPredicate(nodeU, nodeV)))
   : unmodifiableSet(Sets.filter(inEdgesV, connectedPredicate(nodeV, nodeU)));
}

@Override
public NavigableSet<E> descendingSet() {
 return Sets.filter(unfiltered().descendingSet(), predicate);
}

@Override
public NavigableSet<E> subSet(
  E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
 return filter(
   unfiltered().subSet(fromElement, fromInclusive, toElement, toInclusive), predicate);
}

 @Override
 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) {
  return filter(unfiltered().tailSet(fromElement, inclusive), predicate);
 }
}

@Override
public NavigableSet<E> headSet(E toElement, boolean inclusive) {
 return filter(unfiltered().headSet(toElement, inclusive), predicate);
}

@Override
Set<Entry<K, V>> createEntries() {
 return Sets.filter(unfiltered().entries(), entryPredicate());
}

return filter((SortedSet<E>) unfiltered, predicate);