1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
|
/*PGR-GNU*****************************************************************
Copyright (c) 2025 pgRouting developers
Mail: project@pgrouting.org
------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
-- checks the minimum version version for C++ code
CREATE OR REPLACE FUNCTION min_lib_version(min_version TEXT)
RETURNS BOOLEAN AS
$BODY$
DECLARE val BOOLEAN;
BEGIN
WITH
current_version AS (SELECT string_to_array(regexp_replace((SELECT library FROM pgr_full_version()), '.*-', '', 'g'),'.')::int[] AS version),
asked_version AS (SELECT string_to_array(min_version, '.')::int[] AS version)
SELECT (current_version.version >= asked_version.version) FROM current_version, asked_version INTO val;
RETURN val;
END;
$BODY$
LANGUAGE plpgsql;
-- checks the minimum version version for SQL code
CREATE OR REPLACE FUNCTION min_version(min_version TEXT)
RETURNS BOOLEAN AS
$BODY$
DECLARE val BOOLEAN;
BEGIN
WITH
current_version AS (SELECT string_to_array(regexp_replace(pgr_version(), '-.*', '', 'g'),'.')::int[] AS version),
asked_version AS (SELECT string_to_array(min_version, '.')::int[] AS version)
SELECT (current_version.version >= asked_version.version) FROM current_version, asked_version INTO val;
RETURN val;
END;
$BODY$
LANGUAGE plpgsql;
CREATE OR REPLACE FUNCTION column_missing(TEXT, TEXT)
RETURNS TEXT AS
$BODY$
SELECT CASE WHEN min_version('3.8.0') THEN
collect_tap(throws_ok($1, '42703','column "' || $2 || '" does not exist'))
ELSE
collect_tap(throws_ok($1, 'P0001', 'Missing column'))
END;
$BODY$ LANGUAGE SQL;
CREATE OR REPLACE FUNCTION wrong_relation(TEXT, TEXT)
RETURNS TEXT AS
$BODY$
SELECT CASE WHEN min_version('3.8.0') THEN
collect_tap(throws_ok($1, '42P01', 'relation "' || $2 || '" does not exist'))
ELSE
collect_tap(throws_ok($1, 'P0001', 'relation "' || $2 || '" does not exist'))
END;
$BODY$ LANGUAGE SQL;
CREATE OR REPLACE FUNCTION function_types_eq(TEXT, TEXT)
RETURNS TEXT AS
$BODY$
SELECT set_eq(format($$
WITH
a AS (
SELECT oid, u.name, u.idx
FROM pg_catalog.pg_proc p CROSS JOIN unnest(coalesce(p.proallargtypes, p.proargtypes))
WITH ordinality as u(name, idx)
WHERE p.proname = '%1$s'),
b AS (
SELECT a.*, t.typname FROM a JOIN pg_catalog.pg_type As t on (t.oid = a.name))
SELECT array_agg(typname ORDER BY idx) FROM b GROUP BY oid
$$, $1), $2, $1 || ': Function types');
$BODY$ LANGUAGE SQL;
CREATE OR REPLACE FUNCTION function_types_has(TEXT, TEXT)
RETURNS TEXT AS
$BODY$
SELECT set_has(format($$
WITH
a AS (
SELECT oid, u.name, u.idx
FROM pg_proc p CROSS JOIN unnest(p.proallargtypes)
WITH ordinality as u(name, idx)
WHERE p.proname = '%1$s'),
b AS (
SELECT a.*, t.typname FROM a JOIN pg_type As t on (t.oid = a.name))
SELECT array_agg(typname ORDER BY idx) FROM b GROUP BY oid
$$, $1), $2, $1 || ': Function types');
$BODY$ LANGUAGE SQL;
CREATE OR REPLACE FUNCTION function_args_eq(TEXT, TEXT)
RETURNS TEXT AS
$BODY$
SELECT set_eq(format($$
SELECT proargnames from pg_catalog.pg_proc where proname = '%1$s'
$$, $1), $2, $1 || ': Function args names');
$BODY$ LANGUAGE SQL;
CREATE OR REPLACE FUNCTION function_args_has(TEXT, TEXT)
RETURNS TEXT AS
$BODY$
SELECT set_has(format($$
SELECT proargnames from pg_catalog.pg_proc where proname = '%1$s'
$$, $1), $2, $1 || ': Function has args names');
$BODY$ LANGUAGE SQL;
CREATE OR REPLACE FUNCTION function_returns_geom(TEXT)
RETURNS TEXT AS
$BODY$
SELECT set_eq(format($$
WITH a AS (SELECT prorettype FROM pg_proc WHERE proname = '%1$s')
SELECT typname from a JOIN pg_type ON(oid = prorettype)$$, $1),
$$VALUES ('geometry') $$);
$BODY$ LANGUAGE SQL;
CREATE FUNCTION has_total_edges_vertices(tbl TEXT,ne INTEGER, nv INTEGER)
RETURNS SETOF TEXT AS
$BODY$
BEGIN
CREATE TEMP TABLE tmp_rv ON COMMIT DROP AS
SELECT id, geom
FROM pgr_extractVertices($$ SELECT * FROM $$ || $1);
RETURN QUERY EXECUTE format($$
SELECT is((SELECT count(*)::INTEGER FROM %1$s), %2$s, '%1$s has %2$s edges');
$$, $1, $2);
RETURN QUERY EXECUTE format($$
SELECT is((SELECT count(*)::INTEGER FROM tmp_rv), %2$s, '%1$s has %2$s vertices');
$$, $1, $3);
END
$BODY$ LANGUAGE plpgsql;
CREATE OR REPLACE FUNCTION test_drivingSide(fn TEXT)
RETURNS SETOF TEXT AS
$BODY$
DECLARE
query_sql TEXT;
data TEXT := $$ARRAY[-6, 15, -5], -3$$;
BEGIN
IF NOT min_version('4.0.0') THEN
RETURN QUERY SELECT skip(1, 'New signatures on 4.0.0');
RETURN;
END IF;
query_sql := $$SELECT * FROM $$ || fn || $$('edges_sql',$$;
IF fn ilike '%trsp%' THEN
query_sql := query_sql ||$$ 'restrictions_sql', $$;
END IF;
IF fn ilike '%matrix%' OR fn ilike '%via%' THEN
data := $$ARRAY[-6, 15, -5]$$;
END IF;
IF fn ilike '%dd%' THEN
data := $$ARRAY[-6, 15, -5], 3$$;
END IF;
IF fn ilike '%ksp%' THEN
data := $$ARRAY[-6, 15, -5], 3, 2$$;
END IF;
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'r')$$,
fn || ': right driving side on default directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'r', true)$$,
fn || ': right driving side on directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'R')$$,
fn || ': Right driving side on default directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'R', true)$$,
fn || ': Right driving side on directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'l')$$,
fn || ': left driving side on default directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'l', true)$$,
fn || ': left driving side on directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'L')$$,
fn || ': Left driving side on default directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'L', true)$$,
fn || ': Left driving side on directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'b')$$,
fn || ': both driving side allowed on default directed graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'B')$$,
fn || ': Both driving side allowed on default directed graph');
RETURN QUERY SELECT throws_ok(
query_sql || $$'points_sql', $$ || data || $$, 'w')$$,
'XX000', $$Invalid value of 'driving side'$$,
fn || ': wrong driving side not allowed on default directed graph');
RETURN QUERY SELECT throws_ok(
query_sql || $$'points_sql', $$ || data || $$, 'W')$$,
'XX000', $$Invalid value of 'driving side'$$,
fn || ': Wrong driving side not allowed on default directed graph');
RETURN QUERY SELECT throws_ok(
query_sql || $$'points_sql', $$ || data || $$, '')$$,
'XX000', $$Invalid value of 'driving side'$$,
fn || ': empty driving side not allowed on undirected graph');
-- undirected graph
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'b', false)$$,
fn || ': both driving side on undirected graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'B', false)$$,
fn || ': Both driving side on undirected graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'r', false)$$,
fn || ': right driving side allowed on undirected graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'R', false)$$,
fn || ': Right driving side allowed on undirected graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'l', false)$$,
fn || ': left driving side allowed on undirected graph');
RETURN QUERY SELECT lives_ok(
query_sql || $$'points_sql', $$ || data || $$, 'L', false)$$,
fn || ': Left driving side allowed on undirected graph');
RETURN QUERY SELECT throws_ok(
query_sql || $$'points_sql', $$ || data || $$, 'w', false)$$,
'XX000', $$Invalid value of 'driving side'$$,
fn || ': wrong driving side not allowed on undirected graph');
RETURN QUERY SELECT throws_ok(
query_sql || $$'points_sql', $$ || data || $$, 'W', false)$$,
'XX000', $$Invalid value of 'driving side'$$,
fn || ': Wrong driving side not allowed on undirected graph');
RETURN QUERY SELECT throws_ok(
query_sql || $$'points_sql', $$ || data || $$, '', false)$$,
'XX000', $$Invalid value of 'driving side'$$,
fn || ': empty driving side not allowed on undirected graph');
END;
$BODY$
LANGUAGE plpgsql;
|
