Interface Functor<A,F extends Functor<?,F>>
- Type Parameters:
A- The type of the parameterF- The unification parameter
- All Known Subinterfaces:
Applicative<A,,App> BiMonoidFactory<A,,B, C> BiPredicate<A,,B> BiSemigroupFactory<A,,B, C> Effect<A>,Fn0<A>,Fn1<A,,B> Fn2<A,,B, C> Fn3<A,,B, C, D> Fn4<A,,B, C, D, E> Fn5<A,,B, C, D, E, F> Fn6<A,,B, C, D, E, F, G> Fn7<A,,B, C, D, E, F, G, H> Fn8<A,,B, C, D, E, F, G, H, I> Iso<S,,T, A, B> Iso.Simple<S,,A> Kleisli<A,,B, M, MB> Lens<S,,T, A, B> Lens.Simple<S,,A> Monad<A,,M> MonadError<E,,A, M> MonadReader<R,,A, MR> MonadRec<A,,M> MonadT<M,,A, MT, T> MonadWriter<W,,A, MW> Monoid<A>,MonoidFactory<A,,B> Predicate<A>,Prism<S,,T, A, B> Prism.Simple<S,,A> Schema<Values>,Semigroup<A>,SemigroupFactory<A,,B> Traversable<A,,T> TypeSafeKey<A,,B> TypeSafeKey.Simple<A>
- All Known Implementing Classes:
$,Absent,AddAll,All,Alter,And,Any,AutoBracket,Between,Both,Bracket,CartesianProduct,CatMaybes,Choice2,Choice2._A,Choice2._B,Choice3,Choice3._A,Choice3._B,Choice3._C,Choice4,Choice4._A,Choice4._B,Choice4._C,Choice4._D,Choice5,Choice5._A,Choice5._B,Choice5._C,Choice5._D,Choice5._E,Choice6,Choice6._A,Choice6._B,Choice6._C,Choice6._D,Choice6._E,Choice6._F,Choice7,Choice7._A,Choice7._B,Choice7._C,Choice7._D,Choice7._E,Choice7._F,Choice7._G,Choice8,Choice8._A,Choice8._B,Choice8._C,Choice8._D,Choice8._E,Choice8._F,Choice8._G,Choice8._H,Clamp,CmpEq,CmpEqBy,CmpEqWith,Coalesce,Collapse,Collapse,Compare,Compose,Compose,Compose,Concat,Cons,Const,Constantly,Cycle,Difference,Distinct,Downcast,Drop,DropWhile,Either,Either.Left,Either.Right,EitherT,Empty,Endo,EndoK,Eq,Filter,Find,First,Flatten,FoldLeft,FoldRight,Force,GroupBy,GT,GTBy,GTE,GTEBy,GTEWith,GTWith,Head,Id,Identity,IdentityT,IfThenElse,InGroupsOf,Init,Inits,Intersection,Intersperse,Into,Into1,Into3,Into4,Into5,Into6,Into7,Into8,IO,IO.Compose,Iterate,IterateT,Join,LambdaIterable,LambdaMap,Last,Last,Lazy,Lazy.Compose,Lazy.Later,LazyRec,LazyT,LeftAll,LeftAll,LeftAny,LeftAny,LiftA2,LiftA3,LiftA4,LiftA5,LiftA6,LiftA7,LT,LTBy,LTE,LTEBy,LTEWith,LTWith,Magnetize,MagnetizeBy,Map,Market,Matching,Max,MaxBy,MaxWith,Maybe,Maybe.Just,Maybe.Nothing,MaybeT,Merge,Merge,MergeHMaps,MergeMaps,Min,MinBy,MinWith,Not,Occurrences,Or,Over,Partition,Peek,Peek2,Pre,PrependAll,Present,PutAll,RateLimit,Re,ReaderT,RecursiveResult,RecursiveResult.Recurse,RecursiveResult.Terminate,ReduceLeft,ReduceRight,Repeat,Replicate,Reverse,RightAll,RightAll,RightAny,RightAny,RunAll,RunAll,SafeT,ScanLeft,Sequence,Set,SingletonHList,Size,Slide,Snoc,Sort,SortBy,SortWith,Span,State,StateT,Tagged,Tail,Tails,Take,TakeWhile,These,These._A,These._B,These.Both,Times,ToArray,ToCollection,ToMap,Trampoline,Trivial,Try,Try.Failure,Try.Success,Tuple2,Tuple3,Tuple4,Tuple5,Tuple6,Tuple7,Tuple8,Tupler2,Uncons,Under,Unfoldr,Union,Until,Upcast,View,Writer,WriterT,Xor,Zip,ZipWith
- Functional Interface:
- This is a functional interface and can therefore be used as the assignment target for a lambda expression or method reference.
An interface for the generic covariant functorial operation
map over some parameter A.
Functors are foundational to many of the classes provided by this library; generally, anything that can be thought of
as "mappable" is an instance of at least this interface.
For more information, read about Functors.
- See Also:
-
Method Summary
Modifier and TypeMethodDescriptioncoerce()Convenience method for coercing this functor instance into another concrete type.Covariantly transmute this functor's parameter using the given mapping function.
-
Method Details
-
fmap
Covariantly transmute this functor's parameter using the given mapping function. Generally this method is specialized to return an instance of the class implementing Functor.- Type Parameters:
B- the new parameter type- Parameters:
fn- the mapping function- Returns:
- a functor over B (the new parameter type)
-
coerce
Convenience method for coercing this functor instance into another concrete type. Unsafe.- Type Parameters:
Concrete- the concrete functor instance to coerce this functor to- Returns:
- the coerced functor
-