/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
class TIntObjectHashIterator<V> extends THashPrimitiveIterator implements TIntObjectIterator<V> { /** the collection being iterated over */ private final TIntObjectHashMap<V> _map; /** * Creates an iterator over the specified map * * @param map map to iterate over. */ public TIntObjectHashIterator( TIntObjectHashMap<V> map ) { super( map ); this._map = map; } /** {@inheritDoc} */ public void advance() { moveToNextIndex(); } /** {@inheritDoc} */ public int key() { return _map._set[_index]; } /** {@inheritDoc} */ public V value() { return _map._values[_index]; }
int nxt = it.next(); if (p != nxt) { if (loadedRoutes.contains(nxt)) { routes.put(nxt, loadedRoutes.get(nxt)); } else {
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
/** {@inheritDoc} */ @Override public boolean containsKey( int key ) { return contains( key ); }
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
/** See {@link gnu.trove.map.hash.TIntObjectHashMap#contains(int)} */ public boolean contains(int val) { return delegate.contains(val); }
/** See {@link gnu.trove.map.hash.TIntObjectHashMap#contains(int)} */ public boolean contains(int val) { return delegate.contains(val); }
class TIntObjectHashIterator<V> extends THashPrimitiveIterator implements TIntObjectIterator<V> { /** the collection being iterated over */ private final TIntObjectHashMap<V> _map; /** * Creates an iterator over the specified map * * @param map map to iterate over. */ public TIntObjectHashIterator( TIntObjectHashMap<V> map ) { super( map ); this._map = map; } /** {@inheritDoc} */ public void advance() { moveToNextIndex(); } /** {@inheritDoc} */ public int key() { return _map._set[_index]; } /** {@inheritDoc} */ public V value() { return _map._values[_index]; }
class TIntObjectHashIterator<V> extends THashPrimitiveIterator implements TIntObjectIterator<V> { /** the collection being iterated over */ private final TIntObjectHashMap<V> _map; /** * Creates an iterator over the specified map * * @param map map to iterate over. */ public TIntObjectHashIterator( TIntObjectHashMap<V> map ) { super( map ); this._map = map; } /** {@inheritDoc} */ public void advance() { moveToNextIndex(); } /** {@inheritDoc} */ public int key() { return _map._set[_index]; } /** {@inheritDoc} */ public V value() { return _map._values[_index]; }
@Override public void setModelFeatures(List<T> modelkeys) { modelKeypoints = new TIntObjectHashMap<List<T>>(); for (T k : modelkeys) { if (!modelKeypoints.contains(k.id)) modelKeypoints.put(k.id, new ArrayList<T>()); modelKeypoints.get(k.id).add(k); } } }
@Override public void setModelFeatures(List<T> modelkeys) { modelKeypoints = new TIntObjectHashMap<List<T>>(); for (T k : modelkeys) { if (!modelKeypoints.contains(k.id)) modelKeypoints.put(k.id, new ArrayList<T>()); modelKeypoints.get(k.id).add(k); } } }
class TIntObjectHashIterator<V> extends THashPrimitiveIterator implements TIntObjectIterator<V> { /** the collection being iterated over */ private final TIntObjectHashMap<V> _map; /** * Creates an iterator over the specified map * * @param map map to iterate over. */ public TIntObjectHashIterator( TIntObjectHashMap<V> map ) { super( map ); this._map = map; } /** {@inheritDoc} */ public void advance() { moveToNextIndex(); } /** {@inheritDoc} */ public int key() { return _map._set[_index]; } /** {@inheritDoc} */ public V value() { return _map._values[_index]; }
@Override public boolean findMatches(List<T> keys1) { matches = new ArrayList<Pair<T>>(); for (T k : keys1) { if (modelKeypoints.contains(k.id)) { if (allowMultiple || modelKeypoints.get(k.id).size() == 1) { for (T match : modelKeypoints.get(k.id)) { matches.add(new Pair<T>(k, match)); } } } } return true; }
@Override public boolean findMatches(List<T> keys1) { matches = new ArrayList<Pair<T>>(); for (T k : keys1) { if (modelKeypoints.contains(k.id)) { if (allowMultiple || modelKeypoints.get(k.id).size() == 1) { for (T match : modelKeypoints.get(k.id)) { matches.add(new Pair<T>(k, match)); } } } } return true; }
Iterator<E> i = iterator(); while ( i.hasNext() ) { if ( !collection.contains( i.next() ) ) { i.remove(); changed = true;
if (!nodesRelativeIdx.contains(i)){ throw new RuntimeException("Property " + fpVersion.getAbsoluteIndexOf(i) + " is not contained in tree");
if (!nodesRelativeIdx.contains(i)){