src/main/java/org/organicdesign/fp/StaticImports.java
public static <K,V> ImSortedMap<K,V>
    sortedMap(Comparator<? super K> comp, Iterable<Map.Entry<K,V>> kvPairs) {
        return PersistentTreeMap.ofComp(comp, kvPairs);
    }
public static <K,V> ImSortedMap<K,V>
    sortedMap(Comparator<? super K> comp, Iterable<Map.Entry<K,V>> kvPairs) {
        return PersistentTreeMap.ofComp(comp, kvPairs);
    }
public static < K , V > ImSortedMap < K , V > sortedMap ( Comparator < ? super K > comp , Iterable < Map . Entry < K , V > > kvPairs ) { return PersistentTreeMap . ofComp ( comp , kvPairs ) ; }
Returns a new PersistentTreeMap of the specified comparator and the given key/value pairs.  Use
the tup() method to define those key/value pairs briefly and easily.  The keys are sorted
according to the comparator you provide.

@param comp A comparator (on the keys) that defines the sort order inside the new map.  This
becomes a permanent part of the map and all sub-maps or appended maps derived from it.  If you
want to use a null key, make sure the comparator treats nulls correctly in all circumstances!

@param kvPairs Key/value pairs (to go into the map).  In the case of a duplicate key, later
values in the input list overwrite the earlier ones.  The resulting map can contain zero or one
null key (if your comparator knows how to sort nulls) and any number of null values.  Null k/v
pairs will be silently ignored.

@return a new PersistentTreeMap of the specified comparator and the given key/value pairs
Returns a new PersistentTreeMap of the specified comparator and the given key / value pairs . Use the tup () method to define those key / value pairs briefly and easily . The keys are sorted according to the comparator you provide .