public boolean containsKey( long key ) { synchronized( mutex ) { return m.containsKey( key ); } } public boolean containsValue( int value ){
public boolean containsKey( long key ) { return m.containsKey( key ); } public boolean containsValue( int val ) { return m.containsValue( val ); }
/** * 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 Long && _map.containsKey( unwrapKey( key ) ); }
@Override public boolean containsKey( long key ) { synchronized( mutex ) { return m.containsKey( key ); } } @Override
public boolean containsKey( long key ) { synchronized( mutex ) { return m.containsKey( key ); } } public boolean containsValue( int value ){
@Override public boolean contains(Long key) { return indexMap.containsKey(key); }
public boolean containsKey( long key ) { synchronized( mutex ) { return m.containsKey( key ); } } public boolean containsValue( int value ){
@Override public boolean containsKey( long key ) { return m.containsKey( key ); } @Override
public boolean containsKey( long key ) { synchronized( mutex ) { return m.containsKey( key ); } } public boolean containsValue( int value ){
public boolean containsKey( long key ) { return m.containsKey( key ); } public boolean containsValue( int val ) { return m.containsValue( val ); }
public boolean containsKey( long key ) { return m.containsKey( key ); } public boolean containsValue( int val ) { return m.containsValue( val ); }
public boolean containsKey( long key ) { return m.containsKey( key ); } public boolean containsValue( int val ) { return m.containsValue( val ); }
/** * 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 Long && _map.containsKey( unwrapKey( key ) ); }
/** * 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 Long && _map.containsKey( unwrapKey( key ) ); }
/** * 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 */ @Override public boolean containsKey( Object key ) { if ( key == null ) return _map.containsKey( _map.getNoEntryKey() ); return key instanceof Long && _map.containsKey( unwrapKey( key ) ); }
@Override public final boolean contains(T key) { final long code = coding.getCode(key); return indexMap.containsKey(code); }
/** * 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 Long && _map.containsKey( unwrapKey( key ) ); }
@Override public float [] getVector(String phrase) { try { long hash = hashWord(phrase); if (phraseIds.containsKey(hash)) { int phraseId = phraseIds.get(hash); DenseMatrixRow row = phraseMatrix.getRow(phraseId); return row == null ? null : row.getValues(); } else { return null; } } catch (IOException e) { throw new RuntimeException(e); } }
@Override public void handleHighway(LineString geometry, Way way) { if(w2n.containsKey(way.id)) { Envelope env = geometry.getEnvelopeInternal(); short n = new Double((env.getMinX() + 180.0) * 10.0).shortValue(); int fromto = n << 16; n = new Double((env.getMaxX() + 180.0) * 10.0).shortValue(); fromto |= n; w2n.put(way.id, fromto); } highwaysHandler.handleHighway(geometry, way); }
@Override public final int replace(Long existing, Long replacement) { final int index = indexMap.remove(existing); if (index == -1) { throw new IndexException("No match for key: " + existing); } else { if (indexMap.containsKey(replacement)) { throw new IndexException("The replacement key already exists: " + replacement); } else { final int ordinal = getOrdinalForIndex(index); this.indexMap.put(replacement, index); this.keyArray().setValue(ordinal, replacement); return index; } } }