Mercurial > hg > de.mpg.mpiwg.itgroup.digilib.plugin
view libs/commons-math-2.1/docs/apidocs/src-html/org/apache/commons/math/stat/clustering/EuclideanIntegerPoint.html @ 13:cbf34dd4d7e6
commons-math-2.1 added
author | dwinter |
---|---|
date | Tue, 04 Jan 2011 10:02:07 +0100 |
parents | |
children |
line wrap: on
line source
<HTML> <BODY BGCOLOR="white"> <PRE> <FONT color="green">001</FONT> /*<a name="line.1"></a> <FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a> <FONT color="green">003</FONT> * contributor license agreements. See the NOTICE file distributed with<a name="line.3"></a> <FONT color="green">004</FONT> * this work for additional information regarding copyright ownership.<a name="line.4"></a> <FONT color="green">005</FONT> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a> <FONT color="green">006</FONT> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a> <FONT color="green">007</FONT> * the License. You may obtain a copy of the License at<a name="line.7"></a> <FONT color="green">008</FONT> *<a name="line.8"></a> <FONT color="green">009</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a> <FONT color="green">010</FONT> *<a name="line.10"></a> <FONT color="green">011</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a> <FONT color="green">012</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a> <FONT color="green">013</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a> <FONT color="green">014</FONT> * See the License for the specific language governing permissions and<a name="line.14"></a> <FONT color="green">015</FONT> * limitations under the License.<a name="line.15"></a> <FONT color="green">016</FONT> */<a name="line.16"></a> <FONT color="green">017</FONT> <a name="line.17"></a> <FONT color="green">018</FONT> package org.apache.commons.math.stat.clustering;<a name="line.18"></a> <FONT color="green">019</FONT> <a name="line.19"></a> <FONT color="green">020</FONT> import java.io.Serializable;<a name="line.20"></a> <FONT color="green">021</FONT> import java.util.Collection;<a name="line.21"></a> <FONT color="green">022</FONT> <a name="line.22"></a> <FONT color="green">023</FONT> import org.apache.commons.math.util.MathUtils;<a name="line.23"></a> <FONT color="green">024</FONT> <a name="line.24"></a> <FONT color="green">025</FONT> /**<a name="line.25"></a> <FONT color="green">026</FONT> * A simple implementation of {@link Clusterable} for points with integer coordinates.<a name="line.26"></a> <FONT color="green">027</FONT> * @version $Revision: 925812 $ $Date: 2010-03-21 11:49:31 -0400 (Sun, 21 Mar 2010) $<a name="line.27"></a> <FONT color="green">028</FONT> * @since 2.0<a name="line.28"></a> <FONT color="green">029</FONT> */<a name="line.29"></a> <FONT color="green">030</FONT> public class EuclideanIntegerPoint implements Clusterable<EuclideanIntegerPoint>, Serializable {<a name="line.30"></a> <FONT color="green">031</FONT> <a name="line.31"></a> <FONT color="green">032</FONT> /** Serializable version identifier. */<a name="line.32"></a> <FONT color="green">033</FONT> private static final long serialVersionUID = 3946024775784901369L;<a name="line.33"></a> <FONT color="green">034</FONT> <a name="line.34"></a> <FONT color="green">035</FONT> /** Point coordinates. */<a name="line.35"></a> <FONT color="green">036</FONT> private final int[] point;<a name="line.36"></a> <FONT color="green">037</FONT> <a name="line.37"></a> <FONT color="green">038</FONT> /**<a name="line.38"></a> <FONT color="green">039</FONT> * Build an instance wrapping an integer array.<a name="line.39"></a> <FONT color="green">040</FONT> * <p>The wrapped array is referenced, it is <em>not</em> copied.</p><a name="line.40"></a> <FONT color="green">041</FONT> * @param point the n-dimensional point in integer space<a name="line.41"></a> <FONT color="green">042</FONT> */<a name="line.42"></a> <FONT color="green">043</FONT> public EuclideanIntegerPoint(final int[] point) {<a name="line.43"></a> <FONT color="green">044</FONT> this.point = point;<a name="line.44"></a> <FONT color="green">045</FONT> }<a name="line.45"></a> <FONT color="green">046</FONT> <a name="line.46"></a> <FONT color="green">047</FONT> /**<a name="line.47"></a> <FONT color="green">048</FONT> * Get the n-dimensional point in integer space.<a name="line.48"></a> <FONT color="green">049</FONT> * @return a reference (not a copy!) to the wrapped array<a name="line.49"></a> <FONT color="green">050</FONT> */<a name="line.50"></a> <FONT color="green">051</FONT> public int[] getPoint() {<a name="line.51"></a> <FONT color="green">052</FONT> return point;<a name="line.52"></a> <FONT color="green">053</FONT> }<a name="line.53"></a> <FONT color="green">054</FONT> <a name="line.54"></a> <FONT color="green">055</FONT> /** {@inheritDoc} */<a name="line.55"></a> <FONT color="green">056</FONT> public double distanceFrom(final EuclideanIntegerPoint p) {<a name="line.56"></a> <FONT color="green">057</FONT> return MathUtils.distance(point, p.getPoint());<a name="line.57"></a> <FONT color="green">058</FONT> }<a name="line.58"></a> <FONT color="green">059</FONT> <a name="line.59"></a> <FONT color="green">060</FONT> /** {@inheritDoc} */<a name="line.60"></a> <FONT color="green">061</FONT> public EuclideanIntegerPoint centroidOf(final Collection<EuclideanIntegerPoint> points) {<a name="line.61"></a> <FONT color="green">062</FONT> int[] centroid = new int[getPoint().length];<a name="line.62"></a> <FONT color="green">063</FONT> for (EuclideanIntegerPoint p : points) {<a name="line.63"></a> <FONT color="green">064</FONT> for (int i = 0; i < centroid.length; i++) {<a name="line.64"></a> <FONT color="green">065</FONT> centroid[i] += p.getPoint()[i];<a name="line.65"></a> <FONT color="green">066</FONT> }<a name="line.66"></a> <FONT color="green">067</FONT> }<a name="line.67"></a> <FONT color="green">068</FONT> for (int i = 0; i < centroid.length; i++) {<a name="line.68"></a> <FONT color="green">069</FONT> centroid[i] /= points.size();<a name="line.69"></a> <FONT color="green">070</FONT> }<a name="line.70"></a> <FONT color="green">071</FONT> return new EuclideanIntegerPoint(centroid);<a name="line.71"></a> <FONT color="green">072</FONT> }<a name="line.72"></a> <FONT color="green">073</FONT> <a name="line.73"></a> <FONT color="green">074</FONT> /** {@inheritDoc} */<a name="line.74"></a> <FONT color="green">075</FONT> @Override<a name="line.75"></a> <FONT color="green">076</FONT> public boolean equals(final Object other) {<a name="line.76"></a> <FONT color="green">077</FONT> if (!(other instanceof EuclideanIntegerPoint)) {<a name="line.77"></a> <FONT color="green">078</FONT> return false;<a name="line.78"></a> <FONT color="green">079</FONT> }<a name="line.79"></a> <FONT color="green">080</FONT> final int[] otherPoint = ((EuclideanIntegerPoint) other).getPoint();<a name="line.80"></a> <FONT color="green">081</FONT> if (point.length != otherPoint.length) {<a name="line.81"></a> <FONT color="green">082</FONT> return false;<a name="line.82"></a> <FONT color="green">083</FONT> }<a name="line.83"></a> <FONT color="green">084</FONT> for (int i = 0; i < point.length; i++) {<a name="line.84"></a> <FONT color="green">085</FONT> if (point[i] != otherPoint[i]) {<a name="line.85"></a> <FONT color="green">086</FONT> return false;<a name="line.86"></a> <FONT color="green">087</FONT> }<a name="line.87"></a> <FONT color="green">088</FONT> }<a name="line.88"></a> <FONT color="green">089</FONT> return true;<a name="line.89"></a> <FONT color="green">090</FONT> }<a name="line.90"></a> <FONT color="green">091</FONT> <a name="line.91"></a> <FONT color="green">092</FONT> /** {@inheritDoc} */<a name="line.92"></a> <FONT color="green">093</FONT> @Override<a name="line.93"></a> <FONT color="green">094</FONT> public int hashCode() {<a name="line.94"></a> <FONT color="green">095</FONT> int hashCode = 0;<a name="line.95"></a> <FONT color="green">096</FONT> for (Integer i : point) {<a name="line.96"></a> <FONT color="green">097</FONT> hashCode += i.hashCode() * 13 + 7;<a name="line.97"></a> <FONT color="green">098</FONT> }<a name="line.98"></a> <FONT color="green">099</FONT> return hashCode;<a name="line.99"></a> <FONT color="green">100</FONT> }<a name="line.100"></a> <FONT color="green">101</FONT> <a name="line.101"></a> <FONT color="green">102</FONT> /**<a name="line.102"></a> <FONT color="green">103</FONT> * {@inheritDoc}<a name="line.103"></a> <FONT color="green">104</FONT> * @since 2.1<a name="line.104"></a> <FONT color="green">105</FONT> */<a name="line.105"></a> <FONT color="green">106</FONT> @Override<a name="line.106"></a> <FONT color="green">107</FONT> public String toString() {<a name="line.107"></a> <FONT color="green">108</FONT> final StringBuffer buff = new StringBuffer("(");<a name="line.108"></a> <FONT color="green">109</FONT> final int[] coordinates = getPoint();<a name="line.109"></a> <FONT color="green">110</FONT> for (int i = 0; i < coordinates.length; i++) {<a name="line.110"></a> <FONT color="green">111</FONT> buff.append(coordinates[i]);<a name="line.111"></a> <FONT color="green">112</FONT> if (i < coordinates.length - 1) {<a name="line.112"></a> <FONT color="green">113</FONT> buff.append(",");<a name="line.113"></a> <FONT color="green">114</FONT> }<a name="line.114"></a> <FONT color="green">115</FONT> }<a name="line.115"></a> <FONT color="green">116</FONT> buff.append(")");<a name="line.116"></a> <FONT color="green">117</FONT> return buff.toString();<a name="line.117"></a> <FONT color="green">118</FONT> }<a name="line.118"></a> <FONT color="green">119</FONT> <a name="line.119"></a> <FONT color="green">120</FONT> }<a name="line.120"></a> </PRE> </BODY> </HTML>