本文整理汇总了Java中it.unimi.dsi.fastutil.Arrays类的典型用法代码示例。如果您正苦于以下问题:Java Arrays类的具体用法?Java Arrays怎么用?Java Arrays使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
Arrays类属于it.unimi.dsi.fastutil包,在下文中一共展示了Arrays类的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: removeElements
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
/** Removes elements of this type-specific list using optimized system calls.
*
* @param from the start index (inclusive).
* @param to the end index (exclusive).
*/
public void removeElements( final int from, final int to ) {
Arrays.ensureFromTo( size, from, to );
System.arraycopy( a, to, a, from, size - to );
size -= ( to - from );
int i = to - from;
while( i-- != 0 ) a[ size + i ] = null;
}
示例2: limitOrderBy
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
private static List<Map.Entry<String, FacetCounter>> limitOrderBy(FacetField facetField,
List<Map.Entry<String, FacetCounter>> list) {
final FacetSorter facetSorter = FacetSorter.getSorter(list, facetField.getOrderBy());
if (facetSorter == null)
return list;
Arrays.quickSort(0, list.size(), facetSorter, facetSorter);
final Integer limit = facetField.getLimit();
if (limit == null)
return list;
if (list.size() <= limit)
return list;
return list.subList(0, limit);
}
示例3: hashCode
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public int hashCode( final K[] o ) {
return java.util.Arrays.hashCode( o );
}
示例4: equals
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public boolean equals( final K[] a, final K[] b ) {
return java.util.Arrays.equals( a, b );
}
示例5: hashCode
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public int hashCode( final long[] o ) {
return java.util.Arrays.hashCode( o );
}
示例6: equals
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public boolean equals( final long[] a, final long[] b ) {
return java.util.Arrays.equals( a, b );
}
示例7: hashCode
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public int hashCode( final int[] o ) {
return java.util.Arrays.hashCode( o );
}
示例8: equals
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public boolean equals( final int[] a, final int[] b ) {
return java.util.Arrays.equals( a, b );
}
示例9: hashCode
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public int hashCode( final boolean[] o ) {
return java.util.Arrays.hashCode( o );
}
示例10: equals
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public boolean equals( final boolean[] a, final boolean[] b ) {
return java.util.Arrays.equals( a, b );
}
示例11: removeElements
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
/** Removes elements of this type-specific list using optimized system calls.
*
* @param from the start index (inclusive).
* @param to the end index (exclusive).
*/
public void removeElements( final int from, final int to ) {
Arrays.ensureFromTo( size, from, to );
System.arraycopy( a, to, a, from, size - to );
size -= ( to - from );
}
示例12: quickSort
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public void quickSort(Timer timer) {
int numFound = collector.getSize();
Timer t = new Timer(timer, "Sort (quicksort): " + numFound);
Arrays.parallelQuickSort(0, numFound, this, collector);
t.end(null);
}
示例13: SnippetVectorSort
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
private SnippetVectorSort(final SnippetVector[] vectors) {
this.vectors = vectors;
Arrays.quickSort(0, vectors.length, this, this);
}
示例14: sortByOffset
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
public void sortByOffset() {
Arrays.quickSort(0, termQueryItems.size(), this, this);
}
示例15: grow
import it.unimi.dsi.fastutil.Arrays; //导入依赖的package包/类
/** Grows the given array to the maximum between the given length and
* the current length multiplied by two, provided that the given
* length is larger than the current length.
*
* <P>If you want complete control on the array growth, you
* should probably use <code>ensureCapacity()</code> instead.
*
* @param array an array.
* @param length the new minimum length for this array.
* @return <code>array</code>, if it can contain <code>length</code>
* entries; otherwise, an array with
* max(<code>length</code>,<code>array.length</code>/φ) entries whose first
* <code>array.length</code> entries are the same as those of <code>array</code>.
* */
public static <K> K[] grow( final K[] array, final int length ) {
if ( length > array.length ) {
final int newLength = (int)Math.max( Math.min( 2L * array.length, Arrays.MAX_ARRAY_SIZE ), length );
final K t[] =
newArray( array, newLength );
System.arraycopy( array, 0, t, 0, array.length );
return t;
}
return array;
}