cyclops.instances.reactive.collections.mutable.SetXInstances Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of cyclops-pure Show documentation
Show all versions of cyclops-pure Show documentation
Platform for Functional Reactive Programming with Java 8
package cyclops.instances.reactive.collections.mutable;
import com.oath.cyclops.hkt.Higher;
import cyclops.arrow.Cokleisli;
import cyclops.arrow.Kleisli;
import cyclops.arrow.MonoidK;
import cyclops.arrow.MonoidKs;
import cyclops.control.Either;
import cyclops.control.Maybe;
import cyclops.control.Option;
import cyclops.data.tuple.Tuple2;
import cyclops.function.Monoid;
import cyclops.hkt.Active;
import cyclops.hkt.Coproduct;
import cyclops.hkt.Nested;
import cyclops.hkt.Product;
import cyclops.reactive.collections.mutable.SetX;
import cyclops.typeclasses.InstanceDefinitions;
import cyclops.typeclasses.Pure;
import cyclops.typeclasses.comonad.Comonad;
import cyclops.typeclasses.foldable.Foldable;
import cyclops.typeclasses.foldable.Unfoldable;
import cyclops.typeclasses.functor.Functor;
import cyclops.typeclasses.monad.Applicative;
import cyclops.typeclasses.monad.Monad;
import cyclops.typeclasses.monad.MonadPlus;
import cyclops.typeclasses.monad.MonadRec;
import cyclops.typeclasses.monad.MonadZero;
import cyclops.typeclasses.monad.Traverse;
import cyclops.typeclasses.monad.TraverseByTraverse;
import lombok.AllArgsConstructor;
import lombok.experimental.UtilityClass;
import lombok.experimental.Wither;
import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.function.Predicate;
import static com.oath.cyclops.data.ReactiveWitness.set;
@UtilityClass
public class SetXInstances {
public static Nested nested(SetX> nested, InstanceDefinitions def2){
return Nested.of(nested, SetXInstances.definitions(),def2);
}
public static Product product(SetX s, Active active){
return Product.of(allTypeclasses(s),active);
}
public static Coproduct coproduct(SetX s, InstanceDefinitions def2){
return Coproduct.right(s,def2, SetXInstances.definitions());
}
public static Active allTypeclasses(SetX s){
return Active.of(s, SetXInstances.definitions());
}
public static Nested mapM(SetX s,Function> fn, InstanceDefinitions defs){
return Nested.of(s.map(fn), SetXInstances.definitions(), defs);
}
public static Kleisli,T> kindKleisli(){
return Kleisli.of(SetXInstances.monad(), SetX::widen);
}
public static Cokleisli> kindCokleisli(){
return Cokleisli.of(SetX::narrowK);
}
public static InstanceDefinitions definitions(){
return new InstanceDefinitions() {
@Override
public Functor functor() {
return SetXInstances.functor();
}
@Override
public Pure unit() {
return SetXInstances.unit();
}
@Override
public Applicative applicative() {
return SetXInstances.zippingApplicative();
}
@Override
public Monad monad() {
return SetXInstances.monad();
}
@Override
public Option> monadZero() {
return Option.some(SetXInstances.monadZero());
}
@Override
public Option> monadPlus() {
return Option.some(SetXInstances.monadPlus());
}
@Override
public MonadRec monadRec() {
return SetXInstances.monadRec();
}
@Override
public Option> monadPlus(MonoidK m) {
return Option.some(SetXInstances.monadPlus(m));
}
@Override
public Traverse traverse() {
return SetXInstances.traverse();
}
@Override
public Foldable foldable() {
return SetXInstances.foldable();
}
@Override
public Option> comonad() {
return Maybe.nothing();
}
@Override
public Option> unfoldable() {
return Option.some(SetXInstances.unfoldable());
}
};
}
public static Pure unit() {
return INSTANCE;
}
private final static SetXTypeClasses INSTANCE = new SetXTypeClasses();
@AllArgsConstructor
@Wither
public static class SetXTypeClasses implements MonadPlus,
MonadRec,
TraverseByTraverse,
Foldable,
Unfoldable{
private final MonoidK monoidK;
public SetXTypeClasses(){
monoidK = MonoidKs.setXConcat();
}
@Override
public Higher filter(Predicate predicate, Higher ds) {
return narrowK(ds).filter(predicate);
}
@Override
public Higher> zip(Higher fa, Higher fb) {
return narrowK(fa).zip(narrowK(fb));
}
@Override
public Higher zip(Higher fa, Higher fb, BiFunction f) {
return narrowK(fa).zip(narrowK(fb),f);
}
@Override
public MonoidK monoid() {
return monoidK;
}
@Override
public Higher flatMap(Function> fn, Higher ds) {
return narrowK(ds).concatMap(i->narrowK(fn.apply(i)));
}
@Override
public Higher ap(Higher> fn, Higher apply) {
return narrowK(apply)
.zip(narrowK(fn),(a,b)->b.apply(a));
}
@Override
public Higher unit(T value) {
return SetX.of(value);
}
@Override
public Higher map(Function fn, Higher ds) {
return narrowK(ds).map(fn);
}
@Override
public Higher tailRec(T initial, Function>> fn) {
return SetX.tailRec(initial,i->narrowK(fn.apply(i)));
}
@Override
public Higher> traverseA(Applicative ap, Function> fn, Higher ds) {
SetX v = narrowK(ds);
return v.>>foldLeft(ap.unit(SetX.empty()),
(a, b) -> ap.zip(fn.apply(b), a, (sn, vec) -> narrowK(vec).plus(sn)));
}
@Override
public R foldMap(Monoid mb, Function fn, Higher ds) {
SetX x = narrowK(ds);
return x.foldLeft(mb.zero(),(a,b)->mb.apply(a,fn.apply(b)));
}
@Override
public Higher> zipWithIndex(Higher ds) {
return narrowK(ds).zipWithIndex();
}
@Override
public T foldRight(Monoid monoid, Higher ds) {
return narrowK(ds).foldRight(monoid);
}
@Override
public T foldLeft(Monoid monoid, Higher ds) {
return narrowK(ds).foldLeft(monoid);
}
@Override
public Higher unfold(T b, Function>> fn) {
return SetX.unfold(b,fn);
}
}
public static Unfoldable unfoldable(){
return INSTANCE;
}
public static MonadPlus monadPlus(MonoidK m){
return INSTANCE.withMonoidK(m);
}
public static Applicative zippingApplicative(){
return INSTANCE;
}
public static Functor functor(){
return INSTANCE;
}
public static Monad monad(){
return INSTANCE;
}
public static MonadZero monadZero(){
return INSTANCE;
}
public static MonadPlus monadPlus(){
return INSTANCE;
}
public static MonadRec monadRec(){
return INSTANCE;
}
public static Traverse traverse(){
return INSTANCE;
}
public static Foldable foldable(){
return INSTANCE;
}
public static Higher> widen2(Higher> flux) {
// a functor could be used (if C2 is a functor / one exists for C2 type)
// instead of casting
// cast seems safer as Higher must be a SetX
return (Higher) flux;
}
public static SetX narrowK(final Higher future) {
return (SetX) future;
}
public static SetX narrow(final Higher completableSet) {
return ((SetX) completableSet);
}
}