Java IntArrays.trim方法代码示例

import it.unimi.dsi.fastutil.ints.IntArrays; //导入方法依赖的package包/类
public int[] createTestingSet(int numOfSamples) {
	numOfSamples = Math.min(numOfSamples, numNodes);

	if (verbose) LOGGER.info("Creating test set with "+numOfSamples+" nodes...");
	if (numOfSamples >= (numNodes/2)) {
		final Random rnd = RandomSingleton.get();
		int[] samples = MathArrays.natural(numNodes);
		IntArrays.shuffle(samples, rnd);
		return IntArrays.trim(samples, numOfSamples);
	} else {
		IntSet set = new IntOpenHashSet();
		while (set.size() < numOfSamples) {
			set.add(rnd.nextInt(numNodes));
		}
		int[] r = set.toIntArray();
		return r;
	}
}
 

import it.unimi.dsi.fastutil.ints.IntArrays; //导入方法依赖的package包/类
public IntSet getTop(int k) {
	if (k > graph.numNodes())
		LOGGER.warn("Warning: " + k + " categories were asked, but the graph contains " + graph.numNodes());
	
	LOGGER.info("Computing top-"+k+" categories...");
	IntSet okIds = new IntOpenHashSet(IntArrays.trim(positions, k));
	LOGGER.info("Top-"+k+" categories computed.");
	return okIds;
}
 

import it.unimi.dsi.fastutil.ints.IntArrays; //导入方法依赖的package包/类
/** Unwraps the elements returned by a lazy iterator into a new array.
 * 
 * <p>If you need the resulting array to contain the
 * elements returned by <code>lazyIntIterator</code>, but some more elements set to zero
 * would cause no harm, consider using {@link #unwrapLoosely(LazyIntIterator)}, which
 * usually avoids a final call to {@link IntArrays#trim(int[], int)}.
 * 
 * @param lazyIntIterator a lazy integer iterator.
 * @return an array containing the elements returned by <code>lazyIntIterator</code>.
 * @see #unwrapLoosely(LazyIntIterator) 
 */
public static int[] unwrap( final LazyIntIterator lazyIntIterator ) {
	int array[] = new int[ 16 ];
	int j = 0, t;

	while( ( t = lazyIntIterator.nextInt() ) != -1  ) {
		if ( j == array.length ) array = IntArrays.grow( array, j + 1 );
		array[ j++ ] = t;
	}
       
	return IntArrays.trim( array, j );
}
 

import it.unimi.dsi.fastutil.ints.IntArrays; //导入方法依赖的package包/类
/**
 * @return at most <i>howMany</i> out-links of node, ordered by their unexpected (most unexpected first)
 */
public int[] results(int node, int howMany) {
	return IntArrays.trim(results(node), howMany);
}