com.google.common.collect.Hashing.closedTableSize()方法的使用及代码示例

x33g5p2x  于2022-01-20 转载在 其他  
字(8.4k)|赞(0)|评价(0)|浏览(81)

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

Hashing.closedTableSize介绍

暂无

代码示例

代码示例来源：origin: google/guava

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.keys = new Object[expectedSize];
 this.values = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: google/guava

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.elements = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: google/j2objc

@SuppressWarnings("unchecked")
void init(int expectedSize) {
 CollectPreconditions.checkNonnegative(expectedSize, "expectedSize");
 int tableSize = Hashing.closedTableSize(expectedSize, 1.0);
 size = 0;
 keys = (K[]) new Object[expectedSize];
 values = (V[]) new Object[expectedSize];
 hashTableKToV = createFilledWithAbsent(tableSize);
 hashTableVToK = createFilledWithAbsent(tableSize);
 nextInBucketKToV = createFilledWithAbsent(expectedSize);
 nextInBucketVToK = createFilledWithAbsent(expectedSize);
 firstInInsertionOrder = ENDPOINT;
 lastInInsertionOrder = ENDPOINT;
 prevInInsertionOrder = createFilledWithAbsent(expectedSize);
 nextInInsertionOrder = createFilledWithAbsent(expectedSize);
}

代码示例来源：origin: google/j2objc

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.elements = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: google/j2objc

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.keys = new Object[expectedSize];
 this.values = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: google/j2objc

void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.keys = new Object[expectedSize];
 this.values = new int[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: wildfly/wildfly

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.keys = new Object[expectedSize];
 this.values = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: wildfly/wildfly

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.elements = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: google/guava

private void init(int expectedSize) {
 checkNonnegative(expectedSize, "expectedSize");
 int tableSize = Hashing.closedTableSize(expectedSize, LOAD_FACTOR);
 this.hashTableKToV = createTable(tableSize);
 this.hashTableVToK = createTable(tableSize);
 this.firstInKeyInsertionOrder = null;
 this.lastInKeyInsertionOrder = null;
 this.size = 0;
 this.mask = tableSize - 1;
 this.modCount = 0;
}

代码示例来源：origin: google/j2objc

int newTableSize = Hashing.closedTableSize(minCapacity, 1.0);
hashTableKToV = createFilledWithAbsent(newTableSize);
hashTableVToK = createFilledWithAbsent(newTableSize);

代码示例来源：origin: wildfly/wildfly

private void init(int expectedSize) {
 checkNonnegative(expectedSize, "expectedSize");
 int tableSize = Hashing.closedTableSize(expectedSize, LOAD_FACTOR);
 this.hashTableKToV = createTable(tableSize);
 this.hashTableVToK = createTable(tableSize);
 this.firstInKeyInsertionOrder = null;
 this.lastInKeyInsertionOrder = null;
 this.size = 0;
 this.mask = tableSize - 1;
 this.modCount = 0;
}

代码示例来源：origin: google/guava

return new RegularImmutableMultiset<>(entryArray, null, 0, 0, ImmutableSet.of());
int tableSize = Hashing.closedTableSize(distinct, MAX_LOAD_FACTOR);
int mask = tableSize - 1;
@SuppressWarnings("unchecked")

代码示例来源：origin: google/guava

entries = createEntryArray(n);
int tableSize = Hashing.closedTableSize(n, MAX_LOAD_FACTOR);
ImmutableMapEntry<K, V>[] table = createEntryArray(tableSize);
int mask = tableSize - 1;

代码示例来源：origin: google/guava

static <K, V> ImmutableBiMap<K, V> fromEntryArray(int n, Entry<K, V>[] entryArray) {
 checkPositionIndex(n, entryArray.length);
 int tableSize = Hashing.closedTableSize(n, MAX_LOAD_FACTOR);
 int mask = tableSize - 1;
 ImmutableMapEntry<K, V>[] keyTable = createEntryArray(tableSize);

代码示例来源：origin: wildfly/wildfly

return new RegularImmutableMultiset<>(entryArray, null, 0, 0, ImmutableSet.of());
int tableSize = Hashing.closedTableSize(distinct, MAX_LOAD_FACTOR);
int mask = tableSize - 1;
@SuppressWarnings("unchecked")

代码示例来源：origin: wildfly/wildfly

static <K, V> ImmutableBiMap<K, V> fromEntryArray(int n, Entry<K, V>[] entryArray) {
 checkPositionIndex(n, entryArray.length);
 int tableSize = Hashing.closedTableSize(n, MAX_LOAD_FACTOR);
 int mask = tableSize - 1;
 ImmutableMapEntry<K, V>[] keyTable = createEntryArray(tableSize);

代码示例来源：origin: wildfly/wildfly

entries = createEntryArray(n);
int tableSize = Hashing.closedTableSize(n, MAX_LOAD_FACTOR);
ImmutableMapEntry<K, V>[] table = createEntryArray(tableSize);
int mask = tableSize - 1;

代码示例来源：origin: org.jboss.eap/wildfly-client-all

/** Pseudoconstructor for serialization support. */
void init(int expectedSize, float loadFactor) {
 Preconditions.checkArgument(expectedSize >= 0, "Initial capacity must be non-negative");
 Preconditions.checkArgument(loadFactor > 0, "Illegal load factor");
 int buckets = Hashing.closedTableSize(expectedSize, loadFactor);
 this.table = newTable(buckets);
 this.loadFactor = loadFactor;
 this.elements = new Object[expectedSize];
 this.entries = newEntries(expectedSize);
 this.threshold = Math.max(1, (int) (buckets * loadFactor));
}

代码示例来源：origin: org.hudsonci.lib.guava/guava

private void init(int expectedSize) {
 checkArgument(expectedSize >= 0, "expectedSize must be >= 0 but was %s", expectedSize);
 int tableSize = Hashing.closedTableSize(expectedSize, LOAD_FACTOR);
 this.hashTableKToV = createTable(tableSize);
 this.hashTableVToK = createTable(tableSize);
 this.mask = tableSize - 1;
 this.modCount = 0;
 this.size = 0;
}

代码示例来源：origin: com.google.guava/guava-jdk5

private void init(int expectedSize) {
 checkNonnegative(expectedSize, "expectedSize");
 int tableSize = Hashing.closedTableSize(expectedSize, LOAD_FACTOR);
 this.hashTableKToV = createTable(tableSize);
 this.hashTableVToK = createTable(tableSize);
 this.mask = tableSize - 1;
 this.modCount = 0;
 this.size = 0;
}

内容来源于网络，如有侵权，请联系作者删除！

Hashing

相关文章

    查看更多
    微信公众号

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com