1# Boost.Geometry (aka GGL, Generic Geometry Library)
2#
3# Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
4# Copyright (c) 2008-2015 Bruno Lalande, Paris, France.
5# Copyright (c) 2009-2015 Mateusz Loskot, London, UK.
6# Copyright (c) 2018 Adam Wulkiewicz, Lodz, Poland.
7#
8# This file was modified by Oracle on 2014, 2015, 2016, 2017.
9# Modifications copyright (c) 2014-2017, Oracle and/or its affiliates.
10#
11# Contributed and/or modified by Vissarion Fisikopoulos, on behalf of Oracle
12# Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
13# Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
14#
15# Use, modification and distribution is subject to the Boost Software License,
16# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
17# http://www.boost.org/LICENSE_1_0.txt)
18
19test-suite boost-geometry-algorithms
20    :
21    [ run append.cpp                   : : : : algorithms_append ]
22    [ run assign.cpp                   : : : : algorithms_assign ]
23    [ run centroid.cpp                 : : : : algorithms_centroid ]
24    [ run centroid_multi.cpp           : : : : algorithms_centroid_multi ]
25    [ run comparable_distance.cpp      : : : : algorithms_comparable_distance ]
26    [ run convert.cpp                  : : : : algorithms_convert ]
27    [ run convert_multi.cpp            : : : : algorithms_convert_multi ]
28    [ run convex_hull.cpp              : : : : algorithms_convex_hull ]
29    [ run convex_hull_multi.cpp        : : : : algorithms_convex_hull_multi ]
30    [ run correct.cpp                  : : : : algorithms_correct ]
31    [ run correct_multi.cpp            : : : : algorithms_correct_multi ]
32    [ run correct_closure.cpp          : : : : algorithms_correct_closure ]
33    [ run densify.cpp                  : : : : algorithms_densify ]
34    [ run for_each.cpp                 : : : : algorithms_for_each ]
35    [ run for_each_multi.cpp           : : : : algorithms_for_each_multi ]
36    [ run is_convex.cpp                : : : : algorithms_is_convex ]
37    [ run is_empty.cpp                 : : : : algorithms_is_empty ]
38    [ run is_simple.cpp                : : : : algorithms_is_simple ]
39    [ run is_simple_geo.cpp            : : : : algorithms_is_simple_geo ]
40    [ run is_valid.cpp                 : : : : algorithms_is_valid ]
41    [ run is_valid_failure.cpp         : : : : algorithms_is_valid_failure ]
42    [ run is_valid_geo.cpp             : : : : algorithms_is_valid_geo ]
43    [ run line_interpolate.cpp         : : : : algorithms_line_interpolate ]
44    [ run make.cpp                     : : : : algorithms_make ]
45    [ run maximum_gap.cpp              : : : : algorithms_maximum_gap ]
46    [ run num_geometries.cpp           : : : : algorithms_num_geometries ]
47    [ run num_geometries_multi.cpp     : : : : algorithms_num_geometries_multi ]
48    [ run num_interior_rings.cpp       : : : : algorithms_num_interior_rings ]
49    [ run num_interior_rings_multi.cpp : : : : algorithms_num_interior_rings_multi ]
50    [ run num_points.cpp               : : : : algorithms_num_points ]
51    [ run num_points_multi.cpp         : : : : algorithms_num_points_multi ]
52    [ run num_segments.cpp             : : : : algorithms_segments ]
53    [ run perimeter.cpp                : : : : algorithms_perimeter ]
54    [ run perimeter_multi.cpp          : : : : algorithms_perimeter_multi ]
55    [ run point_on_surface.cpp         : : : : algorithms_point_on_surface ]
56    [ run remove_spikes.cpp            : : : : algorithms_remove_spikes ]
57    [ run reverse.cpp                  : : : : algorithms_reverse ]
58    [ run reverse_multi.cpp            : : : : algorithms_reverse_multi ]
59    [ run simplify.cpp                 : : : : algorithms_simplify ]
60    [ run simplify_multi.cpp           : : : : algorithms_simplify_multi ]
61    [ run transform.cpp                : : : : algorithms_transform ]
62    [ run transform_multi.cpp          : : : : algorithms_transform_multi ]
63    [ run unique.cpp                   : : : : algorithms_unique ]
64    [ run unique_multi.cpp             : : : : algorithms_unique_multi ]
65    ;
66
67build-project area ;
68build-project buffer ;
69build-project covered_by ;
70build-project crosses ;
71build-project detail ;
72build-project disjoint ;
73build-project distance ;
74build-project envelope_expand ;
75build-project equals ;
76build-project intersects ;
77build-project length ;
78build-project overlaps ;
79build-project overlay ;
80build-project perimeter ;
81build-project relate ;
82build-project set_operations ;
83build-project similarity ;
84build-project touches ;
85build-project within ;
86