libref.spec.AVLTree

AVLTreeOps

sealed case class AVLTreeOps(tree: TreeNode) extends Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AVLTreeOps
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AVLTreeOps(tree: TreeNode)

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 contains(value: BigInt): Boolean

  9. def delete(v: BigInt): TreeNode

    Return a new tree which not contains given element.

  10. def deleteMax: (BigInt, TreeNode)

    Return a tuple containing the biggest element of the provided tree and a new tree from which this element has been extracted.

  11. def deleteMin: (BigInt, TreeNode)

    Return a tuple containing the smallest element of the provided tree and a new tree from which this element has been extracted.

  12. def doubleLeftRotation: TreeNode

  13. def doubleRightRotation: TreeNode

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

    Definition Classes
    AnyRef
  15. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def findMax: Option[BigInt]

  17. def findMin: Option[BigInt]

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

    Definition Classes
    AnyRef → Any
  19. def insert(v: BigInt): TreeNode

    Returns a new tree containing the given element.

    Returns a new tree containing the given element. Ignore the new element if the same element is already present.

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  21. def leftRotation: TreeNode

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

    Definition Classes
    AnyRef
  23. final def notify(): Unit

    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  25. def rebalance: TreeNode

  26. def rightRotation: TreeNode

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

    Definition Classes
    AnyRef
  28. def toList: List[BigInt]

  29. def toSet: Set[BigInt]

  30. def toSortedList: List[BigInt]

  31. val tree: TreeNode

  32. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped