/** * Get a {@link Set} containing all of the destination vertices in this * AdjacencyMap. * * @return an immutable set containing the destination vertices */ public Set<Object> getAllDestinations() { return Collections.unmodifiableSet(edgeGraph.columnKeySet()); }
/** * Determines whether this AdjacencyMap contains the specified destination * vertex. * * @param destination the source vertex to query for * * @return {@code true} if the adjacency map contains the destination, * otherwise {@code false} */ public boolean containsDestination(final Object destination) { return edgeGraph.columnKeySet().contains(destination); }
extraSurplus.columnKeySet().removeAll(emptyServers);
surplusExtra.columnKeySet().removeAll(serversToRemove);
/** * Determines whether this AdjacencyMap contains the specified destination * vertex. * * @param destination the source vertex to query for * * @return {@code true} if the adjacency map contains the destination, * otherwise {@code false} */ public boolean containsDestination(final Object destination) { return edgeGraph.columnKeySet().contains(destination); }
/** * Get a {@link Set} containing all of the destination vertices in this * AdjacencyMap. * * @return an immutable set containing the destination vertices */ public Set<Object> getAllDestinations() { return Collections.unmodifiableSet(edgeGraph.columnKeySet()); }
@Override public Iterable<V> vertices() { return Sets.union(Sets.union(graphTable.rowKeySet(), graphTable.columnKeySet()), disconnected); }
for (String table : counts.columnKeySet()) { long count = 0; for (Map.Entry<Integer, Long> entry : counts.column(table).entrySet()) { for (String table : counts.columnKeySet()) { for (int partition : counts.column(table).keySet()) { long count = counts.get(partition, table); for (String table : tops.columnKeySet()) { for (int partition : tops.column(table).keySet()) { long total = totalsPerTable.get(table);