cyclops.instances.reactive.collections.immutable.PersistentSetXInstances 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
Platform for Functional Reactive Programming with Java 8
The newest version!
package cyclops.instances.reactive.collections.immutable;

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.immutable.PersistentSetX;
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.persistentSetX;
import static cyclops.reactive.collections.immutable.PersistentSetX.narrowK;

@UtilityClass
public class PersistentSetXInstances {

  public static   Kleisli,T> kindKleisli(){
    return Kleisli.of(PersistentSetXInstances.monad(), PersistentSetX::widen);
  }
  public static   Cokleisli> kindCokleisli(){
    return Cokleisli.of(PersistentSetX::narrowK);
  }
  public static  Nested nested(PersistentSetX> nested, InstanceDefinitions def2){
    return Nested.of(nested, PersistentSetXInstances.definitions(),def2);
  }
  public static   Product product(PersistentSetX s, Active active){
    return Product.of(allTypeclasses(s),active);
  }
  public static   Coproduct coproduct(PersistentSetX s, InstanceDefinitions def2){
    return Coproduct.right(s,def2, PersistentSetXInstances.definitions());
  }
  public static   Active allTypeclasses(PersistentSetX s){
    return Active.of(s, PersistentSetXInstances.definitions());
  }
  public static   Nested mapM(PersistentSetX s,Function> fn, InstanceDefinitions defs){
    return Nested.of(s.map(fn), PersistentSetXInstances.definitions(), defs);
  }


  public static InstanceDefinitions definitions(){
    return new InstanceDefinitions() {
      @Override
      public  Functor functor() {
        return PersistentSetXInstances.functor();
      }

      @Override
      public  Pure unit() {
        return PersistentSetXInstances.unit();
      }

      @Override
      public  Applicative applicative() {
        return PersistentSetXInstances.zippingApplicative();
      }

      @Override
      public  Monad monad() {
        return PersistentSetXInstances.monad();
      }

      @Override
      public  Option> monadZero() {
        return Option.some(PersistentSetXInstances.monadZero());
      }

      @Override
      public  Option> monadPlus() {
        return Option.some(PersistentSetXInstances.monadPlus());
      }

      @Override
      public  MonadRec monadRec() {
        return PersistentSetXInstances.monadRec();
      }

      @Override
      public  Option> monadPlus(MonoidK m) {
        return Option.some(PersistentSetXInstances.monadPlus(m));
      }

      @Override
      public  Traverse traverse() {
        return PersistentSetXInstances.traverse();
      }

      @Override
      public  Foldable foldable() {
        return PersistentSetXInstances.foldable();
      }

      @Override
      public  Option> comonad() {
        return Maybe.nothing();
      }
      @Override
      public  Option> unfoldable() {
        return Option.some(PersistentSetXInstances.unfoldable());
      }
    };

  }

    public static Pure unit() {
      return INSTANCE;
    }

    private final static PersistentSetXTypeClasses INSTANCE = new PersistentSetXTypeClasses();
    @AllArgsConstructor
    @Wither
    public static class PersistentSetXTypeClasses implements MonadPlus,
        MonadRec,
        TraverseByTraverse,
        Foldable,
        Unfoldable{

        private final MonoidK monoidK;
        public PersistentSetXTypeClasses(){
            monoidK = MonoidKs.persistentSetXConcat();
        }
        @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 PersistentSetX.of(value);
        }

        @Override
        public  Higher map(Function fn, Higher ds) {
            return narrowK(ds).map(fn);
        }


        @Override
        public  Higher tailRec(T initial, Function>> fn) {
            return PersistentSetX.tailRec(initial,i->narrowK(fn.apply(i)));
        }

        @Override
        public  Higher> traverseA(Applicative ap, Function> fn, Higher ds) {
            PersistentSetX v = narrowK(ds);
            return v.>>foldLeft(ap.unit(PersistentSetX.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) {
            PersistentSetX 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 PersistentSetX.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;
    }

}