Package | Description |
---|---|
io.github.lukehutch.fastclasspathscanner.utils |
Modifier and Type | Method and Description |
---|---|
static <K,V extends Comparable<V>> |
LazyMap.convertToMultiMapSorted(LazyMap<K,HashSet<V>> lazyMap)
Convert a lazy MultiSet into a lazy MultiMap.
|
static <K,V,T> LazyMap<V,HashSet<K>> |
LazyMap.invertMultiSet(LazyMap<K,HashSet<V>> lazyMap)
Invert the map to find the preimage of each unique value.
|
static <K,V,T> LazyMap<V,HashSet<K>> |
LazyMap.invertMultiSet(LazyMap<K,HashSet<V>> lazyMap,
LazyMap<K,T> templateLazyMap)
For all keys in templateLazyMap, generate the value for each key, then invert the map to find the preimage of
each unique value.
|
Modifier and Type | Method and Description |
---|---|
static <K,V extends Comparable<V>> |
LazyMap.convertToMultiMapSorted(LazyMap<K,HashSet<V>> lazyMap)
Convert a lazy MultiSet into a lazy MultiMap.
|
static <K,V,T> LazyMap<V,HashSet<K>> |
LazyMap.invertMultiSet(LazyMap<K,HashSet<V>> lazyMap)
Invert the map to find the preimage of each unique value.
|
static <K,V,T> LazyMap<V,HashSet<K>> |
LazyMap.invertMultiSet(LazyMap<K,HashSet<V>> lazyMap,
LazyMap<K,T> templateLazyMap)
For all keys in templateLazyMap, generate the value for each key, then invert the map to find the preimage of
each unique value.
|
static <K,V,T> LazyMap<V,HashSet<K>> |
LazyMap.invertMultiSet(LazyMap<K,HashSet<V>> lazyMap,
LazyMap<K,T> templateLazyMap)
For all keys in templateLazyMap, generate the value for each key, then invert the map to find the preimage of
each unique value.
|
Copyright © 2015. All rights reserved.