]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/libs/geometry/test/algorithms/Jamfile.v2
update sources to v12.2.3
[ceph.git] / ceph / src / boost / libs / geometry / test / algorithms / Jamfile.v2
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 #
7 # This file was modified by Oracle on 2014, 2015, 2016, 2017.
8 # Modifications copyright (c) 2014-2017, Oracle and/or its affiliates.
9 #
10 # Contributed and/or modified by Vissarion Fisikopoulos, on behalf of Oracle
11 # Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
12 # Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
13 #
14 # Use, modification and distribution is subject to the Boost Software License,
15 # Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
16 # http://www.boost.org/LICENSE_1_0.txt)
17
18 test-suite boost-geometry-algorithms
19 :
20 [ run append.cpp : : : : algorithms_append ]
21 [ run assign.cpp : : : : algorithms_assign ]
22 [ run centroid.cpp : : : : algorithms_centroid ]
23 [ run centroid_multi.cpp : : : : algorithms_centroid_multi ]
24 [ run comparable_distance.cpp : : : : algorithms_comparable_distance ]
25 [ run convert.cpp : : : : algorithms_convert ]
26 [ run convert_multi.cpp : : : : algorithms_convert_multi ]
27 [ run convex_hull.cpp : : : : algorithms_convex_hull ]
28 [ run convex_hull_multi.cpp : : : : algorithms_convex_hull_multi ]
29 [ run correct.cpp : : : : algorithms_correct ]
30 [ run correct_multi.cpp : : : : algorithms_correct_multi ]
31 [ run correct_closure.cpp : : : : algorithms_correct_closure ]
32 [ run for_each.cpp : : : : algorithms_for_each ]
33 [ run for_each_multi.cpp : : : : algorithms_for_each_multi ]
34 [ run is_convex.cpp : : : : algorithms_is_convex ]
35 [ run is_empty.cpp : : : : algorithms_is_empty ]
36 [ run is_simple.cpp : : : : algorithms_is_simple ]
37 [ run is_simple_geo.cpp : : : : algorithms_is_simple_geo ]
38 [ run is_valid.cpp : : : : algorithms_is_valid ]
39 [ run is_valid_failure.cpp : : : : algorithms_is_valid_failure ]
40 [ run is_valid_geo.cpp : : : : algorithms_is_valid_geo ]
41 [ run make.cpp : : : : algorithms_make ]
42 [ run maximum_gap.cpp : : : : algorithms_maximum_gap ]
43 [ run num_geometries.cpp : : : : algorithms_num_geometries ]
44 [ run num_geometries_multi.cpp : : : : algorithms_num_geometries_multi ]
45 [ run num_interior_rings.cpp : : : : algorithms_num_interior_rings ]
46 [ run num_interior_rings_multi.cpp : : : : algorithms_num_interior_rings_multi ]
47 [ run num_points.cpp : : : : algorithms_num_points ]
48 [ run num_points_multi.cpp : : : : algorithms_num_points_multi ]
49 [ run num_segments.cpp : : : : algorithms_segments ]
50 [ run perimeter.cpp : : : : algorithms_perimeter ]
51 [ run perimeter_multi.cpp : : : : algorithms_perimeter_multi ]
52 [ run point_on_surface.cpp : : : : algorithms_point_on_surface ]
53 [ run remove_spikes.cpp : : : : algorithms_remove_spikes ]
54 [ run reverse.cpp : : : : algorithms_reverse ]
55 [ run reverse_multi.cpp : : : : algorithms_reverse_multi ]
56 [ run simplify.cpp : : : : algorithms_simplify ]
57 [ run simplify_multi.cpp : : : : algorithms_simplify_multi ]
58 [ run transform.cpp : : : : algorithms_transform ]
59 [ run transform_multi.cpp : : : : algorithms_transform_multi ]
60 [ run unique.cpp : : : : algorithms_unique ]
61 [ run unique_multi.cpp : : : : algorithms_unique_multi ]
62 ;
63
64 build-project area ;
65 build-project buffer ;
66 build-project detail ;
67 build-project distance ;
68 build-project envelope_expand ;
69 build-project length ;
70 build-project overlay ;
71 build-project perimeter ;
72 build-project relational_operations ;
73 build-project set_operations ;