Debian Codegraph @

debian/tests/build1

raw
1 #!/bin/sh
2 # autopkgtest check: Build and run a program against libann
3 # (C) 2014 Anton Gladky
4
5 set -e
6
7 WORKDIR=$(mktemp -d)
8 trap "rm -rf $WORKDIR" 0 INT QUIT ABRT PIPE TERM
9 TESTDIR="debian/tests"
10 cp $TESTDIR/ann_test.cpp $WORKDIR/
11 cp $TESTDIR/rand.cpp $WORKDIR/
12 cp $TESTDIR/rand.h $WORKDIR/
13
14 cd $WORKDIR
15
16 cat <<EOF > test1.in
17 validate on
18 stats query_stats
19 dim 2
20 data_size 20
21 query_size 10
22 read_data_pts test1-data.pts
23 read_query_pts test1-query.pts
24 bucket_size 1
25 near_neigh 3
26 split_rule suggest
27 shrink_rule none
28 build_ann
29 epsilon 0.0
30 run_queries standard
31 run_queries priority
32
33 EOF
34
35 cat <<EOF > test1.save
36 ------------------------------------------------------------
37 ann_test: Version 1.0
38 Copyright: David M. Mount and Sunil Arya.
39 Latest Revision: Mar 1, 2005.
40 ------------------------------------------------------------
41
42 validate = on (Warning: this may slow execution time.)
43 stats = query_stats
44 [Read Data Points:
45 data_size = 20
46 file_name = test1-data.pts
47 dim = 2
48 ]
49 [Read Query Points:
50 query_size = 10
51 file_name = test1-query.pts
52 dim = 2
53 ]
54 [Build ann-structure:
55 split_rule = suggest
56 shrink_rule = none
57 data_size = 20
58 dim = 2
59 bucket_size = 1
60 process_time = 0 sec
61 (Structure Statistics:
62 n_nodes = 39 (opt = 40, best if < 400)
63 n_leaves = 20 (0 contain no points)
64 n_splits = 19
65 n_shrinks = 0
66 empty_leaves = 0 percent (best if < 50 percent)
67 depth = 6 (opt = 4, best if < 17)
68 avg_aspect_ratio = 1.48847 (best if < 20)
69 )
70 ]
71 (Computing true nearest neighbors for validation. This may take time.)
72 [Run Queries:
73 query_size = 10
74 dim = 2
75 search_method = standard
76 epsilon = 0
77 near_neigh = 3
78 true_nn = 13
79 query_time = 0 sec/query (biased by perf measurements)
80 (Performance stats: [ mean : stddev ]< min , max >
81 leaf_nodes = [ 6.3 : 2.751 ]< 4 , 11 >
82 splitting_nodes = [ 8.8 : 3.676 ]< 5 , 15 >
83 shrinking_nodes = [ 0 : 0 ]< 0 , 0 >
84 total_nodes = [ 15.1 : 6.35 ]< 9 , 26 >
85 points_visited = [ 6.3 : 2.751 ]< 4 , 11 >
86 coord_hits/pt = [ 0.57 : 0.2201 ]< 0.35 , 0.95 >
87 floating_ops_(K) = [ 0.156 : 0.0563 ]< 0.101 , 0.254 >
88 average_error = [ 0 : 0 ]< 0 , 0 >
89 rank_error = [ 0 : 0 ]< 0 , 0 >
90 )
91 ]
92 [Run Queries:
93 query_size = 10
94 dim = 2
95 search_method = priority
96 epsilon = 0
97 near_neigh = 3
98 true_nn = 13
99 query_time = 0 sec/query (biased by perf measurements)
100 (Performance stats: [ mean : stddev ]< min , max >
101 leaf_nodes = [ 5.9 : 2.025 ]< 4 , 9 >
102 splitting_nodes = [ 8.7 : 3.498 ]< 5 , 15 >
103 shrinking_nodes = [ 0 : 0 ]< 0 , 0 >
104 total_nodes = [ 14.6 : 5.42 ]< 9 , 24 >
105 points_visited = [ 5.9 : 2.025 ]< 4 , 9 >
106 coord_hits/pt = [ 0.535 : 0.1667 ]< 0.35 , 0.8 >
107 floating_ops_(K) = [ 0.1719 : 0.05861 ]< 0.114 , 0.267 >
108 average_error = [ 0 : 0 ]< 0 , 0 >
109 rank_error = [ 0 : 0 ]< 0 , 0 >
110 )
111 ]
112
113 EOF
114
115 cat <<EOF > test1-data.pts
116 -0.297462 0.176102
117 0.565538 -0.361496
118 0.909313 -0.182785
119 0.920712 0.478408
120 0.167682 0.0499836
121 0.305223 -0.0805835
122 0.114973 0.882453
123 0.742916 0.16376
124 0.0724605 -0.826775
125 0.690960 -0.559284
126 0.188485 -0.643934
127 0.749427 -0.942415
128 -0.970662 -0.223466
129 0.916110 0.879597
130 0.927417 -0.382593
131 -0.711327 0.278713
132 -0.519172 0.986146
133 0.135338 0.924588
134 -0.0837537 0.61687
135 0.0520465 0.896306
136
137 EOF
138
139 cat <<EOF > test1-query.pts
140 0.0902484 -0.207129
141 -0.419567 0.485743
142 0.826225 -0.30962
143 0.694758 0.987088
144 -0.410807 -0.465182
145 -0.836501 0.490184
146 0.588289 0.656408
147 0.325807 0.38721
148 -0.532226 -0.727036
149 -0.52506 -0.853508
150
151 EOF
152
153 g++ -o demo ann_test.cpp rand.cpp -lann
154 echo "build: OK"
155 [ -x demo ]
156 ./demo < test1.in
157 echo "run: OK"