public static boolean in(double doubleValue, DoubleOpenCustomHashSet set) { return set.contains(doubleValue); }
public DoubleToIdMap() { _valueToIdMap = new Double2IntOpenHashMap(); _valueToIdMap.defaultReturnValue(INVALID_KEY); _idToValueMap = new DoubleArrayList(); }
@Override public DoubleColumn bottom(final int n) { DoubleArrayList bottom = new DoubleArrayList(); double[] values = data.toDoubleArray(); DoubleArrays.parallelQuickSort(values); for (int i = 0; i < n && i < values.length; i++) { bottom.add(values[i]); } return new DoubleColumn(name() + "[Bottoms " + n + "]", bottom); }
private static double[] filterDoubles(DoubleSet doubleSet, double[] source) { DoubleList doubleList = new DoubleArrayList(); for (double value : source) { if (doubleSet.contains(value)) { doubleList.add(value); } } if (doubleList.size() == source.length) { return source; } else { return doubleList.toDoubleArray(); } }
@Override public int getNumNonZeroElements() { final DoubleIterator iterator = values.values().iterator(); int numNonZeros = 0; for( int i = values.size(); i-- != 0; ) if ( iterator.nextDouble() != 0 ) numNonZeros++; return numNonZeros; }
/** * Adds the given float to this column */ public DoubleColumn append(final float f) { data.add(f); return this; }
@Override public void sortAscending() { DoubleArrays.parallelQuickSort(data.elements()); }
@Override public int countUnique() { DoubleSet uniqueElements = new DoubleOpenHashSet(); for (int i = 0; i < size(); i++) { if (!isMissing(i)) { uniqueElements.add(getDouble(i)); } } return uniqueElements.size(); }
@Override public DoubleColumn unique() { final DoubleSet doubles = new DoubleOpenHashSet(); for (int i = 0; i < size(); i++) { if (!isMissing(i)) { doubles.add(getDouble(i)); } } final DoubleColumn column = DoubleColumn.create(name() + " Unique values"); doubles.forEach((DoubleConsumer) column::append); return column; }
public DoubleColumnPreIndexStatsCollector(String column, StatsCollectorConfig statsCollectorConfig) { super(column, statsCollectorConfig); rawDoubleSet = new DoubleOpenHashSet(INITIAL_HASH_SET_SIZE); aggregatedDoubleSet = new DoubleOpenHashSet(INITIAL_HASH_SET_SIZE); }
@SuppressWarnings("unchecked") private int getKeyForValue(double value) { Double2IntMap map = (Double2IntMap) _groupKeyMap; int groupId = map.get(value); if (groupId == INVALID_ID) { if (_numGroups < _globalGroupIdUpperBound) { groupId = _numGroups; map.put(value, _numGroups++); } } return groupId; }
@Override public Iterator<Double> iterator() { return (Iterator<Double>) data.iterator(); }
@Override public boolean applySV(double value) { return _matchingValues.contains(value); } }
/** * Returns true if the priority queue is empty, false otherwise. * * @return True if empty, false otherwise */ public boolean isEmpty() { return _values.isEmpty(); }
@Override public DoubleColumn top(int n) { DoubleArrayList top = new DoubleArrayList(); double[] values = data.toDoubleArray(); DoubleArrays.parallelQuickSort(values, descendingComparator); for (int i = 0; i < n && i < values.length; i++) { top.add(values[i]); } return new DoubleColumn(name() + "[Top " + n + "]", top); }
/** * Adds the given double to this column */ public DoubleColumn append(double d) { data.add(d); return this; }
@Override public void sortDescending() { DoubleArrays.parallelQuickSort(data.elements(), descendingComparator); }
@Override public boolean applySV(double value) { return !_nonMatchingValues.contains(value); } }