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

IntSet.addAll介绍

暂无

代码示例

代码示例来源：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: CampagneLaboratory/variationanalysis

public void set(List<Integer> readIndicesForwardStrandList, List<Integer> readIndicesReverseStrandList) {
  readIndices.clear();
  readIndices.addAll(readIndicesForwardStrandList);
  readIndices.addAll(readIndicesReverseStrandList);
}

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

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

代码示例来源：origin: com.metsci.glimpse/glimpse-extras-dnc

public void set( IntCollection indices )
{
  if ( !hSet.isEmpty( ) )
  {
    hSet.clear( );
    hSetChanged = true;
  }
  if ( hSet.addAll( indices ) )
  {
    hSetChanged = true;
  }
}

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

/**
 * Gets data from the payload of both this node and its children, the string representation
 * of the path to this node is a substring of the one of the children nodes.
 */
void getData(final IntSet ret) {
  ret.addAll(data);
  for (Edge e : edges.values()) {
    e.getDest().getData(ret);
  }
}

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

removeMatches = searchResults;
} else {
  removeMatches.addAll(searchResults);

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

matches = elements;
} else {
  matches.addAll(elements);

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

LazyIntIterator successors = graph.successors( node );
    while ( ( x = successors.nextInt() ) >= 0 ) successorSet.add( x );
    outSet.addAll( select( successorSet, maxOut ) );
    LazyIntIterator predecessors = grapht.successors( node );
    while ( ( x = predecessors.nextInt() ) >= 0 ) predecessorSet.add( x );
    inSet.addAll( select( predecessorSet, maxIn ) );
resultSet.addAll( outSet );
resultSet.addAll( inSet );

代码示例来源：origin: com.metsci.glimpse/glimpse-extras-dnc

dSet.addAll( hSet );
hSetChanged = false;