partialwindowmatrix.java

用java写的DTW程序组合

// Decompiled by Jad v1.5.7g. Copyright 2000 Pavel Kouznetsov.
// Jad home page: http://www.geocities.com/SiliconValley/Bridge/8617/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi 
// Source File Name:   PartialWindowMatrix.java

package dtw;


// Referenced classes of package dtw:
//            CostMatrix, SearchWindow

class PartialWindowMatrix
    implements CostMatrix
{

    private static final double OUT_OF_WINDOW_VALUE = (1.0D / 0.0D);
    private double lastCol[];
    private double currCol[];
    private int currColIndex;
    private int minLastRow;
    private int minCurrRow;
    private final SearchWindow window;

    PartialWindowMatrix(SearchWindow searchWindow)
    {
        window = searchWindow;
        if(window.maxI() > 0)
        {
            currCol = new double[(window.maxJforI(1) - window.minJforI(1)) + 1];
            currColIndex = 1;
            minLastRow = window.minJforI(currColIndex - 1);
        } else
        {
            currColIndex = 0;
        }
        minCurrRow = window.minJforI(currColIndex);
        lastCol = new double[(window.maxJforI(0) - window.minJforI(0)) + 1];
    }

    public void put(int col, int row, double value)
    {
        if(row < window.minJforI(col) || row > window.maxJforI(col))
            throw new InternalError("CostMatrix is filled in a cell (col=" + col + ", row=" + row + ") that is not in the " + "search window");
        if(col == currColIndex)
            currCol[row - minCurrRow] = value;
        else
        if(col == currColIndex - 1)
            lastCol[row - minLastRow] = value;
        else
        if(col == currColIndex + 1)
        {
            lastCol = currCol;
            minLastRow = minCurrRow;
            currColIndex++;
            currCol = new double[(window.maxJforI(col) - window.minJforI(col)) + 1];
            minCurrRow = window.minJforI(col);
            currCol[row - minCurrRow] = value;
        } else
        {
            throw new InternalError("A PartialWindowMatrix can only fill in 2 adjacentcolumns at a time");
        }
    }

    public double get(int col, int row)
    {
        if(row < window.minJforI(col) || row > window.maxJforI(col))
            return (1.0D / 0.0D);
        if(col == currColIndex)
            return currCol[row - minCurrRow];
        if(col == currColIndex - 1)
            return lastCol[row - minLastRow];
        else
            return (1.0D / 0.0D);
    }

    public int size()
    {
        return lastCol.length + currCol.length;
    }

    public int windowSize()
    {
        return window.size();
    }
}