libcruft-util/test/point.cpp

#include <cruft/util/point.hpp>

#include <cruft/util/tap.hpp>
#include <cruft/util/types.hpp>
#include <cruft/util/coord/iostream.hpp>

using namespace cruft;


///////////////////////////////////////////////////////////////////////////////
int
main (void)
{
    cruft::TAP::logger tap;

    // Redim to lower dimension
    {
        const point3f p { 0.f, 1.f, 2.f };
        const point2f q = p.redim<2> ();
        const point2f r { 0.f, 1.f };

        tap.expect_eq (q, r, "redim to lower dimension");
    }

    // Redim to higher dimension without fill
    {
        const point2f p(0.f, 1.f);
        const point2f q = p.redim<2> ();

        // GCC: we can't use the equality operator here because it triggers
        // an ICE on GCC 7.1.0

        tap.expect (
            std::equal (std::cbegin (p), std::cend (p), std::cbegin (q)),
            "redim to higher dimension"
        );
    }

    // Redim to higher dimension with fill
    //
    // HACK: This fails under GCC-7.1.0, and i'm not wasting any more time
    // reducing this test case. it's _really_ template heavy.
    {
        static const point4f FILL (1.f, 2.f, 3.f, 4.f);
        const point2f p (0.1f, 1.f);
        const point4f q = p.template redim<4> (FILL);

        tap.expect (
            almost_equal (q[0], p[0]) &&
            almost_equal (q[1], p[1]) &&
            almost_equal (q[2], FILL[2]) &&
            almost_equal (q[3], FILL[3]),

            "redim to higher with fill"
        );
    }

    // Simple linking check for coord type casting. Relies on truncation.
    {
        const point2f pf (0.5f, 0.2f);
        const point2u pu (0,    0);

        tap.expect_eq (pf.template cast<point2u::value_type> (), pu, "type cast with truncation");
    }

    // redim to 4-dimension homogenous coords
    {
        const point3f p (3, 4, 5);
        const point4f q = p.homog ();

        tap.expect (
            equal (q.x, 3.f) &&
            equal (q.y, 4.f) &&
            equal (q.z, 5.f) &&
            equal (q.w, 1.f),

            "homogenous redim"
        );
    }

    // trivial checks for distance metrics
    {
        const point2f a (1, 2);
        const point2f b (9, 5);

        tap.expect_eq (distance2 (a, b), 73.f, "distance2");
        tap.expect_eq (distance  (a, b), std::sqrt (73.f), "distance");
        tap.expect_eq (manhattan (a, b), 11.f, "manhattan");
        tap.expect_eq (chebyshev (a, b), 8.f, "chebyshev");
    }

    // test furthest point calculation
    {
        cruft::point2f const cloud[] = {
            { 0, 0},
            {-1, 2},
            { 9,-3},
            { 6, 1},
        };

        auto const i = 1, j = 2;
        auto const [a,b] = furthest (cruft::view{cloud});

        tap.expect ((a == cloud[i] && b == cloud[j]) ||
                    (b == cloud[i] && a == cloud[j]),
                    "furthest point test");
    };

    return tap.status ();
}