- All
- Inst = default(All)
- Append (bool x, bool y)
- Empty ()
- And (bool a, bool b)
- BiCondition (bool a, bool b)
- False ()
- Implies (bool a, bool b)
- Not (bool a)
- Or (bool a, bool b)
- True ()
- XOr (bool a, bool b)
- Any
- Inst = default(Any)
- Append (bool x, bool y)
- Empty ()
- And (bool a, bool b)
- BiCondition (bool a, bool b)
- False ()
- Implies (bool a, bool b)
- Not (bool a)
- Or (bool a, bool b)
- True ()
- XOr (bool a, bool b)
- MCompositions <MonoidA, A>
- MError
- MHashMap <K, V>
- Inst = default(MHashMap<K, V>)
- Append (HashMap<K, V> x, HashMap<K, V> y)
- Count (HashMap<K, V> fa)
- Subtract (HashMap<K, V> x, HashMap<K, V> y)
- Empty ()
- Equals (HashMap<K, V> x, HashMap<K, V> y)
- Fold <S> (HashMap<K, V> fa, S state, Func<S, V, S> f)
- FoldBack <S> (HashMap<K, V> fa, S state, Func<S, V, S> f)
- GetHashCode (HashMap<K, V> x)
- EqualsAsync (HashMap<K, V> x, HashMap<K, V> y)
- GetHashCodeAsync (HashMap<K, V> x)
- MMap <K, V>
- Inst = default(MMap<K, V>)
- Append (Map<K, V> x, Map<K, V> y)
- Count (Map<K, V> fa)
- Subtract (Map<K, V> x, Map<K, V> y)
- Empty ()
- Equals (Map<K, V> x, Map<K, V> y)
- Fold <S> (Map<K, V> fa, S state, Func<S, V, S> f)
- FoldBack <S> (Map<K, V> fa, S state, Func<S, V, S> f)
- GetHashCode (Map<K, V> x)
- EqualsAsync (Map<K, V> x, Map<K, V> y)
- GetHashCodeAsync (Map<K, V> x)
- MOption <MonoidA, A>
- Inst = default(MOption<A>)
- None
- Bind <MonadB, MB, B> (Option<A> ma, Func<A, MB> f)
- BindAsync <MonadB, MB, B> (Option<A> ma, Func<A, MB> f)
- Fail (object err = null)
- Plus (Option<A> a, Option<A> b)
- Return (Func<Unit, A> f)
- Zero ()
- IsNone (Option<A> opt)
- IsSome (Option<A> opt)
- Match <B> (Option<A> opt, Func<A, B> Some, Func<B> None)
- Match <B> (Option<A> opt, Func<A, B> Some, B None)
- Match (Option<A> opt, Action<A> Some, Action None)
- MatchUnsafe <B> (Option<A> opt, Func<A, B> Some, Func<B> None)
- MatchUnsafe <B> (Option<A> opt, Func<A, B> Some, B None)
- Fold <S> (Option<A> ma, S state, Func<S, A, S> f)
- FoldBack <S> (Option<A> ma, S state, Func<S, A, S> f)
- BiFold <S> (Option<A> ma, S state, Func<S, A, S> fa, Func<S, Unit, S> fb)
- BiFoldBack <S> (Option<A> ma, S state, Func<S, A, S> fa, Func<S, Unit, S> fb)
- Count (Option<A> ma)
- Some (A x)
- Optional (A x)
- Run (Func<Unit, Option<A>> ma)
- BindReturn (Unit _, Option<A> mb)
- Return (A x)
- Empty ()
- Append (Option<A> x, Option<A> y)
- Equals (Option<A> x, Option<A> y)
- GetHashCode (Option<A> x)
- Apply (Func<A, A, A> f, Option<A> fa, Option<A> fb)
- Compare (Option<A> x, Option<A> y)
- ToAsync (Option<A> sa)
- EqualsAsync (Option<A> x, Option<A> y)
- GetHashCodeAsync (Option<A> x)
- CompareAsync (Option<A> x, Option<A> y)
- MPatch <EqA, A>
- Append (Patch<EqA, A> px, Patch<EqA, A> py)
- Empty ()
- Equals (Patch<EqA, A> x, Patch<EqA, A> y)
- GetHashCode (Patch<EqA, A> x)
- EqualsAsync (Patch<EqA, A> x, Patch<EqA, A> y)
- GetHashCodeAsync (Patch<EqA, A> x)
- MUnit
- Product <NUM, A>
- Sum <NUM, A>
Booleans form a monoid under disjunctions.
field All Inst = default(All) Source #
method bool BiCondition (bool a, bool b) Source #
Booleans form a monoid under conjunction.
field Any Inst = default(Any) Source #
method bool BiCondition (bool a, bool b) Source #
Error monoid
struct MHashMap <K, V> Source #
field MHashMap<K, V> Inst = default(MHashMap<K, V>) Source #
method int GetHashCode (HashMap<K, V> x) Source #
method Task<bool> EqualsAsync (HashMap<K, V> x, HashMap<K, V> y) Source #
method Task<int> GetHashCodeAsync (HashMap<K, V> x) Source #
field MMap<K, V> Inst = default(MMap<K, V>) Source #
method int GetHashCode (Map<K, V> x) Source #
method Task<bool> EqualsAsync (Map<K, V> x, Map<K, V> y) Source #
method Task<int> GetHashCodeAsync (Map<K, V> x) Source #
struct MOption <MonoidA, A> Source #
field MOption<A> Inst = default(MOption<A>) Source #
method MB Bind <MonadB, MB, B> (Option<A> ma, Func<A, MB> f) Source #
method MB BindAsync <MonadB, MB, B> (Option<A> ma, Func<A, MB> f) Source #
method B MatchUnsafe <B> (Option<A> opt, Func<A, B> Some, Func<B> None) Source #
method B MatchUnsafe <B> (Option<A> opt, Func<A, B> Some, B None) Source #
method S BiFoldBack <S> (Option<A> ma, S state, Func<S, A, S> fa, Func<S, Unit, S> fb) Source #
method Option<A> BindReturn (Unit _, Option<A> mb) Source #
method int GetHashCode (Option<A> x) Source #
method Task<bool> EqualsAsync (Option<A> x, Option<A> y) Source #
method Task<int> GetHashCodeAsync (Option<A> x) Source #
method Task<int> CompareAsync (Option<A> x, Option<A> y) Source #
struct MPatch <EqA, A> Source #
Monoid instance for Patch
method Patch<EqA, A> Append (Patch<EqA, A> px, Patch<EqA, A> py) Source #
Monoid append: produces a patch is a merged version of both provided patches.
method int GetHashCode (Patch<EqA, A> x) Source #
method Task<bool> EqualsAsync (Patch<EqA, A> x, Patch<EqA, A> y) Source #
method Task<int> GetHashCodeAsync (Patch<EqA, A> x) Source #