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


Java BitUtil.findNextPositivePowerOfTwo方法代码示例

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


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

示例1: EncodedData2ObjectHashMap

import org.agrona.BitUtil; //导入方法依赖的package包/类
public EncodedData2ObjectHashMap(
        final int initialCapacity,
        final float loadFactor,
        final int keyLengthInBytes,
        final BiConsumer<K, ByteBuffer> keyEncoder,
        final ToIntFunction<ByteBuffer> hashFunction,
        final K nullKey)
{
    this.capacity = BitUtil.findNextPositivePowerOfTwo(initialCapacity);
    this.loadFactor = loadFactor;
    this.keyLengthInBytes = keyLengthInBytes;
    this.keyBuffer = ByteBuffer.allocate(keyLengthInBytes);
    this.nullKeyBuffer = ByteBuffer.allocate(keyLengthInBytes);
    this.keyEncoder = keyEncoder;
    this.keySpace = ByteBuffer.allocate(keyLengthInBytes * capacity);
    this.values = new Object[capacity];
    this.hashFunction = hashFunction;

    keyEncoder.accept(nullKey, nullKeyBuffer);
    fillKeySpaceWithNullKey(keySpace, capacity);
    if(loadFactor >= 1f)
    {
        throw new IllegalArgumentException("loadFactor must be < 1");
    }
    resizeThreshold = (int) (capacity * loadFactor);
}
 
开发者ID:LMAX-Exchange,项目名称:angler,代码行数:27,代码来源:EncodedData2ObjectHashMap.java

示例2: ensureCapacity

import org.agrona.BitUtil; //导入方法依赖的package包/类
private void ensureCapacity(final int requiredCapacity)
{
    if (requiredCapacity < 0)
    {
        throw new IllegalStateException(
            "Insufficient capacity: length=" + keys.length + " required=" + requiredCapacity);
    }

    if (requiredCapacity > keys.length)
    {
        final int newCapacity = BitUtil.findNextPositivePowerOfTwo(requiredCapacity);
        keys = Arrays.copyOf(keys, newCapacity);
    }
}
 
开发者ID:real-logic,项目名称:agrona,代码行数:15,代码来源:NioSelectedKeySet.java

示例3: AbstractConcurrentArrayQueue

import org.agrona.BitUtil; //导入方法依赖的package包/类
@SuppressWarnings("unchecked")
public AbstractConcurrentArrayQueue(final int requestedCapacity)
{
    capacity = BitUtil.findNextPositivePowerOfTwo(requestedCapacity);
    buffer = (E[])new Object[capacity];
}
 
开发者ID:real-logic,项目名称:agrona,代码行数:7,代码来源:AbstractConcurrentArrayQueue.java

示例4: NioSelectedKeySet

import org.agrona.BitUtil; //导入方法依赖的package包/类
/**
 * Construct a key set with the given capacity.
 *
 * @param initialCapacity for the key set
 */
public NioSelectedKeySet(final int initialCapacity)
{
    keys = new SelectionKey[BitUtil.findNextPositivePowerOfTwo(initialCapacity)];
}
 
开发者ID:real-logic,项目名称:agrona,代码行数:10,代码来源:NioSelectedKeySet.java


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