本文整理汇总了Java中com.carrotsearch.hppc.ObjectIntMap.put方法的典型用法代码示例。如果您正苦于以下问题:Java ObjectIntMap.put方法的具体用法?Java ObjectIntMap.put怎么用?Java ObjectIntMap.put使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类com.carrotsearch.hppc.ObjectIntMap
的用法示例。
在下文中一共展示了ObjectIntMap.put方法的6个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: initVarMap
import com.carrotsearch.hppc.ObjectIntMap; //导入方法依赖的package包/类
/**
* creates a mapping between concept pairs and indices used in the ILP
*
* @param predictions
*/
private ObjectIntMap<CPair> initVarMap(ObjectDoubleMap<CPair> predictions) {
ObjectIntMap<CPair> varMap = new ObjectIntHashMap<CPair>();
int x = 0;
for (ObjectCursor<CPair> p : predictions.keys()) {
varMap.put(p.value, x);
x++;
}
return varMap;
}
示例2: check
import com.carrotsearch.hppc.ObjectIntMap; //导入方法依赖的package包/类
@SuppressWarnings("PMD.DataflowAnomalyAnalysis")
public void check() {
int color = DEFAULT_COLOR;
ObjectIntMap<AbstractStage> colors = new ObjectIntHashMap<AbstractStage>();
ThreadPainter threadPainter = new ThreadPainter();
Traverser traverser = new Traverser(threadPainter);
for (AbstractStage threadableStage : threadableStages) {
color++;
colors.put(threadableStage, color);
threadPainter.reset(colors, color, threadableStages);
traverser.traverse(threadableStage);
}
}
示例3: generateFeatureMap
import com.carrotsearch.hppc.ObjectIntMap; //导入方法依赖的package包/类
private ObjectIntMap<String> generateFeatureMap(SourceOfRandomness sourceOfRandomness) {
ObjectIntMap<String> featureMap = new ObjectIntHashMap<>();
int numFeatures = sourceOfRandomness.nextInt(1,15);
for (int i = 0; i < numFeatures; i++) {
int featureValue = sourceOfRandomness.nextInt(20);
while (featureMap.containsKey(""+featureValue)) {
featureValue = sourceOfRandomness.nextInt(20);
}
featureMap.put(""+featureValue, sourceOfRandomness.nextInt(2));
}
return featureMap;
}
示例4: sortInstructions
import com.carrotsearch.hppc.ObjectIntMap; //导入方法依赖的package包/类
private List<Instruction> sortInstructions(Collection<Instruction> instructions, BasicBlock block) {
ObjectIntMap<Instruction> indexes = new ObjectIntOpenHashMap<>();
int index = 0;
for (Instruction instruction : block) {
indexes.put(instruction, index++);
}
List<Instruction> sortedInstructions = new ArrayList<>(instructions);
sortedInstructions.sort(Comparator.comparing(insn -> indexes.getOrDefault(insn, -1)));
return sortedInstructions;
}
示例5: getInstructionIndexes
import com.carrotsearch.hppc.ObjectIntMap; //导入方法依赖的package包/类
private ObjectIntMap<Instruction> getInstructionIndexes(BasicBlock block) {
ObjectIntMap<Instruction> indexes = new ObjectIntOpenHashMap<>();
for (Instruction instruction : block) {
indexes.put(instruction, indexes.size());
}
return indexes;
}
示例6: TransducerAlphabet
import com.carrotsearch.hppc.ObjectIntMap; //导入方法依赖的package包/类
public TransducerAlphabet(DataInputStream charstream, int number_of_symbols) throws java.io.IOException {
keyTable = new ArrayList<String>();
operations = new IntObjectHashMap<FlagDiacriticOperation>();
ObjectIntMap<String> feature_bucket = new ObjectIntHashMap<String>();
ObjectIntMap<String> value_bucket = new ObjectIntHashMap<String>();
features = 0;
int values = 1;
value_bucket.put("", 0); // neutral value
int i = 0;
int charindex;
ByteArrayList chars = new ByteArrayList();
while (i < number_of_symbols) {
charindex = 0;
if (chars.size()==charindex)
chars.add(charstream.readByte());
else chars.set(charindex,charstream.readByte());
while (chars.get(charindex) != 0) {
++charindex;
if (chars.size()==charindex)
chars.add(charstream.readByte());
else chars.set(charindex,charstream.readByte());
}
String ustring = new String(chars.toArray(), 0, charindex, "UTF-8");
if (ustring.length() > 5 && ustring.charAt(0) == '@' && ustring.charAt(ustring.length() - 1) == '@' && ustring.charAt(2) == '.') { // flag diacritic identified
HfstOptimizedLookup.FlagDiacriticOperator op;
String[] parts = ustring.substring(1, ustring.length() - 1).split("\\.");
/* Not a flag diacritic after all, ignore it */
if (parts.length < 2) {
keyTable.add("");
i++;
continue;
}
String ops = parts[0];
String feats = parts[1];
String vals;
if (parts.length == 3)
vals = parts[2];
else vals = "";
if (ops.equals("P"))
op = HfstOptimizedLookup.FlagDiacriticOperator.P;
else if (ops.equals("N"))
op = HfstOptimizedLookup.FlagDiacriticOperator.N;
else if (ops.equals("R"))
op = HfstOptimizedLookup.FlagDiacriticOperator.R;
else if (ops.equals("D"))
op = HfstOptimizedLookup.FlagDiacriticOperator.D;
else if (ops.equals("C"))
op = HfstOptimizedLookup.FlagDiacriticOperator.C;
else if (ops.equals("U"))
op = HfstOptimizedLookup.FlagDiacriticOperator.U;
else { // Not a valid operator, ignore the operation
keyTable.add("");
i++;
continue;
}
if (value_bucket.containsKey(vals) == false) {
value_bucket.put(vals, values);
values++;
}
if (feature_bucket.containsKey(feats) == false) {
feature_bucket.put(feats, features);
features++;
}
operations.put(i, new FlagDiacriticOperation(op, feature_bucket.get(feats), value_bucket.get(vals)));
keyTable.add("");
i++;
continue;
}
keyTable.add(ustring);
i++;
}
keyTable.set(0, ""); // epsilon is zero
}