@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override protected Multiset<String> create(String[] elements) { Multiset<String> multiset = LinkedHashMultiset.create(); Collections.addAll(multiset, elements); multiset.addAll(ELEMENTS_TO_FILTER_OUT); return Multisets.filter(multiset, PREDICATE); }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
private Multiset<OWLClass> filterByNamespace(Multiset<OWLClass> classes){ if(namespace != null){ return Multisets.filter(classes, input -> input.toStringID().startsWith(namespace)); } return classes; }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override public Multiset<String> tokenizeToMultiset(String input) { return HashMultiset.create(Multisets.filter( tokenizer.tokenizeToMultiset(input), predicate)); }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
@Override Multiset<K> createKeys() { return Multisets.filter(unfiltered.keys(), keyPredicate); } }
/** @return Tokens with their count, sorted by frequency decreasing, then lexicographically ascending */ private ImmutableMultiset<String> filterAndSort(final Multiset<String> counts) { // This isn't terribly efficient, but it is deterministic // Unfortunately, Guava's multiset doesn't give us a clean way to order both by count and element return Multisets.copyHighestCountFirst( ImmutableSortedMultiset.copyOf( Multisets.filter( counts, new Predicate<String>() { @Override public boolean apply(String s) { return counts.count(s) >= minFrequency; } } ) ) ); }
/** @return Tokens with their count, sorted by frequency decreasing, then lexicographically ascending */ private ImmutableMultiset<String> filterAndSort(final Multiset<String> counts) { // This isn't terribly efficient, but it is deterministic // Unfortunately, Guava's multiset doesn't give us a clean way to order both by count and element return Multisets.copyHighestCountFirst( ImmutableSortedMultiset.copyOf( Multisets.filter( counts, new Predicate<String>() { @Override public boolean apply(String s) { return counts.count(s) >= minFrequency; } } ) ) ); }
@Override protected Multiset<String> create(String[] elements) { Multiset<String> multiset = LinkedHashMultiset.create(); Collections.addAll(multiset, elements); multiset.addAll(ELEMENTS_TO_FILTER_OUT); return Multisets.filter(multiset, PREDICATE); }