package org.activityinfo.server.report.generator.map;

/*
 * #%L
 * ActivityInfo Server
 * %%
 * Copyright (C) 2009 - 2013 UNICEF
 * %%
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as
 * published by the Free Software Foundation, either version 3 of the 
 * License, or (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public 
 * License along with this program.  If not, see
 * <http://www.gnu.org/licenses/gpl-3.0.html>.
 * #L%
 */

import org.activityinfo.server.report.generator.map.Jenks.Breaks;

import java.util.Arrays;

import static org.hamcrest.CoreMatchers.equalTo;
import static org.junit.Assert.assertThat;

public class JenksBreakerTest {

    private static double VALUES[] = {
            1111, 6751, 502, 1054, 825, 868, 83, 92, 16, 116, 174, 148, 6447,
            597, 1748, 627, 2338, 868, 441, 1029, 1294, 5184, 1512, 232, 565, 1564,
            270, 1127, 2636, 661, 288, 598, 1389, 527, 289, 825, 612, 336
    };

    @org.junit.Test
    public void test() {

        Jenks breaker = new Jenks();
        breaker.addValues(VALUES);
        Breaks breaks = breaker.computeBreaks(5);

        assertThat(VALUES.length, equalTo(
                breaks.getClassCount(0) +
                        breaks.getClassCount(1) +
                        breaks.getClassCount(2) +
                        breaks.getClassCount(3) +
                        breaks.getClassCount(4)));

        System.out.println(Arrays.toString(breaks.getValues()));
        System.out.println(breaks);
    }

    @org.junit.Test
    public void testGva() {
        Jenks breaker = new Jenks();
        for (double value : VALUES) {
            breaker.addValue(value);
        }

        double last = 0;
        for (int i = 2; i <= 14; ++i) {
            double gvf = breaker.computeBreaks(i).gvf();

            System.out.print("delta " + i + " = " + (gvf - last) + "\n");
            last = gvf;
        }

        Breaks bestBreaks = breaker.computeBreaks();
        System.out.println(bestBreaks);
        assertThat(bestBreaks.numClassses(), equalTo(3));

    }

    @org.junit.Test
    public void degenerate1() {
        Jenks breaker = new Jenks();
        breaker.addValues(1, 1, 1, 1, 1, 1, 1, 1, 1, 1);

        Breaks bestBreaks = breaker.computeBreaks();
        System.out.println(bestBreaks);
        assertThat(bestBreaks.numClassses(), equalTo(1));
    }

    @org.junit.Test
    public void degenerate4() {
        Jenks breaker = new Jenks();
        breaker.addValues(1, 1, 1, 1, 1, 10, 10, 30, 30, 40, 40);

        Breaks bestBreaks = breaker.computeBreaks();
        System.out.println(bestBreaks);
        assertThat(bestBreaks.numClassses(), equalTo(3));
    }

}