public Collection<TransitStop> getTouchedStopsIncludingTransfers () { return matrix[current].keySet(); } }
public Set<K> keySet() { if ( keySet == null ) keySet = Collections.unmodifiableSet( m.keySet() ); return keySet; } public Object[] keys() { return m.keys(); }
public Set<K> keySet() { synchronized( mutex ) { if ( keySet == null ) { keySet = new SynchronizedSet<K>( m.keySet(), mutex ); } return keySet; } } public Object[] keys() {
patternCount.keySet().stream().forEach(p -> stops.retainAll(p.getStops()));
TimeSurface.RangeSet timeSurfaces_a = router_a.timeSurfaceRangeSet; TimeSurface.RangeSet timeSurfaces_b = router_b.timeSurfaceRangeSet; for (Vertex destVertex : timeSurfaces_a.min.times.keySet()) { int min_a = timeSurfaces_a.min.getTime(destVertex); int max_a = timeSurfaces_a.max.getTime(destVertex);
for (AddTripPattern.TemporaryStop t : addedStops.keySet()) {
public Set<K> keySet() { if ( keySet == null ) keySet = Collections.unmodifiableSet( m.keySet() ); return keySet; } public Object[] keys() { return m.keys(); }
/** * Returns a view of the items currently being counted. The returned view * is read-only; any attempts to modify this view will throw an {@link * UnsupportedOperationException}. */ public Set<T> items() { return Collections.unmodifiableSet(counts.keySet()); }
/** * Returns the set of edge types currently present in this graph. */ public Set<T> edgeTypes() { return Collections.unmodifiableSet(typeCounts.keySet()); }
@Override public Set<K> keySet() { if ( keySet == null ) keySet = Collections.unmodifiableSet( m.keySet() ); return keySet; } @Override
public Set<K> keySet() { if ( keySet == null ) keySet = Collections.unmodifiableSet( m.keySet() ); return keySet; } public Object[] keys() { return m.keys(); }
/** * Returns a view of the items currently being counted. The returned view * is read-only; any attempts to modify this view will throw an {@link * UnsupportedOperationException}. */ public Set<T> items() { return Collections.unmodifiableSet(counts.keySet()); }
public Set<K> keySet() { synchronized( mutex ) { if ( keySet == null ) { keySet = new SynchronizedSet<K>( m.keySet(), mutex ); } return keySet; } } public Object[] keys() {
@Override public Set<K> keySet() { synchronized( mutex ) { if ( keySet == null ) { keySet = new SynchronizedSet<K>( m.keySet(), mutex ); } return keySet; } } @Override
/** * {@inheritDoc} */ public DirectedMultigraph<T> subgraph(Set<Integer> subset) { Subgraph sub = new Subgraph(typeCounts.keySet(), subset); subgraphs.add(new WeakReference<Subgraph>(sub)); return sub; }
public Set<K> keySet() { synchronized( mutex ) { if ( keySet == null ) { keySet = new SynchronizedSet<K>( m.keySet(), mutex ); } return keySet; } } public Object[] keys() {
/** * {@inheritDoc} */ public WeightedDirectedMultigraph<T> subgraph(Set<Integer> subset) { Subgraph sub = new Subgraph(typeCounts.keySet(), subset); subgraphs.add(new WeakReference<Subgraph>(sub)); return sub; }
/** * {@inheritDoc} */ public int hashCode() { return vertexToEdges.keySet().hashCode() ^ (typeCounts.keySet().hashCode() * size); }
public NBTTagCompound writeToNBT(NBTTagCompound nbt) { NBTTagList list = new NBTTagList(); for (Letter letter: letters.keySet()) { NBTTagCompound tag = new NBTTagCompound(); tag.setString("Letter", letter.getResource().toString()); tag.setInteger("Days", letters.get(letter)); list.appendTag(tag); } nbt.setTag("LetterData", list); return nbt; } }