cc.factorie.db.mongo

GraphLoader

object GraphLoader

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphLoader
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type Index = Map[(Class[util.Cubbie], String, Any), Iterable[util.Cubbie]]

  2. class IndexBasedInverter extends (InverseSlot[util.Cubbie]) ⇒ Iterable[util.Cubbie]

  3. case class InvSlotInCollection[+R <: util.Cubbie](invSlot: AbstractInverseSlot[R], coll: AbstractCubbieCollection[R]) extends Product with Serializable

  4. type Invs = (InverseSlot[util.Cubbie]) ⇒ Iterable[util.Cubbie]

  5. type Refs = Map[Any, util.Cubbie]

  6. case class SlotInCollection[+R <: util.Cubbie](slot: AbstractRefSlot[R], coll: AbstractCubbieCollection[R]) extends Product with Serializable

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  14. def load(roots: TraversableOnce[util.Cubbie], neighbors: PartialFunction[util.Cubbie, Seq[SlotInCollection[util.Cubbie]]], maxDepth: Int = Int.MaxValue, oldRefs: Refs = Map.empty): Refs

    Loads a cache from ids to cubbies based on the root objects and a neighborhood function.

    Loads a cache from ids to cubbies based on the root objects and a neighborhood function.

    roots

    the cubbies to start with.

    neighbors

    the neigborhood function from cubbies to (refslot,collection) pairs.

    maxDepth

    How far from the root are we allowed to travel. If maxDepth == 0 no ids are added to the cache, for maxDepth == 1 only the roots are added to the cache, for maxDeptn == 2 the roots immediate children etc.

    oldRefs

    an existing cache. Cubbies with ids in this cache will not be loaded/traversed.

    returns

    a cache that maps ids to the cubbie objects in the graph defined by the roots, neighborhood function and maximum depth.

    Annotations
    @tailrec()

  15. def load2(roots: TraversableOnce[util.Cubbie], neighbors: PartialFunction[util.Cubbie, Seq[InvSlotInCollection[util.Cubbie]]], maxDepth: Int = Int.MaxValue, oldIndex: Index = Map.empty): Index

    Annotations
    @tailrec()

  16. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  20. def toInverter(index: Index): IndexBasedInverter

  21. def toRefs(index: Index): Map[Any, util.Cubbie]

  22. def toString(): String

    Definition Classes
    AnyRef → Any

  23. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped