java.util.Hashtable.makeTable()方法的使用及代码示例

x33g5p2x  于2022-01-19 转载在 其他  
字(13.1k)|赞(0)|评价(0)|浏览(185)

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

Hashtable.makeTable介绍

[英]Allocate a table of the given capacity and set the threshold accordingly.
[中]分配给定容量的表，并相应地设置阈值。

代码示例

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

HashtableEntry<K, V>[] newTable = makeTable(newCapacity);
if (size == 0) {
  return newTable;

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

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

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

/**
 * Returns a new {@code Hashtable} with the same key/value pairs, capacity
 * and load factor.
 *
 * @return a shallow copy of this {@code Hashtable}.
 * @see java.lang.Cloneable
 */
@SuppressWarnings("unchecked")
@Override public synchronized Object clone() {
  /*
   * This could be made more efficient. It unnecessarily hashes all of
   * the elements in the map.
   */
  Hashtable<K, V> result;
  try {
    result = (Hashtable<K, V>) super.clone();
  } catch (CloneNotSupportedException e) {
    throw new AssertionError(e);
  }
  // Restore clone to empty state, retaining our capacity and threshold
  result.makeTable(table.length);
  result.size = 0;
  result.keySet = null;
  result.entrySet = null;
  result.values = null;
  result.constructorPutAll(this);
  return result;
}

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

private void readObject(ObjectInputStream stream) throws IOException,
      ClassNotFoundException {
    stream.defaultReadObject();
    int capacity = stream.readInt();
    if (capacity < 0) {
      throw new InvalidObjectException("Capacity: " + capacity);
    }
    if (capacity < MINIMUM_CAPACITY) {
      capacity = MINIMUM_CAPACITY;
    } else if (capacity > MAXIMUM_CAPACITY) {
      capacity = MAXIMUM_CAPACITY;
    } else {
      capacity = Collections.roundUpToPowerOfTwo(capacity);
    }
    makeTable(capacity);

    int size = stream.readInt();
    if (size < 0) {
      throw new InvalidObjectException("Size: " + size);
    }

    for (int i = 0; i < size; i++) {
      @SuppressWarnings("unchecked") K key = (K) stream.readObject();
      @SuppressWarnings("unchecked") V val = (V) stream.readObject();
      constructorPut(key, val);
    }
  }
}

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

HashtableEntry<K, V>[] newTable = makeTable(newCapacity);
if (size != 0) {
  int newMask = newCapacity - 1;

代码示例来源：origin: MobiVM/robovm

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Returns a new {@code Hashtable} with the same key/value pairs, capacity
 * and load factor.
 *
 * @return a shallow copy of this {@code Hashtable}.
 * @see java.lang.Cloneable
 */
@SuppressWarnings("unchecked")
@Override public synchronized Object clone() {
  /*
   * This could be made more efficient. It unnecessarily hashes all of
   * the elements in the map.
   */
  Hashtable<K, V> result;
  try {
    result = (Hashtable<K, V>) super.clone();
  } catch (CloneNotSupportedException e) {
    throw new AssertionError(e);
  }
  // Restore clone to empty state, retaining our capacity and threshold
  result.makeTable(table.length);
  result.size = 0;
  result.keySet = null;
  result.entrySet = null;
  result.values = null;
  result.constructorPutAll(this);
  return result;
}

代码示例来源：origin: ibinti/bugvm

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

代码示例来源：origin: MobiVM/robovm

/**
 * Returns a new {@code Hashtable} with the same key/value pairs, capacity
 * and load factor.
 *
 * @return a shallow copy of this {@code Hashtable}.
 * @see java.lang.Cloneable
 */
@SuppressWarnings("unchecked")
@Override public synchronized Object clone() {
  /*
   * This could be made more efficient. It unnecessarily hashes all of
   * the elements in the map.
   */
  Hashtable<K, V> result;
  try {
    result = (Hashtable<K, V>) super.clone();
  } catch (CloneNotSupportedException e) {
    throw new AssertionError(e);
  }
  // Restore clone to empty state, retaining our capacity and threshold
  result.makeTable(table.length);
  result.size = 0;
  result.keySet = null;
  result.entrySet = null;
  result.values = null;
  result.constructorPutAll(this);
  return result;
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Returns a new {@code Hashtable} with the same key/value pairs, capacity
 * and load factor.
 *
 * @return a shallow copy of this {@code Hashtable}.
 * @see java.lang.Cloneable
 */
@SuppressWarnings("unchecked")
@Override public synchronized Object clone() {
  /*
   * This could be made more efficient. It unnecessarily hashes all of
   * the elements in the map.
   */
  Hashtable<K, V> result;
  try {
    result = (Hashtable<K, V>) super.clone();
  } catch (CloneNotSupportedException e) {
    throw new AssertionError(e);
  }
  // Restore clone to empty state, retaining our capacity and threshold
  result.makeTable(table.length);
  result.size = 0;
  result.keySet = null;
  result.entrySet = null;
  result.values = null;
  result.constructorPutAll(this);
  return result;
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Constructs a new {@code Hashtable} using the specified capacity and the
 * default load factor.
 *
 * @param capacity
 *            the initial capacity.
 */
public Hashtable(int capacity) {
  if (capacity < 0) {
    throw new IllegalArgumentException("Capacity: " + capacity);
  }
  if (capacity == 0) {
    @SuppressWarnings("unchecked")
    HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE;
    table = tab;
    threshold = -1; // Forces first put() to replace EMPTY_TABLE
    return;
  }
  if (capacity < MINIMUM_CAPACITY) {
    capacity = MINIMUM_CAPACITY;
  } else if (capacity > MAXIMUM_CAPACITY) {
    capacity = MAXIMUM_CAPACITY;
  } else {
    capacity = Collections.roundUpToPowerOfTwo(capacity);
  }
  makeTable(capacity);
}

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * Returns a new {@code Hashtable} with the same key/value pairs, capacity
 * and load factor.
 *
 * @return a shallow copy of this {@code Hashtable}.
 * @see Cloneable
 */
@SuppressWarnings("unchecked")
@Override public synchronized Object clone() {
  /*
   * This could be made more efficient. It unnecessarily hashes all of
   * the elements in the map.
   */
  Hashtable<K, V> result;
  try {
    result = (Hashtable<K, V>) super.clone();
  } catch (CloneNotSupportedException e) {
    throw new AssertionError(e);
  }
  // Restore clone to empty state, retaining our capacity and threshold
  result.makeTable(table.length);
  result.size = 0;
  result.keySet = null;
  result.entrySet = null;
  result.values = null;
  result.constructorPutAll(this);
  return result;
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Returns a new {@code Hashtable} with the same key/value pairs, capacity
 * and load factor.
 *
 * @return a shallow copy of this {@code Hashtable}.
 * @see java.lang.Cloneable
 */
@SuppressWarnings("unchecked")
@Override public synchronized Object clone() {
  /*
   * This could be made more efficient. It unnecessarily hashes all of
   * the elements in the map.
   */
  Hashtable<K, V> result;
  try {
    result = (Hashtable<K, V>) super.clone();
  } catch (CloneNotSupportedException e) {
    throw new AssertionError(e);
  }
  // Restore clone to empty state, retaining our capacity and threshold
  result.makeTable(table.length);
  result.size = 0;
  result.keySet = null;
  result.entrySet = null;
  result.values = null;
  result.constructorPutAll(this);
  return result;
}

代码示例来源：origin: MobiVM/robovm

private void readObject(ObjectInputStream stream) throws IOException,
      ClassNotFoundException {
    stream.defaultReadObject();
    int capacity = stream.readInt();
    if (capacity < 0) {
      throw new InvalidObjectException("Capacity: " + capacity);
    }
    if (capacity < MINIMUM_CAPACITY) {
      capacity = MINIMUM_CAPACITY;
    } else if (capacity > MAXIMUM_CAPACITY) {
      capacity = MAXIMUM_CAPACITY;
    } else {
      capacity = Collections.roundUpToPowerOfTwo(capacity);
    }
    makeTable(capacity);

    int size = stream.readInt();
    if (size < 0) {
      throw new InvalidObjectException("Size: " + size);
    }

    for (int i = 0; i < size; i++) {
      @SuppressWarnings("unchecked") K key = (K) stream.readObject();
      @SuppressWarnings("unchecked") V val = (V) stream.readObject();
      constructorPut(key, val);
    }
  }
}

代码示例来源：origin: ibinti/bugvm

private void readObject(ObjectInputStream stream) throws IOException,
      ClassNotFoundException {
    stream.defaultReadObject();
    int capacity = stream.readInt();
    if (capacity < 0) {
      throw new InvalidObjectException("Capacity: " + capacity);
    }
    if (capacity < MINIMUM_CAPACITY) {
      capacity = MINIMUM_CAPACITY;
    } else if (capacity > MAXIMUM_CAPACITY) {
      capacity = MAXIMUM_CAPACITY;
    } else {
      capacity = Collections.roundUpToPowerOfTwo(capacity);
    }
    makeTable(capacity);

    int size = stream.readInt();
    if (size < 0) {
      throw new InvalidObjectException("Size: " + size);
    }

    for (int i = 0; i < size; i++) {
      @SuppressWarnings("unchecked") K key = (K) stream.readObject();
      @SuppressWarnings("unchecked") V val = (V) stream.readObject();
      constructorPut(key, val);
    }
  }
}

代码示例来源：origin: com.bugvm/bugvm-rt

private void readObject(ObjectInputStream stream) throws IOException,
      ClassNotFoundException {
    stream.defaultReadObject();
    int capacity = stream.readInt();
    if (capacity < 0) {
      throw new InvalidObjectException("Capacity: " + capacity);
    }
    if (capacity < MINIMUM_CAPACITY) {
      capacity = MINIMUM_CAPACITY;
    } else if (capacity > MAXIMUM_CAPACITY) {
      capacity = MAXIMUM_CAPACITY;
    } else {
      capacity = Collections.roundUpToPowerOfTwo(capacity);
    }
    makeTable(capacity);

    int size = stream.readInt();
    if (size < 0) {
      throw new InvalidObjectException("Size: " + size);
    }

    for (int i = 0; i < size; i++) {
      @SuppressWarnings("unchecked") K key = (K) stream.readObject();
      @SuppressWarnings("unchecked") V val = (V) stream.readObject();
      constructorPut(key, val);
    }
  }
}

代码示例来源：origin: FlexoVM/flexovm

private void readObject(ObjectInputStream stream) throws IOException,
      ClassNotFoundException {
    stream.defaultReadObject();
    int capacity = stream.readInt();
    if (capacity < 0) {
      throw new InvalidObjectException("Capacity: " + capacity);
    }
    if (capacity < MINIMUM_CAPACITY) {
      capacity = MINIMUM_CAPACITY;
    } else if (capacity > MAXIMUM_CAPACITY) {
      capacity = MAXIMUM_CAPACITY;
    } else {
      capacity = Collections.roundUpToPowerOfTwo(capacity);
    }
    makeTable(capacity);

    int size = stream.readInt();
    if (size < 0) {
      throw new InvalidObjectException("Size: " + size);
    }

    for (int i = 0; i < size; i++) {
      @SuppressWarnings("unchecked") K key = (K) stream.readObject();
      @SuppressWarnings("unchecked") V val = (V) stream.readObject();
      constructorPut(key, val);
    }
  }
}

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

Hashtable

相关文章

    查看更多

    热门标签

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

    最新文章

    更多
    • 蜀ICP备2022004421号-2 NULL123 https://www.null123.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com