view flys-artifacts/src/main/java/de/intevation/flys/utils/KMIndex.java @ 4241:49cb65d5932d

Improved the historical discharge calculation. The calculation now creates new HistoricalWQKms (new subclass of WQKms). Those WQKms are used to create new facets from (new) type 'HistoricalDischargeCurveFacet'. The chart generator is improved to support those facets.
author Ingo Weinzierl <ingo.weinzierl@intevation.de>
date Wed, 24 Oct 2012 14:34:35 +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 :

http://dive4elements.wald.intevation.org