java.util.LinkedHashMap.init()方法的使用及代码示例

x33g5p2x  于2022-01-17 转载在 其他  
字(7.0k)|赞(0)|评价(0)|浏览(134)

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

LinkedHashMap.init介绍

[英]Called by superclass constructors and pseudoconstructors (clone, readObject) before any entries are inserted into the map. Initializes the chain.
[中]

代码示例

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new empty {@code LinkedHashMap} instance.
 */
public LinkedHashMap() {
  init();
  accessOrder = false;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

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

/**
 * Constructs a new {@code LinkedHashMap} instance with the specified
 * capacity, load factor and a flag specifying the ordering behavior.
 *
 * @param initialCapacity
 *            the initial capacity of this hash map.
 * @param loadFactor
 *            the initial load factor.
 * @param accessOrder
 *            {@code true} if the ordering should be done based on the last
 *            access (from least-recently accessed to most-recently
 *            accessed), and {@code false} if the ordering should be the
 *            order in which the entries were inserted.
 * @throws IllegalArgumentException
 *             when the capacity is less than zero or the load factor is
 *             less or equal to zero.
 */
public LinkedHashMap(
    int initialCapacity, float loadFactor, boolean accessOrder) {
  super(initialCapacity, loadFactor);
  init();
  this.accessOrder = accessOrder;
}

相关文章