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

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

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

UintMap.getInt介绍

[英]Get integer value assigned with key.
[中]获取用键指定的整数值。

代码示例

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

byte getConstantType(int index)
{
  return (byte) itsPoolTypes.getInt(index, 0);
}

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

byte getConstantType(int index)
{
  return (byte) itsPoolTypes.getInt(index, 0);
}

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

byte getConstantType(int index)
{
  return (byte) itsPoolTypes.getInt(index, 0);
}

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

byte getConstantType(int index)
{
  return (byte) itsPoolTypes.getInt(index, 0);
}

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

int addConstant(String k)
{
  int utf8Index = 0xFFFF & addUtf8(k);
  int theIndex = itsStringConstHash.getInt(utf8Index, -1);
  if (theIndex == -1) {
    theIndex = itsTopIndex++;
    ensure(3);
    itsPool[itsTop++] = CONSTANT_String;
    itsTop = ClassFileWriter.putInt16(utf8Index, itsPool, itsTop);
    itsStringConstHash.put(utf8Index, theIndex);
  }
  return theIndex;
}

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

int addConstant(String k)
{
  int utf8Index = 0xFFFF & addUtf8(k);
  int theIndex = itsStringConstHash.getInt(utf8Index, -1);
  if (theIndex == -1) {
    theIndex = itsTopIndex++;
    ensure(3);
    itsPool[itsTop++] = CONSTANT_String;
    itsTop = ClassFileWriter.putInt16(utf8Index, itsPool, itsTop);
    itsStringConstHash.put(utf8Index, theIndex);
  }
  return theIndex;
}

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

if (length == 0) { return ""; }
int indent = properties.getInt(INITIAL_INDENT_PROP, 0);
if (indent < 0) throw new IllegalArgumentException();
int indentGap = properties.getInt(INDENT_GAP_PROP, 4);
if (indentGap < 0) throw new IllegalArgumentException();
int caseGap = properties.getInt(CASE_GAP_PROP, 2);
if (caseGap < 0) throw new IllegalArgumentException();

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

if (length == 0) { return ""; }
int indent = properties.getInt(INITIAL_INDENT_PROP, 0);
if (indent < 0) throw new IllegalArgumentException();
int indentGap = properties.getInt(INDENT_GAP_PROP, 4);
if (indentGap < 0) throw new IllegalArgumentException();
int caseGap = properties.getInt(CASE_GAP_PROP, 2);
if (caseGap < 0) throw new IllegalArgumentException();

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

if (length == 0) { return ""; }
int indent = properties.getInt(INITIAL_INDENT_PROP, 0);
if (indent < 0) throw new IllegalArgumentException();
int indentGap = properties.getInt(INDENT_GAP_PROP, 4);
if (indentGap < 0) throw new IllegalArgumentException();
int caseGap = properties.getInt(CASE_GAP_PROP, 2);
if (caseGap < 0) throw new IllegalArgumentException();

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

int addConstant(String k)
{
  int utf8Index = 0xFFFF & addUtf8(k);
  int theIndex = itsStringConstHash.getInt(utf8Index, -1);
  if (theIndex == -1) {
    theIndex = itsTopIndex++;
    ensure(3);
    itsPool[itsTop++] = CONSTANT_String;
    itsTop = ClassFileWriter.putInt16(utf8Index, itsPool, itsTop);
    itsStringConstHash.put(utf8Index, theIndex);
  }
  itsPoolTypes.put(theIndex, CONSTANT_String);
  return theIndex;
}

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

if (length == 0) { return ""; }
int indent = properties.getInt(INITIAL_INDENT_PROP, 0);
if (indent < 0) throw new IllegalArgumentException();
int indentGap = properties.getInt(INDENT_GAP_PROP, 4);
if (indentGap < 0) throw new IllegalArgumentException();
int caseGap = properties.getInt(CASE_GAP_PROP, 2);
if (caseGap < 0) throw new IllegalArgumentException();

代码示例来源：origin: com.yahoo/yuicompressor

if (length == 0) { return ""; }
int indent = properties.getInt(INITIAL_INDENT_PROP, 0);
if (indent < 0) throw new IllegalArgumentException();
int indentGap = properties.getInt(INDENT_GAP_PROP, 4);
if (indentGap < 0) throw new IllegalArgumentException();
int caseGap = properties.getInt(CASE_GAP_PROP, 2);
if (caseGap < 0) throw new IllegalArgumentException();

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

if (length == 0) { return ""; }
int indent = properties.getInt(INITIAL_INDENT_PROP, 0);
if (indent < 0) throw new IllegalArgumentException();
int indentGap = properties.getInt(INDENT_GAP_PROP, 4);
if (indentGap < 0) throw new IllegalArgumentException();
int caseGap = properties.getInt(CASE_GAP_PROP, 2);
if (caseGap < 0) throw new IllegalArgumentException();

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

int addConstant(String k)
{
  int utf8Index = 0xFFFF & addUtf8(k);
  int theIndex = itsStringConstHash.getInt(utf8Index, -1);
  if (theIndex == -1) {
    theIndex = itsTopIndex++;
    ensure(3);
    itsPool[itsTop++] = CONSTANT_String;
    itsTop = ClassFileWriter.putInt16(utf8Index, itsPool, itsTop);
    itsStringConstHash.put(utf8Index, theIndex);
  }
  itsPoolTypes.put(theIndex, CONSTANT_String);
  return theIndex;
}

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

int addConstant(String k)
{
  int utf8Index = 0xFFFF & addUtf8(k);
  int theIndex = itsStringConstHash.getInt(utf8Index, -1);
  if (theIndex == -1) {
    theIndex = itsTopIndex++;
    ensure(3);
    itsPool[itsTop++] = CONSTANT_String;
    itsTop = ClassFileWriter.putInt16(utf8Index, itsPool, itsTop);
    itsStringConstHash.put(utf8Index, theIndex);
  }
  itsPoolTypes.put(theIndex, CONSTANT_String);
  return theIndex;
}

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

int addConstant(String k)
{
  int utf8Index = 0xFFFF & addUtf8(k);
  int theIndex = itsStringConstHash.getInt(utf8Index, -1);
  if (theIndex == -1) {
    theIndex = itsTopIndex++;
    ensure(3);
    itsPool[itsTop++] = CONSTANT_String;
    itsTop = ClassFileWriter.putInt16(utf8Index, itsPool, itsTop);
    itsStringConstHash.put(utf8Index, theIndex);
  }
  itsPoolTypes.put(theIndex, CONSTANT_String);
  return theIndex;
}

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

/**
 * Calculate partial dependencies for super blocks.
 *
 * This is used as a workaround for dead code that is generated. Only
 * one dependency per super block is given.
 */
private SuperBlock[] getSuperBlockDependencies() {
  SuperBlock[] deps = new SuperBlock[superBlocks.length];
  for (int i = 0; i < itsExceptionTableTop; i++) {
    ExceptionTableEntry ete = itsExceptionTable[i];
    short startPC = (short) getLabelPC(ete.itsStartLabel);
    short handlerPC = (short) getLabelPC(ete.itsHandlerLabel);
    SuperBlock handlerSB = getSuperBlockFromOffset(handlerPC);
    SuperBlock dep = getSuperBlockFromOffset(startPC);
    deps[handlerSB.getIndex()] = dep;
  }
  int[] targetPCs = itsJumpFroms.getKeys();
  for (int i = 0; i < targetPCs.length; i++) {
    int targetPC = targetPCs[i];
    int branchPC = itsJumpFroms.getInt(targetPC, -1);
    SuperBlock branchSB = getSuperBlockFromOffset(branchPC);
    SuperBlock targetSB = getSuperBlockFromOffset(targetPC);
    deps[targetSB.getIndex()] = branchSB;
  }
  return deps;
}

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

/**
 * Calculate partial dependencies for super blocks.
 *
 * This is used as a workaround for dead code that is generated. Only
 * one dependency per super block is given.
 */
private SuperBlock[] getSuperBlockDependencies() {
  SuperBlock[] deps = new SuperBlock[superBlocks.length];
  for (int i = 0; i < itsExceptionTableTop; i++) {
    ExceptionTableEntry ete = itsExceptionTable[i];
    short startPC = (short) getLabelPC(ete.itsStartLabel);
    short handlerPC = (short) getLabelPC(ete.itsHandlerLabel);
    SuperBlock handlerSB = getSuperBlockFromOffset(handlerPC);
    SuperBlock dep = getSuperBlockFromOffset(startPC);
    deps[handlerSB.getIndex()] = dep;
  }
  int[] targetPCs = itsJumpFroms.getKeys();
  for (int i = 0; i < targetPCs.length; i++) {
    int targetPC = targetPCs[i];
    int branchPC = itsJumpFroms.getInt(targetPC, -1);
    SuperBlock branchSB = getSuperBlockFromOffset(branchPC);
    SuperBlock targetSB = getSuperBlockFromOffset(targetPC);
    deps[targetSB.getIndex()] = branchSB;
  }
  return deps;
}

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

/**
 * Calculate partial dependencies for super blocks.
 *
 * This is used as a workaround for dead code that is generated. Only
 * one dependency per super block is given.
 */
private SuperBlock[] getSuperBlockDependencies() {
  SuperBlock[] deps = new SuperBlock[superBlocks.length];
  for (int i = 0; i < itsExceptionTableTop; i++) {
    ExceptionTableEntry ete = itsExceptionTable[i];
    short startPC = (short) getLabelPC(ete.itsStartLabel);
    short handlerPC = (short) getLabelPC(ete.itsHandlerLabel);
    SuperBlock handlerSB = getSuperBlockFromOffset(handlerPC);
    SuperBlock dep = getSuperBlockFromOffset(startPC);
    deps[handlerSB.getIndex()] = dep;
  }
  int[] targetPCs = itsJumpFroms.getKeys();
  for (int i = 0; i < targetPCs.length; i++) {
    int targetPC = targetPCs[i];
    int branchPC = itsJumpFroms.getInt(targetPC, -1);
    SuperBlock branchSB = getSuperBlockFromOffset(branchPC);
    SuperBlock targetSB = getSuperBlockFromOffset(targetPC);
    deps[targetSB.getIndex()] = branchSB;
  }
  return deps;
}

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

/**
 * Calculate partial dependencies for super blocks.
 *
 * This is used as a workaround for dead code that is generated. Only
 * one dependency per super block is given.
 */
private SuperBlock[] getSuperBlockDependencies() {
  SuperBlock[] deps = new SuperBlock[superBlocks.length];
  for (int i = 0; i < itsExceptionTableTop; i++) {
    ExceptionTableEntry ete = itsExceptionTable[i];
    short startPC = (short) getLabelPC(ete.itsStartLabel);
    short handlerPC = (short) getLabelPC(ete.itsHandlerLabel);
    SuperBlock handlerSB = getSuperBlockFromOffset(handlerPC);
    SuperBlock dep = getSuperBlockFromOffset(startPC);
    deps[handlerSB.getIndex()] = dep;
  }
  int[] targetPCs = itsJumpFroms.getKeys();
  for (int i = 0; i < targetPCs.length; i++) {
    int targetPC = targetPCs[i];
    int branchPC = itsJumpFroms.getInt(targetPC, -1);
    SuperBlock branchSB = getSuperBlockFromOffset(branchPC);
    SuperBlock targetSB = getSuperBlockFromOffset(targetPC);
    deps[targetSB.getIndex()] = branchSB;
  }
  return deps;
}

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

UintMap

相关文章

    查看更多
    微信公众号

    热门标签

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

    最新文章

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