当前位置: 首页>>代码示例>>Java>>正文


Java TShortSet.size方法代码示例

本文整理汇总了Java中gnu.trove.set.TShortSet.size方法的典型用法代码示例。如果您正苦于以下问题:Java TShortSet.size方法的具体用法?Java TShortSet.size怎么用?Java TShortSet.size使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在gnu.trove.set.TShortSet的用法示例。


在下文中一共展示了TShortSet.size方法的6个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: equals

import gnu.trove.set.TShortSet; //导入方法依赖的package包/类
/** {@inheritDoc) */
public boolean equals( Object other ) {
    if (! ( other instanceof TShortSet ) ) {
        return false;
    }
    final TShortSet that = ( TShortSet ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    for ( int i = _states.length; i-- > 0; ) {
        if ( _states[i] == FULL ) {
            if ( ! that.contains( _set[i] ) ) {
                return false;
            }
        }
    }
    return true;
}
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:19,代码来源:TShortObjectHashMap.java

示例2: equals

import gnu.trove.set.TShortSet; //导入方法依赖的package包/类
/** {@inheritDoc} */
public boolean equals( Object other ) {
    if ( ! ( other instanceof TShortSet ) ) {
        return false;
    }
    TShortSet that = ( TShortSet ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    for ( int i = _states.length; i-- > 0; ) {
        if ( _states[i] == FULL ) {
            if ( ! that.contains( _set[i] ) ) {
                return false;
            }
        }
    }
    return true;
}
 
开发者ID:JianpingZeng,项目名称:xcc,代码行数:19,代码来源:TShortHashSet.java

示例3: equals

import gnu.trove.set.TShortSet; //导入方法依赖的package包/类
/** {@inheritDoc) */
@Override
public boolean equals( Object other ) {
    if (! ( other instanceof TShortSet ) ) {
        return false;
    }
    final TShortSet that = ( TShortSet ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    for ( int i = _states.length; i-- > 0; ) {
        if ( _states[i] == FULL ) {
            if ( ! that.contains( _set[i] ) ) {
                return false;
            }
        }
    }
    return true;
}
 
开发者ID:palantir,项目名称:trove-3.0.3,代码行数:20,代码来源:TShortObjectHashMap.java

示例4: equals

import gnu.trove.set.TShortSet; //导入方法依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean equals( Object other ) {
    if ( ! ( other instanceof TShortSet ) ) {
        return false;
    }
    TShortSet that = ( TShortSet ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    for ( int i = _states.length; i-- > 0; ) {
        if ( _states[i] == FULL ) {
            if ( ! that.contains( _set[i] ) ) {
                return false;
            }
        }
    }
    return true;
}
 
开发者ID:palantir,项目名称:trove-3.0.3,代码行数:20,代码来源:TShortHashSet.java

示例5: equals

import gnu.trove.set.TShortSet; //导入方法依赖的package包/类
/** {@inheritDoc} */
@Override
public boolean equals( Object other ) {
    if ( ! ( other instanceof TShortSet ) ) {
        return false;
    }
    TShortSet that = ( TShortSet ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    for ( int i = capacity(); i-- > 0; ) {
        if ( _states.get(i) == FULL ) {
            if ( ! that.contains( _set.get( i ) ) ) {
                return false;
            }
        }
    }
    return true;
}
 
开发者ID:palantir,项目名称:trove-3.0.3,代码行数:20,代码来源:TShortOffheapHashSet.java

示例6: distinct

import gnu.trove.set.TShortSet; //导入方法依赖的package包/类
@Override
public Array<Boolean> distinct(int limit) {
    final TShortSet set = new TShortHashSet(limit);
    final ArrayBuilder<Boolean> builder = ArrayBuilder.of(2, Boolean.class);
    for (int i=0; i<length(); ++i) {
        final boolean value = getBoolean(i);
        if (set.add(value ? (short)1 : (short)0)) {
            builder.addBoolean(value);
            if (set.size() >= limit) {
                break;
            }
        }
    }
    return builder.toArray();
}
 
开发者ID:zavtech,项目名称:morpheus-core,代码行数:16,代码来源:MappedArrayOfBooleans.java


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