Fn0<Boolean>s
.letters
.boolean
value.anyOf(
equalTo(o1), equalTo(o2), ..., equalTo(on))
Fn0<Boolean>s
.Do
(sideeffect).null
, empty, or
all characters are whitespace
.Fn0<Boolean>s
, starting with the one
given to this method.Comparable
, to
an external Comparator
.cause
of a Throwable
.characters
.name
of a Class
.List
.Maps.combine(..)
string representation
of an arbitrary object, i.e.Fn0<Boolean>s
which must all evaluate
to true
for the conjunction to yield true
,
otherwise it yields false
.Iterable
.Fn0<Boolean>s
which evaluates to true
only when at least one of the
premises yields true.void
.Do
does nothing.either(
equalTo(o))
.Fn0<Boolean>s
,
starting with the one given to this method.Iterable
is empty.Comparator
augmented with various methods to refine its functionality.Fn
which resolves enum constants from names (String
).Fn0
.exists(
equalTo(element))
Fn
s which each will be given said object to obtain
the elements.null
values is evaluated as false.Fn
, where the result of
each function is passed to its successor, and the last will yield the
actual result of the chain.Fn2
, where the result of
each function is passed to its successor, and the last will yield the
actual result of the chain.Runnable
s as a single Runnable which will
execute the given Runnables in sequence.Do
s to be executed in sequence.I
and
returning a value of type O
.Fn
simply yields any given argument as its result.I1
and I2
, and
returning a value of type O
.Fns
, where the result of the
first is passed as argument to the second.Optional
.package
of a Class
.hashCode
for objects, or 0 if null
.Iterator.hasNext()
method as a function.char
, or null
if the char
cannot be found.null
if the substring cannot be found.integer value
of any number.Base.equalTo(Object)
.true
for null
values.String
.String
with all
elements joined with the given separator.map entry
.contained in
the given Map
.null
, and ultimately yield the
last object.char
, or null
if the char
cannot be found.null
if the substring cannot be found.LazyVal
can be implemented
in place of an Fn0
to communicate
that the value yielded from the function is
a lazily calculated.long value
of any number.lower case
.Optional
to another type of Optional
.Optional
to another type of Optional
.Mapper
can be implemented
in place of an Fn
to communicate
that the functions maps values 1:1 to other values.maps
and map entries
.regular expression match
on strings.message
of a Throwable
.name
of enum constants.Member
, e.g.not whitespace
.not blank
and
each char satisfies a given predicate.not(
equalTo(o))
.true
for all non-null
values.digits
.Optional
wraps a value that is either defined or
undefined.null
in an Optional
.Optional
, using a predicate to
determine if the value should be treated as defined..orElse(null)
package name
of a Class
.PartialApplication
is used to build more specialized
functions from another function.T
, and evaluates it
as either true
or false
.Premise
is the same as a
Fn0<Boolean>
, e.g. a true
/false
value, or fact, that may or may not change over time.Iterable
and provides access to
various operations to view and/or transform the wrapped iterable.Print
to a PrintStream
.Print
to a PrintStream
,
each call adding a line feed at the end.Iterator
s not meant to remove
objects while iterating.Reducer
can be implemented
in place of an Fn2
to communicate
that the functions reduces two values to one.UnsupportedOperationException
if called.Do
s, in order to compute side effects.Iterator
interface, by requiring only
one method, SimpleIterator.nextIfAvailable()
, to be implemented instead of both
hasNext()
and next()
.simple name
of a Class
.List
of the contents of this iterable.List
of the contents of this iterable.char
delimiter.Character
predicate.strings
.double
value using Double.valueOf(String)
.int
value using Integer.valueOf(String)
.long
value using Long.valueOf(String)
.string representation
of
any object.Reflect.getClass
, with the additional
possible typing of the yielded Class
es.upper case
map entry
.contained in
the given Map
.Write
bytes to an OutputStream
.Copyright © 2016. All rights reserved.