public boolean add(int value) { return super.put(value, defaultValue)==0; }
public boolean add(int value) { return super.put(value, defaultValue)==0; }
/** * Creates a hash map from two index-aligned arrays of key-value pairs. */ public static IntIntHashMap from(int[] keys, int[] values) { if (keys.length != values.length) { throw new IllegalArgumentException("Arrays of keys and values must have an identical length."); } IntIntHashMap map = new IntIntHashMap(keys.length); for (int i = 0; i < keys.length; i++) { map.put(keys[i], values[i]); } return map; }
/** * {@inheritDoc} */ @Override public int putAll(IntIntAssociativeContainer container) { final int count = size(); for (IntIntCursor c : container) { put(c.key, c.value); } return size() - count; }
/** * Puts all key/value pairs from a given iterable into this map. */ @Override public int putAll(Iterable<? extends IntIntCursor> iterable){ final int count = size(); for (IntIntCursor c : iterable) { put(c.key, c.value); } return size() - count; }
Variable arg = argumentMapping[i]; if (arg != null) { entryVarMap.put(i, arg.getIndex());
public boolean add(int value) { return super.put(value, defaultValue)==0; }
public void put(int key, int value) { g_map.put(key, value); }
/** * Creates a hash map from two index-aligned arrays of key-value pairs. */ public static IntIntHashMap from(int[] keys, int[] values) { if (keys.length != values.length) { throw new IllegalArgumentException("Arrays of keys and values must have an identical length."); } IntIntHashMap map = new IntIntHashMap(keys.length); for (int i = 0; i < keys.length; i++) { map.put(keys[i], values[i]); } return map; }
public ProjectPushInfo(List<SchemaPath> columns, ImmutableList<DesiredField> desiredFields, ImmutableList<RexNode> inputRefs) { super(); this.columns = columns; this.desiredFields = desiredFields; this.inputsRefs = inputRefs; this.fieldNames = Lists.newArrayListWithCapacity(desiredFields.size()); this.types = Lists.newArrayListWithCapacity(desiredFields.size()); IntIntHashMap oldToNewIds = new IntIntHashMap(); int i =0; for (DesiredField f : desiredFields) { fieldNames.add(f.name); types.add(f.field.getType()); oldToNewIds.put(f.origIndex, i); i++; } this.rewriter = new InputRewriter(oldToNewIds); }
@Override public int test() { final IntIntHashMap m_map = new IntIntHashMap( m_keys.length / 2 + 1, m_fillFactor ); int add = 0, remove = 0; while ( add < m_keys.length ) { m_map.put( m_keys[ add ], m_keys[ add ] ); ++add; m_map.put( m_keys[ add ], m_keys[ add ] ); ++add; m_map.remove( m_keys[ remove++ ] ); } return m_map.size(); } }
@Override public void setup(final int[] keys, final float fillFactor, int oneFailOutOf ) { super.setup( keys, fillFactor, oneFailOutOf ); m_map = new IntIntHashMap( keys.length, fillFactor ); for (int key : keys) m_map.put( key + (key % oneFailOutOf == 0 ? 1 : 0), key ); }
/** * Puts all key/value pairs from a given iterable into this map. */ @Override public int putAll(Iterable<? extends IntIntCursor> iterable){ final int count = size(); for (IntIntCursor c : iterable) { put(c.key, c.value); } return size() - count; }
/** * {@inheritDoc} */ @Override public int putAll(IntIntAssociativeContainer container) { final int count = size(); for (IntIntCursor c : container) { put(c.key, c.value); } return size() - count; }
public boolean accept(int state) { int thisNodeNumber = 0; for (int arc = fsa.getFirstArc(state); arc != 0; arc = fsa.getNextArc(arc)) { thisNodeNumber += (fsa.isArcFinal(arc) ? 1 : 0) + (fsa.isArcTerminal(arc) ? 0 : numbers.get(fsa.getEndNode(arc))); } numbers.put(state, thisNodeNumber); return true; } });
public boolean accept(int state) { int thisNodeNumber = 0; for (int arc = fsa.getFirstArc(state); arc != 0; arc = fsa.getNextArc(arc)) { thisNodeNumber += (fsa.isArcFinal(arc) ? 1 : 0) + (fsa.isArcTerminal(arc) ? 0 : numbers.get(fsa.getEndNode(arc))); } numbers.put(state, thisNodeNumber); return true; } });
/** Called by {@link #normalizeIndices()}. */ private void remapGapIndices(IntIntHashMap map, int[] lastIndex, CTNode curr) { int gapIndex = curr.getGappingRelationIndex(); if (map.containsKey(gapIndex)) { curr.setGappingRelationIndex(map.get(gapIndex)); } else if (gapIndex != -1) { curr.setGappingRelationIndex(lastIndex[0]); map.put(gapIndex, lastIndex[0]++); } for (CTNode child : curr.getChildrenList()) remapGapIndices(map, lastIndex, child); }
public int visitNode(int node) { int index = visitedNodes.indexOf(node); if (index >= 0) { return visitedNodes.indexGet(index); } int fromHere = 0; for (int arc = fsa.getFirstArc(node); arc != 0; arc = fsa.getNextArc(arc)) { if (fsa.isArcFinal(arc)) fromHere++; if (!fsa.isArcTerminal(arc)) { fromHere += visitNode(fsa.getEndNode(arc)); } } visitedNodes.put(node, fromHere); return fromHere; } }
public int visitNode(int node) { int index = visitedNodes.indexOf(node); if (index >= 0) { return visitedNodes.indexGet(index); } int fromHere = 0; for (int arc = fsa.getFirstArc(node); arc != 0; arc = fsa.getNextArc(arc)) { if (fsa.isArcFinal(arc)) fromHere++; if (!fsa.isArcTerminal(arc)) { fromHere += visitNode(fsa.getEndNode(arc)); } } visitedNodes.put(node, fromHere); return fromHere; } }