#include "Intersect.h"
#include <iostream>
using namespace std;

Intersect::Intersect(refptr<Shape> shape1, refptr<Shape> shape2)
{
    m_shape1 = shape1;
    m_shape2 = shape2;
}

Shape::IntersectionList Intersect::intersect(refptr<Shape> _this, const Ray & ray)
{
    IntersectionList res1 = m_shape1->intersect(m_shape1, ray);
    IntersectionList res2 = m_shape2->intersect(m_shape2, ray);
    BoolIntersectionList merged(res1, res2, ray.getOrigin());

    IntersectionList res;
    bool in1 = false, in2 = false;
    bool in_bool = false;

    for (int i = 0, sz = merged.size(); i < sz; i++)
    {
        Vector normal = merged[i].intersection.normal;
        double dot = - (ray.getDirection() % normal);
        bool front = dot > 0.0;
        bool left = merged[i].left;
        if (front)
        {
            if (left)
                in1 = true;
            else
                in2 = true;
            if (!in_bool && in1 && in2)
            {
                /* we found an intersection point with the boolean object */
                in_bool = true;
                res.add( merged[i].intersection );
            }
        }
        else
        {
            if (in_bool && in1 && in2)
            {
                /* we found an intersection point with the boolean object */
                res.add( merged[i].intersection );
            }
            if (left)
                in1 = false;
            else
                in2 = false;
            in_bool = false;
        }
    }

    return res;
}