it.unimi.dsi.fastutil.ints.IntSet.add()方法的使用及代码示例

x33g5p2x  于2022-01-21 转载在 其他  
字(8.5k)|赞(0)|评价(0)|浏览(146)

本文整理了Java中it.unimi.dsi.fastutil.ints.IntSet.add()方法的一些代码示例，展示了IntSet.add()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。IntSet.add()方法的具体详情如下：
包路径：it.unimi.dsi.fastutil.ints.IntSet
类名称：IntSet
方法名：add

IntSet.add介绍

暂无

代码示例

代码示例来源：origin: apache/incubator-pinot

@Override
 public IntSet deserialize(ByteBuffer byteBuffer) {
  int size = byteBuffer.getInt();
  IntSet intSet = new IntOpenHashSet(size);
  for (int i = 0; i < size; i++) {
   intSet.add(byteBuffer.getInt());
  }
  return intSet;
 }
};

代码示例来源：origin: apache/incubator-pinot

/**
 * Collect statistics for the given entry.
 * - Add it to the passed in set (which could be raw or aggregated)
 * - Update maximum number of values for Multi-valued entries
 * - Update Total number of entries
 * - Check if entry is sorted.
 * @param entry
 * @param set
 */
private void collectEntry(Object entry, IntSet set) {
 if (entry instanceof Object[]) {
  for (Object e : (Object[]) entry) {
   set.add(((Number) e).intValue());
  }
  if (maxNumberOfMultiValues < ((Object[]) entry).length) {
   maxNumberOfMultiValues = ((Object[]) entry).length;
  }
  updateTotalNumberOfEntries((Object[]) entry);
 } else {
  int value = ((Number) entry).intValue();
  addressSorted(value);
  updatePartition(value);
  set.add(value);
  totalNumberOfEntries++;
 }
}

代码示例来源：origin: apache/incubator-pinot

IntRawValueBasedNotInPredicateEvaluator(NotInPredicate notInPredicate) {
 String[] values = notInPredicate.getValues();
 _nonMatchingValues = new IntOpenHashSet(HashUtil.getMinHashSetSize(values.length));
 for (String value : values) {
  _nonMatchingValues.add(Integer.parseInt(value));
 }
}

代码示例来源：origin: apache/incubator-pinot

IntRawValueBasedInPredicateEvaluator(InPredicate inPredicate) {
 String[] values = inPredicate.getValues();
 _matchingValues = new IntOpenHashSet(HashUtil.getMinHashSetSize(values.length));
 for (String value : values) {
  _matchingValues.add(Integer.parseInt(value));
 }
}

代码示例来源：origin: apache/incubator-pinot

@Test
public void testIntSet() {
 for (int i = 0; i < NUM_ITERATIONS; i++) {
  int size = RANDOM.nextInt(100);
  IntSet expected = new IntOpenHashSet(size);
  for (int j = 0; j < size; j++) {
   expected.add(RANDOM.nextInt());
  }
  byte[] bytes = ObjectSerDeUtils.serialize(expected);
  IntSet actual = ObjectSerDeUtils.deserialize(bytes, ObjectSerDeUtils.ObjectType.IntSet);
  // NOTE: use Object comparison instead of Collection comparison because the order might be different
  assertEquals((Object) actual, expected, ERROR_MESSAGE);
 }
}

代码示例来源：origin: apache/incubator-pinot

@Override
public int[][] transformToIntValuesMV(@Nonnull ProjectionBlock projectionBlock) {
 if (getResultMetadata().getDataType() != FieldSpec.DataType.INT) {
  return super.transformToIntValuesMV(projectionBlock);
 }
 if (_intValueSet == null) {
  _intValueSet = new IntOpenHashSet();
  for (String inValue : _stringValueSet) {
   _intValueSet.add(Integer.parseInt(inValue));
  }
  _intValues = new int[DocIdSetPlanNode.MAX_DOC_PER_CALL][];
 }
 int[][] unFilteredIntValues = _mainTransformFunction.transformToIntValuesMV(projectionBlock);
 int length = projectionBlock.getNumDocs();
 for (int i = 0; i < length; i++) {
  _intValues[i] = filterInts(_intValueSet, unFilteredIntValues[i]);
 }
 return _intValues;
}

代码示例来源：origin: jtablesaw/tablesaw

@Override
public int countUnique() {
  IntSet ints = new IntOpenHashSet(size());
  for (int i = 0; i < size(); i++) {
    ints.add(data.getInt(i));
  }
  return ints.size();
}

代码示例来源：origin: apache/incubator-pinot

@Override
public int[][] transformToDictIdsMV(@Nonnull ProjectionBlock projectionBlock) {
 if (_dictIdSet == null) {
  _dictIdSet = new IntOpenHashSet();
  Dictionary dictionary = _mainTransformFunction.getDictionary();
  for (String inValue : _stringValueSet) {
   int dictId = dictionary.indexOf(inValue);
   if (dictId >= 0) {
    _dictIdSet.add(dictId);
   }
  }
  _dictIds = new int[DocIdSetPlanNode.MAX_DOC_PER_CALL][];
 }
 int[][] unFilteredDictIds = _mainTransformFunction.transformToDictIdsMV(projectionBlock);
 int length = projectionBlock.getNumDocs();
 for (int i = 0; i < length; i++) {
  _dictIds[i] = filterInts(_dictIdSet, unFilteredDictIds[i]);
 }
 return _dictIds;
}

代码示例来源：origin: apache/incubator-pinot

RealtimeDictionaryBasedRangePredicateEvaluator(RangePredicate rangePredicate, MutableDictionary dictionary) {
 _matchingDictIdSet = new IntOpenHashSet();
 int dictionarySize = dictionary.length();
 if (dictionarySize == 0) {
  _numMatchingDictIds = 0;
  _alwaysFalse = true;
  return;
 }
 String lowerBoundary = rangePredicate.getLowerBoundary();
 String upperBoundary = rangePredicate.getUpperBoundary();
 boolean includeLowerBoundary = rangePredicate.includeLowerBoundary();
 boolean includeUpperBoundary = rangePredicate.includeUpperBoundary();
 if (lowerBoundary.equals("*")) {
  lowerBoundary = dictionary.getMinVal().toString();
 }
 if (upperBoundary.equals("*")) {
  upperBoundary = dictionary.getMaxVal().toString();
 }
 for (int dictId = 0; dictId < dictionarySize; dictId++) {
  if (dictionary.inRange(lowerBoundary, upperBoundary, dictId, includeLowerBoundary, includeUpperBoundary)) {
   _matchingDictIdSet.add(dictId);
  }
 }
 _numMatchingDictIds = _matchingDictIdSet.size();
 if (_numMatchingDictIds == 0) {
  _alwaysFalse = true;
 } else if (dictionarySize == _numMatchingDictIds) {
  _alwaysTrue = true;
 }
}

代码示例来源：origin: jtablesaw/tablesaw

@Override
public int countUnique() {
  IntSet uniqueElements = new IntOpenHashSet();
  for (int i = 0; i < size(); i++) {
    if (!isMissingValue(getInt(i))) {
      uniqueElements.add(getInt(i));
    }
  }
  return uniqueElements.size();
}

代码示例来源：origin: apache/incubator-pinot

PredicateEvaluator firstPredicateEvaluator = predicateEvaluators.get(0);
for (int matchingDictId : firstPredicateEvaluator.getMatchingDictIds()) {
 matchingDictIds.add(matchingDictId);

代码示例来源：origin: apache/incubator-pinot

DictionaryBasedInPredicateEvaluator(InPredicate inPredicate, Dictionary dictionary) {
 String[] values = inPredicate.getValues();
 _matchingDictIdSet = new IntOpenHashSet(HashUtil.getMinHashSetSize(values.length));
 for (String value : values) {
  int dictId = dictionary.indexOf(value);
  if (dictId >= 0) {
   _matchingDictIdSet.add(dictId);
  }
 }
 _numMatchingDictIds = _matchingDictIdSet.size();
 if (_numMatchingDictIds == 0) {
  _alwaysFalse = true;
 } else if (dictionary.length() == _numMatchingDictIds) {
  _alwaysTrue = true;
 }
}

代码示例来源：origin: apache/incubator-pinot

DictionaryBasedNotInPredicateEvaluator(NotInPredicate notInPredicate, Dictionary dictionary) {
 String[] values = notInPredicate.getValues();
 _nonMatchingDictIdSet = new IntOpenHashSet(HashUtil.getMinHashSetSize(values.length));
 for (String value : values) {
  int dictId = dictionary.indexOf(value);
  if (dictId >= 0) {
   _nonMatchingDictIdSet.add(dictId);
  }
 }
 _numNonMatchingDictIds = _nonMatchingDictIdSet.size();
 if (_numNonMatchingDictIds == 0) {
  _alwaysTrue = true;
 } else if (dictionary.length() == _numNonMatchingDictIds) {
  _alwaysFalse = true;
 }
 _dictionary = dictionary;
}

代码示例来源：origin: jtablesaw/tablesaw

@Override
public IntColumn unique() {
  final IntSet values = new IntOpenHashSet();
  for (int i = 0; i < size(); i++) {
    if (!isMissing(i)) {
      values.add(getInt(i));
    }
  }
  final IntColumn column = IntColumn.create(name() + " Unique values");
  for (int value : values) {
    column.append(value);
  }
  return column;
}

代码示例来源：origin: apache/incubator-pinot

int value = _random.nextInt();
stringValues.add(Integer.toString(value));
valueSet.add(value);

代码示例来源：origin: prestodb/presto

private static void testFilter(DictionaryAwarePageFilter filter, Block block, boolean filterRange)
{
  IntSet actualSelectedPositions = toSet(filter.filter(null, new Page(block)));
  block = block.getLoadedBlock();
  IntSet expectedSelectedPositions = new IntArraySet(block.getPositionCount());
  for (int position = 0; position < block.getPositionCount(); position++) {
    if (isSelected(filterRange, block.getLong(position, 0))) {
      expectedSelectedPositions.add(position);
    }
  }
  assertEquals(actualSelectedPositions, expectedSelectedPositions);
}

代码示例来源：origin: jtablesaw/tablesaw

@Override
public DateColumn unique() {
  IntSet ints = new IntOpenHashSet(data.size());
  for (int i = 0; i < size(); i++) {
    ints.add(data.getInt(i));
  }
  DateColumn copy = emptyCopy(ints.size());
  copy.setName(name() + " Unique values");
  copy.data = IntArrayList.wrap(ints.toIntArray());
  return copy;
}

代码示例来源：origin: prestodb/presto

pagesToCompact.add(previousRow.getPageId());
pagesToCompact.add(newPageId);

代码示例来源：origin: it.unimi.dsi/mg4j

private int getResults( final DocumentIterator documentIterator, final int offset, final int length, final ObjectArrayList<DocumentScoreInfo<Reference2ObjectMap<Index,SelectedInterval[]>>> results, final IntSet alreadySeen ) throws IOException {
  int document, count = 0; // Number of not-already-seen documents
  // Unfortunately, to provide the exact count of results we have to scan the whole iterator.
  while ( ( document = documentIterator.nextDocument() ) != -1 ) {
    if ( alreadySeen != null && ! alreadySeen.add( document ) ) continue;
    if ( count >= offset && count < offset + length ) results.add( new DocumentScoreInfo<Reference2ObjectMap<Index,SelectedInterval[]>>( document, -1 ) );
    count++;
  }
  
  return count;
}

代码示例来源：origin: org.datavec/datavec-dataframe

@Override
public int countUnique() {
  IntSet ints = new IntOpenHashSet(size());
  for (int i = 0; i < size(); i++) {
    ints.add(data.getInt(i));
  }
  return ints.size();
}

内容来源于网络，如有侵权，请联系作者删除！

IntSet

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com