Mercurial > dive4elements > river
view flys-artifacts/src/main/java/de/intevation/flys/utils/KMIndex.java @ 4198:1cdbd8a0c994
Added two new tables ClickableQDTable and ClickableWTable and made Ws and Qs clickable in historical discharge calculation.
The new tables define listener interfaces (clicked lower or upper icon) to listen to user clicks.
In addition to this, there is an enum ClickMode with NONE, SINGLE and RANGE options, which allows to
specifiy, which icons are displayed in the tables. NONE means no icon for user clicks, SINGLE has 1
icon, RANGE 2 icons for lower and upper.
author | Ingo Weinzierl <ingo.weinzierl@intevation.de> |
---|---|
date | Mon, 22 Oct 2012 13:31:25 +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 :