/*
 *  File:       ray.cc
 *  Summary:    Diamond grid wrapper around geom::ray.
 *
 * The geom::grid diamonds is a checkerboard grid rotated
 * by 45 degrees such that the black cells ("diamonds") lie just
 * within the normal crawl map cells.
 *
 * ray_def provides for advancing and reflecting rays in
 * map coordinates, where a ray touches a given cell if it
 * meets the diamond.
 */

#include "AppHdr.h"

#include <cmath>

#include "ray.h"
#include "geom2d.h"

static geom::grid diamonds(geom::lineseq(1, 1, 0.5, 1),
                           geom::lineseq(1, -1, -0.5, 1));

static int ifloor(double d)
{
    return static_cast<int>(floor(d));
}

coord_def ray_def::pos() const
{
    // XXX: pretty arbitrary if we're just on a corner.
    int x = ifloor(r.start.x);
    int y = ifloor(r.start.y);
    return (coord_def(x, y));
}

// Return false if we passed or hit a corner.
bool ray_def::advance()
{
    if (on_corner)
    {
        on_corner = false;
        r.move_half_cell(diamonds);
    }
    else
    {
        // Starting inside a diamond.
        bool c = !r.to_next_cell(diamonds);

        if (c)
        {
            // r is now on a corner, going from diamond to diamond.
            r.move_half_cell(diamonds);
            return (false);
        }
    }
    // Now inside a non-diamond.

    if (r.to_next_cell(diamonds))
        return (true);
    else
    {
        // r is now on a corner, going from non-diamond to non-diamond.
        on_corner = true;
        return (false);
    }
}

void ray_def::advance_and_bounce()
{
    // XXX
    r.dir = -r.dir;
}

void ray_def::regress()
{
    r.dir = -r.dir;
    advance();
    r.dir = -r.dir;
}