/** * Empties the map. */ public void clear() { this._map.clear(); }
public TIntObjectIterator getIterator() { return idxListSelection_.iterator(); }
ClassData classData = result.getOrCreateClassData(fileData.myFilePath); int max = -1; TIntObjectHashMap<LineData> linesMap = new TIntObjectHashMap<>(); for (GoCoverageProjectData.RangeData rangeData : fileData.myRangesData.values()) { for (int i = rangeData.startLine; i <= rangeData.endLine; i++) { LineData existingData = linesMap.get(i); if (existingData != null) { existingData.setHits(existingData.getHits() + rangeData.hits); LineData newData = new LineData(i, null); newData.setHits(newData.getHits() + rangeData.hits); linesMap.put(i, newData); linesMap.forEachValue(data -> { data.fillArrays(); linesArray[data.getLineNumber()] = data;
public Object put (int key1, int key2, Object value) { TIntObjectHashMap inner; if (backing.containsKey (key1)) { inner = (TIntObjectHashMap) backing.get (key1); } else { inner = new TIntObjectHashMap (); backing.put (key1, inner); } return inner.put (key2, value); }
public void addConstraint(int fi, int li, double lower, double upper, double weight) { if (!constraints.containsKey(fi)) { constraints.put(fi,new MaxEntL2IndGEConstraint()); } constraints.get(fi).add(li, lower, upper, weight); }
public void getExpectations(double[] expectations) { assert(expectations.length == numDimensions()); for (int fi : constraintIndices.keys()) { int ci = constraintIndices.get(fi); OneLabelPRConstraint constraint = constraints.get(fi); for (int li = 0; li < constraint.expectation.length; li++) { expectations[ci + li * constraints.size()] = constraint.expectation[li]; } } }
public double getAuxiliaryValueContribution(double[] parameters) { double value = 0; for (int fi : constraints.keys()) { int ci = constraintIndices.get(fi); for (int li = 0; li < map.getNumLabels(); li++) { double param = parameters[ci + li * constraints.size()]; value += constraints.get(fi).target[li] * param - (param * param) / (2 * constraints.get(fi).weight); } } return value; }
/** Returns an iterator over the set of (key2, value) pairs that match (key1). */ public TIntObjectIterator curry (int key1) { final TIntObjectHashMap inner = (TIntObjectHashMap) backing.get (key1); if (inner == null) { return new TIntObjectIterator (new TIntObjectHashMap ()); } else { return new TIntObjectIterator (inner); } }
public InterpolationResultsHolder getCopy() { final TIntObjectHashMap retMap = new TIntObjectHashMap(result_); final TIntObjectIterator it = result_.iterator(); for (int i = result_.size(); i-- > 0;) { it.advance(); retMap.put(it.key(), CtuluLibArray.copy((double[]) it.value())); } final InterpolationResultsHolder ret = new InterpolationResultsHolder(variable_, nbPt_); ret.result_ = retMap; return ret; }
public JunctionTree(int size) { super(); numNodes = size; sepsets = new TIntObjectHashMap(); cpfs = new Factor[size]; } // JunctionTree constructor
private int[] cachedLargeIdxToSmall (DiscreteFactor smallPotential) { int hashval = computeSubsetHashValue (smallPotential); Object ints = projectionCache.get (hashval); if (ints != null) { return (int[]) ints; } else { int[] projection = computeLargeIdxToSmall (smallPotential); projectionCache.put (hashval, projection); return projection; } }
public boolean setSelection(final EbliListeSelectionMulti _m) { clear(); if (_m == null) { return true; } final TIntObjectIterator it = _m.idxListSelection_.iterator(); for (int i = _m.idxListSelection_.size(); i-- > 0;) { it.advance(); final CtuluListSelection newS = new CtuluListSelection((CtuluListSelection) it.value()); if (!newS.isEmpty()) { idxListSelection_.put(it.key(), newS); } } return true; }
/** * Add a non-index string to this object, e.g. Postcode="CB4 2QW" * Note: AttrId is used as Strings would be inefficient (esp as they're not * easily merged when dealing with serialised I/O) */ public void setNonIndexString(int attrId, String value){ if (nonIndexAttrs == null) { nonIndexAttrs = new TIntObjectHashMap<String>(4, 1.0f); // high load factor to get compact map } nonIndexAttrs.put(attrId, value); }
public boolean execute (Object object) { TIntObjectHashMap inner = (TIntObjectHashMap) object; N[0] += inner.size (); return true; } });