• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

Java TCustomObjectHash类代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了Java中gnu.trove.impl.hash.TCustomObjectHash的典型用法代码示例。如果您正苦于以下问题:Java TCustomObjectHash类的具体用法?Java TCustomObjectHash怎么用?Java TCustomObjectHash使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。



TCustomObjectHash类属于gnu.trove.impl.hash包,在下文中一共展示了TCustomObjectHash类的7个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectShortCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectShortCustomHashMap.java


示例2: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectCharCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectCharCustomHashMap.java


示例3: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectLongCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectLongCustomHashMap.java


示例4: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectByteCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectByteCustomHashMap.java


示例5: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectIntCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectIntCustomHashMap.java


示例6: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectDoubleCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectDoubleCustomHashMap.java


示例7: nextIndex

import gnu.trove.impl.hash.TCustomObjectHash; //导入依赖的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 java.util.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 = TObjectFloatCustomHashMap.this._set;
           int i = _index;
           while ( i-- > 0 && ( set[i] == TCustomObjectHash.FREE ||
set[i] == TCustomObjectHash.REMOVED ) ) {
               ;
           }
           return i;
       }
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:24,代码来源:TObjectFloatCustomHashMap.java



注:本文中的gnu.trove.impl.hash.TCustomObjectHash类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
Java PhysicsCollisionListener类代码示例发布时间:2022-05-22
下一篇:
Java Query类代码示例发布时间:2022-05-22
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap