Uses of Class
io.atlassian.fugue.law.IsEq

Packages that use IsEq

Package	Description
io.atlassian.fugue.law
io.atlassian.fugue.optic.law

Uses of IsEq in io.atlassian.fugue.law

Methods in io.atlassian.fugue.law that return IsEq

Modifier and Type	Method	Description
static <A> IsEq<A>	IsEq.isEq(A lhs, A rhs)	Two equal elements
IsEq<A>	MonoidLaws.monoidLeftIdentity(A x)	If the zero of your monoid is combine with an element of the type your monoid works with the result should be that element.
IsEq<A>	MonoidLaws.monoidRightIdentity(A x)	If an element of the type your monoid works with is combined with the zero of your monoid result should be that element.
IsEq<A>	SemigroupLaws.multiply1pEqualRepeatedAppend(int n, A a)	The Semigroup.multiply1p(int, Object) function of your semigroup must be equal to Semigroup.sumNonEmpty(Object, Iterable) applied to the input and an iterable containing n - 1 copies of that input
IsEq<A>	MonoidLaws.multiplyEqualRepeatedAppend(int n, A a)	The multiply function of your monoid must be equal to the sum function called with an iterable containing n copies of the input type.
IsEq<A>	MonoidLaws.semigroupAssociative(A x, A y, A z)	A monoid must not care about the order elements are combined.
IsEq<A>	SemigroupLaws.semigroupAssociative(A x, A y, A z)	A semigroup must not care about the order elements are combined.
IsEq<A>	MonoidLaws.sumEqualFold(Iterable<A> as)	The sum function of your monoid must be equal to Functions.fold(BiFunction, Object, Iterable) using append as the folding function and zero() as the initial value
IsEq<A>	SemigroupLaws.sumNonEmptyEqualFold(A head, Iterable<A> tail)	The Semigroup.sumNonEmpty(Object, Iterable) function of your semigroup must be equal to a Functions.fold(BiFunction, Object, Iterable) where append is used as the combining function, head is used as the initial value and tail is the iterable to check

Uses of IsEq in io.atlassian.fugue.optic.law

Methods in io.atlassian.fugue.optic.law that return IsEq

Modifier and Type	Method	Description
IsEq<S>	OptionalLaws.getOptionSet(S s)	set what you get
IsEq<S>	LensLaws.getSet(S s)	set what you get
IsEq<Option<A>>	TraversalLaws.headOption(S s)	headOption returns the first element of getAll
IsEq<Either<String,S>>	IsoLaws.modifyEitherFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Either<String,S>>	LensLaws.modifyEitherFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Either<String,S>>	OptionalLaws.modifyEitherFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Either<String,S>>	PrismLaws.modifyEitherFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Either<String,S>>	TraversalLaws.modifyEitherFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	IsoLaws.modifyFunctionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	LensLaws.modifyFunctionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	OptionalLaws.modifyFunctionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	PrismLaws.modifyFunctionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	TraversalLaws.modifyFunctionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	IsoLaws.modifyIdentity(S s)	modify id = id
IsEq<S>	LensLaws.modifyIdentity(S s)	modify id = id
IsEq<S>	OptionalLaws.modifyIdentity(S s)	modify id = id
IsEq<S>	PrismLaws.modifyIdentity(S s)	modify id = id
IsEq<S>	SetterLaws.modifyIdentity(S s)	modify id = id
IsEq<S>	TraversalLaws.modifyIdentity(S s)	modify id = id
IsEq<List<S>>	IsoLaws.modifyIterableFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<List<S>>	LensLaws.modifyIterableFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<List<S>>	OptionalLaws.modifyIterableFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<List<S>>	PrismLaws.modifyIterableFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<List<S>>	TraversalLaws.modifyIterableFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Option<S>>	IsoLaws.modifyOptionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Option<S>>	LensLaws.modifyOptionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Option<S>>	OptionalLaws.modifyOptionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Option<S>>	PrismLaws.modifyOptionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Option<S>>	TraversalLaws.modifyOptionFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Option<S>>	OptionalLaws.modifyOptionIdentity(S s)	modifyOption with id is isomorphomic to isMatching
IsEq<Option<S>>	PrismLaws.modifyOptionIdentity(S s)	modifyOption with id is isomorphomic to isMatching
IsEq<Pair<S,S>>	IsoLaws.modifyPairFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Pair<S,S>>	LensLaws.modifyPairFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Pair<S,S>>	OptionalLaws.modifyPairFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Pair<S,S>>	PrismLaws.modifyPairFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<Pair<S,S>>	TraversalLaws.modifyPairFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	IsoLaws.modifySupplierFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	LensLaws.modifySupplierFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	OptionalLaws.modifySupplierFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	PrismLaws.modifySupplierFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	TraversalLaws.modifySupplierFPoint(S s)	modifyF Applicative.point(_) = Applicative.point(_)
IsEq<S>	PrismLaws.partialRoundTripOneWay(S s)	if a Prism match you can always go back to the source
IsEq<S>	IsoLaws.roundTripOneWay(S s)	get and reverseGet forms an Isomorphism: round trip one way
IsEq<A>	IsoLaws.roundTripOtherWay(A a)	get and reverseGet forms an Isomorphism: round trip other way
IsEq<Option<A>>	PrismLaws.roundTripOtherWay(A a)	reverseGet produces a value
IsEq<S>	IsoLaws.set(S s, A a)	set is a weaker version of reverseGet
IsEq<A>	LensLaws.setGet(S s, A a)	get what you set
IsEq<List<A>>	TraversalLaws.setGetAll(S s, A a)	get what you set.
IsEq<Option<A>>	OptionalLaws.setGetOption(S s, A a)	get what you set
IsEq<S>	LensLaws.setIdempotent(S s, A a)	set idempotent
IsEq<S>	OptionalLaws.setIdempotent(S s, A a)	set idempotent
IsEq<S>	SetterLaws.setIdempotent(S s, A a)	set idempotent
IsEq<S>	TraversalLaws.setIdempotent(S s, A a)	set idempotent
IsEq<Option<S>>	OptionalLaws.setOption(S s, A a)	setOption only succeeds when the Optional is matching
IsEq<Option<S>>	PrismLaws.setOption(S s, A a)	setOption only succeeds when the Prism is matching