001    /*
002     * Copyright (C) 2008-2010 by Holger Arndt
003     *
004     * This file is part of the Universal Java Matrix Package (UJMP).
005     * See the NOTICE file distributed with this work for additional
006     * information regarding copyright ownership and licensing.
007     *
008     * UJMP is free software; you can redistribute it and/or modify
009     * it under the terms of the GNU Lesser General Public License as
010     * published by the Free Software Foundation; either version 2
011     * of the License, or (at your option) any later version.
012     *
013     * UJMP is distributed in the hope that it will be useful,
014     * but WITHOUT ANY WARRANTY; without even the implied warranty of
015     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
016     * GNU Lesser General Public License for more details.
017     *
018     * You should have received a copy of the GNU Lesser General Public
019     * License along with UJMP; if not, write to the
020     * Free Software Foundation, Inc., 51 Franklin St, Fifth Floor,
021     * Boston, MA  02110-1301  USA
022     */
023    package org.ujmp.core.util;
024    
025    /**
026     * This distance measure yields the <i>Manhattan distance</i> between two
027     * samples of <code>double</code> values.
028     */
029    public class ManhattanDistance implements DistanceMeasure {
030    
031            /**
032             * Get the distance between two data samples.
033             * 
034             * @param sample1
035             *            the first sample of <code>double</code> values
036             * @param sample2
037             *            the second sample of <code>double</code> values
038             * @return the distance between <code>sample1</code> and
039             *         <code>sample2</code>
040             * @throws IllegalArgumentException
041             *             if the two samples contain different amounts of values
042             */
043            public double getDistance(double[] sample1, double[] sample2) throws IllegalArgumentException {
044    
045                    int n = sample1.length;
046                    if (n != sample2.length || n < 1)
047                            throw new IllegalArgumentException("Input arrays must have the same length.");
048    
049                    double sumOfDifferences = 0;
050                    for (int i = 0; i < n; i++) {
051                            if (Double.isNaN(sample1[i]) || Double.isNaN(sample2[i]))
052                                    continue;
053    
054                            sumOfDifferences += Math.abs(sample1[i] - sample2[i]);
055                    }
056    
057                    return sumOfDifferences;
058            }
059    }