org.mozilla.javascript.UintMap.ensureIndex()方法的使用及代码示例

x33g5p2x  于2022-02-01 转载在 JavaScript  
字(4.4k)|赞(0)|评价(0)|浏览(98)

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

UintMap.ensureIndex介绍

暂无

代码示例

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

/**
 * Set object value of the key.
 * If key does not exist, also set its int value to 0.
 */
public void put(int key, Object value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, false);
  if (values == null) {
    values = new Object[1 << power];
  }
  values[index] = value;
}

代码示例来源:origin: ro.isdc.wro4j/rhino

/**
 * Set object value of the key.
 * If key does not exist, also set its int value to 0.
 */
public void put(int key, Object value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, false);
  if (values == null) {
    values = new Object[1 << power];
  }
  values[index] = value;
}

代码示例来源:origin: com.github.tntim96/rhino

/**
 * Set object value of the key.
 * If key does not exist, also set its int value to 0.
 */
public void put(int key, Object value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, false);
  if (values == null) {
    values = new Object[1 << power];
  }
  values[index] = value;
}

代码示例来源:origin: rhino/js

/**
 * Set object value of the key.
 * If key does not exist, also set its int value to 0.
 */
public void put(int key, Object value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, false);
  if (values == null) {
    values = new Object[1 << power];
  }
  values[index] = value;
}

代码示例来源:origin: io.apigee/rhino

/**
 * Set object value of the key.
 * If key does not exist, also set its int value to 0.
 */
public void put(int key, Object value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, false);
  if (values == null) {
    values = new Object[1 << power];
  }
  values[index] = value;
}

代码示例来源:origin: com.sun.phobos/phobos-rhino

/**
 * Set object value of the key.
 * If key does not exist, also set its int value to 0.
 */
public void put(int key, Object value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, false);
  if (values == null) {
    values = new Object[1 << power];
  }
  values[index] = value;
}

代码示例来源:origin: io.apigee/rhino

/**
 * Set int value of the key.
 * If key does not exist, also set its object value to null.
 */
public void put(int key, int value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, true);
  if (ivaluesShift == 0) {
    int N = 1 << power;
    // keys.length can be N * 2 after clear which set ivaluesShift to 0
    if (keys.length != N * 2) {
      int[] tmp = new int[N * 2];
      System.arraycopy(keys, 0, tmp, 0, N);
      keys = tmp;
    }
    ivaluesShift = N;
  }
  keys[ivaluesShift + index] = value;
}

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

/**
 * Set int value of the key.
 * If key does not exist, also set its object value to null.
 */
public void put(int key, int value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, true);
  if (ivaluesShift == 0) {
    int N = 1 << power;
    // keys.length can be N * 2 after clear which set ivaluesShift to 0
    if (keys.length != N * 2) {
      int[] tmp = new int[N * 2];
      System.arraycopy(keys, 0, tmp, 0, N);
      keys = tmp;
    }
    ivaluesShift = N;
  }
  keys[ivaluesShift + index] = value;
}

代码示例来源:origin: com.sun.phobos/phobos-rhino

/**
 * Set int value of the key.
 * If key does not exist, also set its object value to null.
 */
public void put(int key, int value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, true);
  if (ivaluesShift == 0) {
    int N = 1 << power;
    // keys.length can be N * 2 after clear which set ivaluesShift to 0
    if (keys.length != N * 2) {
      int[] tmp = new int[N * 2];
      System.arraycopy(keys, 0, tmp, 0, N);
      keys = tmp;
    }
    ivaluesShift = N;
  }
  keys[ivaluesShift + index] = value;
}

代码示例来源:origin: com.github.tntim96/rhino

/**
 * Set int value of the key.
 * If key does not exist, also set its object value to null.
 */
public void put(int key, int value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, true);
  if (ivaluesShift == 0) {
    int N = 1 << power;
    // keys.length can be N * 2 after clear which set ivaluesShift to 0
    if (keys.length != N * 2) {
      int[] tmp = new int[N * 2];
      System.arraycopy(keys, 0, tmp, 0, N);
      keys = tmp;
    }
    ivaluesShift = N;
  }
  keys[ivaluesShift + index] = value;
}

代码示例来源:origin: ro.isdc.wro4j/rhino

/**
 * Set int value of the key.
 * If key does not exist, also set its object value to null.
 */
public void put(int key, int value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, true);
  if (ivaluesShift == 0) {
    int N = 1 << power;
    // keys.length can be N * 2 after clear which set ivaluesShift to 0
    if (keys.length != N * 2) {
      int[] tmp = new int[N * 2];
      System.arraycopy(keys, 0, tmp, 0, N);
      keys = tmp;
    }
    ivaluesShift = N;
  }
  keys[ivaluesShift + index] = value;
}

代码示例来源:origin: rhino/js

/**
 * Set int value of the key.
 * If key does not exist, also set its object value to null.
 */
public void put(int key, int value) {
  if (key < 0) Kit.codeBug();
  int index = ensureIndex(key, true);
  if (ivaluesShift == 0) {
    int N = 1 << power;
    // keys.length can be N * 2 after clear which set ivaluesShift to 0
    if (keys.length != N * 2) {
      int[] tmp = new int[N * 2];
      System.arraycopy(keys, 0, tmp, 0, N);
      keys = tmp;
    }
    ivaluesShift = N;
  }
  keys[ivaluesShift + index] = value;
}

相关文章