@Override public boolean applySV(int value) { return _matchingValues.contains(value); } }
@Override public boolean applySV(int value) { return !_nonMatchingValues.contains(value); } }
@Override public boolean applySV(int dictId) { return !_nonMatchingDictIdSet.contains(dictId); }
@Override public boolean applySV(int dictId) { return _matchingDictIdSet.contains(dictId); }
@Override public boolean applySV(int dictId) { return _matchingDictIdSet.contains(dictId); }
@Override public int[] getMatchingDictIds() { if (_matchingDictIds == null) { int dictionarySize = _dictionary.length(); _matchingDictIds = new int[dictionarySize - _numNonMatchingDictIds]; int index = 0; for (int dictId = 0; dictId < dictionarySize; dictId++) { if (!_nonMatchingDictIdSet.contains(dictId)) { _matchingDictIds[index++] = dictId; } } } return _matchingDictIds; }
private static int[] filterInts(IntSet intSet, int[] source) { IntList intList = new IntArrayList(); for (int value : source) { if (intSet.contains(value)) { intList.add(value); } } if (intList.size() == source.length) { return source; } else { return intList.toIntArray(); } }
while (childrenIterator.hasNext()) { StarTreeNode childNode = childrenIterator.next(); if (matchingDictIds.contains(childNode.getDimensionValue())) { queue.add( new SearchEntry(childNode, newRemainingPredicateColumns, searchEntry._remainingGroupByColumns));
verify(!pagesToCompact.contains(newPageId)); pagesToCompact.add(newPageId);
public boolean contains(int val) { final int h = val * MIXER; final long bits = _filter[h & _mask]; return (bits & (1L << (h >>> 26))) != 0 && (bits & (1L << ((h >> 20) & 0x3F))) != 0 && _set.contains(val); }
public boolean contains(int val) { final int h = val * MIXER; final long bits = _filter[h & _mask]; return (bits & (1L << (h >>> 26))) != 0 && (bits & (1L << ((h >> 20) & 0x3F))) != 0 && _set.contains(val); }
public boolean contains(int val) { final int h = val * MIXER; final long bits = _filter[h & _mask]; return (bits & (1L << (h >>> 26))) != 0 && (bits & (1L << ((h >> 20) & 0x3F))) != 0 && _set.contains(val); }
@Override public boolean contains(IntWritable value) { return set.contains(value.get()); }
@Override public Document nextDocument() throws IOException { Document doc; if ( over ) return null; do { doc = underlyingIterator.nextDocument(); docPointer++; } while ( doc != null && !documents.contains( docPointer ) ); over = doc == null; return doc; }
@Override public Document nextDocument() throws IOException { Document document; if ( over ) return null; for(;;) { document = underlyingIterator.nextDocument(); docPointer++; if ( document != null ) { if ( documents.contains( docPointer ) ) break; document.close(); } else break; } over = document == null; return document; }
public Collection<CustomSlot> getCustomSlots(ContainerCraftGUI container) { Collection<CustomSlot> slots = new ArrayList<>(); if (isItemError()) { IntSet slotNumbers = new IntArraySet(getData()); for (final CustomSlot cslot : container.getCustomSlots()) { if (!(cslot.inventory instanceof InventoryPlayer) && slotNumbers.contains(cslot.getSlotIndex())) { slots.add(cslot); } } } return slots; } }
/** * Builds a new frame only with rows not specified in mapping. */ default Frame removeRows(Mapping mapping) { IntSet remove = new IntOpenHashSet(mapping.toList()); IntList map = new IntArrayList(Math.min(0, rowCount() - remove.size())); for (int i = 0; i < rowCount(); i++) { if (!remove.contains(i)) { map.add(i); } } return mapRows(Mapping.wrap(map)); }
@Override public Stream<? extends FMInstance> stream() { return uidxs.stream() .flatMap(uidx -> { IntSet uidxIidxs = new IntOpenHashSet(); prefs.getUidxIidxs(uidx).forEachRemaining(uidxIidxs::add); return seq(rnd.ints(iidxs.size(), 0, iidxs.size()).map(iidxs::getInt)) .filter(jidx -> !uidxIidxs.contains(jidx)) .limit(uidxIidxs.size()) .zip(uidxIidxs) .map(t -> getInstance(uidx, t.v2, t.v1)) .shuffle(); }); }