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

UintMap.getKeys介绍

[英]Return array of present keys
[中]返回当前密钥的数组

代码示例

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

static int[] getLineNumbers(InterpreterData data)
{
  UintMap presentLines = new UintMap();
  byte[] iCode = data.itsICode;
  int iCodeLength = iCode.length;
  for (int pc = 0; pc != iCodeLength;) {
    int bytecode = iCode[pc];
    int span = bytecodeSpan(bytecode);
    if (bytecode == Icode_LINE) {
      if (span != 3) Kit.codeBug();
      int line = getIndex(iCode, pc + 1);
      presentLines.put(line, 0);
    }
    pc += span;
  }
  return presentLines.getKeys();
}

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

static int[] getLineNumbers(InterpreterData data)
{
  UintMap presentLines = new UintMap();
  byte[] iCode = data.itsICode;
  int iCodeLength = iCode.length;
  for (int pc = 0; pc != iCodeLength;) {
    int bytecode = iCode[pc];
    int span = bytecodeSpan(bytecode);
    if (bytecode == Icode_LINE) {
      if (span != 3) Kit.codeBug();
      int line = getIndex(iCode, pc + 1);
      presentLines.put(line, 0);
    }
    pc += span;
  }
  return presentLines.getKeys();
}

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

static int[] getLineNumbers(InterpreterData data)
{
  UintMap presentLines = new UintMap();
  byte[] iCode = data.itsICode;
  int iCodeLength = iCode.length;
  for (int pc = 0; pc != iCodeLength;) {
    int bytecode = iCode[pc];
    int span = bytecodeSpan(bytecode);
    if (bytecode == Icode_LINE) {
      if (span != 3) Kit.codeBug();
      int line = getIndex(iCode, pc + 1);
      presentLines.put(line, 0);
    }
    pc += span;
  }
  return presentLines.getKeys();
}

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

static int[] getLineNumbers(InterpreterData data)
{
  UintMap presentLines = new UintMap();
  byte[] iCode = data.itsICode;
  int iCodeLength = iCode.length;
  for (int pc = 0; pc != iCodeLength;) {
    int bytecode = iCode[pc];
    int span = bytecodeSpan(bytecode);
    if (bytecode == Icode_LINE) {
      if (span != 3) Kit.codeBug();
      int line = getIndex(iCode, pc + 1);
      presentLines.put(line, 0);
    }
    pc += span;
  }
  return presentLines.getKeys();
}

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

static int[] getLineNumbers(InterpreterData data)
{
  UintMap presentLines = new UintMap();
  byte[] iCode = data.itsICode;
  int iCodeLength = iCode.length;
  for (int pc = 0; pc != iCodeLength;) {
    int bytecode = iCode[pc];
    int span = bytecodeSpan(bytecode);
    if (bytecode == Icode_LINE) {
      if (span != 3) Kit.codeBug();
      int line = getIndex(iCode, pc + 1);
      presentLines.put(line, 0);
    }
    pc += span;
  }
  return presentLines.getKeys();
}

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

static int[] getLineNumbers(InterpreterData data)
{
  UintMap presentLines = new UintMap();
  byte[] iCode = data.itsICode;
  int iCodeLength = iCode.length;
  for (int pc = 0; pc != iCodeLength;) {
    int bytecode = iCode[pc];
    int span = bytecodeSpan(bytecode);
    if (bytecode == Icode_LINE) {
      if (span != 3) Kit.codeBug();
      int line = getIndex(iCode, pc + 1);
      presentLines.put(line, 0);
    }
    pc += span;
  }
  return presentLines.getKeys();
}

代码示例来源：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: 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;
}

代码示例来源：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: 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;
}