本文整理汇总了Java中gnu.trove.impl.hash.TObjectHash类的典型用法代码示例。如果您正苦于以下问题：Java TObjectHash类的具体用法？Java TObjectHash怎么用？Java TObjectHash使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
TObjectHash类属于gnu.trove.impl.hash包，在下文中一共展示了TObjectHash类的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: testFreeSlotCounterConsistency
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Make sure that REMOVED entries are pruned when doing compaction.
*/
public void testFreeSlotCounterConsistency() {
THashMap<String,String> map = new THashMap<String,String>();
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
map.put( "ONE", "1" );
map.put( "TWO", "2" );
map.put( "THREE", "3" );
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
// Compact to make sure we're at the internal capacity we want to ultimate be at
map.compact();
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
map.remove( "TWO" );
map.put( "FOUR", "4" );
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
map.compact();
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
}
开发者ID:palantir，项目名称:trove-3.0.3，代码行数:25，代码来源:THashMapTest.java
示例2: testFreeSlotCounterConsistency
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Make sure that REMOVED entries are pruned when doing compaction.
*/
public void testFreeSlotCounterConsistency() {
THashMap<String,String> map = new THashMap<String,String>();
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
map.put( "ONE", "1" );
map.put( "TWO", "2" );
map.put( "THREE", "3" );
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
// Compact to make sure we're at the internal capacity we want to ultimate be at
map.compact();
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
map.remove( "TWO" );
map.put( "FOUR", "4" );
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
map.compact();
HashTestKit.checkFreeSlotCount( map, map._set, TObjectHash.FREE );
}
开发者ID:leventov，项目名称:trove-over-koloboke-compile，代码行数:25，代码来源:THashMapTest.java
示例3: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectFloatHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectFloatHashMap.java
示例4: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectIntHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectIntHashMap.java
示例5: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectShortHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectShortHashMap.java
示例6: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectByteHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectByteHashMap.java
示例7: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectDoubleHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectDoubleHashMap.java
示例8: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectLongHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectLongHashMap.java
示例9: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectCharHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:25，代码来源:TObjectCharHashMap.java
示例10: objectAtIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
@SuppressWarnings("unchecked")
protected E objectAtIndex( int index ) {
Object obj = _objectHash._set[index];
if ( obj == TObjectHash.FREE || obj == TObjectHash.REMOVED ) {
return null;
}
return (E) obj;
}
开发者ID:JianpingZeng，项目名称:xcc，代码行数:9，代码来源:TObjectHashIterator.java
示例11: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
final Object[] set = TObjectDoubleHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE ||
set[i] == TObjectHash.REMOVED ) ) {
// do nothing
}
return i;
}
开发者ID:digitalheir，项目名称:java-probabilistic-earley-parser，代码行数:25，代码来源:TObjectDoubleHashMap.java
示例12: objectAtIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
@SuppressWarnings("unchecked")
protected E objectAtIndex(final int index ) {
final Object obj = _objectHash._set[index];
if ( obj == TObjectHash.FREE || obj == TObjectHash.REMOVED ) {
return null;
}
return (E) obj;
}
开发者ID:digitalheir，项目名称:java-probabilistic-earley-parser，代码行数:9，代码来源:TObjectHashIterator.java
示例13: objectAtIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
@Override
@SuppressWarnings("unchecked")
protected E objectAtIndex( int index ) {
Object obj = _objectHash._set[index];
if ( obj == TObjectHash.FREE || obj == TObjectHash.REMOVED ) {
return null;
}
return (E) obj;
}
开发者ID:palantir，项目名称:trove-3.0.3，代码行数:10，代码来源:TObjectHashIterator.java
示例14: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectFloatHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE || set[i] == TObjectHash.REMOVED ) ) {
;
}
return i;
}
开发者ID:major2015，项目名称:easyrec_major，代码行数:23，代码来源:TObjectFloatHashMap.java
示例15: nextIndex
import gnu.trove.impl.hash.TObjectHash; //导入依赖的package包/类
/**
* Returns the index of the next value in the data structure
* or a negative value if the iterator is exhausted.
*
* @return an <code>int</code> value
* @throws ConcurrentModificationException
* if the underlying
* collection's size has been modified since the iterator was
* created.
*/
protected final int nextIndex() {
if ( _expectedSize != _hash.size() ) {
throw new ConcurrentModificationException();
}
Object[] set = TObjectIntHashMap.this._set;
int i = _index;
while ( i-- > 0 && ( set[i] == TObjectHash.FREE || set[i] == TObjectHash.REMOVED ) ) {
;
}
return i;
}
开发者ID:major2015，项目名称:easyrec_major，代码行数:23，代码来源:TObjectIntHashMap.java
注：本文中的gnu.trove.impl.hash.TObjectHash类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。 |
客服电话
APP下载
官方微信
请发表评论