GraphLookup

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (GraphLookup, B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

val as: String

the name of the array field added to each output document

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val connectFromField: String

the field name whose value $graphLookup uses to recursively match against the connectToField of other documents in the collection

val connectToField: String

the field name in other documents against which to match the value of the field specified by the connectFromField parameter

val depthField: Option[String]

an optional name for a field to add to each traversed document in the search path

def ensuring(cond: (GraphLookup) ⇒ Boolean, msg: ⇒ Any): GraphLookup

def ensuring(cond: (GraphLookup) ⇒ Boolean): GraphLookup

def ensuring(cond: Boolean, msg: ⇒ Any): GraphLookup

def ensuring(cond: Boolean): GraphLookup

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

val from: String

the target collection for the $graphLookup operation to search

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

val makePipe: P.Document

val maxDepth: Option[Int]

an optional non-negative integral number specifying the maximum recursion depth

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val restrictSearchWithMatch: Option[P.Value]

an optional filter expression

val startWith: P.Value

the expression that specifies the value of the connectFromField with which to start the recursive search

final def synchronized[T0](arg0: ⇒ T0): T0

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def →[B](y: B): (GraphLookup, B)

val self: Any

val self: Any

def x: GraphLookup

def x: GraphLookup