Packages

object traverse

Provides traversal functionality

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def allPaths[E <: EdgeDocument[E, From, From], From <: Document[From]](from: Id[From], to: Id[From], maxDepth: Int, bufferSize: Int = 100, edgeFilter: (E) => Boolean = (_: E) => true)(implicit ev: =:=[Doc, E]): Stream[TraversalPath[E, From, From]]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def bfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startIds: Set[Id[N]], maxDepth: Int)(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for BFS with multiple starting nodes and specified depth

  7. def bfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startIds: Set[Id[N]])(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for BFS with multiple starting nodes

  8. def bfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startId: Id[N], maxDepth: Int)(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for BFS with a single starting node and specified depth

  9. def bfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startId: Id[N])(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for BFS with a single starting node

  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
  11. def collectReachableIds[E <: EdgeDocument[E, N, N], N <: Document[N]](startId: Id[N], maxDepth: Int = Int.MaxValue)(implicit ev: =:=[Doc, E]): Task[Set[Id[N]]]

    Compatibility method for legacy code - uses the new traversal API internally but returns a backward-compatible result wrapped in a Task

  12. def dfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startIds: Set[Id[N]], maxDepth: Int)(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for DFS with multiple starting nodes and specified depth

  13. def dfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startIds: Set[Id[N]])(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for DFS with multiple starting nodes

  14. def dfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startId: Id[N], maxDepth: Int)(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for DFS with specified depth

  15. def dfs[E <: EdgeDocument[E, N, T], N <: Document[N], T <: Document[T]](startId: Id[N])(implicit ev: =:=[Doc, E]): EdgeTraversalBuilder[E, N, T]

    Create a traversal for DFS

  16. def edgesFor[E <: EdgeDocument[E, From, To], From <: Document[From], To <: Document[To]](fromId: Id[From])(implicit ev: =:=[Doc, E]): Stream[E]

    Get a stream of edges for the specified from ID

  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  19. def from[D <: Document[D]](ids: Set[Id[D]]): DocumentTraversalBuilder[D]

    Start a traversal from a set of document IDs

  20. def from[D <: Document[D]](id: Id[D]): DocumentTraversalBuilder[D]

    Start a traversal from a single document ID

  21. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate() @native()
  22. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate() @native()
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @native()
  26. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @native()
  27. def reachableFrom[E <: EdgeDocument[E, From, To], From <: Document[From], To <: Document[To]](from: Id[From], maxDepth: Int = Int.MaxValue)(implicit ev: =:=[From, To]): Stream[E]

    Find all nodes reachable from a starting ID by following edges

  28. def shortestPaths[E <: EdgeDocument[E, From, To], From <: Document[From], To <: Document[To]](from: Id[From], to: Id[To], maxDepth: Int = Int.MaxValue, bufferSize: Int = 100, edgeFilter: (E) => Boolean = (_: E) => true)(implicit ev: =:=[Doc, E]): Stream[TraversalPath[E, From, To]]

    Find shortest paths between two nodes

  29. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from AnyRef

Inherited from Any

Ungrouped