package org.forester.evoinference.distance;
+import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.List;
import java.util.Map.Entry;
_data = new ArrayList<SortedMap<Double, SortedSet<Integer>>>();
}
+ @Override
+ public String toString() {
+ final DecimalFormat df = new DecimalFormat( "0.00" );
+ final StringBuilder sb = new StringBuilder();
+ for( int j = 1; j < size(); ++j ) {
+ for( final Entry<Double, SortedSet<Integer>> entry : getSentrySet( j ) ) {
+ final double key = entry.getKey();
+ final SortedSet<Integer> values = entry.getValue();
+ sb.append( df.format( key ) + "->" );
+ boolean first = true;
+ for( final Integer v : values ) {
+ if ( !first ) {
+ sb.append( "," );
+ }
+ first = false;
+ sb.append( v );
+ }
+ sb.append( " " );
+ }
+ sb.append( "\n" );
+ }
+ return sb.toString();
+ }
+
void addPairing( final double key, final int value, final int j ) {
- final SortedMap<Double, SortedSet<Integer>> m = _data.get( j );
+ final SortedMap<Double, SortedSet<Integer>> m = getS( j );
addPairing( key, value, m );
}
}
Set<Entry<Double, SortedSet<Integer>>> getSentrySet( final int j ) {
- return _data.get( j ).entrySet();
+ return getS( j ).entrySet();
}
void initialize( final BasicSymmetricalDistanceMatrix d ) {
addPairing( d.getValues()[ i ][ j ], i, map );
}
}
+ System.out.println( toString() );
}
void removePairing( final double key, final int value, final int j ) {
if ( x.size() == 1 ) {
if ( !x.contains( value ) ) {
//TODO remove me later
- throw new IllegalStateException( "!x.contains( value )" );
+ throw new IllegalStateException( "pairing " + key + " -> " + value + " does not exist" );
}
m.remove( key );
}
final boolean removed = x.remove( value );
if ( !removed ) {
//TODO remove me later
- throw new IllegalStateException( value + " not found" );
+ throw new IllegalStateException( "pairing " + key + " -> " + value + " does not exist/was not removed" );
}
}
else {
}
}
+ int size() {
+ return _data.size();
+ }
+
private static void addPairing( final double key, final int value, final SortedMap<Double, SortedSet<Integer>> m ) {
if ( !m.containsKey( key ) ) {
final TreeSet<Integer> x = new TreeSet<Integer>();