Uses of Class
fj.data.TreeMap

Packages that use TreeMap
Package
Description
Types that set the premise for the existence of Functional Java.
Common algebraic data types.
  • Uses of TreeMap in fj

    Methods in fj that return types with arguments of type TreeMap
    Modifier and Type
    Method
    Description
    static <K, V> Equal<TreeMap<K,V>>
    Equal.treeMapEqual(Equal<K> k, Equal<V> v)
     
    static <K, V> Hash<TreeMap<K,V>>
    Hash.treeMapHash(Hash<K> h, Hash<V> v)
     
    static <K, V> Show<TreeMap<K,V>>
    Show.treeMapShow(Show<K> sk, Show<V> sv)
    A show instance for the TreeMap type.
  • Uses of TreeMap in fj.data

    Methods in fj.data that return TreeMap
    Modifier and Type
    Method
    Description
    static <K, V> TreeMap<K,V>
    TreeMap.arrayTreeMap(Ord<K> keyOrd, P2<K,V>... ps)
    Constructs a tree map from the given elements.
    TreeMap.delete(K k)
    Deletes the entry in the tree map that corresponds to the given key.
    static <K, V> TreeMap<K,V>
    TreeMap.empty(Ord<K> keyOrd)
    Constructs an empty tree map.
    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>
    List.groupBy(F<A,B> keyFunction, F<A,C> valueFunction, Monoid<C> monoid, Ord<B> keyOrd)
    Groups the elements of this list by a given keyFunction into a TreeMap and transforms the matching elements with the given valueFunction.
    final <B, C> TreeMap<B,List<C>>
    List.groupBy(F<A,B> keyFunction, F<A,C> valueFunction, Ord<B> keyOrd)
    Groups the elements of this list by a given keyFunction into a TreeMap and transforms the matching elements with the given valueFunction.
    final <B> TreeMap<B,List<A>>
    List.groupBy(F<A,B> keyFunction, Ord<B> keyOrd)
    Groups the elements of this list by a given keyFunction into a TreeMap.
    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 <K, V> TreeMap<K,V>
    TreeMap.iteratorTreeMap(Ord<K> keyOrd, Iterator<P2<K,V>> it)
    Constructs a tree map from the given elements.
    <W> TreeMap<K,W>
    TreeMap.map(F<V,W> f)
    Maps the given function across the values of this TreeMap.
    TreeMap.set(K k, V v)
    Inserts the given key and value association into the tree map.
    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 <K, V> TreeMap<K,V>
    TreeMap.treeMap(Ord<K> keyOrd, P2<K,V>... p2s)
    Constructs a tree map from the given elements.
    TreeMap.union(TreeMap<K,V> t2)
    The expression t1.union(t2) takes the left-biased union of t1 and t2.
    TreeMap.union(Iterable<P2<K,V>> t2)
    The expression t1.union(t2) takes the left-biased union of t1 and t2.
    TreeMap.update(K k, F<V,V> f, V v)
    Modifies the value for the given key, if present, by applying the given function to it, or inserts the given value if the key is not present.
    Methods in fj.data that return types with arguments of type TreeMap
    Modifier and Type
    Method
    Description
    TreeMap.splitLookup(K k)
    Splits this TreeMap at the given key.
    TreeMap.splitLookup(K k)
    Splits this TreeMap at the given key.
    TreeMap.update(K k, F<V,V> f)
    Modifies the value for the given key, if present, by applying the given function to it.
    Methods in fj.data with parameters of type TreeMap
    Modifier and Type
    Method
    Description
    TreeMap.union(TreeMap<K,V> t2)
    The expression t1.union(t2) takes the left-biased union of t1 and t2.