laws/cats.collections.laws/PartiallyOrderedSetLaws

PartiallyOrderedSetLaws

trait PartiallyOrderedSetLaws[F[_]] extends UnorderedFoldableLaws[F]
trait UnorderedFoldableLaws[F]
class Object
trait Matchable
class Any

Value members

Concrete methods

def addAllLargestMatchesProxy[A](fa: F[A], maxSize: Long, items: Iterable[A])(`evidence$19`: Order[A]): IsEq[F[A]]
def addAllListSameAsSort[A](ls: List[A])(`evidence$12`: Order[A]): IsEq[List[A]]
def addAllMatchesProxy[A](fa: F[A], items: Iterable[A])(`evidence$13`: Order[A]): IsEq[F[A]]
def addEmptyIsSingleton[A](a: A)(`evidence$3`: Order[A]): IsEq[F[A]]
def addIfLargerMatchesProxy[A](fa: F[A], maxSize: Long, item: A)(`evidence$17`: Order[A]): IsEq[F[A]]
def addIncreasesSize[A](fa: F[A], a: A)(`evidence$7`: Order[A]): Boolean
def addMonoidConsistency[A, B](fa: F[A], a: A, fn: A => B)(`evidence$4`: Order[A], `evidence$5`: CommutativeMonoid[B]): IsEq[B]
def buildMatchesProxy[A](items: Iterable[A])(`evidence$14`: Order[A]): IsEq[F[A]]
def containsMatchesToList[A](fa: F[A], a: A)(`evidence$8`: Order[A]): Boolean
def emptyIsEmpty[A](`evidence$6`: CommutativeMonoid[A]): IsEq[A]
def minimumOptionIsTheMinimum[A](fa: F[A])(`evidence$10`: Order[A]): Boolean
def popMatchesProxy[A](fa: F[A])(`evidence$21`: Order[A]): IsEq[Option[(A, F[A])]]
def removeDecreasesSize[A](fa: F[A])(`evidence$9`: Order[A]): Boolean
def removeMinNeverDecreasesMin[A](fa: F[A])(`evidence$11`: Order[A]): Boolean
def sizeMatchesUnorderedFoldMap[A](fa: F[A]): Boolean
def sortedFoldLeftMatchesProxy[A, B](fa: F[A], init: B, fn: (B, A) => B)(`evidence$15`: Order[A]): IsEq[B]
def takeLargestMatchesProxy[A](fa: F[A], maxSize: Long)(`evidence$16`: Order[A]): IsEq[F[A]]
def toSortedListMatchesProxy[A](fa: F[A])(`evidence$18`: Order[A]): IsEq[List[A]]
def unaddMatchesProxy[A](fa: F[A])(`evidence$20`: Order[A]): IsEq[Option[(A, F[A])]]

Inherited methods

def existsLazy[A](fa: F[A]): Boolean
Inherited from
UnorderedFoldableLaws
def forallConsistentWithExists[A](fa: F[A], p: A => Boolean): Boolean
Inherited from
UnorderedFoldableLaws
def forallEmpty[A](fa: F[A], p: A => Boolean): Boolean

If F[A] is empty, forall must return true.

If F[A] is empty, forall must return true.

Inherited from
UnorderedFoldableLaws
def forallLazy[A](fa: F[A]): Boolean
Inherited from
UnorderedFoldableLaws
def nonEmptyRef[A](fa: F[A]): IsEq[Boolean]
Inherited from
UnorderedFoldableLaws
def unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(`evidence$1`: CommutativeMonoid[A]): IsEq[A]
Inherited from
UnorderedFoldableLaws

Implicits

Implicits

implicit override def F: PartiallyOrderedSet[F]
Definition Classes
UnorderedFoldableLaws