package ch.asynk.rustanddust.engine;

import java.util.List;
import java.util.Collection;

import ch.asynk.rustanddust.engine.util.ArrayListIt;

public class SearchBoard
{
    public class Node
    {
        public int col;
        public int row;
        public int search;
        public int remaining;
        public Node parent;
        public boolean roadMarch;

        public Node(int col, int row)
        {
            this.col = col;
            this.row = row;
        }

        @Override
        public String toString()
        {
            return col + ";" + row;
        }
    }

    private int cols;
    private int rows;
    private Board board;
    private int searchCount;
    private Node nodes[];

    private ArrayListIt<Node> stack;
    private ArrayListIt<Node> queue;
    private ArrayListIt<Node> roadMarch;
    private ArrayListIt<Node> los;
    private boolean losBlocked;

    public SearchBoard(Board board, int cols, int rows)
    {
        this.cols = cols;
        this.rows = rows;
        this.board = board;
        this.searchCount = 0;

        this.nodes = new Node[cols * rows];
        for (int j = 0; j < rows; j++) {
            int dx = ((j + 1) / 2);
            for (int i = 0; i < cols; i++)
                nodes[i + (j * cols)] = new Node((i + dx), j);
        }

        this.queue = new ArrayListIt<Node>(30);
        this.stack = new ArrayListIt<Node>(20);
        this.roadMarch = new ArrayListIt<Node>(5);
        this.los = new ArrayListIt<Node>(10);
    }

    private boolean inMap(int col, int row)
    {
        if ((row < 0) || (row >= rows))
            return false;

        int colOffset = ((row + 1) / 2);
        if ((col < colOffset) || ((col - colOffset) >= cols))
            return false;

        return true;
    }

    private Tile getTile(Node node)
    {
        return board.getTile(node.col, node.row);
    }

    private Node getNode(Tile tile)
    {
        return getNode(tile.col, tile.row);
    }

    protected Node getNode(int col, int row)
    {
        int colOffset = ((row + 1) / 2);
        if ((col < colOffset) || (row < 0) || (row >= rows) || ((col - colOffset) >= cols))
            return null;

        return nodes[((col - colOffset)) + (row * cols)];
    }

    public int distance(Node from, Node to)
    {
        return board.distance(from.col, from.row, to.col, to.row);
    }

    public void adjacentMoves(Node src, Node a[])
    {
        // move to enter dst by sides[i]
        a[0] = getNode((src.col - 1), src.row);
        a[1] = getNode(src.col, (src.row + 1));
        a[2] = getNode((src.col + 1), (src.row + 1));
        a[3] = getNode((src.col + 1), src.row);
        a[4] = getNode(src.col, (src.row - 1));
        a[5] = getNode((src.col - 1), (src.row - 1));
    }

    public int possibleMovesFrom(Pawn pawn, Collection<Tile> moves)
    {
        moves.clear();
        searchCount += 1;

        Node adjacents[] = new Node[6];

        Node from = getNode(pawn.getTile());
        from.parent = null;
        from.search = searchCount;
        from.remaining = pawn.getMovementPoints();
        from.roadMarch = true;

        if (from.remaining <= 0)
            return moves.size();

        int roadMarchBonus = pawn.getRoadMarchBonus();
        boolean first = true;

        stack.push(from);

        while (stack.size() != 0) {
            Node src = stack.pop();

            if (src.remaining < 0)
                continue;
            if (src.remaining == 0) {
                if (src.roadMarch)
                    roadMarch.push(src);
                continue;
            }

            adjacentMoves(src, adjacents);

            for (int i = 0; i < 6; i++) {
                Node dst = adjacents[i];
                if (dst != null) {

                    Tile t = getTile(dst);
                    int cost = t.costFrom(pawn, board.getSide(i));
                    boolean mayMoveOne = first && t.atLeastOneMove(pawn);
                    int r = src.remaining - cost;
                    boolean roadMarch = (src.roadMarch && t.road(board.getSide(i)));

                    if (dst.search == searchCount) {
                        if ((r >= 0) && ((r > dst.remaining) || (roadMarch && ((r + roadMarchBonus) >= dst.remaining)))) {
                            dst.remaining = r;
                            dst.parent = src;
                            dst.roadMarch = roadMarch;
                            stack.push(dst);
                            moves.add(getTile(dst));
                        }
                    } else {
                        dst.search = searchCount;
                        if ((r >= 0) || mayMoveOne) {
                            dst.parent = src;
                            dst.remaining = r;
                            dst.roadMarch = roadMarch;
                            stack.push(dst);
                            moves.add(getTile(dst));
                        } else {
                            dst.parent = null;
                            dst.remaining = -1;
                        }
                    }
                }
            }
            first = false;
        }

        for (Node n : roadMarch) n.remaining = roadMarchBonus;
        while (roadMarch.size() != 0) {
            Node src = roadMarch.pop();

            adjacentMoves(src, adjacents);

            for (int i = 0; i < 6; i++) {
                Node dst = adjacents[i];
                if (dst != null) {

                    Tile t = getTile(dst);
                    if (!t.road(board.getSide(i)))
                        continue;
                    int cost = t.costFrom(pawn, board.getSide(i));
                    int r = src.remaining - cost;

                    if (dst.search == searchCount) {
                        if ((r >= 0) && (r > dst.remaining)) {
                            dst.remaining = r;
                            dst.parent = src;
                            dst.roadMarch = true;
                            roadMarch.push(dst);
                            moves.add(getTile(dst));
                        }
                    } else {
                        dst.search = searchCount;
                        if (r >= 0) {
                            dst.parent = src;
                            dst.remaining = r;
                            dst.roadMarch = true;
                            roadMarch.push(dst);
                            moves.add(getTile(dst));
                        } else {
                            dst.parent = null;
                            dst.remaining = -1;
                        }
                    }
                }
            }
        }

        return moves.size();
    }

    private void adjacentTargets(Node src, int angle, Node a[])
    {
        // move in allowed directions
        if (Orientation.NORTH.isInSides(angle))
            a[0] = getNode((src.col + 1), src.row);
        else
            a[0] = null;

        if (Orientation.NORTH_EAST.isInSides(angle))
            a[1] = getNode(src.col, (src.row - 1));
        else
            a[1] = null;

        if (Orientation.SOUTH_EAST.isInSides(angle))
            a[2] = getNode((src.col - 1), (src.row - 1));
        else
            a[2] = null;

        if (Orientation.SOUTH.isInSides(angle))
            a[3] = getNode((src.col - 1), src.row);
        else
            a[3] = null;

        if (Orientation.SOUTH_WEST.isInSides(angle))
            a[4] = getNode(src.col, (src.row + 1));
        else
            a[4] = null;

        if (Orientation.NORTH_WEST.isInSides(angle))
            a[5] = getNode((src.col + 1), (src.row + 1));
        else
            a[5] = null;
    }

    public List<Node> buildLineOfSight(int x0, int y0, int x1, int y1, boolean clearVisibility)
    {
        lineOfSight(x0, y0, x1, y1, clearVisibility);
        return los;
    }

    public int possibleTargetsFrom(Pawn shooter, Collection<Pawn> targets)
    {
        targets.clear();
        searchCount += 1;

        Node adjacents[] = new Node[6];

        int range = shooter.getEngagementRangeFrom(shooter.getTile());
        int angle = shooter.getAngleOfAttack();
        int extendedAngle = shooter.getOrientation().opposite().allBut();

        Node from = getNode(shooter.getTile());
        from.search = searchCount;
        from.remaining = range;

        if (range <= 0)
            return targets.size();

        queue.enqueue(from);

        while (queue.size() != 0) {
            Node src = queue.dequeue();

            if (src.remaining <= 0)
                continue;

            if (((range - src.remaining) % 2) == 1)
                adjacentTargets(src, extendedAngle, adjacents);
            else
                adjacentTargets(src, angle, adjacents);

            int rangeLeft = src.remaining - 1;

            for (int i = 0; i < 6; i++) {
                Node dst = adjacents[i];
                if ((dst == null) || (dst.search == searchCount))
                    continue;

                dst.search = searchCount;
                dst.remaining = rangeLeft;
                queue.enqueue(dst);
                Tile t = getTile(dst);
                if (!t.isEmpty() && hasClearLineOfSight(from, dst, angle)) {
                    for (Pawn target : t) {
                        if (shooter.canEngage(target))
                            targets.add(target);
                    }
                }
            }
        }

        return targets.size();
    }

    public boolean canAttack(Pawn shooter, Pawn target, boolean clearVisibility)
    {
        Node from = getNode(shooter.getTile());
        Node to = getNode(target.getTile());

        shooter.setAttack(target, distance(from, to));

        if (shooter.attack.distance > shooter.getEngagementRangeFrom(shooter.getTile()))
            return false;

        if (!lineOfSight(from.col, from.row, to.col, to.row, clearVisibility))
            return false;

        if (!validateFireAngle(shooter.getAngleOfAttack(), los))
            return false;

        shooter.attack.isClear = !losBlocked;
        shooter.attack.isFlank = isFlankAttack(target.getFlankSides(), los);

        return true;
    }

    private boolean hasClearLineOfSight(Node from, Node to, int angleOfAttack)
    {
        if (!lineOfSight(from.col, from.row, to.col, to.row, true))
            return false;
        return validateFireAngle(angleOfAttack, los);
    }

    private boolean isFlankAttack(int angle, List<Node> los)
    {
        Node from = los.get(los.size() - 2);
        Node to = los.get(los.size() - 1);
        Orientation o = Orientation.fromMove(to.col, to.row, from.col, from.row);

        if (los.size() < 3)
            return o.isInSides(angle);

        Node before = los.get(los.size() - 3);
        if (distance(before, to) > 1)
            return o.isInSides(angle);

        Orientation o2 = Orientation.fromMove(to.col, to.row, before.col, before.row);
        return (o.isInSides(angle) && o2.isInSides(angle));
    }

    private boolean validateFireAngle(int angle, List<Node> los)
    {
        Node from = los.get(0);
        Node p0 = los.get(1);
        Orientation o = Orientation.fromMove(from.col, from.row, p0.col, p0.row);

        if (los.size() < 3)
            return o.isInSides(angle);

        Node p1 = los.get(2);
        if (distance(from, p1) > 1)
            return o.isInSides(angle);

        Orientation o2 = Orientation.fromMove(from.col, from.row, p1.col, p1.row);
        return (o.isInSides(angle) || o2.isInSides(angle));
    }

    private boolean fixLineOfSight(boolean ret, int x1, int y1)
    {
        if (ret) return true;
        if (!losBlocked) return false;

        Node last = los.get(los.size() - 1);
        if ((last.col == x1) && (last.row == y1)) {
            losBlocked = false;
            return true;
        }
        return false;
    }

    private boolean lineOfSight(int x0, int y0, int x1, int y1, boolean clearVisibility)
    {
        los.clear();
        losBlocked = false;
        Tile from = board.getTile(x0, y0);
        Tile to = board.getTile(x1, y1);

        // orthogonal axis
        int ox0 = x0 - ((y0 +1) / 2);
        int ox1 = x1 - ((y1 +1) / 2);

        int dy = y1 - y0;
        int dx = ox1 - ox0;

        int xs = 1;
        int ys = 1;
        if (dx < 0) xs = -1;
        if (dy < 0) ys = -1;
        boolean sig = !(((dx < 0) && (dy >= 0)) || ((dx >= 0) && (dy < 0)));

        dy = Math.abs(dy);
        dx = Math.abs(2 * dx);
        if ((dy % 2) == 1) {
            if ((y0 % 2) == 0) dx += xs;
            else {
                dx -= xs;
                Math.abs(dx);
            }
        }

        if (dx == 0)
            return fixLineOfSight(verticalLineOfSight(x0, y0, x1, y1, clearVisibility), x1, y1);
        if (dx == (3 * dy))
            return fixLineOfSight(diagonalLineOfSight(x0, y0, x1, y1, clearVisibility), x1, y1);

        int dx3 = 3 * dx;
        int dy3 = 3 * dy;

        int x = x0;
        int y = y0;
        int e = -2 * dx;

        boolean flat = (dx > (3 * dy));
        boolean diag = (dx == (3 * dy));

        los.add(getNode(x, y));
        while ((x != x1) || (y != y1)) {
            if (e > 0) {
                e -= (dy3 + dx3);
                y += ys;
                if (!sig)
                    x -= xs;
            } else {
                e += dy3;
                if ((e > -dx) || (!flat && (e == -dx))) {
                    e -= dx3;
                    y += ys;
                    if (sig)
                        x += xs;
                } else if ((e < -dx3) || (diag && (e == -dx3))) {
                    e += dx3;
                    y -= ys;
                    if (!sig)
                        x += xs;
                } else {
                    e += dy3;
                    x += xs;
                }
            }
            los.add(getNode(x, y));
            if (!losBlocked) losBlocked = board.getTile(x, y).blockLineOfSight(from, to);
            if (losBlocked && clearVisibility) return fixLineOfSight(false, x1, y1);
        }

        return true;
    }

    private boolean verticalLineOfSight(int x0, int y0, int x1, int y1, boolean clearVisibility)
    {
        Tile from = board.getTile(x0, y0);
        Tile to = board.getTile(x1, y1);

        int d = ( (y1 > y0) ? 1 : -1);
        int x = x0;
        int y = y0;

        Tile t = null;
        los.add(getNode(x, y));
        while ((x != x1) || (y != y1)) {
            boolean blocked = false;

            y += d;
            t = board.getTile(x, y);
            if (!t.isOffMap()) los.add(getNode(x, y));
            if (!losBlocked) blocked = t.blockLineOfSight(from, to);

            x += d;
            t = board.getTile(x, y);
            if (!t.isOffMap()) los.add(getNode(x, y));
            if (blocked && !t.blockLineOfSight(from, to))
                blocked = false;

            if (blocked) losBlocked = true;
            if (losBlocked && clearVisibility) return false;

            y += d;
            t = board.getTile(x, y);
            if (!t.isOffMap()) los.add(getNode(x, y));
        }

        return true;
    }

    private boolean diagonalLineOfSight(int x0, int y0, int x1, int y1, boolean clearVisibility)
    {
        Tile from = board.getTile(x0, y0);
        Tile to = board.getTile(x1, y1);

        int dy = ( (y1 > y0) ? 1 : -1);
        int dx = ( (x1 > x0) ? 1 : -1);
        boolean sig = !(((dx < 0) && (dy >= 0)) || ((dx >= 0) && (dy < 0)));

        int x = x0;
        int y = y0;

        Tile t = null;
        los.add(getNode(x, y));
        while ((x != x1) || (y != y1)) {
            boolean blocked = false;

            x += dx;
            t = board.getTile(x, y);
            if (!t.isOffMap()) los.add(getNode(x, y));
            if (!losBlocked) blocked = t.blockLineOfSight(from, to);

            y += dy;
            if (!sig)
                x -= dx;
            t = board.getTile(x, y);
            if (!t.isOffMap()) los.add(getNode(x, y));
            if (blocked && !t.blockLineOfSight(from, to))
                blocked = false;

            if (blocked) losBlocked = true;
            if (losBlocked && clearVisibility) return false;

            x += dx;
            t = board.getTile(x, y);
            if (!t.isOffMap()) los.add(getNode(x, y));
        }

        return true;
    }
}