class Builder[A] extends AnyRef
- Alphabetic
- By Inheritance
- Builder
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Builder()
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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bfs: Builder[A]
configure search algorithm to go "breadth first", rather than the default "depth first"
- def breadthFirstSearch: Builder[A]
configure search algorithm to go "breadth first", rather than the default "depth first"
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def dedup: Builder[A]
Keep a 'visited' list of elements to ensure we are not going in cycles.
- def emit(condition: (Traversal[A]) => Traversal[_]): Builder[A]
Emit intermediate elements (along the way), if they meet the given condition.
Emit intermediate elements (along the way), if they meet the given condition. Note that this does not apply a filter on the final elements of the traversal.
- def emit: Builder[A]
Emit all intermediate elements (along the way).
- def emitAllButFirst: Builder[A]
Emit intermediate elements (along the way), apart from the _first_ element
- 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 hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def maxDepth(value: Int): Builder[A]
Maximum depth to go down in the repeat traversal.
Maximum depth to go down in the repeat traversal. Note that there may be other conditions like until|whilst etc.
- 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
- def until(condition: (Traversal[A]) => Traversal[_]): Builder[A]
- 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()
- def whilst(condition: (Traversal[A]) => Traversal[_]): Builder[A]
Stop traversing when given condition-traversal has no result.
Stop traversing when given condition-traversal has no result. The condition-traversal is already evaluated at the first iteration, for classic while/repeat behaviour.
n.b. the only reason not to call this
whileis to avoid using scala keywords, which would need to be quoted.
Deprecated Value Members
- def times(value: Int): Builder[A]
Maximum depth to go down in the repeat traversal.
Maximum depth to go down in the repeat traversal. Note that there may be other conditions like until|whilst etc.
- Annotations
- @deprecated
- Deprecated
(Since version 1.153) use
maxDepthinstead - semantically equivalent, while it describes the meaning more precisely