Packages

sealed abstract class ISet[A] extends AnyRef

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

Abstract Value Members

  1. abstract val size: Int

Concrete 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 \\(other: ISet[A])(implicit o: Order[A]): ISet[A]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def contains(x: A)(implicit o: Order[A]): Boolean

    Alias for member

  8. final def delete(x: A)(implicit o: Order[A]): ISet[A]
  9. final def deleteAt(i: Int): ISet[A]
  10. final def deleteFindMax: (A, ISet[A])
  11. final def deleteFindMin: (A, ISet[A])
  12. final def deleteMax: ISet[A]
  13. final def deleteMin: ISet[A]
  14. final def difference(other: ISet[A])(implicit o: Order[A]): ISet[A]
  15. final def elemAt(i: Int): Option[A]

    Alias for Foldable[ISet].index

  16. final def elems: List[A]
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def equals(other: Any): Boolean
    Definition Classes
    ISet → AnyRef → Any
  19. final def filter(p: (A) ⇒ Boolean): ISet[A]
  20. final def filterGt(a: Option[A])(implicit o: Order[A]): ISet[A]
  21. final def filterLt(a: Option[A])(implicit o: Order[A]): ISet[A]
  22. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. final def findMax: Option[A]
    Annotations
    @tailrec()
  24. final def findMin: Option[A]
    Annotations
    @tailrec()
  25. final def foldLeft[B](z: B)(f: (B, A) ⇒ B): B
  26. final def foldRight[B](z: B)(f: (A, B) ⇒ B): B
  27. final def foldl[B](z: B)(f: (B, A) ⇒ B): B
  28. final def foldr[B](z: B)(f: (A, B) ⇒ B): B
  29. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  30. final def hashCode(): Int
    Definition Classes
    ISet → AnyRef → Any
  31. final def insert(x: A)(implicit o: Order[A]): ISet[A]
  32. final def intersection(other: ISet[A])(implicit o: Order[A]): ISet[A]
  33. final def isEmpty: Boolean
  34. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  35. final def isProperSubsetOf(other: ISet[A])(implicit o: Order[A]): Boolean
  36. final def isSubsetOf(other: ISet[A])(implicit o: Order[A]): Boolean
  37. final def lookupGE(x: A)(implicit o: Order[A]): Option[A]
    Annotations
    @tailrec()
  38. final def lookupGT(x: A)(implicit o: Order[A]): Option[A]
    Annotations
    @tailrec()
  39. final def lookupIndex(x: A)(implicit o: Order[A]): Option[Int]
  40. final def lookupLE(x: A)(implicit o: Order[A]): Option[A]
    Annotations
    @tailrec()
  41. final def lookupLT(x: A)(implicit o: Order[A]): Option[A]
    Annotations
    @tailrec()
  42. def map[B](f: (A) ⇒ B)(implicit arg0: Order[B]): ISet[B]

    For the Functor composition law to hold it is important that the Order[B] is substitutive for the Order[A] – that is, that the Order[B] should be no stronger, it should not distinguish two B instances that would be considered as equal A instances.

    For the Functor composition law to hold it is important that the Order[B] is substitutive for the Order[A] – that is, that the Order[B] should be no stronger, it should not distinguish two B instances that would be considered as equal A instances.

    Note: this is not able to implement Functor due to the Order constraint on the destination type, however it still is a functor in the mathematical sense.

    Documentation as copied from the Haskell source:

    -- | /O(n*log n)/.
-- @'map' f s@ is the set obtained by applying @f@ to each element of @s@.
--
-- It's worth noting that the size of the result may be smaller if,
-- for some @(x,y)@, @x \/= y && f x == f y@
  43. final def maxView: Option[(A, ISet[A])]
  44. final def member(x: A)(implicit o: Order[A]): Boolean
    Annotations
    @tailrec()
  45. def merge(other: ISet[A]): ISet[A]
    Attributes
    protected
  46. final def minView: Option[(A, ISet[A])]
  47. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  48. final def notMember(x: A)(implicit o: Order[A]): Boolean
  49. final def notify(): Unit
    Definition Classes
    AnyRef
  50. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  51. final def partition(p: (A) ⇒ Boolean): (ISet[A], ISet[A])
  52. final def split(x: A)(implicit o: Order[A]): (ISet[A], ISet[A])
  53. final def splitMember(x: A)(implicit o: Order[A]): (ISet[A], Boolean, ISet[A])
  54. final def splitRoot: List[ISet[A]]
  55. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  56. final def toAscList: List[A]
  57. final def toDescList: List[A]
  58. final def toList: List[A]
  59. def toString(): String
    Definition Classes
    AnyRef → Any
  60. final def trim(a: Option[A], b: Option[A])(implicit o: Order[A]): ISet[A]
  61. final def union(other: ISet[A])(implicit o: Order[A]): ISet[A]
  62. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  63. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  64. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped