Uses of Interface
edu.ucla.sspace.util.primitive.IntSet

Packages that use IntSet

Package	Description
edu.ucla.sspace.graph
edu.ucla.sspace.util.primitive

Uses of IntSet in edu.ucla.sspace.graph

Methods in edu.ucla.sspace.graph that return IntSet

Modifier and Type	Method and Description
IntSet	SparseDirectedTypedEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	SparseTypedEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	SparseUndirectedEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	EdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	SparseWeightedDirectedTypedEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	SparseDirectedEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	SparseWeightedEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	GenericEdgeSet.connected() Returns the set of vertices connected to the root edges.
IntSet	DirectedMultigraph.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	WeightedDirectedMultigraph.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	UndirectedMultigraph.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	AbstractGraph.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	AbstractGraph.Subgraph.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	Graph.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	GraphAdaptor.getNeighbors(int vertex) Returns the set of vertices that are connected to the specified vertex, or an empty set if the vertex is not in this graph.
IntSet	SparseDirectedTypedEdgeSet.predecessors()
IntSet	SparseWeightedDirectedTypedEdgeSet.predecessors()
IntSet	SparseDirectedGraph.predecessors(int vertex) Returns the set of vertices that point to this vertex.
IntSet	DirectedMultigraph.predecessors(int vertex) Returns the set of vertices that point to this vertex.
IntSet	WeightedDirectedMultigraph.predecessors(int vertex) Returns the set of vertices that point to this vertex.
IntSet	DirectedGraph.predecessors(int vertex) Returns the set of vertices that point to this vertex.
IntSet	SparseDirectedTypedEdgeSet.successors()
IntSet	SparseWeightedDirectedTypedEdgeSet.successors()
IntSet	SparseDirectedGraph.successors(int vertex) Returns the set of vertices that can be reached by following the outgoing edges from this vertex.
IntSet	DirectedMultigraph.successors(int vertex) Returns the set of vertices that can be reached by following the outgoing edges from this vertex.
IntSet	WeightedDirectedMultigraph.successors(int vertex) Returns the set of vertices that can be reached by following the outgoing edges from this vertex.
IntSet	DirectedGraph.successors(int vertex) Returns the set of vertices that can be reached by following the outgoing edges from this vertex.
IntSet	DirectedMultigraph.vertices() Returns the set of vertices in this graph.
IntSet	WeightedDirectedMultigraph.vertices() Returns the set of vertices in this graph.
IntSet	UndirectedMultigraph.vertices() Returns the set of vertices in this graph.
IntSet	AbstractGraph.vertices() Returns the set of vertices in this graph.
IntSet	AbstractGraph.Subgraph.vertices() Returns the set of vertices in this graph.
IntSet	Graph.vertices() Returns the set of vertices in this graph.
IntSet	GraphAdaptor.vertices() Returns the set of vertices in this graph.

Methods in edu.ucla.sspace.graph with parameters of type IntSet

Modifier and Type	Method and Description
SparseDirectedTypedEdgeSet<T>	SparseDirectedTypedEdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
SparseTypedEdgeSet<T>	SparseTypedEdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
SparseUndirectedEdgeSet	SparseUndirectedEdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
EdgeSet	EdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
SparseWeightedDirectedTypedEdgeSet<T>	SparseWeightedDirectedTypedEdgeSet.copy(IntSet vertices)
SparseDirectedEdgeSet	SparseDirectedEdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
SparseWeightedEdgeSet	SparseWeightedEdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
GenericEdgeSet<T>	GenericEdgeSet.copy(IntSet vertices) Copies the edges in this set that are connected to any of the vertices in the provided set.
Graph	DynamicGraph.subgraph(IntSet vertices) Returns a view of this graph containing only the specified vertices.
Graph	DynamicGraph.subgraph(IntSet vertices, Calendar atTime)
Graph	DynamicGraph.subgraph(IntSet vertices, Calendar startTime, Calendar endTime)
Graph	DynamicGraph.subgraph(IntSet vertices, Date atTime)
Graph	DynamicGraph.subgraph(IntSet vertices, Date startTime, Date endTime)
Graph	DynamicGraph.subgraph(IntSet vertices, long atTime)
Graph	DynamicGraph.subgraph(IntSet vertices, long startTime, long endTime)

Uses of IntSet in edu.ucla.sspace.util.primitive

Classes in edu.ucla.sspace.util.primitive that implement IntSet

Modifier and Type	Class and Description
class	AbstractIntSet An abstact base class that implements all of the IntSet
class	CompactIntSet A BitSet-backed Set implementation for storing non-negative int values.
class	TroveIntSet

Methods in edu.ucla.sspace.util.primitive that return IntSet

Modifier and Type	Method and Description
static IntSet	PrimitiveCollections.emptyIntSet() Returns an immutable, empty IntSet.
IntSet	IntIntMultiMap.get(int key) Returns the set of values mapped to this key or null of the key is not mapped to any values
IntSet	IntIntHashMultiMap.get(int key) Returns the set of values mapped to this key or null of the key is not mapped to any values
IntSet	IntIntHashMultiMap.get(Object key) Returns the set of values mapped to this key or null of the key is not mapped to any values
IntSet	IntIntMultiMap.keySet() Returns a Set view of the mappings contained in this multi-map.
IntSet	IntIntHashMultiMap.keySet() Returns a Set view of the mappings contained in this multi-map.
IntSet	IntIntMultiMap.remove(int key) Removes the mapping for a key from this multi-map if it is present
IntSet	IntIntHashMultiMap.remove(int key) Removes the mapping for a key from this multi-map if it is present
IntSet	IntIntHashMultiMap.remove(Integer key) Removes the mapping for a key from this multi-map if it is present, returning any mapped values to that key
static IntSet	PrimitiveCollections.unmodifiableSet(IntSet s) Returns an immuable view of the provided IntSet.
static IntSet	CompactIntSet.wrap(BitSet b) Wraps the provided BitSet as a Set returning the result.
static IntSet	TroveIntSet.wrap(gnu.trove.set.TIntSet set)

Methods in edu.ucla.sspace.util.primitive with parameters of type IntSet

Modifier and Type	Method and Description
static IntSet	PrimitiveCollections.unmodifiableSet(IntSet s) Returns an immuable view of the provided IntSet.

Constructors in edu.ucla.sspace.util.primitive with parameters of type IntSet

Constructor and Description
TroveIntSet(IntSet c) Creates a new TroveIntSet containing all the integers in the provided set.