Package | Description |
---|---|
com.ibm.bluej.util.common |
Provides utilities for collection reading, normalization, iteration and data handling
|
com.ibm.bluej.util.common.visualization |
Provides visualization and formatting utility classes for GUI Java applications
|
Modifier and Type | Method and Description |
---|---|
static <S extends Pair,T extends java.util.List<S>> |
SecondPairComparator.sort(T list) |
static <S extends Pair,T extends java.util.List<S>> |
SecondPairComparator.sortR(T list) |
Modifier and Type | Method and Description |
---|---|
static <F,S> Pair<F,S> |
Pair.make(F f,
S s) |
static <T> Pair<T,MutableDouble> |
MutableDoubleHashMap.maxEntry(java.util.Map<T,MutableDouble> map) |
static <T> Pair<T,MutableDouble> |
SparseVectors.maxEntry(java.util.Map<T,MutableDouble> map) |
static <T1,T2> Pair<T1,T2> |
Pair.of(T1 f,
T2 s) |
Modifier and Type | Method and Description |
---|---|
java.util.Map<java.lang.String,Pair<java.lang.Boolean,java.lang.Double>> |
PrecisionRecallThreshold.getScores() |
static <T> java.util.List<Pair<java.util.Collection<T>,java.util.Collection<T>>> |
CollectionUtil.partitionToCrossvalidatedTrainTestDivisions(java.util.Collection<T> seq,
int numDivisions)
This helps you convert a collection of items into a series of train/test divisions for the
purpose of running cross-validation or jack-knifing.
|
static <T> java.util.List<Pair<T,MutableDouble>> |
MutableDoubleHashMap.sorted(java.util.Map<T,MutableDouble> m)
least to greatest
|
static <T> java.util.List<Pair<T,MutableDouble>> |
SparseVectors.sorted(java.util.Map<T,MutableDouble> m)
least to greatest
|
static <T> java.util.List<Pair<T,MutableDouble>> |
MutableDoubleHashMap.sorted(java.util.Map<T,MutableDouble> m,
SecondPairComparator<T,MutableDouble> comp) |
static <T> java.util.List<Pair<T,MutableDouble>> |
SparseVectors.sorted(java.util.Map<T,MutableDouble> m,
SecondPairComparator<T,MutableDouble> comp)
returns the sparse vector as a list of pairs, sorted by comp
|
static <T> java.util.List<Pair<T,MutableDouble>> |
MutableDoubleHashMap.sortedReverse(java.util.Map<T,MutableDouble> m)
greatest to least
|
static <T> java.util.List<Pair<T,MutableDouble>> |
SparseVectors.sortedReverse(java.util.Map<T,MutableDouble> m)
greatest to least
|
static <K,V> java.util.ArrayList<Pair<K,V>> |
HashMapUtil.toPairs(java.util.Map<K,V> map) |
Modifier and Type | Method and Description |
---|---|
int |
FirstPairComparator.compare(Pair p1,
Pair p2) |
int |
FirstPairComparator.compare(Pair p1,
Pair p2) |
int |
SecondPairComparator.compare(Pair p1,
Pair p2) |
int |
SecondPairComparator.compare(Pair p1,
Pair p2) |
static <K,V> java.util.HashMap<K,V> |
HashMapUtil.fromPairs(Pair<K,V>[] pairs) |
Modifier and Type | Method and Description |
---|---|
java.lang.Double |
SamplingPermutationTest.AccuracyMap.f(java.util.Collection<Pair<java.lang.Boolean,java.lang.Double>> insts) |
java.lang.Double |
SamplingPermutationTest.MaxFScoreScorerMap.f(java.util.Collection<Pair<java.lang.Boolean,java.lang.Double>> insts) |
java.lang.Double |
SamplingPermutationTest.AUCScorerMap.f(java.util.Collection<Pair<java.lang.Boolean,java.lang.Double>> insts) |
java.lang.Double |
SamplingPermutationTest.PearsonMap.f(java.util.Collection<Pair<java.lang.Boolean,java.lang.Double>> insts) |
java.lang.Double |
SamplingPermutationTest.LogLikeMap.f(java.util.Collection<Pair<java.lang.Boolean,java.lang.Double>> insts) |
static <K,V> java.util.HashMap<K,V> |
HashMapUtil.fromPairs(java.lang.Iterable<Pair<K,V>> pairs) |
static java.lang.String |
Span.highlightAll(java.lang.String source,
java.util.List<Span> spans,
FunST<Span,Pair<java.lang.String,java.lang.String>> beginEndMaker) |
Modifier and Type | Method and Description |
---|---|
void |
FunctionCellRenderer.setFunction(FunSV<Pair<java.awt.Component,java.lang.Object>> f) |
Constructor and Description |
---|
FunctionCellRenderer(FunSV<Pair<java.awt.Component,java.lang.Object>> f) |