Package com.arcadedb.graph
Class EdgeLinkedList
- java.lang.Object
-
- com.arcadedb.graph.EdgeLinkedList
-
public class EdgeLinkedList extends Object
Linked list uses to manage edges in vertex. The edges are stored in reverse order from insertion. The last item is the first in the list.- Author:
- Luca Garulli ([email protected])
-
-
Constructor Summary
Constructors Constructor Description EdgeLinkedList(Vertex vertex, Vertex.DIRECTION direction, EdgeSegment lastSegment)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
add(RID edgeRID, RID vertexRID)
void
addAll(List<Pair<Identifiable,Identifiable>> entries)
boolean
containsEdge(RID rid)
boolean
containsVertex(RID rid, int[] edgeBucketFilter)
long
count(String edgeType)
Counts the items in the linked list.Iterator<Edge>
edgeIterator(String... edgeTypes)
Iterator<Pair<RID,RID>>
entryIterator(String... edgeTypes)
void
removeEdge(Edge edge)
void
removeEdgeRID(RID edge)
void
removeVertex(RID vertexRID)
JSONArray
toJSON()
Iterator<Vertex>
vertexIterator(String... edgeTypes)
-
-
-
Constructor Detail
-
EdgeLinkedList
public EdgeLinkedList(Vertex vertex, Vertex.DIRECTION direction, EdgeSegment lastSegment)
-
-
Method Detail
-
containsEdge
public boolean containsEdge(RID rid)
-
toJSON
public JSONArray toJSON()
-
containsVertex
public boolean containsVertex(RID rid, int[] edgeBucketFilter)
-
count
public long count(String edgeType)
Counts the items in the linked list.- Parameters:
edgeType
- Type of edge to filter for the counting. If it is null, any type is counted.- Returns:
-
addAll
public void addAll(List<Pair<Identifiable,Identifiable>> entries)
-
removeEdge
public void removeEdge(Edge edge)
-
removeEdgeRID
public void removeEdgeRID(RID edge)
-
removeVertex
public void removeVertex(RID vertexRID)
-
-