#include <iosfwd>
#include <string>
#include <vector>

#include "cata_catch.h"
#include "coordinates.h"
#include "cuboid_rectangle.h"
#include "point.h"

TEST_CASE( "rectangle_containment_raw", "[point]" )
{
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    half_open_rectangle<point> r1( point( 0, 0 ), point( 2, 2 ) );
    CHECK( !r1.contains( point( 0, -1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r1.contains( point( 0, 0 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r1.contains( point( 0, 1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( !r1.contains( point( 0, 2 ) ) );
    CHECK( !r1.contains( point( 0, 3 ) ) );

    // NOLINTNEXTLINE(cata-use-named-point-constants)
    inclusive_rectangle<point> r2( point( 0, 0 ), point( 2, 2 ) );
    CHECK( !r2.contains( point( 0, -1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r2.contains( point( 0, 0 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r2.contains( point( 0, 1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r2.contains( point( 0, 2 ) ) );
    CHECK( !r2.contains( point( 0, 3 ) ) );
}

TEST_CASE( "rectangle_overlapping_inclusive", "[point]" )
{
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    inclusive_rectangle<point> r1( point( 0, 0 ), point( 2, 2 ) );
    inclusive_rectangle<point> r2( point( 2, 2 ), point( 3, 3 ) );
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    inclusive_rectangle<point> r3( point( 0, 0 ), point( 2, 1 ) );
    inclusive_rectangle<point> r4( point( -2, -4 ), point( 4, -1 ) );
    inclusive_rectangle<point> r5( point( -1, -3 ), point( 0, -2 ) );

    CHECK( r1.overlaps( r1 ) );
    CHECK( r1.overlaps( r2 ) );
    CHECK( r1.overlaps( r3 ) );
    CHECK( !r1.overlaps( r4 ) );
    CHECK( !r1.overlaps( r5 ) );

    CHECK( r2.overlaps( r1 ) );
    CHECK( r2.overlaps( r2 ) );
    CHECK( !r2.overlaps( r3 ) );
    CHECK( !r2.overlaps( r4 ) );
    CHECK( !r2.overlaps( r5 ) );

    CHECK( r3.overlaps( r1 ) );
    CHECK( !r3.overlaps( r2 ) );
    CHECK( r3.overlaps( r3 ) );
    CHECK( !r3.overlaps( r4 ) );
    CHECK( !r3.overlaps( r5 ) );

    CHECK( !r4.overlaps( r1 ) );
    CHECK( !r4.overlaps( r2 ) );
    CHECK( !r4.overlaps( r3 ) );
    CHECK( r4.overlaps( r4 ) );
    CHECK( r4.overlaps( r5 ) );
    CHECK( r5.overlaps( r4 ) );
}

TEST_CASE( "rectangle_overlapping_half_open", "[point]" )
{
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    half_open_rectangle<point> r1( point( 0, 0 ), point( 2, 2 ) );
    half_open_rectangle<point> r2( point( 2, 2 ), point( 3, 3 ) );
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    half_open_rectangle<point> r3( point( 0, 0 ), point( 2, 1 ) );
    half_open_rectangle<point> r4( point( -2, -4 ), point( 4, -1 ) );
    half_open_rectangle<point> r5( point( -1, -3 ), point( 0, -2 ) );

    CHECK( r1.overlaps( r1 ) );
    CHECK( !r1.overlaps( r2 ) );
    CHECK( r1.overlaps( r3 ) );
    CHECK( !r1.overlaps( r4 ) );
    CHECK( !r1.overlaps( r5 ) );

    CHECK( !r2.overlaps( r1 ) );
    CHECK( r2.overlaps( r2 ) );
    CHECK( !r2.overlaps( r3 ) );
    CHECK( !r2.overlaps( r4 ) );
    CHECK( !r2.overlaps( r5 ) );

    CHECK( r3.overlaps( r1 ) );
    CHECK( !r3.overlaps( r2 ) );
    CHECK( r3.overlaps( r3 ) );
    CHECK( !r3.overlaps( r4 ) );
    CHECK( !r3.overlaps( r5 ) );

    CHECK( !r4.overlaps( r1 ) );
    CHECK( !r4.overlaps( r2 ) );
    CHECK( !r4.overlaps( r3 ) );
    CHECK( r4.overlaps( r4 ) );
    CHECK( r4.overlaps( r5 ) );
    CHECK( r5.overlaps( r4 ) );
}

TEST_CASE( "rectangle_containment_coord", "[point]" )
{
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    half_open_rectangle<point_abs_omt> r1( point_abs_omt( 0, 0 ), point_abs_omt( 2, 2 ) );
    CHECK( !r1.contains( point_abs_omt( 0, -1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r1.contains( point_abs_omt( 0, 0 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r1.contains( point_abs_omt( 0, 1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( !r1.contains( point_abs_omt( 0, 2 ) ) );
    CHECK( !r1.contains( point_abs_omt( 0, 3 ) ) );

    // NOLINTNEXTLINE(cata-use-named-point-constants)
    inclusive_rectangle<point_abs_omt> r2( point_abs_omt( 0, 0 ), point_abs_omt( 2, 2 ) );
    CHECK( !r2.contains( point_abs_omt( 0, -1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r2.contains( point_abs_omt( 0, 0 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r2.contains( point_abs_omt( 0, 1 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( r2.contains( point_abs_omt( 0, 2 ) ) );
    CHECK( !r2.contains( point_abs_omt( 0, 3 ) ) );
}

TEST_CASE( "cuboid_shrinks", "[point]" )
{
    half_open_cuboid<tripoint> b( tripoint_zero, tripoint( 3, 3, 3 ) );
    CAPTURE( b );
    CHECK( b.contains( tripoint( 1, 0, 0 ) ) ); // NOLINT(cata-use-named-point-constants)
    CHECK( b.contains( tripoint( 2, 1, 2 ) ) );
    b.shrink( tripoint( 1, 1, 0 ) ); // NOLINT(cata-use-named-point-constants)
    CAPTURE( b );
    // Shrank in the x and y directions
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    CHECK( !b.contains( tripoint( 1, 0, 0 ) ) );
    CHECK( !b.contains( tripoint( 2, 1, 2 ) ) );
    // Didn't shrink in the z direction
    // NOLINTNEXTLINE(cata-use-named-point-constants)
    CHECK( b.contains( tripoint( 1, 1, 0 ) ) );
    CHECK( b.contains( tripoint( 1, 1, 2 ) ) );
}

TEST_CASE( "point_to_from_string", "[point]" )
{
    bool use_locale = GENERATE( false, true );

    if( use_locale ) {
        try {
            std::locale::global( std::locale( "en_US.UTF-8" ) );
        } catch( std::runtime_error & ) {
            // On platforms where we can't set the locale, don't worry about it
            return;
        }
        setlocale( LC_ALL, nullptr );
    }
    CAPTURE( std::locale().name() );

    SECTION( "points_from_string" ) {
        CHECK( point_south.to_string() == "(0,1)" );
        CHECK( tripoint( -1, 0, 1 ).to_string() == "(-1,0,1)" );
        CHECK( point( 77777, 0 ).to_string() == "(77777,0)" );
        CHECK( tripoint( 77777, 0, 0 ).to_string() == "(77777,0,0)" );
    }

    SECTION( "point_round_trip" ) {
        point p( 10, -77777 );
        CHECK( point::from_string( p.to_string() ) == p );
    }

    SECTION( "tripoint_round_trip" ) {
        tripoint p( 10, -77777, 6 );
        CHECK( tripoint::from_string( p.to_string() ) == p );
    }
}

TEST_CASE( "tripoint_xy", "[point]" )
{
    tripoint p( 1, 2, 3 );
    CHECK( p.xy() == point( 1, 2 ) );
}

TEST_CASE( "closest_points_first_tripoint", "[point]" )
{
    const tripoint center = { 1, -1, 2 };

    GIVEN( "min_dist > max_dist" ) {
        const std::vector<tripoint> result = closest_points_first( center, 1, 0 );

        CHECK( result.empty() );
    }

    GIVEN( "min_dist = max_dist = 0" ) {
        const std::vector<tripoint> result = closest_points_first( center, 0, 0 );

        REQUIRE( result.size() == 1 );
        CHECK( result[0] == tripoint{ 1, -1, 2 } );
    }

    GIVEN( "min_dist = 0, max_dist = 1" ) {
        const std::vector<tripoint> result = closest_points_first( center, 0, 1 );

        REQUIRE( result.size() == 9 );
        CHECK( result[0] == tripoint{  1, -1, 2 } );
        CHECK( result[1] == tripoint{  2, -1, 2 } );
        CHECK( result[2] == tripoint{  2,  0, 2 } );
        CHECK( result[3] == tripoint{  1,  0, 2 } );
        CHECK( result[4] == tripoint{  0,  0, 2 } );
        CHECK( result[5] == tripoint{  0, -1, 2 } );
        CHECK( result[6] == tripoint{  0, -2, 2 } );
        CHECK( result[7] == tripoint{  1, -2, 2 } );
        CHECK( result[8] == tripoint{  2, -2, 2 } );
    }

    GIVEN( "min_dist = 2, max_dist = 2" ) {
        const std::vector<tripoint> result = closest_points_first( center, 2, 2 );

        REQUIRE( result.size() == 16 );

        CHECK( result[0]  == tripoint{  3, -2, 2 } );
        CHECK( result[1]  == tripoint{  3, -1, 2 } );
        CHECK( result[2]  == tripoint{  3,  0, 2 } );
        CHECK( result[3]  == tripoint{  3,  1, 2 } );
        CHECK( result[4]  == tripoint{  2,  1, 2 } );
        CHECK( result[5]  == tripoint{  1,  1, 2 } );
        CHECK( result[6]  == tripoint{  0,  1, 2 } );
        CHECK( result[7]  == tripoint{ -1,  1, 2 } );
        CHECK( result[8]  == tripoint{ -1,  0, 2 } );
        CHECK( result[9]  == tripoint{ -1, -1, 2 } );
        CHECK( result[10] == tripoint{ -1, -2, 2 } );
        CHECK( result[11] == tripoint{ -1, -3, 2 } );
        CHECK( result[12] == tripoint{  0, -3, 2 } );
        CHECK( result[13] == tripoint{  1, -3, 2 } );
        CHECK( result[14] == tripoint{  2, -3, 2 } );
        CHECK( result[15] == tripoint{  3, -3, 2 } );
    }
}

TEST_CASE( "closest_points_first_point_abs_omt", "[point]" )
{
    const point_abs_omt center( 1, 3 );

    GIVEN( "min_dist > max_dist" ) {
        const std::vector<point_abs_omt> result = closest_points_first( center, 1, 0 );

        CHECK( result.empty() );
    }

    GIVEN( "min_dist = max_dist = 0" ) {
        const std::vector<point_abs_omt> result = closest_points_first( center, 0, 0 );

        REQUIRE( result.size() == 1 );
        CHECK( result[0].raw() == point{ 1, 3 } );
    }

    GIVEN( "min_dist = 0, max_dist = 1" ) {
        const std::vector<point_abs_omt> result = closest_points_first( center, 0, 1 );

        REQUIRE( result.size() == 9 );
        CHECK( result[0].raw() == point{ 1, 3 } );
        CHECK( result[1].raw() == point{ 2, 3 } );
        CHECK( result[2].raw() == point{ 2, 4 } );
        CHECK( result[3].raw() == point{ 1, 4 } );
        CHECK( result[4].raw() == point{ 0, 4 } );
        CHECK( result[5].raw() == point{ 0, 3 } );
        CHECK( result[6].raw() == point{ 0, 2 } );
        CHECK( result[7].raw() == point{ 1, 2 } );
        CHECK( result[8].raw() == point{ 2, 2 } );
    }
}
