本文整理汇总了Java中gnu.trove.map.TIntLongMap.size方法的典型用法代码示例。如果您正苦于以下问题：Java TIntLongMap.size方法的具体用法？Java TIntLongMap.size怎么用？Java TIntLongMap.size使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类gnu.trove.map.TIntLongMap的用法示例。
在下文中一共展示了TIntLongMap.size方法的5个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: TIntLongHashMap
import gnu.trove.map.TIntLongMap; //导入方法依赖的package包/类
/**
* Creates a new <code>TIntLongHashMap</code> instance containing
* all of the entries in the map passed in.
*
* @param map a <tt>TIntLongMap</tt> that will be duplicated.
*/
public TIntLongHashMap( TIntLongMap map ) {
super( map.size() );
if ( map instanceof TIntLongHashMap ) {
TIntLongHashMap hashmap = ( TIntLongHashMap ) map;
this._loadFactor = hashmap._loadFactor;
this.no_entry_key = hashmap.no_entry_key;
this.no_entry_value = hashmap.no_entry_value;
//noinspection RedundantCast
if ( this.no_entry_key != ( int ) 0 ) {
Arrays.fill( _set, this.no_entry_key );
}
//noinspection RedundantCast
if ( this.no_entry_value != ( long ) 0 ) {
Arrays.fill( _values, this.no_entry_value );
}
setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) );
}
putAll( map );
}
示例2: testBug2037709
import gnu.trove.map.TIntLongMap; //导入方法依赖的package包/类
public void testBug2037709() {
TIntLongMap m = new TIntLongHashMap();
for ( int i = 0; i < 10; i++ ) {
m.put( i, i );
}
int sz = m.size();
assertEquals( 10, sz );
int[] keys = new int[sz];
m.keys( keys );
boolean[] seen = new boolean[sz];
Arrays.fill( seen, false );
for ( int i = 0; i < 10; i++ ) {
seen[keys[i]] = true;
}
for ( int i = 0; i < 10; i++ ) {
if ( !seen[i] ) {
TestCase.fail( "Missing key for: " + i );
}
}
}
示例3: testBug2037709
import gnu.trove.map.TIntLongMap; //导入方法依赖的package包/类
public void testBug2037709() {
TIntLongMap m = new TIntLongOffheapHashMap();
for ( int i = 0; i < 10; i++ ) {
m.put( i, i );
}
int sz = m.size();
assertEquals( 10, sz );
int[] keys = new int[sz];
m.keys( keys );
boolean[] seen = new boolean[sz];
Arrays.fill( seen, false );
for ( int i = 0; i < 10; i++ ) {
seen[keys[i]] = true;
}
for ( int i = 0; i < 10; i++ ) {
if ( !seen[i] ) {
TestCase.fail( "Missing key for: " + i );
}
}
}
示例4: equals
import gnu.trove.map.TIntLongMap; //导入方法依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean equals( Object other ) {
if ( ! ( other instanceof TIntLongMap ) ) {
return false;
}
TIntLongMap that = ( TIntLongMap ) other;
if ( that.size() != this.size() ) {
return false;
}
long[] values = _values;
byte[] states = _states;
long this_no_entry_value = getNoEntryValue();
long that_no_entry_value = that.getNoEntryValue();
for ( int i = values.length; i-- > 0; ) {
if ( states[i] == FULL ) {
int key = _set[i];
long that_value = that.get( key );
long this_value = values[i];
if ( ( this_value != that_value ) &&
( this_value != this_no_entry_value ) &&
( that_value != that_no_entry_value ) ) {
return false;
}
}
}
return true;
}
示例5: equals
import gnu.trove.map.TIntLongMap; //导入方法依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean equals( Object other ) {
if ( ! ( other instanceof TIntLongMap ) ) {
return false;
}
TIntLongMap that = ( TIntLongMap ) other;
if ( that.size() != this.size() ) {
return false;
}
TLongOffheapArray values = _values;
TByteOffheapArray states = _states;
long this_no_entry_value = getNoEntryValue();
long that_no_entry_value = that.getNoEntryValue();
for ( int i = capacity(); i-- > 0; ) {
if ( states.get( i ) == FULL ) {
int key = _set.get( i );
long that_value = that.get( key );
long this_value = values.get( i );
if ( ( this_value != that_value ) &&
( this_value != this_no_entry_value ) &&
( that_value != that_no_entry_value ) ) {
return false;
}
}
}
return true;
}