/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j 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/>.
 */
package org.neo4j.gis.spatial.index;

import static org.assertj.core.api.Assertions.assertThat;
import static org.assertj.core.data.Offset.offset;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import static org.junit.jupiter.api.Assertions.assertTrue;

import org.junit.jupiter.api.Test;

class EnvelopeTest {
    @Test
    void shouldCreateBasic2DEnvelopes() {
        for (double width = 0.0; width < 10.0; width += 2.5) {
            for (double minx = -10.0; minx < 10.0; minx += 2.5) {
                for (double miny = -10.0; miny < 10.0; miny += 2.5) {
                    double maxx = minx + width;
                    double maxy = miny + width;
                    makeAndTestEnvelope(
                            new double[] {minx, miny}, new double[] {maxx, maxy}, new double[] {width, width});
                }
            }
        }
    }

    @Test
    void shouldHandleIntersectionsIn1D() {
        double widthX = 1.0;
        double widthY = 1.0;
        Envelope left = new Envelope(0.0, widthX, 0.0, widthY);
        for (double minx = -10.0; minx < 10.0; minx += 0.2) {
            double maxx = minx + widthX;
            Envelope right = new Envelope(minx, maxx, 0.0, widthY);
            if (maxx < left.getMinX() || minx > left.getMaxX()) {
                testDoesNotOverlap(left, right);
            } else {
                double overlapX = (maxx < left.getMaxX()) ? maxx - left.getMinX() : left.getMaxX() - minx;
                double overlap = overlapX * widthY;
                testOverlaps(left, right, true, overlap);
            }
        }
    }

    @Test
    void shouldHandleIntersectionsIn2D() {
        Envelope left = new Envelope(0.0, 1.0, 0.0, 1.0);
        testOverlaps(left, new Envelope(0.0, 1.0, 0.0, 1.0), true, 1.0, 1.0); // copies
        testOverlaps(left, new Envelope(0.5, 1.0, 0.5, 1.0), true, 1.0, 0.25); // top right quadrant
        testOverlaps(left, new Envelope(0.25, 0.75, 0.25, 0.75), true, 1.0, 0.25); // centered
        testOverlaps(left, new Envelope(-0.5, 0.5, -0.5, 0.5), true, 0.25, 0.25); // overlaps bottom left quadrant
        testOverlaps(left, new Envelope(-0.5, 1.5, -0.5, 1.5), true, 1.0, 1.0); // encapsulates
        testOverlaps(left, new Envelope(-1.0, 0.0, 0.0, 1.0), true, 0.0, 0.0); // touches left edge
        testOverlaps(left, new Envelope(0.5, 1.5, 1.0, 2.0), true, 0.0, 0.0); // touches top-right edge
        testOverlaps(left, new Envelope(0.5, 1.5, 0.0, 1.0), true, 0.5, 0.5); // overlaps right half
    }

    @Test
    void testWithSideRatioNotTooSmall2D() {
        // No change expected
        double[] from = new double[] {0, 0};
        double[] to = new double[] {1, 1};

        Envelope envelope = new Envelope(from, to).withSideRatioNotTooSmall();
        double[] expectedFrom = new double[] {0, 0};
        double[] expectedTo = new double[] {1, 1};
        assertArrayEquals(expectedFrom, envelope.min, 0.0001);
        assertArrayEquals(expectedTo, envelope.max, 0.0001);

        // Expected to change
        final double bigValue = 100;
        final double smallValue = 0.000000000000000001;
        to = new double[] {bigValue, smallValue};
        Envelope envelope2 = new Envelope(from, to).withSideRatioNotTooSmall();
        double[] expectedTo2 = new double[] {bigValue, bigValue / Envelope.MAXIMAL_ENVELOPE_SIDE_RATIO};
        assertArrayEquals(expectedFrom, envelope2.min, 0.0001);
        assertArrayEquals(expectedTo2, envelope2.max, 0.00001);
    }

    // Works for any number of dimensions, and 4 is more interesting than 3
    @Test
    void testWithSideRatioNotTooSmall4D() {
        // No change expected
        double[] from = new double[] {0, 0, 0, 0};
        double[] to = new double[] {1, 1, 1, 1};

        Envelope envelope = new Envelope(from, to).withSideRatioNotTooSmall();
        double[] expectedFrom = new double[] {0, 0, 0, 0};
        double[] expectedTo = new double[] {1, 1, 1, 1};
        assertArrayEquals(expectedFrom, envelope.min, 0.0001);
        assertArrayEquals(expectedTo, envelope.max, 0.0001);

        // Expected to change
        final double bigValue = 107;
        final double smallValue = 0.00000000000000000123;
        to = new double[] {bigValue, smallValue, 12, smallValue * 0.1};
        Envelope envelope2 = new Envelope(from, to).withSideRatioNotTooSmall();
        double[] expectedTo2 = new double[] {
            bigValue,
            bigValue / Envelope.MAXIMAL_ENVELOPE_SIDE_RATIO,
            12,
            bigValue / Envelope.MAXIMAL_ENVELOPE_SIDE_RATIO
        };
        assertArrayEquals(expectedFrom, envelope2.min, 0.00001);
        assertArrayEquals(expectedTo2, envelope2.max, 0.00001);
    }

    private static void makeAndTestEnvelope(double[] min, double[] max, double[] width) {
        Envelope env = new Envelope(min, max);
        assertThat(env.getMinX()).as("Expected min-x to be correct").isEqualTo(min[0]);
        assertThat(env.getMinY()).as("Expected min-y to be correct").isEqualTo(min[1]);
        assertThat(env.getMaxX()).as("Expected max-x to be correct").isEqualTo(max[0]);
        assertThat(env.getMaxY()).as("Expected max-y to be correct").isEqualTo(max[1]);
        assertThat(env.getDimension())
                .as("Expected dimension to be same as min.length")
                .isEqualTo(min.length);
        assertThat(env.getDimension())
                .as("Expected dimension to be same as max.length")
                .isEqualTo(max.length);
        for (int i = 0; i < min.length; i++) {
            assertThat(env.getMin(i))
                    .as("Expected min[" + i + "] to be correct")
                    .isEqualTo(min[i]);
            assertThat(env.getMax(i))
                    .as("Expected max[" + i + "] to be correct")
                    .isEqualTo(max[i]);
        }
        double area = 1.0;
        Envelope copy = new Envelope(env);
        Envelope intersection = env.intersection(copy);
        for (int i = 0; i < min.length; i++) {
            assertThat(env.getWidth(i))
                    .as("Expected width[" + i + "] to be correct")
                    .isEqualTo(width[i]);
            assertThat(copy.getWidth(i))
                    .as("Expected copied width[" + i + "] to be correct")
                    .isEqualTo(width[i]);
            assertThat(intersection.getWidth(i))
                    .as("Expected intersected width[" + i + "] to be correct")
                    .isEqualTo(width[i]);
            area *= width[i];
        }
        assertThat(env.getArea()).as("Expected area to be correct").isEqualTo(area);
        assertThat(env.getArea()).as("Expected copied area to be correct").isEqualTo(copy.getArea());
        assertThat(env.getArea()).as("Expected intersected area to be correct").isEqualTo(intersection.getArea());
        assertTrue(env.intersects(copy), "Expected copied envelope to intersect");
        assertThat(env.overlap(copy))
                .as("Expected copied envelope to intersect completely")
                .isEqualTo(1.0);
    }

    private static void testDoesNotOverlap(Envelope left, Envelope right) {
        Envelope bbox = new Envelope(left);
        bbox.expandToInclude(right);
        testOverlaps(left, right, false, 0.0);
    }

    private static void testOverlaps(Envelope left, Envelope right, boolean intersects, double overlap) {
        String intersectMessage = intersects ? "Should intersect" : "Should not intersect";
        String overlapMessage = intersects ? "Should overlap" : "Should not have overlap";
        assertThat(left.intersects(right)).as(intersectMessage).isEqualTo(intersects);
        assertThat(right.intersects(left)).as(intersectMessage).isEqualTo(intersects);
        assertThat(left.overlap(right)).as(overlapMessage).isCloseTo(overlap, offset(0.000001));
        assertThat(right.overlap(left)).as(overlapMessage).isCloseTo(overlap, offset(0.000001));
    }

    private static void testOverlaps(
            Envelope left, Envelope right, boolean intersects, double overlap, double overlapArea) {
        testOverlaps(left, right, intersects, overlap);
        assertThat(left.intersection(right).getArea())
                .as("Expected overlap area")
                .isCloseTo(overlapArea, offset(0.000001));
        assertThat(right.intersection(left).getArea())
                .as("Expected overlap area")
                .isCloseTo(overlapArea, offset(0.000001));
    }
}
