Class

cats.collections.laws

MinimalPartialOrderedSetProxy

Related Doc: package laws

Permalink

class MinimalPartialOrderedSetProxy[F[_]] extends PartiallyOrderedSet[F]

We test all default methods against this proxy so overrides can never change semantics

Linear Supertypes
PartiallyOrderedSet[F], UnorderedFoldable[F], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MinimalPartialOrderedSetProxy
  2. PartiallyOrderedSet
  3. UnorderedFoldable
  4. Serializable
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MinimalPartialOrderedSetProxy(pos: PartiallyOrderedSet[F])

    Permalink

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def add[A](fa: F[A], a: A)(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → PartiallyOrderedSet
  5. def addAll[A](fa: F[A], items: Iterable[A])(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  6. def addAllLargest[A](fa: F[A], maxSize: Long, items: Iterable[A])(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  7. def addIfLarger[A](fa: F[A], maxSize: Long, item: A)(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def build[A](items: Iterable[A])(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  10. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def contains[A](fa: F[A], a: A)(implicit arg0: Order[A]): Boolean

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → PartiallyOrderedSet
  12. def empty[A]: F[A]

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → PartiallyOrderedSet
  13. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  15. def exists[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    UnorderedFoldable
  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def forall[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    UnorderedFoldable
  18. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  20. def isEmpty[A](fa: F[A]): Boolean

    Permalink
    Definition Classes
    UnorderedFoldable
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. def minimumOption[A](fa: F[A]): Option[A]

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → PartiallyOrderedSet
  23. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  24. def nonEmpty[A](fa: F[A]): Boolean

    Permalink
    Definition Classes
    UnorderedFoldable
  25. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  27. def order[A](implicit arg0: Order[A]): Order[F[A]]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  28. def pop[A](fa: F[A])(implicit order: Order[A]): Option[(A, F[A])]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  29. def removeMin[A](fa: F[A])(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → PartiallyOrderedSet
  30. def singleton[A](a: A): F[A]

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → PartiallyOrderedSet
  31. def size[A](fa: F[A]): Long

    Permalink
    Definition Classes
    UnorderedFoldable
  32. def sortedFoldLeft[A, B](fa: F[A], init: B)(fn: (B, A) ⇒ B)(implicit order: Order[A]): B

    Permalink
    Definition Classes
    PartiallyOrderedSet
  33. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  34. def takeLargest[A](fa: F[A], maxSize: Long)(implicit order: Order[A]): F[A]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  35. def toSortedList[A](fa: F[A])(implicit order: Order[A]): List[A]

    Permalink
    Definition Classes
    PartiallyOrderedSet
  36. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  37. def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A

    Permalink
    Definition Classes
    UnorderedFoldable
  38. def unorderedFoldMap[A, B](fa: F[A])(fn: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B

    Permalink
    Definition Classes
    MinimalPartialOrderedSetProxy → UnorderedFoldable
  39. final def wait(): Unit

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

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

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

Deprecated Value Members

  1. def unadd[A](fa: F[A])(implicit order: Order[A]): Option[(A, F[A])]

    Permalink
    Definition Classes
    PartiallyOrderedSet
    Annotations
    @deprecated
    Deprecated

    (Since version 2019-07-10) Use pop instead

Inherited from PartiallyOrderedSet[F]

Inherited from UnorderedFoldable[F]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped