All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.commons.math3.stat.clustering.EuclideanDoublePoint Maven / Gradle / Ivy

There is a newer version: 2.12.15
Show newest version
/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.commons.math3.stat.clustering;

import java.io.Serializable;
import java.util.Collection;
import java.util.Arrays;

import org.apache.commons.math3.util.MathArrays;

/**
 * A simple implementation of {@link Clusterable} for points with double coordinates.
 * @since 3.1
 * @deprecated As of 3.2 (to be removed in 4.0),
 * use {@link org.apache.commons.math3.ml.clustering.DoublePoint} instead
 */
@Deprecated
public class EuclideanDoublePoint implements Clusterable, Serializable {

    /** Serializable version identifier. */
    private static final long serialVersionUID = 8026472786091227632L;

    /** Point coordinates. */
    private final double[] point;

    /**
     * Build an instance wrapping an integer array.
     * 

* The wrapped array is referenced, it is not copied. * * @param point the n-dimensional point in integer space */ public EuclideanDoublePoint(final double[] point) { this.point = point; } /** {@inheritDoc} */ public EuclideanDoublePoint centroidOf(final Collection points) { final double[] centroid = new double[getPoint().length]; for (final EuclideanDoublePoint p : points) { for (int i = 0; i < centroid.length; i++) { centroid[i] += p.getPoint()[i]; } } for (int i = 0; i < centroid.length; i++) { centroid[i] /= points.size(); } return new EuclideanDoublePoint(centroid); } /** {@inheritDoc} */ public double distanceFrom(final EuclideanDoublePoint p) { return MathArrays.distance(point, p.getPoint()); } /** {@inheritDoc} */ @Override public boolean equals(final Object other) { if (!(other instanceof EuclideanDoublePoint)) { return false; } return Arrays.equals(point, ((EuclideanDoublePoint) other).point); } /** * Get the n-dimensional point in integer space. * * @return a reference (not a copy!) to the wrapped array */ public double[] getPoint() { return point; } /** {@inheritDoc} */ @Override public int hashCode() { return Arrays.hashCode(point); } /** {@inheritDoc} */ @Override public String toString() { return Arrays.toString(point); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy