daoadresseservice/util/NearestShortTreeMap.java

package dk.daoas.daoadresseservice.util;

import java.util.TreeMap;

public class NearestShortTreeMap {
        

        public static <T> short getNearestKey(short search, TreeMap<Short,T> map) {
                
                Short ceilKey = map.ceilingKey(search);         
                Short lowerKey = map.lowerKey(search);
                
                if (ceilKey == null) {
                        return lowerKey;
                }
                
                if (lowerKey == null) {
                        return ceilKey;
                }
                
                
                int ceilDiff = Math.abs( ceilKey - search );
                int lowerDiff = Math.abs( lowerKey - search );
                
                if (ceilDiff < lowerDiff) {
                        return ceilKey;
                } else {
                        return lowerKey;
                }
                
        }

}
1	torben	2785	package dk.daoas.daoadresseservice.util;
2
3			import java.util.TreeMap;
4
5			public class NearestShortTreeMap {
6
7
8			public static <T> short getNearestKey(short search, TreeMap<Short,T> map) {
9
10			Short ceilKey = map.ceilingKey(search);
11			Short lowerKey = map.lowerKey(search);
12
13			if (ceilKey == null) {
14			return lowerKey;
15			}
16
17			if (lowerKey == null) {
18			return ceilKey;
19			}
20
21
22			int ceilDiff = Math.abs( ceilKey - search );
23			int lowerDiff = Math.abs( lowerKey - search );
24
25			if (ceilDiff < lowerDiff) {
26			return ceilKey;
27			} else {
28			return lowerKey;
29			}
30
31			}
32
33			}