当前位置: 首页>>代码示例>>Java>>正文


Java IntOpenHashSet.add方法代码示例

本文整理汇总了Java中it.unimi.dsi.fastutil.ints.IntOpenHashSet.add方法的典型用法代码示例。如果您正苦于以下问题:Java IntOpenHashSet.add方法的具体用法?Java IntOpenHashSet.add怎么用?Java IntOpenHashSet.add使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在it.unimi.dsi.fastutil.ints.IntOpenHashSet的用法示例。

在下文中一共展示了IntOpenHashSet.add方法的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: syncMatrixInfos

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
/**
 * compare the matrix meta on the master and the matrix meta on ps to find the matrix this parameter server needs to create and delete
 * @param matrixReports parameter server matrix report, include the matrix ids this parameter server hold.
 * @param needCreateMatrixes use to return the matrix partitions this parameter server need to build
 * @param needReleaseMatrixes use to return the matrix ids this parameter server need to remove
 * @param needRecoverParts need recover partitions
 * @param psId parameter server id
*/
public void syncMatrixInfos(List<MatrixReport> matrixReports,
  List<MatrixMeta> needCreateMatrixes, List<Integer> needReleaseMatrixes,
  List<RecoverPartKey> needRecoverParts, ParameterServerId psId) {

  //get matrix ids in the parameter server report
  IntOpenHashSet matrixInPS = new IntOpenHashSet();
  int size = matrixReports.size();
  for (int i = 0; i < size; i++) {
    matrixInPS.add(matrixReports.get(i).matrixId);
  }

  handleMatrixReports(psId, matrixReports);

  Set<RecoverPartKey> parts = getAndRemoveNeedRecoverParts(psId);
  if(parts != null) {
    needRecoverParts.addAll(parts);
  }

  //get the matrices parameter server need to create and delete
  getPSNeedUpdateMatrix(matrixInPS, needCreateMatrixes, needReleaseMatrixes, psId);
  psMatricesUpdate(psId, matrixReports);
}
 
开发者ID:Tencent,项目名称:angel,代码行数:31,代码来源:AMMatrixMetaManager.java


示例2: aggregate

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
@Override
public IntOpenHashSet aggregate(Block docIdSetBlock, Block[] block) {
  IntOpenHashSet ret = new IntOpenHashSet();
  int docId = 0;
  BlockDocIdIterator docIdIterator = docIdSetBlock.getBlockDocIdSet().iterator();
  BlockSingleValIterator blockValIterator = (BlockSingleValIterator) block[0].getBlockValueSet().iterator();

  // Assume dictionary is always there for String data type.
  // If data type is String, we shouldn't hit here.
  while ((docId = docIdIterator.next()) != Constants.EOF) {
    if (blockValIterator.skipTo(docId)) {
      ret.add(blockValIterator.nextIntVal());
    }
  }

  return ret;
}
 
开发者ID:Hanmourang,项目名称:Pinot,代码行数:18,代码来源:DistinctCountAggregationNoDictionaryFunction.java


示例3: RealtimeDictionaryBasedRangePredicateEvaluator

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
RealtimeDictionaryBasedRangePredicateEvaluator(RangePredicate rangePredicate, MutableDictionary dictionary) {
  _matchingDictIdSet = new IntOpenHashSet();

  int dictionarySize = dictionary.length();
  if (dictionarySize == 0) {
    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);
    }
  }
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:27,代码来源:RangePredicateEvaluatorFactory.java


示例4: testIntOpenHashSet

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
/**
 * Test for ser/de of {@link IntOpenHashSet}.
 */
@Test
public void testIntOpenHashSet()
    throws IOException {
  for (int i = 0; i < NUM_ITERATIONS; i++) {
    int size = RANDOM.nextInt(100);
    IntOpenHashSet expected = new IntOpenHashSet(size);
    for (int j = 0; j < size; j++) {
      expected.add(RANDOM.nextInt());
    }

    byte[] bytes = ObjectCustomSerDe.serialize(expected);
    IntOpenHashSet actual = ObjectCustomSerDe.deserialize(bytes, ObjectType.IntOpenHashSet);

    // Use Object comparison instead of Collection comparison because order might change.
    Assert.assertEquals((Object) actual, expected, ERROR_MESSAGE);
  }
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:21,代码来源:ObjectCustomSerDeTest.java


示例5: findNewRows

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
private RowIndex findNewRows(RowIndex rowIndex) {
  IntOpenHashSet need = new IntOpenHashSet();
  IntOpenHashSet fetchingRowIds = fetchingRowSets.get(rowIndex.getMatrixId());

  IntIterator iter = rowIndex.getRowIds().iterator();
  while (iter.hasNext()) {
    int rowId = iter.nextInt();
    if (!fetchingRowIds.contains(rowId)) {
      need.add(rowId);
      fetchingRowIds.add(rowId);
    }
  }

  return new RowIndex(rowIndex.getMatrixId(), need, rowIndex);
}
 
开发者ID:Tencent,项目名称:angel,代码行数:16,代码来源:MatrixClientAdapter.java


示例6: addTo

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
public double addTo(IntOpenHashSet another,Int2IntOpenHashMap id2Count){
	int totalno=0;
	
	for (int k : occSet) {
		if (!another.contains(k)){
			totalno+=id2Count.get(k);
			another.add(k);
		}
	}
	
	return (totalno/((totalOccs)*1.0f));
}
 
开发者ID:drivenbyentropy,项目名称:aptasuite,代码行数:13,代码来源:MotifProfile.java


示例7: getIntOpenHashSets

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
private static List<Serializable> getIntOpenHashSets(int numberOfElements) {
  List<Serializable> intOpenHashSets = new ArrayList<Serializable>();
  for (int i = 0; i < numberOfElements; ++i) {
    IntOpenHashSet intOpenHashSet = new IntOpenHashSet();
    intOpenHashSet.add(i);
    intOpenHashSets.add(intOpenHashSet);
  }
  return intOpenHashSets;
}
 
开发者ID:Hanmourang,项目名称:Pinot,代码行数:10,代码来源:SimpleAggregationFunctionsTest.java


示例8: analyzeAsC2W

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
private IntOpenHashSet analyzeAsC2W(DatasetConfiguration config) throws GerbilException {
    D2WDataset dataset = (D2WDataset) config.getDataset(ExperimentType.D2KB);
    if (dataset == null) {
        return null;
    }
    List<HashSet<Annotation>> goldStandard = dataset.getD2WGoldStandardList();
    IntOpenHashSet ids = new IntOpenHashSet();
    for (HashSet<Annotation> annotations : goldStandard) {
        for (Annotation annotation : annotations) {
            ids.add(annotation.getConcept());
        }
    }
    return ids;
}
 
开发者ID:dice-group,项目名称:gerbil,代码行数:15,代码来源:DatasetWikiIdExporter.java


示例9: analyzeAsD2W

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
private IntOpenHashSet analyzeAsD2W(DatasetConfiguration config) throws GerbilException {
    C2WDataset dataset = (C2WDataset) config.getDataset(ExperimentType.C2KB);
    if (dataset == null) {
        return null;
    }
    List<HashSet<Tag>> goldStandard = dataset.getC2WGoldStandardList();
    IntOpenHashSet ids = new IntOpenHashSet();
    for (HashSet<Tag> tags : goldStandard) {
        for (Tag tag : tags) {
            ids.add(tag.getConcept());
        }
    }
    return ids;
}
 
开发者ID:dice-group,项目名称:gerbil,代码行数:15,代码来源:DatasetWikiIdExporter.java


示例10: IntegerLabelFilter

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
/** Creates a new integer-label filter.
	 * 
 * @param keyAndvalues the key to be queried to filter an arc,
 * or the empty string to query the well-known attribute, followed by a list of values that will be preserved.
 */
public IntegerLabelFilter( final String... keyAndvalues ) {
	if ( keyAndvalues.length == 0 ) throw new IllegalArgumentException( "You must specificy a key name" );
	this.key = keyAndvalues[ 0 ].length() == 0 ? null : keyAndvalues[ 0 ];
	values = new IntOpenHashSet( keyAndvalues.length );
	for( int i = 1; i < keyAndvalues.length; i++ ) values.add( Integer.parseInt( keyAndvalues[ i ] ) );
}
 
开发者ID:lhelwerd,项目名称:WebGraph,代码行数:12,代码来源:IntegerLabelFilter.java


示例11: DictionaryBasedNotInPredicateEvaluator

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
DictionaryBasedNotInPredicateEvaluator(NotInPredicate notInPredicate, Dictionary dictionary) {
  String[] values = notInPredicate.getValues();
  _nonMatchingDictIdSet = new IntOpenHashSet(values.length);
  for (String value : values) {
    int dictId = dictionary.indexOf(value);
    if (dictId >= 0) {
      _nonMatchingDictIdSet.add(dictId);
    }
  }
  _dictionary = dictionary;
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:12,代码来源:NotInPredicateEvaluatorFactory.java


示例12: IntRawValueBasedNotInPredicateEvaluator

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
IntRawValueBasedNotInPredicateEvaluator(NotInPredicate notInPredicate) {
  String[] values = notInPredicate.getValues();
  _nonMatchingValues = new IntOpenHashSet(values.length);
  for (String value : values) {
    _nonMatchingValues.add(Integer.parseInt(value));
  }
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:8,代码来源:NotInPredicateEvaluatorFactory.java


示例13: DictionaryBasedInPredicateEvaluator

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
DictionaryBasedInPredicateEvaluator(InPredicate inPredicate, Dictionary dictionary) {
  String[] values = inPredicate.getValues();
  _matchingDictIdSet = new IntOpenHashSet();
  for (String value : values) {
    int dictId = dictionary.indexOf(value);
    if (dictId >= 0) {
      _matchingDictIdSet.add(dictId);
    }
  }
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:11,代码来源:InPredicateEvaluatorFactory.java


示例14: IntRawValueBasedInPredicateEvaluator

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
IntRawValueBasedInPredicateEvaluator(InPredicate inPredicate) {
  String[] values = inPredicate.getValues();
  _matchingValues = new IntOpenHashSet(values.length);
  for (String value : values) {
    _matchingValues.add(Integer.parseInt(value));
  }
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:8,代码来源:InPredicateEvaluatorFactory.java


示例15: deserializeIntOpenHashSet

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
/**
 * Helper method to de-serialize an {@link IntOpenHashSet} from a ByteBuffer.
 */
private static IntOpenHashSet deserializeIntOpenHashSet(ByteBuffer byteBuffer) {

  int size = byteBuffer.getInt();
  IntOpenHashSet intOpenHashSet = new IntOpenHashSet(size);
  for (int i = 0; i < size; i++) {
    intOpenHashSet.add(byteBuffer.getInt());
  }

  return intOpenHashSet;
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:14,代码来源:ObjectCustomSerDe.java


示例16: testParallelThreads

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
/**
 * This tries to be a more "real life" test. A bunch of threads perform updates, which should
 * create exceptions. Verify that the final exception list is correct.
 */
@Test
public void testParallelThreads() throws InterruptedException {
  RegionVersionHolder vh1 = new RegionVersionHolder(member());
  RegionVersionHolder vh2 = new RegionVersionHolder(member());

  int UPDATES = 50000;
  int NUM_UPDATERS = 20;
  int NUM_EXCEPTIONS = 500;

  Random random = new Random();
  IntOpenHashSet exceptions = new IntOpenHashSet();
  for (int i = 0; i < NUM_EXCEPTIONS; i++) {
    exceptions.add(i);
  }


  HolderUpdater[] updaters = new HolderUpdater[NUM_UPDATERS];
  for (int i = 0; i < updaters.length; i++) {
    updaters[i] = new HolderUpdater(UPDATES, i, NUM_UPDATERS, exceptions, vh1, vh2);
  }

  for (int i = 0; i < updaters.length; i++) {
    updaters[i].start();
  }


  for (int i = 0; i < updaters.length; i++) {
    updaters[i].join();
  }

  // System.out.println("testing vh1="+vh1);
  for (int i = 1; i < UPDATES; i++) {
    assertEquals("vector is incorrect on item " + i, !exceptions.contains(i), vh1.contains(i));
  }

  // Mimic a GII. Initialize vh2 from vh1. vh2 has not seen all of the updates
  vh2.initializeFrom(vh1);

  // System.out.println("testing vh2="+vh2);
  for (int i = 1; i < UPDATES; i++) {
    assertEquals("vector is incorrect on item " + i, !exceptions.contains(i), vh2.contains(i));
  }
}
 
开发者ID:ampool,项目名称:monarch,代码行数:48,代码来源:RegionVersionHolderRandomJUnitTest.java


示例17: testRandom2

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
@Test
public void testRandom2() {
	XoRoShiRo128PlusRandomGenerator random = new XoRoShiRo128PlusRandomGenerator(1);
	for(int size: new int[] { 10, 100, 1000, 10000 }) {
		Modulo2SparseSystem system = new Modulo2SparseSystem(size);

		IntOpenHashSet edge[] = new IntOpenHashSet[size];

		int x, v, w;
		for (int i = 0; i < 2 * size / 3; i++) {
			boolean alreadySeen;
			do {
				x = random.nextInt(size);
				do v = random.nextInt(size); while(v == i);
				do w = random.nextInt(size); while(w == i || w == v);

				edge[i] = new IntOpenHashSet();
				edge[i].add(x);
				edge[i].add(v);
				edge[i].add(w);

				alreadySeen = false;
				for(int j = 0; j < i; j++)
					if (edge[j].equals(edge[i])) {
					alreadySeen = true;
					break;
				}
			} while(alreadySeen);
		}

		for(int i = 0; i < 2 * size / 3; i++) {
			Modulo2Equation equation = new Modulo2Equation(random.nextInt(100));
			IntOpenHashSet variables = new IntOpenHashSet();
			for(IntIterator iterator = edge[i].iterator(); iterator.hasNext();) variables.add(iterator.nextInt());
			final int[] array = variables.toIntArray();
			Arrays.sort(array);
			for(int var: array) equation.add(var);
			system.add(equation);
		}
		final long[] solution = new long[size];
		assertTrue(system.copy().gaussianElimination(solution));
		assertTrue(system.check(solution));
		Arrays.fill(solution, 0);
		assertTrue(system.copy().lazyGaussianElimination(solution));
		assertTrue(system.check(solution));
	}
}
 
开发者ID:vigna,项目名称:Sux4J,代码行数:48,代码来源:Modulo2SparseSystemTest.java


示例18: offerNumberInRangeTo

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
public void offerNumberInRangeTo(IntOpenHashSet hashSet, int start, int end) {
    end = Math.min(end, arr.length);
    for (int i = start; i < end; i++) {
        hashSet.add(arr[i]);
    }
}
 
开发者ID:Hanmourang,项目名称:Pinot,代码行数:7,代码来源:DistinctCountHLLTest.java


示例19: testTrimming

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
@SuppressWarnings("unchecked")
@Test
public void testTrimming() {
  // Test Server side trimming
  Map<String, Object[]> intermediateResultsMap = new HashMap<>(NUM_GROUPS);
  for (int i = 0; i < NUM_GROUPS; i++) {
    IntOpenHashSet set = new IntOpenHashSet();
    for (int j = 0; j <= i; j += NUM_GROUPS / MAX_SIZE_OF_SET) {
      set.add(j);
    }
    intermediateResultsMap.put(_groups.get(i), new Object[]{(double) i, set});
  }
  List<Map<String, Object>> trimmedIntermediateResultMaps =
      _trimmingService.trimIntermediateResultsMap(intermediateResultsMap);
  Map<String, Object> trimmedSumResultMap = trimmedIntermediateResultMaps.get(0);
  Map<String, Object> trimmedDistinctCountResultMap = trimmedIntermediateResultMaps.get(1);
  int trimSize = trimmedSumResultMap.size();
  Assert.assertEquals(trimmedDistinctCountResultMap.size(), trimSize, ERROR_MESSAGE);
  for (int i = NUM_GROUPS - trimSize; i < NUM_GROUPS; i++) {
    String group = _groups.get(i);
    Assert.assertEquals(((Double) trimmedSumResultMap.get(group)).intValue(), i, ERROR_MESSAGE);
    Assert.assertEquals(((IntOpenHashSet) trimmedDistinctCountResultMap.get(group)).size(),
        i / (NUM_GROUPS / MAX_SIZE_OF_SET) + 1, ERROR_MESSAGE);
  }

  // Test Broker side trimming
  Map<String, Comparable> finalDistinctCountResultMap = new HashMap<>(trimSize);
  for (Map.Entry<String, Object> entry : trimmedDistinctCountResultMap.entrySet()) {
    finalDistinctCountResultMap.put(entry.getKey(), ((IntOpenHashSet) entry.getValue()).size());
  }
  List[] groupByResultLists =
      _trimmingService.trimFinalResults(new Map[]{trimmedSumResultMap, finalDistinctCountResultMap});
  List<GroupByResult> sumGroupByResultList = groupByResultLists[0];
  List<GroupByResult> distinctCountGroupByResultList = groupByResultLists[1];
  for (int i = 0; i < GROUP_BY_TOP_N; i++) {
    int expectedGroupIndex = NUM_GROUPS - 1 - i;
    GroupByResult sumGroupByResult = sumGroupByResultList.get(i);
    List<String> sumGroup = sumGroupByResult.getGroup();
    Assert.assertEquals(sumGroup.size(), NUM_GROUP_KEYS, ERROR_MESSAGE);
    Assert.assertEquals(buildGroupString(sumGroup), _groups.get(expectedGroupIndex), ERROR_MESSAGE);
    Assert.assertEquals((int) Double.parseDouble((String) sumGroupByResult.getValue()), expectedGroupIndex,
        ERROR_MESSAGE);
    // For distinctCount, because multiple groups have same value, so there is no guarantee on the order of groups,
    // just check the value
    GroupByResult distinctCountGroupByResult = distinctCountGroupByResultList.get(i);
    Assert.assertEquals(Integer.parseInt((String) distinctCountGroupByResult.getValue()),
        expectedGroupIndex / (NUM_GROUPS / MAX_SIZE_OF_SET) + 1, ERROR_MESSAGE);
  }
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:50,代码来源:AggregationGroupByTrimmingServiceTest.java


示例20: setUp

import it.unimi.dsi.fastutil.ints.IntOpenHashSet; //导入方法依赖的package包/类
@BeforeClass
public void setUp()
    throws Exception {
  FileUtils.deleteQuietly(TEMP_DIR);

  IntOpenHashSet intSet = new IntOpenHashSet();
  while (intSet.size() < NUM_VALUES) {
    intSet.add(RANDOM.nextInt());
  }
  _intValues = intSet.toIntArray();
  Arrays.sort(_intValues);

  LongOpenHashSet longSet = new LongOpenHashSet();
  while (longSet.size() < NUM_VALUES) {
    longSet.add(RANDOM.nextLong());
  }
  _longValues = longSet.toLongArray();
  Arrays.sort(_longValues);

  FloatOpenHashSet floatSet = new FloatOpenHashSet();
  while (floatSet.size() < NUM_VALUES) {
    floatSet.add(RANDOM.nextFloat());
  }
  _floatValues = floatSet.toFloatArray();
  Arrays.sort(_floatValues);

  DoubleOpenHashSet doubleSet = new DoubleOpenHashSet();
  while (doubleSet.size() < NUM_VALUES) {
    doubleSet.add(RANDOM.nextDouble());
  }
  _doubleValues = doubleSet.toDoubleArray();
  Arrays.sort(_doubleValues);

  Set<String> stringSet = new HashSet<>();
  while (stringSet.size() < NUM_VALUES) {
    stringSet.add(RandomStringUtils.random(RANDOM.nextInt(MAX_STRING_LENGTH)).replace('\0', ' '));
  }
  _stringValues = stringSet.toArray(new String[NUM_VALUES]);
  Arrays.sort(_stringValues);

  boolean[] isSorted = {true};
  SegmentDictionaryCreator dictionaryCreator = new SegmentDictionaryCreator(false, _intValues,
      new DimensionFieldSpec(INT_COLUMN_NAME, FieldSpec.DataType.INT, true), TEMP_DIR, '\0');
  dictionaryCreator.build(isSorted);

  dictionaryCreator = new SegmentDictionaryCreator(false, _longValues,
      new DimensionFieldSpec(LONG_COLUMN_NAME, FieldSpec.DataType.LONG, true), TEMP_DIR, '\0');
  dictionaryCreator.build(isSorted);

  dictionaryCreator = new SegmentDictionaryCreator(false, _floatValues,
      new DimensionFieldSpec(FLOAT_COLUMN_NAME, FieldSpec.DataType.FLOAT, true), TEMP_DIR, '\0');
  dictionaryCreator.build(isSorted);

  dictionaryCreator = new SegmentDictionaryCreator(false, _doubleValues,
      new DimensionFieldSpec(DOUBLE_COLUMN_NAME, FieldSpec.DataType.DOUBLE, true), TEMP_DIR, '\0');
  dictionaryCreator.build(isSorted);

  dictionaryCreator = new SegmentDictionaryCreator(false, _stringValues,
      new DimensionFieldSpec(STRING_COLUMN_NAME, FieldSpec.DataType.STRING, true), TEMP_DIR, '\0');
  dictionaryCreator.build(isSorted);
  _numBytesPerStringValue = dictionaryCreator.getStringColumnMaxLength();
}
 
开发者ID:linkedin,项目名称:pinot,代码行数:63,代码来源:ImmutableDictionaryReaderTest.java



注:本文中的it.unimi.dsi.fastutil.ints.IntOpenHashSet.add方法示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。