package ca.pfv.spmf.datastructures.kdtree;
/* This file is copyright (c) 2008-2013 Philippe Fournier-Viger
* 
* This file is part of the SPMF DATA MINING SOFTWARE
* (http://www.philippe-fournier-viger.com/spmf).
* 
* SPMF is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
* 
* SPMF is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU General Public License for more details.
* You should have received a copy of the GNU General Public License along with
* SPMF. If not, see .
*/

/**
 * This class represents a point (a vector of double) stored or to be stored in a KDTree
 * 
*  @see KDTree
*  @see KDNode
 * @author Philippe Fournier-Viger
 */

public class KNNPoint implements Comparable{
	
	double [] values;  // a vector
	double distance; // a distance
	
	/**
	 * Constructor
	 * @param values  vector
	 * @param distance distance
	 */
	public KNNPoint(double values[], double distance){
		this.values = values;
		this.distance = distance;
	}

	/**
	 * Compare this point to another point
	 * @param point2 the given point.
	 * @return an integer <0 if the distance of this point is smaller than the distance of point2
	 *         an integer >0 if the distance of this point is larger than the one of point2
	 *         0 if the distance is the same.
	 */
	public int compareTo(KNNPoint point2) {
		return (int)(this.distance  - point2.distance);
	}
	
	/**
	 * Return this point as a string.
	 * @return a string
	 */
	public String toString(){
		StringBuffer buffer = new StringBuffer();
		buffer.append("(");
		for(Double element : values ){
			buffer.append(" " + element);
		}
		buffer.append(")");
		return buffer.toString();
	}
	
	/**
	 * Verify if two points are equals.
	 * @param point2  a given point.
	 * @return true if equals to that point.
	 */
	public boolean equals(Object point2){
		if(point2 == null){
			return false;
		}
		KNNPoint o2 = (KNNPoint)point2;
		for(int i=0; i < values.length; i++ ){
			if(o2.values[i] != values[i]){
				return false;
			}
		}
		return true;
	}
}