ListQueryEngine2.h

Go to the documentation of this file.

/*************************************************************************
> File Name: ListQueryEngine2.h
> Project Name: CubbyFlow
> Author: Chan-Ho Chris Ohk
> Purpose: Ad-hoc list-based 2-D intersection/nearest-neighbor query engine.
> Created Time: 2017/10/14
> Copyright (c) 2018, Chan-Ho Chris Ohk
*************************************************************************/
#ifndef CUBBYFLOW_LIST_QUERY_ENGINE2_H
#define CUBBYFLOW_LIST_QUERY_ENGINE2_H

#include <Core/QueryEngine/IntersectionQueryEngine2.h>
#include <Core/QueryEngine/NearestNeighborQueryEngine2.h>

namespace CubbyFlow
{
    template <typename T>
    class ListQueryEngine2 final : public IntersectionQueryEngine2<T>, public NearestNeighborQueryEngine2<T>
    {
    public:
        void Add(const T& item);

        void Add(const std::vector<T>& items);

        bool IsIntersects(const BoundingBox2D& box,
            const BoxIntersectionTestFunc2<T>& testFunc) const override;

        bool IsIntersects(const Ray2D& ray,
            const RayIntersectionTestFunc2<T>& testFunc) const override;

        void ForEachIntersectingItem(
            const BoundingBox2D& box, const BoxIntersectionTestFunc2<T>& testFunc,
            const IntersectionVisitorFunc2<T>& visitorFunc) const override;

        void ForEachIntersectingItem(
            const Ray2D& ray, const RayIntersectionTestFunc2<T>& testFunc,
            const IntersectionVisitorFunc2<T>& visitorFunc) const override;

        ClosestIntersectionQueryResult2<T> GetClosestIntersection(
            const Ray2D& ray,
            const GetRayIntersectionFunc2<T>& testFunc) const override;

        NearestNeighborQueryResult2<T> GetNearestNeighbor(
            const Vector2D& pt,
            const NearestNeighborDistanceFunc2<T>& distanceFunc) const override;

    private:
        std::vector<T> m_items;
    };
}

#include <Core/QueryEngine/ListQueryEngine2-Impl.h>

#endif