/** {@inheritDoc} */ @Override public boolean equals( Object other ) { if ( ! ( other instanceof TIntDoubleMap ) ) { return false; } TIntDoubleMap that = ( TIntDoubleMap ) other; if ( that.size() != this.size() ) { return false; } double[] values = _values; byte[] states = _states; double this_no_entry_value = getNoEntryValue(); double that_no_entry_value = that.getNoEntryValue(); for ( int i = values.length; i-- > 0; ) { if ( states[i] == FULL ) { int key = _set[i]; double that_value = that.get( key ); double this_value = values[i]; if ( ( this_value != that_value ) && ( this_value != this_no_entry_value ) && ( that_value != that_no_entry_value ) ) { return false; } } } return true; }
/** * Inserts a key/value pair into the map. * * @param key an <code>Object</code> value * @param value an <code>Object</code> value * @return the previous value associated with <tt>key</tt>, * or Double(0) if none was found. */ public Double put( Integer key, Double value ) { int k; double v; if ( key == null ) { k = _map.getNoEntryKey(); } else { k = unwrapKey( key ); } if ( value == null ) { v = _map.getNoEntryValue(); } else { v = unwrapValue( value ); } double retval = _map.put( k, v ); if ( retval == _map.getNoEntryValue() ) { return null; } return wrapValue( retval ); }
/** * Checks for the present of <tt>key</tt> in the keys of the map. * * @param key an <code>Object</code> value * @return a <code>boolean</code> value */ public boolean containsKey( Object key ) { if ( key == null ) return _map.containsKey( _map.getNoEntryKey() ); return key instanceof Integer && _map.containsKey( unwrapKey( key ) ); }
/** * Deletes a key/value pair from the map. * * @param key an <code>Object</code> value * @return the removed value, or null if it was not found in the map */ public Double remove( Object key ) { int k; if ( key != null ) { if ( key instanceof Integer ) { k = unwrapKey( key ); } else { return null; } } else { k = _map.getNoEntryKey(); } double v = _map.remove( k ); // There may be a false positive since primitive maps // cannot return null, so we have to do an extra // check here. if ( v == _map.getNoEntryValue() ) { return null; } else { return wrapValue( v ); } }
/** * Retrieves the value for <tt>key</tt> * * @param key an <code>Object</code> value * @return the value of <tt>key</tt> or null if no such mapping exists. */ public Double get( Object key ) { int k; if ( key != null ) { if ( key instanceof Integer ) { k = unwrapKey( key ); } else { return null; } } else { k = _map.getNoEntryKey(); } double v = _map.get( k ); // There may be a false positive since primitive maps // cannot return null, so we have to do an extra // check here. if ( v == _map.getNoEntryValue() ) { return null; } else { return wrapValue( v ); } }
private void handleSliderInput(int sliderIndex, int data) { double value = SliderboardTools.toSliderPercent(data); List<SliderboardListener> listeners = sliderListeners.get(sliderIndex); double previousValue = sliderValues.containsKey(sliderIndex) ? sliderValues.get(sliderIndex) : -1.0; if (listeners != null && previousValue != value) { listeners.forEach(listener -> listener.sliderMoved(value)); } sliderValues.put(sliderIndex, value); }
distances.put(e.getId(), distance(vertex, e, xscale)); double diff = distances.get(o1.getId()) - distances.get(o2.getId()); if (candidateEdges.isEmpty() || distances.get(candidateEdges.get(0).getId()) > radiusDeg) { stopDistances.put(t.getIndex(), distance(vertex, t, xscale)); double diff = stopDistances.get(o1.getIndex()) - stopDistances.get(o2.getIndex()); if (diff < 0) { return -1; if (candidateStops.isEmpty() || stopDistances.get(candidateStops.get(0).getIndex()) > radiusDeg) { LOG.debug("Stops aren't close either!"); return false; bestStops.add(candidateStops.get(i++)); } while (i < candidateStops.size() && stopDistances.get(candidateStops.get(i).getIndex()) - stopDistances .get(candidateStops.get(i - 1).getIndex()) < DUPLICATE_WAY_EPSILON_DEGREES); bestEdges.add(candidateEdges.get(i++)); } while (i < candidateEdges.size() && distances.get(candidateEdges.get(i).getId()) - distances .get(candidateEdges.get(i - 1).getId()) < DUPLICATE_WAY_EPSILON_DEGREES); double distanceDegreesLatitude = distances.get(candidateEdges.get(0).getId()); int distanceMeters = (int)SphericalDistanceLibrary.degreesLatitudeToMeters(distanceDegreesLatitude); if (distanceMeters > WARNING_DISTANCE_METERS) {
ranks.put(src.getLanguage(), lr); lr.pageSums.put(src.getId(), 1.0); final int n = lr.pageSums.size(); lr.pageSums.transformValues(new TDoubleFunction() { @Override public double execute(double v) { LocalId src = LocalId.fromInt(row.getRowIndex()); LangRanks lr = ranks.get(src.getLanguage()); double w = lr.pageSums.get(src.getId()) / ncols; for (int j = 0; j < ncols; j++) { LocalId dest = LocalId.fromInt(row.getColIndex(j)); if (dest.getLanguage() == src.getLanguage()) { lr.nextSums.adjustOrPutValue(dest.getId(), w, w); final int n = lr.nextSums.size(); lr.nextSums.forEachKey(new TIntProcedure() { @Override public boolean execute(int id) {
public double get( int key ) { synchronized( mutex ) { return m.get( key ); } }
double s = l1.getScore(i); if (!Double.isInfinite(s) && !Double.isNaN(s)) { scores.adjustOrPutValue(l1.getId(i), 0.5 * s, 0.5 * s); inList1.add(l1.getId(i)); double s = l2.getScore(i); if (!Double.isInfinite(s) && !Double.isNaN(s)) { scores.adjustOrPutValue(l2.getId(i), 0.5 * s, 0.5 * s); inList2.add(l2.getId(i)); scores.adjustValue(p1, 0.5 * missingScore2); scores.adjustValue(p2, 0.5 * missingScore1); for (int id : scores.keys()) { leaderboard.tallyScore(id, scores.get(id));
merged.adjustOrPutValue(entry.getKey().getId(), v, v); total += v; merged.adjustOrPutValue(entry.getKey().getId(), v, v); total += v; merged.adjustOrPutValue(entry.getKey().getId(), v, v); total += v; if (candidateVector != null) { for (int id : candidateVector.keys()) { double w = Math.sqrt(merged.get(ids[i]) / total); double v = candidateVector.get(id); vector.adjustOrPutValue(id, (float)(w * v), (float)(w * v));
/** * {@inheritDoc} */ public int disconnect(int vertex) { if (edges.containsKey(vertex)) { edges.remove(vertex); return 1; } return 0; }
/** * {@inheritDoc} */ public Set<WeightedEdge> getEdges(int vertex) { return (edges.containsKey(vertex)) ? Collections.<WeightedEdge>singleton( new SimpleWeightedEdge(rootVertex, vertex, edges.get(vertex))) : Collections.<WeightedEdge>emptySet(); }
public int[] keys() { synchronized( mutex ) { return m.keys(); } } public int[] keys( int[] array ) {
/** * Returns the number of entries in the map. * * @return the map's size. */ public int size() { return this._map.size(); }
public boolean containsKey( int key ) { synchronized( mutex ) { return m.containsKey( key ); } } public boolean containsValue( double value ){
/** * Empties the map. */ public void clear() { this._map.clear(); }
public double put( int key, double value ) { synchronized( mutex ) { return m.put( key, value ); } } public double remove( int key ) {