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

RubyHash.resize介绍

暂无

代码示例

代码示例来源：origin: org.jruby/jruby-complete

private void resizeAndAdjustThreshold(RubyHashEntry[] oldTable) {
  int newCapacity = oldTable.length << 1;
  resize(newCapacity);
  threshold = newCapacity - (newCapacity >> 2);
}

代码示例来源：origin: org.kill-bill.billing/killbill-osgi-bundles-jruby

private void resizeAndAdjustThreshold(RubyHashEntry[] oldTable) {
  int newCapacity = oldTable.length << 1;
  resize(newCapacity);
  threshold = newCapacity - (newCapacity >> 2);
}

代码示例来源：origin: org.jruby/jruby-core

private final void MRICheckResize() {
  if (size / table.length > ST_DEFAULT_MAX_DENSITY) {
    int forSize = table.length + 1; // size + 1;
    for (int i=0, newCapacity = MIN_CAPA; i < MRI_PRIMES.length; i++, newCapacity <<= 1) {
      if (newCapacity > forSize) {
        resize(MRI_PRIMES[i]);
        return;
      }
    }
    return; // suboptimal for large hashes (> 1073741824 + 85 entries) not very likely to happen
  }
}
// ------------------------------

代码示例来源：origin: org.jruby/jruby-core

private void resizeAndAdjustThreshold(RubyHashEntry[] oldTable) {
  int newCapacity = oldTable.length << 1;
  resize(newCapacity);
  threshold = newCapacity - (newCapacity >> 2);
}

代码示例来源：origin: org.jruby/jruby-complete

private final void MRICheckResize() {
  if (size / table.length > ST_DEFAULT_MAX_DENSITY) {
    int forSize = table.length + 1; // size + 1;
    for (int i=0, newCapacity = MIN_CAPA; i < MRI_PRIMES.length; i++, newCapacity <<= 1) {
      if (newCapacity > forSize) {
        resize(MRI_PRIMES[i]);
        return;
      }
    }
    return; // suboptimal for large hashes (> 1073741824 + 85 entries) not very likely to happen
  }
}
// ------------------------------

代码示例来源：origin: com.ning.billing/killbill-osgi-bundles-jruby

private void resizeAndAdjustThreshold(RubyHashEntry[] oldTable) {
  int newCapacity = oldTable.length << 1;
  resize(newCapacity);
  threshold = newCapacity - (newCapacity >> 2);
}

代码示例来源：origin: org.kill-bill.billing/killbill-osgi-bundles-jruby

private final void MRICheckResize() {
  if (size / table.length > ST_DEFAULT_MAX_DENSITY) {
    int forSize = table.length + 1; // size + 1;
    for (int i=0, newCapacity = MIN_CAPA; i < MRI_PRIMES.length; i++, newCapacity <<= 1) {
      if (newCapacity > forSize) {
        resize(MRI_PRIMES[i]);
        return;
      }
    }
    return; // suboptimal for large hashes (> 1073741824 + 85 entries) not very likely to happen
  }
}
// ------------------------------

代码示例来源：origin: com.ning.billing/killbill-osgi-bundles-jruby

private final void MRICheckResize() {
  if (size / table.length > ST_DEFAULT_MAX_DENSITY) {
    int forSize = table.length + 1; // size + 1;
    for (int i=0, newCapacity = MIN_CAPA; i < MRI_PRIMES.length; i++, newCapacity <<= 1) {
      if (newCapacity > forSize) {
        resize(MRI_PRIMES[i]);
        return;
      }
    }
    return; // suboptimal for large hashes (> 1073741824 + 85 entries) not very likely to happen
  }
}
// ------------------------------