class TraversalSource extends AnyRef
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- TraversalSource
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new TraversalSource(graph: Graph)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def all: Traversal[Node]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def has(key: String, value: Any): Traversal[Node]
Start traversal with all nodes that have given property value
- def has(property: Property[_]): Traversal[Node]
Start traversal with all nodes that have given property value
- def hasLabel(label: String): Traversal[Node]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def id[NodeType](id: Long)(implicit arg0: DefaultsToNode[NodeType]): Traversal[NodeType]
- def ids[NodeType](ids: Long*)(implicit arg0: DefaultsToNode[NodeType]): Traversal[NodeType]
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def label(label: String): Traversal[Node]
- def labelAndProperty(label: String, propertyKey: String, propertyValue: Any): Traversal[Node]
Start traversal with all nodes with given label that have given property value Inspects the cardinality of the indices of the properties and labels, and takes the smaller one
- def labelAndProperty(label: String, property: Property[_]): Traversal[Node]
Start traversal with all nodes with given label that have given property value Inspects the cardinality of the indices of the properties and labels, and takes the smaller one
- def labelTyped[A <: Node](label: String): Traversal[A]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()