public final class NodeBitMap extends Object implements NodeIterable<Node>
Constructor and Description |
---|
NodeBitMap(Graph graph) |
Modifier and Type | Method and Description |
---|---|
boolean |
checkAndMarkInc(Node node) |
void |
clear(Node node) |
void |
clearAll() |
void |
clearAndGrow(Node node) |
boolean |
contains(Node node) |
NodeBitMap |
copy() |
int |
count() |
int |
getCounter() |
Graph |
graph() |
void |
grow() |
void |
intersect(NodeBitMap other) |
void |
invert() |
boolean |
isMarked(int id) |
boolean |
isMarked(Node node) |
boolean |
isMarkedAndGrow(Node node) |
boolean |
isNew(Node node) |
Iterator<Node> |
iterator() |
void |
mark(Node node) |
<T extends Node> |
markAll(Iterable<T> nodes) |
void |
markAndGrow(Node node) |
protected Node |
nextMarkedNode(int fromNodeId) |
void |
subtract(NodeBitMap other) |
String |
toString() |
void |
union(NodeBitMap other) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
filter, filter, first, isEmpty, isNotEmpty, snapshot, snapshotTo
forEach, spliterator
public NodeBitMap(Graph graph)
public int getCounter()
public Graph graph()
public boolean isNew(Node node)
public boolean isMarked(Node node)
public boolean checkAndMarkInc(Node node)
public boolean isMarked(int id)
public boolean isMarkedAndGrow(Node node)
public void mark(Node node)
public void markAndGrow(Node node)
public void clear(Node node)
public void clearAndGrow(Node node)
public void clearAll()
public void intersect(NodeBitMap other)
public void subtract(NodeBitMap other)
public void union(NodeBitMap other)
public void invert()
public void grow()
protected Node nextMarkedNode(int fromNodeId)
public NodeBitMap copy()
public int count()
count
in interface NodeIterable<Node>
public boolean contains(Node node)
contains
in interface NodeIterable<Node>