c

overflowdb.traversal

NodeTraversal

final class NodeTraversal[E <: Node] extends AnyVal

Linear Supertypes
AnyVal, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeTraversal
  2. AnyVal
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new NodeTraversal(traversal: Traversal[E])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##: Int
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def both(labels: String*): Traversal[Node]

    follow incoming and outgoing edges of given labels to adjacent nodes

  6. def both: Traversal[Node]

    follow incoming and outgoing edges to adjacent nodes

  7. def bothE(labels: String*): Traversal[Edge]

    follow incoming and outgoing edges of given label

  8. def bothE: Traversal[Edge]

    follow incoming and outgoing edges

  9. def getClass(): Class[_ <: AnyVal]
    Definition Classes
    AnyVal → Any
  10. def hasId(values: Long*): Traversal[E]

    alias for

    alias for

    id
  11. def hasId(value: Long): Traversal[E]

    alias for

    alias for

    id
  12. def id(values: Long*): Traversal[E]

    Filter by given ids Note: do not use as the first step in a traversal, e.g.

    Filter by given ids Note: do not use as the first step in a traversal, e.g. traversalSource.all.id(value). Use traversalSource.withId instead, it is much faster

  13. def id(value: Long): Traversal[E]

    Filter by given id Note: do not use as the first step in a traversal, e.g.

    Filter by given id Note: do not use as the first step in a traversal, e.g. traversalSource.all.id(value). Use traversalSource.withId instead, it is much faster

  14. def id: Traversal[Long]
    Annotations
    @Doc()
  15. def in(labels: String*): Traversal[Node]

    follow incoming edges of given label to adjacent nodes

  16. def in: Traversal[Node]

    follow incoming edges to adjacent nodes

  17. def inE(labels: String*): Traversal[Edge]

    follow incoming edges of given label

  18. def inE: Traversal[Edge]

    follow incoming edges

  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. def out(labels: String*): Traversal[Node]

    follow outgoing edges of given labels to adjacent nodes

  21. def out: Traversal[Node]

    follow outgoing edges to adjacent nodes

    follow outgoing edges to adjacent nodes

    Annotations
    @Doc()
  22. def outE(labels: String*): Traversal[Edge]

    follow outgoing edges of given label

  23. def outE: Traversal[Edge]

    follow outgoing edges

  24. def toString(): String
    Definition Classes
    Any
  25. val traversal: Traversal[E]

Inherited from AnyVal

Inherited from Any

Ungrouped