// 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:   CCI.java

package gnnt.MEBS.HQApplet.Indicator;

import gnnt.MEBS.HQApplet.*;
import java.awt.Graphics;
import java.awt.Rectangle;

// Referenced classes of package gnnt.MEBS.HQApplet.Indicator:
//            IndicatorBase, IndicatorPos

public class CCI extends IndicatorBase
{

    private final int m_iParam[] = {
        21
    };

    public CCI(IndicatorPos pos, int Precision)
    {
        super(pos, Precision);
        m_strIndicatorName = "CCI";
        m_strParamName = (new String[] {
            ""
        });
        m_iPrecision = 2;
    }

    public void Paint(Graphics g, Rectangle rc, KLineData data[])
    {
        super.Paint(g, rc, data);
        Calculate();
        m_max = -10000F;
        m_min = 10000F;
        GetValueMaxMin(m_data[0], m_iParam[0] - 1);
        DrawCoordinate(g, 2);
        DrawLine(g, m_data[0], m_iParam[0] - 1, HQApplet.rhColor.clIndicator[0]);
    }

    public void Calculate()
    {
        m_data = new float[2][];
        if(m_kData == null || m_kData.length <= 0)
            return;
        int n = m_iParam[0];
        if(n > m_kData.length || n < 2)
            return;
        m_data[0] = new float[m_kData.length];
        m_data[1] = new float[m_kData.length];
        float cci[] = m_data[0];
        float ma[] = m_data[1];
        double sum = 0.0D;
        for(int i = 0; i < n - 1; i++)
            sum += (m_kData[i].highPrice + m_kData[i].lowPrice + m_kData[i].closePrice) / 3F;

        float prec = 0.0F;
        for(int i = n - 1; i < m_kData.length; i++)
        {
            sum -= prec;
            sum += (m_kData[i].highPrice + m_kData[i].lowPrice + m_kData[i].closePrice) / 3F;
            ma[i] = (float)(sum / (double)n);
            prec = (m_kData[(i - n) + 1].highPrice + m_kData[(i - n) + 1].lowPrice + m_kData[(i - n) + 1].closePrice) / 3F;
        }

        cci[n - 2] = 0.0F;
        for(int i = n - 1; i < m_kData.length; i++)
        {
            sum = 0.0D;
            for(int j = (i - n) + 1; j <= i; j++)
                sum += Math.abs((m_kData[j].highPrice + m_kData[j].lowPrice + m_kData[j].closePrice) / 3F - ma[i]);

            if(sum == 0.0D)
                cci[i] = cci[i - 1];
            else
                cci[i] = (float)((double)((m_kData[i].highPrice + m_kData[i].lowPrice + m_kData[i].closePrice) / 3F - ma[i]) / ((0.014999999999999999D * sum) / (double)n));
        }

    }
}