# Boost.Geometry Index
#
# Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
#
# Use, modification and distribution is subject to the Boost Software License,
# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
# http://www.boost.org/LICENSE_1_0.txt)

test-suite boost-geometry-index-rtree-generated
    :
    [ run rtree_p2d_linear.cpp ]
    [ run rtree_b2d_linear.cpp ]
    [ run rtree_p2d_quadratic.cpp ]
    [ run rtree_b2d_quadratic.cpp ]
    [ run rtree_p2d_rstar.cpp ]
    [ run rtree_b2d_rstar.cpp ]
    [ run rtree_p2d_linear_rt.cpp ]
    [ run rtree_b2d_linear_rt.cpp ]
    [ run rtree_p2d_quadratic_rt.cpp ]
    [ run rtree_b2d_quadratic_rt.cpp ]
    [ run rtree_p2d_rstar_rt.cpp ]
    [ run rtree_b2d_rstar_rt.cpp ]
    [ run rtree_p2f_linear.cpp ]
    [ run rtree_b2f_linear.cpp ]
    [ run rtree_p2f_quadratic.cpp ]
    [ run rtree_b2f_quadratic.cpp ]
    [ run rtree_p2f_rstar.cpp ]
    [ run rtree_b2f_rstar.cpp ]
    [ run rtree_p2f_linear_rt.cpp ]
    [ run rtree_b2f_linear_rt.cpp ]
    [ run rtree_p2f_quadratic_rt.cpp ]
    [ run rtree_b2f_quadratic_rt.cpp ]
    [ run rtree_p2f_rstar_rt.cpp ]
    [ run rtree_b2f_rstar_rt.cpp ]
    [ run rtree_p2i_linear.cpp ]
    [ run rtree_b2i_linear.cpp ]
    [ run rtree_p2i_quadratic.cpp ]
    [ run rtree_b2i_quadratic.cpp ]
    [ run rtree_p2i_rstar.cpp ]
    [ run rtree_b2i_rstar.cpp ]
    [ run rtree_p2i_linear_rt.cpp ]
    [ run rtree_b2i_linear_rt.cpp ]
    [ run rtree_p2i_quadratic_rt.cpp ]
    [ run rtree_b2i_quadratic_rt.cpp ]
    [ run rtree_p2i_rstar_rt.cpp ]
    [ run rtree_b2i_rstar_rt.cpp ]
    [ run rtree_p2tt_linear.cpp ]
    [ run rtree_b2tt_linear.cpp ]
    [ run rtree_p2tt_quadratic.cpp ]
    [ run rtree_b2tt_quadratic.cpp ]
    [ run rtree_p2tt_rstar.cpp ]
    [ run rtree_b2tt_rstar.cpp ]
    [ run rtree_p2tt_linear_rt.cpp ]
    [ run rtree_b2tt_linear_rt.cpp ]
    [ run rtree_p2tt_quadratic_rt.cpp ]
    [ run rtree_b2tt_quadratic_rt.cpp ]
    [ run rtree_p2tt_rstar_rt.cpp ]
    [ run rtree_b2tt_rstar_rt.cpp ]
    [ run rtree_p3d_linear.cpp ]
    [ run rtree_b3d_linear.cpp ]
    [ run rtree_p3d_quadratic.cpp ]
    [ run rtree_b3d_quadratic.cpp ]
    [ run rtree_p3d_rstar.cpp ]
    [ run rtree_b3d_rstar.cpp ]
    [ run rtree_p3d_linear_rt.cpp ]
    [ run rtree_b3d_linear_rt.cpp ]
    [ run rtree_p3d_quadratic_rt.cpp ]
    [ run rtree_b3d_quadratic_rt.cpp ]
    [ run rtree_p3d_rstar_rt.cpp ]
    [ run rtree_b3d_rstar_rt.cpp ]
    [ run rtree_p3f_linear.cpp ]
    [ run rtree_b3f_linear.cpp ]
    [ run rtree_p3f_quadratic.cpp ]
    [ run rtree_b3f_quadratic.cpp ]
    [ run rtree_p3f_rstar.cpp ]
    [ run rtree_b3f_rstar.cpp ]
    [ run rtree_p3f_linear_rt.cpp ]
    [ run rtree_b3f_linear_rt.cpp ]
    [ run rtree_p3f_quadratic_rt.cpp ]
    [ run rtree_b3f_quadratic_rt.cpp ]
    [ run rtree_p3f_rstar_rt.cpp ]
    [ run rtree_b3f_rstar_rt.cpp ]
    [ run rtree_p3i_linear.cpp ]
    [ run rtree_b3i_linear.cpp ]
    [ run rtree_p3i_quadratic.cpp ]
    [ run rtree_b3i_quadratic.cpp ]
    [ run rtree_p3i_rstar.cpp ]
    [ run rtree_b3i_rstar.cpp ]
    [ run rtree_p3i_linear_rt.cpp ]
    [ run rtree_b3i_linear_rt.cpp ]
    [ run rtree_p3i_quadratic_rt.cpp ]
    [ run rtree_b3i_quadratic_rt.cpp ]
    [ run rtree_p3i_rstar_rt.cpp ]
    [ run rtree_b3i_rstar_rt.cpp ]
    [ run rtree_p3tt_linear.cpp ]
    [ run rtree_b3tt_linear.cpp ]
    [ run rtree_p3tt_quadratic.cpp ]
    [ run rtree_b3tt_quadratic.cpp ]
    [ run rtree_p3tt_rstar.cpp ]
    [ run rtree_b3tt_rstar.cpp ]
    [ run rtree_p3tt_linear_rt.cpp ]
    [ run rtree_b3tt_linear_rt.cpp ]
    [ run rtree_p3tt_quadratic_rt.cpp ]
    [ run rtree_b3tt_quadratic_rt.cpp ]
    [ run rtree_p3tt_rstar_rt.cpp ]
    [ run rtree_b3tt_rstar_rt.cpp ]
    ;