NodeUtils

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

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

   

   Definition Classes

   AnyRef → Any

10. def hasTooManyEdges(dir: GraphDir, thresh: Option[Int])(node: Node): Boolean

    

    Checks if a node has too many edges.

    Checks if a node has too many edges.

    thresh

    the threshold (maximum value to be checked against)

    node

    the relevant node

11. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. def pickRandNodeId(nodeIds: Seq[Int], randNumGen: Random): Int

    

    Returns the id of some random home node

    Returns the id of some random home node

    nodeIds

    the list of home node ids

    randNumGen

    some random number generator

    returns

    the id of some random home node

17. def removeFromList[T](discardSet: Set[Int], universe: List[T], extractFunc: (T) ⇒ Int): List[T]

    

    Removes from a given universe of elements, those that belong to discardSet

    Removes from a given universe of elements, those that belong to discardSet

    discardSet

    set of ints identifying elements that need to be discarded

    universe

    the list of all elements

    extractFunc

    function to extract the int from one element in the universe

    returns

    universe without those elements that are present in discardSet

18. def removeSelfAndNodesDirectlyFollowing[T](node: Node, allNodeInfos: List[T], extractIdFunc: (T) ⇒ Int): List[T]

    

    Removes node and those nodes that node directly follows from a given set

    Removes node and those nodes that node directly follows from a given set

    node

    the relevant node

    allNodeInfos

    the information about a set of nodes

    extractIdFunc

    function to extract the id from the information about a node

    returns

    allNodeInfos without node and nodes directly followed by node

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

    

    Definition Classes

    AnyRef

20. def toString(): String

    

    Definition Classes

    AnyRef → Any

21. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )