Mercurial > dive4elements > river
view flys-artifacts/src/main/java/de/intevation/flys/utils/KMIndex.java @ 4255:670e98f5a441
Fixed leak while merging facets.
The ThemeList that is used by OutputHelper to sort the
Facets for an Output now uses a list to store the ManagedFacets.
The correct order is made up by sorting the List using
Collections.sort() function of the Java JDK. Therfore, the
ManagedFacet class implements the Comparable interface. The
return value of its compareTo(other) method depends on the
value of the 'position' field.
author | Ingo Weinzierl <weinzierl.ingo@googlemail.com> |
---|---|
date | Thu, 25 Oct 2012 14:01:46 +0200 |
parents | 0e8929d5e9e3 |
children | 46511b4d8357 |
line wrap: on
line source
package de.intevation.flys.utils; import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Iterator; import java.io.Serializable; public class KMIndex<A> implements Serializable, Iterable<KMIndex.Entry<A>> { public static final double EPSILON = 1e-4; public static class Entry<A> implements Serializable, Comparable<Entry<A>> { protected double km; protected A value; public Entry(double km) { this.km = km; } public Entry(double km, A value) { this.km = km; this.value = value; } public double getKm() { return km; } public A getValue() { return value; } public void setValue(A value) { this.value = value; } @Override public int compareTo(Entry<A> other) { double diff = km - other.km; if (diff < -EPSILON) return -1; if (diff > +EPSILON) return +1; return 0; } public boolean epsilonEquals(double km) { return Math.abs(this.km - km) < EPSILON; } } // class Entry protected List<Entry<A>> entries; public KMIndex() { this(10); } public KMIndex(int capacity) { entries = new ArrayList<Entry<A>>(capacity); } public void add(double km, A value) { entries.add(new Entry<A>(km, value)); } public void sort() { Collections.sort(entries); } public Entry<A> search(double km) { for (Entry<A> entry: entries) { if (entry.epsilonEquals(km)) { return entry; } } return null; } public Entry<A> binarySearch(double km) { int index = Collections.binarySearch(entries, new Entry<A>(km)); return index >= 0 ? entries.get(index) : null; } public Iterator<Entry<A>> iterator() { return entries.iterator(); } } // vim:set ts=4 sw=4 si et sta sts=4 fenc=utf8 :