cyclops.instances.reactive.collections.mutable.QueueXInstances 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.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.QueueX;
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.queue;
import static cyclops.reactive.collections.mutable.QueueX.narrowK;

/**
 * Companion class for creating Type Class instances for working with Queues
 * @author johnmcclean
 *
 */
@UtilityClass
public class QueueXInstances {
    public static  Kleisli, T> kindKleisli() {
        return Kleisli.of(QueueXInstances.monad(), QueueX::widen);
    }

    public static  Cokleisli> kindCokleisli() {
        return Cokleisli.of(QueueX::narrowK);
    }

    public static  Nested nested(QueueX> nested, InstanceDefinitions def2) {
        return Nested.of(nested, QueueXInstances.definitions(), def2);
    }

    public static  Product product(QueueX q, Active active) {
        return Product.of(allTypeclasses(q), active);
    }

    public static  Coproduct coproduct(QueueX q, InstanceDefinitions def2) {
        return Coproduct.right(q, def2, QueueXInstances.definitions());
    }

    public static  Active allTypeclasses(QueueX q) {
        return Active.of(q, QueueXInstances.definitions());
    }

    public static  Nested mapM(QueueX q, Function> fn, InstanceDefinitions defs) {
        return Nested.of(q.map(fn), QueueXInstances.definitions(), defs);
    }

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

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

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

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

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

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

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

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

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

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

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

            @Override
            public  Option> unfoldable() {
                return Option.some(QueueXInstances.unfoldable());
            }
        };
    }

    public static Pure unit() {
        return INSTANCE;
    }

    private final static QueueXTypeClasses INSTANCE = new QueueXTypeClasses();

    @AllArgsConstructor
    @Wither
    public static class QueueXTypeClasses implements MonadPlus,
        MonadRec,
        TraverseByTraverse,
        Foldable,
        Unfoldable {

        private final MonoidK monoidK;

        public QueueXTypeClasses() {
            monoidK = MonoidKs.queueXConcat();
        }

        @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 QueueX.of(value);
        }

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


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

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

}