Uses of Class
fj.Ord
Packages that use Ord
Package
Description
Types that set the premise for the existence of Functional Java.
Common algebraic data types.
-
Uses of Ord in fj
Modifier and TypeFieldDescriptionstatic final Ord
<BigDecimal> Ord.bigdecimalOrd
An order instance for theBigDecimal
type.static final Ord
<BigInteger> Ord.bigintOrd
An order instance for theBigInteger
type.Ord.booleanOrd
An order instance for theboolean
type.Ord.byteOrd
An order instance for thebyte
type.Ord.charOrd
An order instance for thechar
type.Ord.doubleOrd
An order instance for thedouble
type.Ord.floatOrd
An order instance for thefloat
type.Ord.intOrd
An order instance for theint
type.Ord.longOrd
An order instance for thelong
type.Ord.naturalOrd
An order instance for theNatural
type.Ord.orderingOrd
An order instance for theOrdering
type.Ord.shortOrd
An order instance for theshort
type.static final Ord
<StringBuffer> Ord.stringBufferOrd
An order instance for theStringBuffer
type.static final Ord
<StringBuilder> Ord.stringBuilderOrd
An order instance for theStringBuffer
type.Ord.stringOrd
An order instance for theString
type.Ord.unitOrd
An order instance for theUnit
type.Modifier and TypeMethodDescriptionAn order instance for theArray
type.static <A extends Comparable<A>>
Ord<A> Ord.comparableOrd()
An order instance for theComparable
interface.static <A,
B> Ord <A> Static version ofcontramap(F)
<B> Ord
<B> Maps the given function across this ord as a contra-variant functor.An order instance for theEither
type.An order instance for theList
type.static <A> Ord
<NonEmptyList<A>> Ord.nonEmptyListOrd
(Ord<A> oa) An order instance for theNonEmptyList
type.An order instance for theOption
type.Ord.Definition.ord()
Build an ord instance from this definition.static <A> Ord
<A> Returns an order instance that uses the given equality test and ordering function.static <A> Ord
<A> Returns an order instance that uses the given equality test and ordering function.static <A> Ord
<A> Ord.ordDef
(Ord.AltDefinition<A> def) Returns an order instance that uses the given minimal equality test and ordering definition.static <A> Ord
<A> Ord.ordDef
(Ord.Definition<A> def) Returns an order instance that uses the given minimal equality test and ordering definition.An order instance for a product-1.An order instance for a product-2, with the first factor considered most significant.An order instance for a product-3, with the first factor considered most significant.Ord.reverse()
Return a seq ord using the given value ord.An order instance for theSet
type.An order instance for theStream
type.static <A,
B> Ord <Validation<A, B>> Ord.validationOrd
(Ord<A> oa, Ord<B> ob) An order instance for theValidation
type.Modifier and TypeMethodDescriptionAn order instance for theArray
type.static <A,
B> Ord <A> Static version ofcontramap(F)
An order instance for theEither
type.An order instance for theList
type.Promotes this function to map over a Set.static <A> Ord
<NonEmptyList<A>> Ord.nonEmptyListOrd
(Ord<A> oa) An order instance for theNonEmptyList
type.static <A,
B> Ord.Definition <A> Begin definition of an ord instance.An order instance for theOption
type.An order instance for a product-1.An order instance for a product-2, with the first factor considered most significant.An order instance for a product-3, with the first factor considered most significant.Return a seq ord using the given value ord.Promotes this function to return its value in a Set.Promotes this function to a function on Sets.A union monoid for sets.An order instance for theSet
type.An order instance for theStream
type.default <B> Ord.Definition
<A> Refine this ord definition: compares using self and if objects are equal compares using givenOrd
.static <A,
B> Ord <Validation<A, B>> Ord.validationOrd
(Ord<A> oa, Ord<B> ob) An order instance for theValidation
type.Promotes this function to zip two sets, applying the function lock-step over both sets. -
Uses of Ord in fj.data
Modifier and TypeMethodDescriptionSet.ord()
Returns the order of this Set.An Ord instance for Zippers.Enumerator.order()
Returns the ordering for the enumerator.Modifier and TypeMethodDescriptionstatic <A> Set
<A> Return the elements of the given iterator as a set.static <K,
V> TreeMap <K, V> TreeMap.arrayTreeMap
(Ord<K> keyOrd, P2<K, V>... ps) Constructs a tree map from the given elements.private static <A> Set
<A> final <B> Set
<B> Binds the given function across this set.static <A> Set
<A> The empty set.static <K,
V> TreeMap <K, V> Constructs an empty tree map.static <A> Enumerator
<A> Enumerator.enumerator
(F<A, Option<A>> successor, F<A, Option<A>> predecessor, Option<A> max, Option<A> min, Ord<A> order) Construct an enumerator.static <A> Enumerator
<A> Enumerator.enumerator
(F<A, Option<A>> successor, F<A, Option<A>> predecessor, Option<A> max, Option<A> min, Ord<A> order, F<A, F<Long, Option<A>>> plus) Construct an enumerator.static <K,
V> TreeMap <K, V> TreeMap.fromMutableMap
(Ord<K> ord, Map<K, V> m) An immutable projection of the given mutable map.final <B,
C, D> TreeMap <B, D> List.groupBy
(F<A, B> keyFunction, F<A, C> valueFunction, D groupingIdentity, F2<C, D, D> groupingAcc, Ord<B> keyOrd) Groups the elements of this list by a given keyFunction, applies the valueFunction and accumulates the mapped values with the given grouping accumulator function on the grouping identity.final <B,
C> TreeMap <B, C> Groups the elements of this list by a given keyFunction into aTreeMap
and transforms the matching elements with the given valueFunction.Groups the elements of this list by a given keyFunction into aTreeMap
and transforms the matching elements with the given valueFunction.Groups the elements of this list by a given keyFunction into aTreeMap
.boolean
boolean
PriorityQueue.isGreaterThan
(Ord<K> ok, K k) boolean
PriorityQueue.isLessThan
(Ord<K> ok, K k) Does the top of the queue have lower priority than k?static <A> Set
<A> Set.iterableSet
(Ord<A> o, Iterable<A> as) Return the elements of the given iterable as a set.static <K,
V> TreeMap <K, V> TreeMap.iterableTreeMap
(Ord<K> keyOrd, Iterable<P2<K, V>> it) Constructs a tree map from the given elements.static <A> Set
<A> Set.iteratorSet
(Ord<A> o, Iterator<A> as) Return the elements of the given iterator as a set.static <K,
V> TreeMap <K, V> TreeMap.iteratorTreeMap
(Ord<K> keyOrd, Iterator<P2<K, V>> it) Constructs a tree map from the given elements.static <A> Set
<A> Join a set of sets into a single set.final <B> Set
<B> Maps the given function across this set.final A
Returns the maximum element in this list according to the given ordering.final A
Returns the maximum element in this non empty list according to the given ordering.List.maximumOption
(Ord<A> o) Returns the maximum element in this list according to the given ordering.private static <A> Stream
<A> Stream.mergePairs
(Ord<A> o, Stream<Stream<A>> s) private static <A> Stream
<A> final A
Returns the minimum element in this list according to the given ordering.final A
Returns the minimum element in this non empty list according to the given ordering.List.minimumOption
(Ord<A> o) Returns the minimum element in this list according to the given ordering.final A
Returns the most common element in this list.Removes duplicates according to the given ordering.An Ord instance for Zippers.List.sequenceSet
(Ord<B> ord, List<Set<B>> list) Sequence the given list and collect the output as a set; use the given ord to order the set.Option.sequenceSet
(Ord<B> ord, Option<Set<B>> option) Sequence the given option and collect the output as a set; use the given ord to order the set.Seq.sequenceSet
(Ord<B> ord, Seq<Set<B>> seq) Sequence the given seq and collect the output as a set; use the given ord to order the set.Stream.sequenceSet
(Ord<B> ord, Stream<Set<B>> stream) Sequence the given stream and collect the output as a set; use the given ord to order the set.static final <E,
C> Set <Validation<E, C>> Validation.sequenceSet
(Ord<E> ordE, Ord<C> ordC, Validation<E, Set<C>> validation) Sequence the given validation and collect the output as a set.static <A> Set
<A> Constructs a set from the given elements.static <K,
V> TreeMap <K, V> TreeMap.setTreeMap
(Ord<K> ord, Set<P2<K, Option<V>>> s) Constructs a TreeMap from the given set.static <A> Set
<A> Returns a set with a single element.Sorts this list using the given order over elements using a merge sort algorithm.Sorts this non empty list using the given order over elements using a merge sort algorithm.Sort this stream according to the given ordering.Sort this stream according to the given ordering, using a parallel Quick Sort algorithm that uses the given parallelisation strategy.Splits this TreeMap at the given key.private static <A> Set.Tree
<A> List.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this list with the given function and collect the output as a set; use the given ord to order the set.Option.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this option with the given function and collect the output as a set; use the given ord to order the set.Seq.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this seq with the given function and collect the output as a set; use the given ord to order the set.Stream.traverseSet
(Ord<B> ord, F<A, Set<B>> f) Traverse this stream with the given function and collect the output as a set; use the given ord to order the set.final <C> Set
<Validation<E, C>> Traverse this validation with the given function and collect the output as a set; use the given success and failure value ords to order the set.static <K,
V> TreeMap <K, V> Constructs a tree map from the given elements. -
Uses of Ord in fj.data.hamt
Methods in fj.data.hamt with parameters of type Ord