本文整理汇总了Java中gnu.trove.list.TIntList.get方法的典型用法代码示例。如果您正苦于以下问题：Java TIntList.get方法的具体用法？Java TIntList.get怎么用？Java TIntList.get使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类gnu.trove.list.TIntList的用法示例。
在下文中一共展示了TIntList.get方法的8个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: equals
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean equals( Object other ) {
if ( other == this ) {
return true;
}
if ( !( other instanceof TIntList ) ) return false;
TIntList that = ( TIntList )other;
if ( size() != that.size() ) return false;
for( int i = 0; i < size(); i++ ) {
if ( get( i ) != that.get( i ) ) {
return false;
}
}
return true;
}
示例2: testTransform
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public void testTransform() {
int element_count = 20;
TIntList a = new TIntOffheapArrayList();
for ( int i = 1; i < element_count; i++ ) {
a.add( i );
}
a.transformValues( new TIntFunction() {
@Override
public int execute( int value ) {
return value * value;
}
} );
for ( int i = 0; i < a.size(); i++ ) {
int result = a.get( i );
int expected = ( i + 1 ) * ( i + 1 );
assertEquals( expected, result );
}
}
示例3: testTransform
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public void testTransform() {
int element_count = 20;
TIntList a = new TIntArrayList();
for ( int i = 1; i < element_count; i++ ) {
a.add( i );
}
a.transformValues( new TIntFunction() {
@Override
public int execute( int value ) {
return value * value;
}
} );
for ( int i = 0; i < a.size(); i++ ) {
int result = a.get( i );
int expected = ( i + 1 ) * ( i + 1 );
assertEquals( expected, result );
}
}
示例4: testShuffle
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public void testShuffle() {
int element_count = 20;
TIntList list = new TIntLinkedList( 20 );
for ( int i = 0; i < element_count; i++ ) {
list.add( i );
}
TIntList copy = new TIntLinkedList(list);
list.shuffle( new Random( System.currentTimeMillis() ) );
boolean differ = false;
for ( int i = 0; i < list.size(); i++ ) {
assertTrue( list.contains( i ) );
if (copy.get(i) != list.get(i))
differ = true;
}
// lost nothing
Set<Integer> s = new HashSet<Integer>();
for (TIntIterator iterator = list.iterator(); iterator.hasNext();) {
int next = iterator.next();
s.add(next);
}
assertTrue(s.size() == list.size());
assertTrue(copy.size() == list.size());
assertTrue("list not different " + copy + " shuffled= " + list, differ);
}
示例5: testTransform
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public void testTransform() {
int element_count = 20;
TIntList a = new TIntLinkedList();
for ( int i = 1; i < element_count; i++ ) {
a.add( i );
}
a.transformValues( new TIntFunction() {
@Override
public int execute( int value ) {
return value * value;
}
} );
for ( int i = 0; i < a.size(); i++ ) {
int result = a.get( i );
int expected = ( i + 1 ) * ( i + 1 );
assertEquals( expected, result );
}
}
示例6: testTransform
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public void testTransform() {
int element_count = 20;
TIntList a = new TIntLinkedList();
for ( int i = 1; i < element_count; i++ ) {
a.add( i );
}
a.transformValues( new TIntFunction() {
public int execute( int value ) {
return value * value;
}
} );
for ( int i = 0; i < a.size(); i++ ) {
int result = a.get( i );
int expected = ( i + 1 ) * ( i + 1 );
assertEquals( expected, result );
}
}
示例7: testTransform
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public void testTransform() {
int element_count = 20;
TIntList a = new TIntArrayList();
for ( int i = 1; i < element_count; i++ ) {
a.add( i );
}
a.transformValues( new TIntFunction() {
public int execute( int value ) {
return value * value;
}
} );
for ( int i = 0; i < a.size(); i++ ) {
int result = a.get( i );
int expected = ( i + 1 ) * ( i + 1 );
assertEquals( expected, result );
}
}
示例8: intoRanges
import gnu.trove.list.TIntList; //导入方法依赖的package包/类
public static List<IntRange> intoRanges(TIntList ids) {
if (ids.isEmpty()) {
throw new NoSuchElementException();
}
List<IntRange> ranges = new ArrayList<>();
if (ids.size() == 1) {
return ImmutableList.of(new IntRange(ids.get(0)));
}
ids.sort();
int start = ids.get(0);
int cur = start;
for (int id : ids.subList(1, ids.size()).toArray()) {
if (cur + 1 == id) {
cur = id;
} else {
ranges.add(new IntRange(start, cur));
start = id;
cur = id;
}
}
if (start == cur) {
ranges.add(new IntRange(start));
} else {
ranges.add(new IntRange(start, cur));
}
return ranges;
}