    001    //$HeadURL: https://svn.wald.intevation.org/svn/deegree/base/branches/2.4_testing/src/org/deegree/processing/raster/interpolation/DataTuple.java $
    002    /*----------------------------------------------------------------------------
    003     This file is part of deegree, http://deegree.org/
    004     Copyright (C) 2001-2009 by:
    005       Department of Geography, University of Bonn
    006     and
    007       lat/lon GmbH
    008
    009     This library is free software; you can redistribute it and/or modify it under
    010     the terms of the GNU Lesser General Public License as published by the Free
    011     Software Foundation; either version 2.1 of the License, or (at your option)
    012     any later version.
    013     This library is distributed in the hope that it will be useful, but WITHOUT
    014     ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
    015     FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
    016     details.
    017     You should have received a copy of the GNU Lesser General Public License
    018     along with this library; if not, write to the Free Software Foundation, Inc.,
    019     59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
    020
    021     Contact information:
    022
    023     lat/lon GmbH
    024     Aennchenstr. 19, 53177 Bonn
    025     Germany
    026     http://lat-lon.de/
    027
    028     Department of Geography, University of Bonn
    029     Prof. Dr. Klaus Greve
    030     Postfach 1147, 53001 Bonn
    031     Germany
    032     http://www.geographie.uni-bonn.de/deegree/
    033
    034     e-mail: info@deegree.org
    035    ----------------------------------------------------------------------------*/
    036    package org.deegree.processing.raster.interpolation;
    037
    038    /**
    039     *
    040     *
    041     *
    042     * @author <a href="mailto:poth@lat-lon.de">Andreas Poth</a>
    043     * @author last edited by: $Author: mschneider $
    044     *
    045     * @version 1.0. $Revision: 18195 $, $Date: 2009-06-18 17:55:39 +0200 (Do, 18. Jun 2009) $
    046     *
    047     */
    048    public class DataTuple implements Comparable<DataTuple> {
    049
    050        /**
    051         * X-Coordinate of the data tuple
    052         */
    053        public double x = 0;
    054
    055        /**
    056         * Y-Coordinate of the data tuple
    057         */
    058        public double y = 0;
    059
    060        /**
    061         * Value at location x,y
    062         */
    063        public double value = 0;
    064
    065        /**
    066         * This may not be the best choice for epsilon.
    067         */
    068        // public static final double EPSILON = 0.00000000001;
    069        /**
    070         * Convenience constructor.
    071         *
    072         * @param x
    073         * @param y
    074         * @param value
    075         */
    076        public DataTuple( double x, double y, double value ) {
    077            this.x = x;
    078            this.y = y;
    079            this.value = value;
    080        }
    081
    082        /**
    083         * Empty constructor. Data is pre-set to zero.
    084         */
    085        public DataTuple() {
    086            //
    087        }
    088
    089        /*
    090         * (non-Javadoc)
    091         *
    092         * @see java.lang.Comparable#compareTo(T)
    093         */
    094        public int compareTo( DataTuple o ) {
    095
    096            // boolean xequal = ( ( ( x - EPSILON ) < o.x ) && ( ( x + EPSILON ) > o.x ) );
    097            // boolean yequal = ( ( ( y - EPSILON ) < o.y ) && ( ( y + EPSILON ) > o.y ) );
    098
    099            boolean xequal = ( x == o.x );
    100            boolean yequal = ( y == o.y );
    101
    102            if ( xequal && yequal ) {
    103                return 0;
    104            }
    105
    106            if ( x < o.x ) {
    107                return -1;
    108            }
    109
    110            if ( xequal && ( y < o.y ) ) {
    111                return -1;
    112            }
    113
    114            return 1;
    115        }
    116
    117    }