本文整理了Java中org.luaj.vm2.LuaTable.log2()方法的一些代码示例，展示了LuaTable.log2()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。LuaTable.log2()方法的具体详情如下：
包路径：org.luaj.vm2.LuaTable
类名称：LuaTable
方法名：log2

LuaTable.log2介绍

暂无

代码示例

代码示例来源：origin: M66B/XPrivacyLua

public void presize(int narray, int nhash) {
  if ( nhash > 0 && nhash < MIN_HASH_CAPACITY )
    nhash = MIN_HASH_CAPACITY;
  // Size of both parts must be a power of two.
  array = (narray>0? new LuaValue[1 << log2(narray)]: NOVALS);
  hash = (nhash>0? new Slot[1 << log2(nhash)]: NOBUCKETS);
  hashEntries = 0;
}

代码示例来源：origin: hsllany/HtmlNative

public void presize(int narray, int nhash) {
  if ( nhash > 0 && nhash < MIN_HASH_CAPACITY )
    nhash = MIN_HASH_CAPACITY;
  // Size of both parts must be a power of two.
  array = (narray>0? new LuaValue[1 << log2(narray)]: NOVALS);
  hash = (nhash>0? new Slot[1 << log2(nhash)]: NOBUCKETS);
  hashEntries = 0;
}

代码示例来源：origin: mirkosertic/GameComposer

public void presize(int narray, int nhash) {
  if ( nhash > 0 && nhash < MIN_HASH_CAPACITY )
    nhash = MIN_HASH_CAPACITY;
  // Size of both parts must be a power of two.
  array = (narray>0? new LuaValue[1 << log2(narray)]: NOVALS);
  hash = (nhash>0? new Slot[1 << log2(nhash)]: NOBUCKETS);
  hashEntries = 0;
}

代码示例来源：origin: M66B/XPrivacyLua

public void presize( int narray ) {
  if ( narray > array.length )
    array = resize( array, 1 << log2(narray) );
}

代码示例来源：origin: hsllany/HtmlNative

public void presize( int narray ) {
  if ( narray > array.length )
    array = resize( array, 1 << log2(narray) );
}

代码示例来源：origin: mirkosertic/GameComposer

@Override
public void presize( int narray ) {
  if ( narray > array.length )
    array = resize( array, 1 << log2(narray) );
}

代码示例来源：origin: M66B/XPrivacyLua

private int countIntKeys(int[] nums) {
  int total = 0;
  int i = 1;
  // Count integer keys in array part
  for ( int bit = 0; bit < 31; ++bit ) {
    if ( i > array.length )
      break;
    int j = Math.min(array.length, 1 << bit);
    int c = 0;
    while ( i <= j ) {
      if ( array[ i++ - 1 ] != null )
        c++;
    }
    nums[bit] = c;
    total += c;
  }
  // Count integer keys in hash part
  for ( i = 0; i < hash.length; ++i ) {
    for ( Slot s = hash[i]; s != null; s = s.rest() ) {
      int k;
      if ( ( k = s.arraykey(Integer.MAX_VALUE) ) > 0 ) {
        nums[log2(k)]++;
        total++;
      }
    }
  }
  return total;
}

代码示例来源：origin: hsllany/HtmlNative

private int countIntKeys(int[] nums) {
  int total = 0;
  int i = 1;
  // Count integer keys in array part
  for ( int bit = 0; bit < 31; ++bit ) {
    if ( i > array.length )
      break;
    int j = Math.min(array.length, 1 << bit);
    int c = 0;
    while ( i <= j ) {
      if ( array[ i++ - 1 ] != null )
        c++;
    }
    nums[bit] = c;
    total += c;
  }
  // Count integer keys in hash part
  for ( i = 0; i < hash.length; ++i ) {
    for ( Slot s = hash[i]; s != null; s = s.rest() ) {
      int k;
      if ( ( k = s.arraykey(Integer.MAX_VALUE) ) > 0 ) {
        nums[log2(k)]++;
        total++;
      }
    }
  }
  return total;
}

代码示例来源：origin: mirkosertic/GameComposer

private int countIntKeys(int[] nums) {
  int total = 0;
  int i = 1;
  // Count integer keys in array part
  for ( int bit = 0; bit < 31; ++bit ) {
    if ( i > array.length )
      break;
    int j = Math.min(array.length, 1 << bit);
    int c = 0;
    while ( i <= j ) {
      if ( array[ i++ - 1 ] != null )
        c++;
    }
    nums[bit] = c;
    total += c;
  }
  // Count integer keys in hash part
  for ( i = 0; i < hash.length; ++i ) {
    for ( Slot s = hash[i]; s != null; s = s.rest() ) {
      int k;
      if ( ( k = s.arraykey(Integer.MAX_VALUE) ) > 0 ) {
        nums[log2(k)]++;
        total++;
      }
    }
  }
  return total;
}

代码示例来源：origin: M66B/XPrivacyLua

if ( newKey > 0 ) {
  total++;
  nums[log2(newKey)]++;
  newArray = new LuaValue[newArraySize];
  if (newArraySize > oldArray.length) {
    for (int i = log2(oldArray.length + 1), j = log2(newArraySize) + 1; i < j; ++i) {
      movingToArray += nums[i];
    for (int i = log2(newArraySize + 1), j = log2(oldArray.length) + 1; i < j; ++i) {
      movingToArray -= nums[i];
    : 1 << log2(newHashSize);
  newHashMask = newCapacity - 1;
  newHash = new Slot[ newCapacity ];

代码示例来源：origin: hsllany/HtmlNative

if ( newKey > 0 ) {
  total++;
  nums[log2(newKey)]++;
  newArray = new LuaValue[newArraySize];
  if (newArraySize > oldArray.length) {
    for (int i = log2(oldArray.length + 1), j = log2(newArraySize) + 1; i < j; ++i) {
      movingToArray += nums[i];
    for (int i = log2(newArraySize + 1), j = log2(oldArray.length) + 1; i < j; ++i) {
      movingToArray -= nums[i];
    : 1 << log2(newHashSize);
  newHashMask = newCapacity - 1;
  newHash = new Slot[ newCapacity ];

代码示例来源：origin: mirkosertic/GameComposer

if ( newKey > 0 ) {
  total++;
  nums[log2(newKey)]++;
  newArray = new LuaValue[newArraySize];
  if (newArraySize > oldArray.length) {
    for (int i = log2(oldArray.length + 1), j = log2(newArraySize) + 1; i < j; ++i) {
      movingToArray += nums[i];
    for (int i = log2(newArraySize + 1), j = log2(oldArray.length) + 1; i < j; ++i) {
      movingToArray -= nums[i];
    : 1 << log2(newHashSize);
  newHashMask = newCapacity - 1;
  newHash = new Slot[ newCapacity ];