2 package org.forester.evoinference.distance;
4 import java.text.DecimalFormat;
5 import java.util.ArrayList;
7 import java.util.Map.Entry;
9 import java.util.SortedMap;
10 import java.util.SortedSet;
11 import java.util.TreeMap;
12 import java.util.TreeSet;
14 import org.forester.evoinference.matrix.distance.BasicSymmetricalDistanceMatrix;
16 public final class S {
18 public final static int FACTOR = 1000000;
19 private final static boolean DEBUG = true;
20 private final List<SortedMap<Integer, SortedSet<Integer>>> _data;
23 _data = new ArrayList<SortedMap<Integer, SortedSet<Integer>>>();
26 final public void addPairing( final double key, final int value, final int j ) {
27 addPairing( ( int ) ( FACTOR * key ), value, getS( j ) );
30 final public void addPairing( final int key, final int value, final int j ) {
31 addPairing( key, value, getS( j ) );
34 final public SortedMap<Integer, SortedSet<Integer>> getS( final int j ) {
35 return _data.get( j );
38 final public SortedSet<Integer> getValues( final int key, final int j ) {
39 return getS( j ).get( key );
42 final public void initialize( final BasicSymmetricalDistanceMatrix d ) {
43 for( int j = 0; j < d.getSize(); ++j ) {
44 final TreeMap<Integer, SortedSet<Integer>> map = new TreeMap<Integer, SortedSet<Integer>>();
46 for( int i = 0; i < j; ++i ) {
47 addPairing( ( int ) ( FACTOR * d.getValues()[ i ][ j ] ), i, map );
50 System.out.println( toString() );
53 final public void initialize( final int size ) {
54 for( int j = 0; j < size; ++j ) {
55 final TreeMap<Integer, SortedSet<Integer>> map = new TreeMap<Integer, SortedSet<Integer>>();
60 final public void removePairing( final double key, final int value, final int j ) {
61 removePairing( ( int ) ( key * FACTOR ), value, j );
64 final public void removePairing( final int key, final int value, final int j ) {
65 final SortedMap<Integer, SortedSet<Integer>> m = _data.get( j );
66 final SortedSet<Integer> x = m.get( key );
69 System.out.println( toString() );
70 throw new IllegalArgumentException( "key " + key + " (->" + value + ") does not exist for row " + j );
73 if ( x.size() == 1 ) {
75 if ( !x.contains( value ) ) {
76 throw new IllegalArgumentException( "pairing " + key + "->" + value + " does not exist for row "
82 else if ( x.size() > 1 ) {
84 if ( !x.remove( value ) ) {
85 throw new IllegalArgumentException( "pairing " + key + "->" + value
86 + " does not exist (could not be removed) for row " + j );
94 throw new IllegalStateException();
98 final public int size() {
102 // Slow, only for testing
103 @SuppressWarnings( "unchecked")
104 final public SortedSet<Integer>[] toArray( final int j ) {
105 return _data.get( j ).values().toArray( new SortedSet[ _data.get( j ).size() ] );
109 final public String toString() {
110 final DecimalFormat df = new DecimalFormat( "0.00" );
111 final StringBuilder sb = new StringBuilder();
112 for( int j = 0; j < size(); ++j ) {
113 for( final Entry<Integer, SortedSet<Integer>> entry : getSentrySet( j ) ) {
114 final double key = entry.getKey();
115 final SortedSet<Integer> values = entry.getValue();
116 sb.append( df.format( key / FACTOR ) + "->" );
117 boolean first = true;
118 for( final int v : values ) {
129 return sb.toString();
132 final Set<Entry<Integer, SortedSet<Integer>>> getSentrySet( final int j ) {
133 return getS( j ).entrySet();
136 final private static void addPairing( final int key, final int value, final SortedMap<Integer, SortedSet<Integer>> m ) {
137 if ( !m.containsKey( key ) ) {
138 final TreeSet<Integer> x = new TreeSet<Integer>();
144 if ( m.get( key ).contains( value ) ) {
145 throw new IllegalArgumentException( "pairing " + key + "->" + value + " already exists" );
148 m.get( key ).add( value );