TestNode

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. def containsNode(nodeIds: Seq[Int], queryNodeId: Int): Boolean

   The default implementation just walks the array but users likely want to override to provide a more optimized implementation.

   The default implementation just walks the array but users likely want to override to provide a more optimized implementation.

   returns

   a boolean indicating Whether nodeIds contains queryNodeId.

   Attributes

   protected

   Definition Classes

   Node

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

   Definition Classes

   AnyRef

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. val id: Int

    The unique id of this node.

    The unique id of this node.

    Definition Classes

    TestNode → Node

13. def inboundCount: Int

    returns

    the total number of inbound edges.

    Definition Classes

    Node

14. def inboundNodes(max: Int): Seq[Int]

    Returns up to max nodes that this node points to.

    Returns up to max nodes that this node points to.

    max

    the max number of nodes it needs

    returns

    a sequence of inboundNode ids

    Definition Classes

    Node

15. val inboundNodes: List[Int]

    Returns ids of all nodes pointing to this node.

    Returns ids of all nodes pointing to this node.

    Definition Classes

    TestNode → Node

16. def isInboundNode(nodeId: Int): Boolean

    Returns true if the given nodeId points to this node.

    Returns true if the given nodeId points to this node.

    nodeId

    host node id

    returns

    a set of random node id

    Definition Classes

    Node

17. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

18. def isNeighbor(dir: GraphDir, nodeId: Int): Boolean

    whether nodeId is a neighbor in the allowing direction dir

    whether nodeId is a neighbor in the allowing direction dir

    dir

    the direction (inbound or outbound) that the method is applied to.

    nodeId

    the target node id.

    returns

    a boolean indicating whether nodeId is in the home node's neighbors.

    Definition Classes

    Node

19. def isOutboundNode(nodeId: Int): Boolean

    Returns true if the this node point to the given node.

    Returns true if the this node point to the given node.

    nodeId

    home node id

    returns

    a boolean indicating whether outbound nodes contains nodeId.

    Definition Classes

    Node

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

    Definition Classes

    AnyRef

21. def neighborCount(dir: GraphDir): Int

    the neighbor count in the allowing direction dir

    the neighbor count in the allowing direction dir

    dir

    the direction (inbound or outbound) that the method is applied to.

    returns

    the number of neighbors in the direction of dir.

    Definition Classes

    Node

22. def neighborIds(dir: GraphDir, max: Int): Seq[Int]

    A method that returns max nodes of either inbound or outbound allowing direction dir.

    A method that returns max nodes of either inbound or outbound allowing direction dir.

    dir

    the direction (inbound or outbound) that the method is applied to.

    max

    the maximum number of neighbors needed.

    returns

    a sequence of inbound or outbound neighbors.

    Definition Classes

    Node

23. def neighborIds(dir: GraphDir): Seq[Int]

    A method that return either inbound or outbound allowing direction dir.

    A method that return either inbound or outbound allowing direction dir.

    dir

    the direction (inbound or outbound) that the method is applied to.

    returns

    a sequence of inbound or outbound neighbors.

    Definition Classes

    Node

24. final def notify(): Unit

    Definition Classes

    AnyRef

25. final def notifyAll(): Unit

    Definition Classes

    AnyRef

26. def outboundCount: Int

    returns

    the total number of outbound edges.

    Definition Classes

    Node

27. def outboundNodes(max: Int): Seq[Int]

    max

    the maximum number of outBound nodes needed.

    returns

    up to max nodes that this node points to.

    Definition Classes

    Node

28. val outboundNodes: List[Int]

    returns

    all nodes this node points to.

    Definition Classes

    TestNode → Node

29. def randomInboundNode(rnd: Random): Option[Int]

    Returns a random node from the set of nodes that points to this node or else None if this node has no inbound edges, using the supplied random number generator rnd.

    Returns a random node from the set of nodes that points to this node or else None if this node has no inbound edges, using the supplied random number generator rnd.

    rnd

    user defined random number generator

    returns

    a random node id

    Definition Classes

    Node

30. def randomInboundNode: Option[Int]

    Returns a random node from the set of nodes that points to this node or else None if this node has no inbound edges.

    Returns a random node from the set of nodes that points to this node or else None if this node has no inbound edges.

    The default implementation picks a random node from inboundNodes()* so subclasses should consider overriding this method if the Seq sequence they produce is not a IndexedSeq.

    returns

    a sequence of random node ids

    Definition Classes

    Node

31. def randomInboundNodeSet(numResults: Int, rnd: Random): Seq[Int]

    Returns a random sample of size at most numResults from the set of nodes that point to this node using the supplied random number generator rnd.

    Returns a random sample of size at most numResults from the set of nodes that point to this node using the supplied random number generator rnd.

    numResults

    max number of random nodes needed

    rnd

    user defined random number generator

    returns

    a set of random node id

    Definition Classes

    Node

32. def randomNeighbor(dir: GraphDir, rnd: Random): Option[Int]

    A method that returns a random node in the allowing direction dir, using the supplied random number generator rnd.

    A method that returns a random node in the allowing direction dir, using the supplied random number generator rnd.

    dir

    the direction (inbound or outbound) that the method is applied to.

    rnd

    a user defined random number generator.

    returns

    a random neighbor or None if no neighbor is in the direction dir.

    Definition Classes

    Node

33. def randomNeighbor(dir: GraphDir): Option[Int]

    A method that returns a random node in the allowing direction dir.

    A method that returns a random node in the allowing direction dir.

    dir

    the direction (inbound or outbound) that the method is applied to.

    returns

    a random neighbor or None if no neighbor is in the direction dir.

    Definition Classes

    Node

34. def randomNeighborSet(numResults: Int, dir: GraphDir, rnd: Random): Seq[Int]

    A method that returns a set of either inbound or outbound nodes of size numResults, in the allowing direction dir, using the supplied random number generator rnd.

    A method that returns a set of either inbound or outbound nodes of size numResults, in the allowing direction dir, using the supplied random number generator rnd.

    numResults

    maximum number of neighbors needed.

    dir

    the direction (inbound or outbound) that the method is applied to.

    rnd

    a user defined random number generator.

    returns

    a set of random neighbors.

    Definition Classes

    Node

35. def randomNeighborSet(numResults: Int, dir: GraphDir): Seq[Int]

    A method that returns a random node of size numResults in the allowing direction dir, using the supplied random number generator rnd.

    A method that returns a random node of size numResults in the allowing direction dir, using the supplied random number generator rnd.

    numResults

    maximum number of neighbors needed.

    dir

    the direction (inbound or outbound) that the method is applied to.

    returns

    a set of random neighbors.

    Definition Classes

    Node

36. def randomNode(nodeIds: Seq[Int], rnd: Random): Option[Int]

    rnd

    a user defined random number generator.

    returns

    a random node from nodeIds using a supplied random number generator rnd.

    Attributes

    protected

    Definition Classes

    Node

37. def randomNodeSet(nodeIds: Seq[Int], numResults: Int, rnd: Random): Array[Int]

    Random sampling with replacement.

    Random sampling with replacement. Choose a set of random nodes of size numResults from nodeIds using a supplied random number generator rnd.

    numResults

    maximum number of nodes needed.

    rnd

    a user defined random number generator.

    returns

    a random node from nodeIds using a supplied random number generator rnd.

    Attributes

    protected

    Definition Classes

    Node

38. def randomOutboundNode(rnd: Random): Option[Int]

    Returns a random node from the set of nodes that this node points to or else None if this node has no outbound edges, using the supplied random number generator rnd.

    Returns a random node from the set of nodes that this node points to or else None if this node has no outbound edges, using the supplied random number generator rnd.

    rnd

    a user defined random number generator.

    returns

    a random node that this node points to.

    Definition Classes

    Node

39. def randomOutboundNode: Option[Int]

    Returns a random node from the set of nodes that this node points to or else None if this node has no outbound edges.

    Returns a random node from the set of nodes that this node points to or else None if this node has no outbound edges.

    The default implementation picks a random node from outboundNodes()* so subclasses should consider overriding this method if the Seq sequence they produce is not a lazy IndexedSeq.

    returns

    a random node that this node points to.

    Definition Classes

    Node

40. def randomOutboundNodeSet(numResults: Int, rnd: Random): Seq[Int]

    Returns a random sample of size at most numResults from the set of nodes that this node points to using the supplied random number generator rnd.

    Returns a random sample of size at most numResults from the set of nodes that this node points to using the supplied random number generator rnd.

    rnd

    a user defined random number generator.

    returns

    a set of random nodes that this node points to.

    Definition Classes

    Node

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

    Definition Classes

    AnyRef

42. def toString(): String

    Override toString to make debugging easier.

    Override toString to make debugging easier. It prints max of 10 neighbors in each direction.

    Definition Classes

    Node → AnyRef → Any

43. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )