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

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

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

IntSet.size介绍

暂无

代码示例

代码示例来源：origin: apache/ignite

/** {@inheritDoc} */
@Override public long estimateSize() {
  return storage().indexes().size();
}

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

@Override
 public void seal() {
  sealed = true;
  sortedIntList = new int[rawIntSet.size()];
  rawIntSet.toArray(sortedIntList);

  Arrays.sort(sortedIntList);

  if (sortedIntList.length == 0) {
   min = null;
   max = null;
   return;
  }

  // Update min/max based on raw docs.
  min = sortedIntList[0];
  max = sortedIntList[sortedIntList.length - 1];

  // Merge the raw and aggregated docs, so stats for dictionary creation are collected correctly.
  int numAggregated = aggregatedIntSet.size();
  if (numAggregated > 0) {
   rawIntSet.addAll(aggregatedIntSet);
   sortedIntList = new int[rawIntSet.size()];
   rawIntSet.toArray(sortedIntList);
   Arrays.sort(sortedIntList);
  }
 }
}

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

@Override
public byte[] serialize(IntSet intSet) {
 int size = intSet.size();
 byte[] bytes = new byte[Integer.BYTES + size * Integer.BYTES];
 ByteBuffer byteBuffer = ByteBuffer.wrap(bytes);
 byteBuffer.putInt(size);
 IntIterator iterator = intSet.iterator();
 while (iterator.hasNext()) {
  byteBuffer.putInt(iterator.nextInt());
 }
 return bytes;
}

代码示例来源：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

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 TimeColumn unique() {
  IntSet ints = new IntOpenHashSet(data);
  TimeColumn column = emptyCopy(ints.size());
  column.data = IntArrayList.wrap(ints.toIntArray());
  column.setName(name() + " Unique values");
  return column;
}

代码示例来源：origin: apache/ignite

/** {@inheritDoc} */
@Override public int nonZeroElements() {
  int res = 0;
  IntIterator rowIter = indexesMap().keySet().iterator();
  while (rowIter.hasNext()) {
    int row = rowIter.nextInt();
    res += indexesMap().get(row).size();
  }
  return res;
}

代码示例来源：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

int numMatchingDictIds = matchingDictIds.size();
int numChildren = starTreeNode.getNumChildren();

代码示例来源：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 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: org.apache.giraph/giraph-core

@Override
public long size() {
 if (set instanceof IntOpenHashBigSet) {
  return ((IntOpenHashBigSet) set).size64();
 }
 return set.size();
}

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

@Override
public int countUnique() {
  IntSet ints = new IntOpenHashSet(data);
  return ints.size();
}

代码示例来源：origin: org.apache.giraph/giraph-core

@Override
public void trim(long n) {
 if (set instanceof IntOpenHashSet) {
  ((IntOpenHashSet) set).trim((int) Math.max(set.size(), n));
 } else {
  ((IntOpenHashBigSet) set).trim(Math.max(set.size(), n));
 }
}

代码示例来源：origin: mezz/JustEnoughItems

/**
 * Efficiently get the elements contained in both sets.
 * Note that this implementation will alter the original sets.
 */
private static IntSet intersection(IntSet set1, IntSet set2) {
  if (set1.size() > set2.size()) {
    set2.retainAll(set1);
    return set2;
  } else {
    set1.retainAll(set2);
    return set1;
  }
}

代码示例来源：origin: RankSys/RankSys

@Override
public IntToDoubleFunction similarity(int idx1) {
  IntSet set = new IntOpenHashSet();
  data.getUidxPreferences(idx1).map(IdxPref::v1).forEach(set::add);
  return idx2 -> {
    int coo = (int) data.getUidxPreferences(idx2)
        .map(IdxPref::v1)
        .filter(set::contains)
        .count();
    return sim(coo, set.size(), data.numItems(idx2));
  };
}

代码示例来源：origin: org.apache.giraph/giraph-core

@Override
public void write(DataOutput out) throws IOException {
 out.writeInt(set.size());
 IntIterator iter = set.iterator();
 while (iter.hasNext()) {
  out.writeInt(iter.nextInt());
 }
}

代码示例来源：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();
}

代码示例来源：origin: tech.tablesaw/tablesaw-core

@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;
}

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

IntSet

相关文章

    查看更多

    热门标签

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

    最新文章

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