Class/Object

dogs

DisjointSets

Related Docs: object DisjointSets | package dogs

Permalink

class DisjointSets[T] extends AnyRef

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DisjointSets
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(v: T): DisjointSets[T]

    Permalink

    Add a value to this datastructure

    Add a value to this datastructure

    v

    Value to be added

    returns

    New DisjointSets's state.

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

    Permalink
    Definition Classes
    AnyRef → Any
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def contains(v: T): Boolean

    Permalink

    Checks whether or not a value is present in the disjoint sets collection

    Checks whether or not a value is present in the disjoint sets collection

    v

    label to be found within the data structure

    returns

    Check result

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

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def find(v: T): (DisjointSets[T], Option[T])

    Permalink

    Find the label of the provided value.

    Find the label of the provided value.

    v

    Value whose label is to be found

    returns

    (new state, 'None' if the value doesn't exist, Some(label) otherwise)

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

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  19. def toSets: (DisjointSets[T], Map[T, Set[T]])

    Permalink

    Generates a map from labels to sets from the current DisjointSets.

  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  21. def union(a: T, b: T): (DisjointSets[T], Boolean)

    Permalink

    Joins two disjoint sets if both are contained by this DisjointSets

    Joins two disjoint sets if both are contained by this DisjointSets

    a

    Set a

    b

    Set b

    returns

    (new DisjointSets with updated state, true if Both labels are contained and joined )

  22. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped