Uses of Interface
com.m3.scalaflavor4j.Function1

Packages that use Function1

Package	Description
com.m3.scalaflavor4j
com.m3.scalaflavor4j.arm

Uses of Function1 in com.m3.scalaflavor4j

Subinterfaces of Function1 in com.m3.scalaflavor4j

Modifier and Type	Interface and Description
interface	F1<T1,R> Function1 alias
interface	FlatMapF1<T1,U> Function1 alias for Seq#flatMap(F1)
interface	Guard<M> Guard function
interface	PredicateF1<T1> Function1 alias for predicate functions

Classes in com.m3.scalaflavor4j that implement Function1

Modifier and Type	Class and Description
class	CaseClause<M,R> CaseClause
static class	ExceptionControl.Catch<R> scala.util.control.Exception.Catch
class	PartialF<R> PartialFunction alias
class	PartialFunction<R> A partial function of type PartialFunction[A, B] is a unary function where the domain does not necessarily include all values of type A.
class	RichFunction1<T1,R> A function of 1 parameter.

Methods in com.m3.scalaflavor4j that return Function1

Modifier and Type	Method and Description
abstract <U> Function1<Function2<T,U,Boolean>,Boolean>	Seq.corresponds(Seq<U> that) Curried Seq.corresponds(Seq)
<U> Function1<Function2<T,U,Boolean>,Boolean>	Nil.corresponds(Seq<U> that)
<U> Function1<Function2<T,U,Boolean>,Boolean>	IndexedSeq.corresponds(Seq<U> that)
Function1<T1,Function1<T2,Function1<T3,R>>>	RichFunction3.curried() Creates a curried version of this function.
<U> Function1<Function1<T,U>,U>	Some.fold(U ifEmpty)
abstract <U> Function1<Function1<T,U>,U>	Option.fold(U ifEmpty)
<U> Function1<Function1<T,U>,U>	None.fold(U ifEmpty)
abstract <U> Function1<Function2<U,T,U>,U>	Seq.foldLeft(U z) Curried Seq.foldLeft(Object, Function2)
<U> Function1<Function2<U,T,U>,U>	Nil.foldLeft(U z)
<U> Function1<Function2<U,T,U>,U>	IndexedSeq.foldLeft(U z)
abstract <U> Function1<Function2<T,U,U>,U>	Seq.foldRight(U z) Curried Seq.foldRight(Object, Function2)
<U> Function1<Function2<T,U,U>,U>	Nil.foldRight(U z)
<U> Function1<Function2<T,U,U>,U>	IndexedSeq.foldRight(U z)
abstract <U> Function1<Function2<U,T,U>,Seq<U>>	Seq.scanLeft(U z) Curried Seq.scanLeft(Object, Function2)
<U> Function1<Function2<U,T,U>,Seq<U>>	Nil.scanLeft(U z)
<U> Function1<Function2<U,T,U>,Seq<U>>	IndexedSeq.scanLeft(U z)
abstract <U> Function1<Function2<T,U,U>,Seq<U>>	Seq.scanRight(U z) Curried Seq.scanRight(Object, Function2)
<U> Function1<Function2<T,U,U>,Seq<U>>	Nil.scanRight(U z)
<U> Function1<Function2<T,U,U>,Seq<U>>	IndexedSeq.scanRight(U z)

Methods in com.m3.scalaflavor4j that return types with arguments of type Function1

Modifier and Type	Method and Description
F1<T1,Function1<T2,Function1<T3,Function1<T4,Function1<T5,R>>>>>	RichFunction5.curried() Creates a curried version of this function.
F1<T1,Function1<T2,Function1<T3,Function1<T4,Function1<T5,R>>>>>	RichFunction5.curried() Creates a curried version of this function.
F1<T1,Function1<T2,Function1<T3,Function1<T4,Function1<T5,R>>>>>	RichFunction5.curried() Creates a curried version of this function.
F1<T1,Function1<T2,Function1<T3,Function1<T4,Function1<T5,R>>>>>	RichFunction5.curried() Creates a curried version of this function.
F1<T1,Function1<T2,Function1<T3,Function1<T4,R>>>>	RichFunction4.curried() Creates a curried version of this function.
F1<T1,Function1<T2,Function1<T3,Function1<T4,R>>>>	RichFunction4.curried() Creates a curried version of this function.
F1<T1,Function1<T2,Function1<T3,Function1<T4,R>>>>	RichFunction4.curried() Creates a curried version of this function.
Function1<T1,Function1<T2,Function1<T3,R>>>	RichFunction3.curried() Creates a curried version of this function.
Function1<T1,Function1<T2,Function1<T3,R>>>	RichFunction3.curried() Creates a curried version of this function.
F1<T1,Function1<T2,R>>	RichFunction2.curried() Creates a curried version of this function.
<U> Function1<Function1<T,U>,U>	Some.fold(U ifEmpty)
abstract <U> Function1<Function1<T,U>,U>	Option.fold(U ifEmpty)
<U> Function1<Function1<T,U>,U>	None.fold(U ifEmpty)

Methods in com.m3.scalaflavor4j with parameters of type Function1

Modifier and Type	Method and Description
<R> CaseClause<M,R>	CaseClause.CaseClauseBuilder._arrow(Function1<M,R> block)
<R> ExceptionControl.Catch<R>	ExceptionControl.HandlingByBuilder.by(Function1<Throwable,R> f)
abstract int	Seq.count(Function1<T,Boolean> p) Counts the number of elements in the sequence which satisfy a predicate.
abstract int	ParSeq.count(Function1<T,Boolean> predicate) Counts the number of elements in the sequence which satisfy a predicate.
int	Nil.count(Function1<T,Boolean> p)
int	IndexedSeq.count(Function1<T,Boolean> predicate)
int	ForkJoinParSeq.count(Function1<T,Boolean> predicate)
abstract Seq<T>	Seq.dropWhile(Function1<T,Boolean> p) Drops longest prefix of elements that satisfy a predicate.
Seq<T>	Nil.dropWhile(Function1<T,Boolean> p)
IndexedSeq<T>	IndexedSeq.dropWhile(Function1<T,Boolean> predicate)
abstract boolean	Seq.exists(Function1<T,Boolean> p) Tests whether a predicate holds for some of the elements of this sequence.
abstract boolean	ParSeq.exists(Function1<T,Boolean> p) Tests whether a predicate holds for some of the elements of this sequence.
boolean	Nil.exists(Function1<T,Boolean> p)
boolean	IndexedSeq.exists(Function1<T,Boolean> predicate)
boolean	ForkJoinParSeq.exists(Function1<T,Boolean> predicate)
Option<T>	Some.filter(Function1<T,Boolean> f)
abstract Seq<T>	Seq.filter(Function1<T,Boolean> f) Selects all elements of this sequence which satisfy a predicate.
abstract ParSeq<T>	ParSeq.filter(Function1<T,Boolean> f) Selects all elements of this sequence which satisfy a predicate.
abstract Option<T>	Option.filter(Function1<T,Boolean> f) Selects all elements of this sequence which satisfy a predicate.
Option<T>	None.filter(Function1<T,Boolean> f)
Seq<T>	Nil.filter(Function1<T,Boolean> f)
IndexedSeq<T>	IndexedSeq.filter(Function1<T,Boolean> isOk)
ParSeq<T>	ForkJoinParSeq.filter(Function1<T,Boolean> predicate)
SMap<K,V>	SMap.filter(Function1<Tuple2<K,V>,Boolean> f) Selects all elements of this immutable map which satisfy a predicate.
abstract Seq<T>	Seq.filterNot(Function1<T,Boolean> f) Selects all elements of this immutable sequence which do not satisfy a predicate.
abstract ParSeq<T>	ParSeq.filterNot(Function1<T,Boolean> f) Selects all elements of this immutable sequence which do not satisfy a predicate.
Seq<T>	Nil.filterNot(Function1<T,Boolean> f)
IndexedSeq<T>	IndexedSeq.filterNot(Function1<T,Boolean> isOk)
ParSeq<T>	ForkJoinParSeq.filterNot(Function1<T,Boolean> predicate)
abstract Option<T>	Seq.find(Function1<T,Boolean> p) Finds the first element of the sequence satisfying a predicate, if any.
Option<T>	Nil.find(Function1<T,Boolean> p)
Option<T>	IndexedSeq.find(Function1<T,Boolean> predicate)
abstract <U> Seq<U>	Seq.flatMap(Function1<T,CollectionLike<U>> f) Builds a new collection by applying a function to all elements of this sequence and concatenating the results.
abstract <U> ParSeq<U>	ParSeq.flatMap(Function1<T,CollectionLike<U>> f) Builds a new collection by applying a function to all elements of this sequence and concatenating the results.
<U> Seq<U>	Nil.flatMap(Function1<T,CollectionLike<U>> f)
<U> IndexedSeq<U>	IndexedSeq.flatMap(Function1<T,CollectionLike<U>> f)
<U> CollectionLike<U>	Generator.flatMap(Function1<T,CollectionLike<U>> f)
<U> ParSeq<U>	ForkJoinParSeq.flatMap(Function1<T,CollectionLike<U>> f)
<U> Option<U>	Some.flatMap(Function1<T,Option<U>> f)
abstract <U> Option<U>	Option.flatMap(Function1<T,Option<U>> f) Returns the result of applying f to this Option's value if this Option is nonempty.
<U> Option<U>	None.flatMap(Function1<T,Option<U>> f)
<U> U	Some.fold(U ifEmpty, Function1<T,U> f)
abstract <U> U	Option.fold(U ifEmpty, Function1<T,U> f) Returns the result of applying $f to this $option's value if the $option is nonempty.
<U> U	None.fold(U ifEmpty, Function1<T,U> f)
abstract boolean	Seq.forall(Function1<T,Boolean> p) Tests whether a predicate holds for all elements of this sequence.
abstract boolean	ParSeq.forall(Function1<T,Boolean> p) Tests whether a predicate holds for all elements of this sequence.
boolean	Nil.forall(Function1<T,Boolean> p)
boolean	IndexedSeq.forall(Function1<T,Boolean> predicate)
boolean	ForkJoinParSeq.forall(Function1<T,Boolean> predicate)
abstract <U> SMap<U,Seq<T>>	Seq.groupBy(Function1<T,U> f) Partitions this sequence into a map of sequences according to some discriminator function.
abstract <U> SMap<U,Seq<T>>	ParSeq.groupBy(Function1<T,U> f) Partitions this sequence into a map of sequences according to some discriminator function.
<U> SMap<U,Seq<T>>	Nil.groupBy(Function1<T,U> f)
<U> SMap<U,Seq<T>>	IndexedSeq.groupBy(Function1<T,U> getGroupName)
<U> SMap<U,Seq<T>>	ForkJoinParSeq.groupBy(Function1<T,U> getGroupName)
<U> Option<U>	Some.map(Function1<T,U> f)
abstract <U> Seq<U>	Seq.map(Function1<T,U> f) Builds a new collection by applying a function to all elements of this sequence.
abstract <U> ParSeq<U>	ParSeq.map(Function1<T,U> f) Builds a new collection by applying a function to all elements of this sequence.
abstract <U> Option<U>	Option.map(Function1<T,U> f) Builds a new collection by applying a function to all elements of this sequence.
<U> Option<U>	None.map(Function1<T,U> f)
<U> Seq<U>	Nil.map(Function1<T,U> f)
<U> IndexedSeq<U>	IndexedSeq.map(Function1<T,U> f)
<U> CollectionLike<U>	Generator.map(Function1<T,U> f)
<U> ParSeq<U>	ForkJoinParSeq.map(Function1<T,U> f)
<L,M> SMap<L,M>	SMap.map(Function1<Tuple2<K,V>,Tuple2<L,M>> f) Builds a new collection by applying a function to all elements of this immutable map.
L	Right.mergeToLeft(Function1<R,L> rightToLeft)
L	Left.mergeToLeft(Function1<R,L> rightToLeft)
abstract L	Either.mergeToLeft(Function1<R,L> rightToLeft) Returns merged value to the Left type.
R	Right.mergeToRight(Function1<L,R> leftToRight)
R	Left.mergeToRight(Function1<L,R> leftToRight)
abstract R	Either.mergeToRight(Function1<L,R> leftToRight) Returns merged value to the Right type.
abstract Tuple2<Seq<T>,Seq<T>>	Seq.partition(Function1<T,Boolean> p) Partitions this sequence in two sequences according to a predicate.
Tuple2<Seq<T>,Seq<T>>	Nil.partition(Function1<T,Boolean> p)
Tuple2<Seq<T>,Seq<T>>	IndexedSeq.partition(Function1<T,Boolean> predicate)
abstract <U> Seq<U>	Seq.reverseMap(Function1<T,U> f) Builds a new collection by applying a function to all elements of this sequence and collecting the results in reversed order.
<U> Seq<U>	Nil.reverseMap(Function1<T,U> f)
<U> IndexedSeq<U>	IndexedSeq.reverseMap(Function1<T,U> f)
abstract Tuple2<Seq<T>,Seq<T>>	Seq.span(Function1<T,Boolean> p) Splits this sequence into a prefix/suffix pair according to a predicate.
Tuple2<Seq<T>,Seq<T>>	Nil.span(Function1<T,Boolean> p)
Tuple2<Seq<T>,Seq<T>>	IndexedSeq.span(Function1<T,Boolean> predicate)
abstract Seq<T>	Seq.takeWhile(Function1<T,Boolean> p) Takes longest prefix of elements that satisfy a predicate.
Seq<T>	Nil.takeWhile(Function1<T,Boolean> p)
IndexedSeq<T>	IndexedSeq.takeWhile(Function1<T,Boolean> predicate)
<R> ExceptionControl.Catch<R>	ExceptionControl.CatchBuilder.withApply(Function1<Throwable,R> f) Create a new Catch with the same isDefinedAt logic as this one, but with the supplied apply method replacing the current one.
<U,V extends CollectionLike<U>> V	ForComprehension1.yield(Function1<T,U> f)
<U,V extends CollectionLike<U>> V	ForComprehension2.yield(Function1<Tuple2<T1,T2>,U> f)
<U,V extends CollectionLike<U>> V	ForComprehension3.yield(Function1<Tuple3<T1,T2,T3>,U> f)
<U,V extends CollectionLike<U>> V	ForComprehension4.yield(Function1<Tuple4<T1,T2,T3,T4>,U> f)
<U,V extends CollectionLike<U>> V	ForComprehension5.yield(Function1<Tuple5<T1,T2,T3,T4,T5>,U> f)

Constructors in com.m3.scalaflavor4j with parameters of type Function1

Constructor and Description
ExceptionControl.Catch(Seq<Class<? extends Throwable>> classes, Function1<Throwable,R> withApply)
ExceptionControl.Catch(Seq<Class<? extends Throwable>> classes, Function1<Throwable,R> withApply, boolean promiscuously)
RichFunction1(Function1<T1,R> f)

Uses of Function1 in com.m3.scalaflavor4j.arm

Methods in com.m3.scalaflavor4j.arm with parameters of type Function1

Modifier and Type	Method and Description
<B> B	ManagedResource.map(Function1<R,B> f)