public class DetachedEdge extends DetachedElement<Edge> implements Edge, Edge.Iterators
Edge that is disconnected from a Graph. "Disconnection" can mean detachment from
a Graph in the sense that the Edge was constructed from a Graph instance and this reference
was removed or it can mean that the DetachedEdge could have been constructed independently of a
Graph instance in the first place.
DetachedEdge only has reference to the properties and in/out vertices that are associated with it at the
time of detachment (or construction) and is not traversable or mutable. Note that the references to the in/out
vertices are DetachedVertex instances that only have reference to the
Element.id() and Element.label().Edge.Exceptions, Edge.Iteratorsid, label, propertiesDEFAULT_LABEL| Modifier | Constructor and Description |
|---|---|
protected |
DetachedEdge(Edge edge,
boolean withProperties) |
|
DetachedEdge(java.lang.Object id,
java.lang.String label,
java.util.Map<java.lang.String,java.lang.Object> properties,
org.javatuples.Pair<java.lang.Object,java.lang.String> outV,
org.javatuples.Pair<java.lang.Object,java.lang.String> inV) |
| Modifier and Type | Method and Description |
|---|---|
static Edge |
addTo(Graph graph,
DetachedEdge detachedEdge) |
Edge |
attach(Graph hostGraph) |
Edge |
attach(Vertex hostVertex) |
Edge.Iterators |
iterators()
Gets the iterators for the
Element. |
<V> java.util.Iterator<Property<V>> |
propertyIterator(java.lang.String... propertyKeys)
Get an
Iterator of properties. |
java.lang.String |
toString() |
java.util.Iterator<Vertex> |
vertexIterator(Direction direction)
Retrieve the vertex (or vertices) associated with this edge as defined by the direction.
|
equals, graph, hashCode, id, label, property, property, removeclone, finalize, getClass, notify, notifyAll, wait, wait, waitgraph, id, keys, label, property, property, remove, valueproperties, propertyMap, start, value, valueMap, valueMapaddBothE, addE, addInE, addOutE, aggregate, aggregate, as, back, between, both, bothE, bothV, branch, cap, cap, choose, choose, coin, count, cyclicPath, dedup, emit, emit, emit, except, except, except, filter, flatMap, fold, fold, group, group, groupCount, groupCount, has, has, has, has, has, has, has, hasNot, identity, in, inE, inject, inV, limit, local, map, match, order, otherV, out, outE, outV, path, profile, range, repeat, retain, retain, retain, sack, sack, sack, sample, select, select, shuffle, sideEffect, simplePath, store, store, subgraph, subgraph, subgraph, subgraph, submit, sum, timeLimit, times, to, toE, toV, tree, tree, unfold, union, until, until, values, where, where, where, withPath, withSack, withSack, withSideEffectvalueIteratorprotected DetachedEdge(Edge edge, boolean withProperties)
public DetachedEdge(java.lang.Object id,
java.lang.String label,
java.util.Map<java.lang.String,java.lang.Object> properties,
org.javatuples.Pair<java.lang.Object,java.lang.String> outV,
org.javatuples.Pair<java.lang.Object,java.lang.String> inV)
public java.lang.String toString()
toString in class java.lang.Objectpublic Edge attach(Vertex hostVertex)
attach in interface Attachable<Edge>public Edge attach(Graph hostGraph)
attach in interface Attachable<Edge>public static Edge addTo(Graph graph, DetachedEdge detachedEdge)
public Edge.Iterators iterators()
ElementElement. Iterators provide low-level access to the data associated with
an Element as they do not come with the overhead of Traversal
construction. Use iterators in places where performance is most crucial.public java.util.Iterator<Vertex> vertexIterator(Direction direction)
Edge.IteratorsDirection.BOTH then the iterator order is: Direction.OUT then Direction.IN.vertexIterator in interface Edge.Iteratorsdirection - Get the incoming vertex, outgoing vertex, or both verticespublic <V> java.util.Iterator<Property<V>> propertyIterator(java.lang.String... propertyKeys)
Element.IteratorsIterator of properties.propertyIterator in interface Edge.IteratorspropertyIterator in interface Element.IteratorspropertyIterator in class DetachedElement<Edge>Copyright © 2013-2015 TinkerPop. All Rights Reserved.