b640595f97
mechanism. FossilOrigin-Name: 1ccaaed6b516ec2ce953c1b31025a82ba76d00e7
73 lines
2.6 KiB
Plaintext
73 lines
2.6 KiB
Plaintext
# 2010 August 28
|
|
#
|
|
# The author disclaims copyright to this source code. In place of
|
|
# a legal notice, here is a blessing:
|
|
#
|
|
# May you do good and not evil.
|
|
# May you find forgiveness for yourself and forgive others.
|
|
# May you share freely, never taking more than you give.
|
|
#
|
|
#***********************************************************************
|
|
# This file contains tests for the r-tree module. Specifically, it tests
|
|
# that new-style custom r-tree queries (geometry callbacks) work.
|
|
#
|
|
|
|
if {![info exists testdir]} {
|
|
set testdir [file join [file dirname [info script]] .. .. test]
|
|
}
|
|
source $testdir/tester.tcl
|
|
ifcapable !rtree { finish_test ; return }
|
|
ifcapable rtree_int_only { finish_test; return }
|
|
|
|
|
|
#-------------------------------------------------------------------------
|
|
# Test the example 2d "circle" geometry callback.
|
|
#
|
|
register_circle_geom db
|
|
|
|
do_execsql_test rtreeE-1.1 {
|
|
PRAGMA page_size=512;
|
|
CREATE VIRTUAL TABLE rt2 USING rtree(id,x0,x1,y0,y1);
|
|
|
|
/* A tight pattern of small boxes near 0,0 */
|
|
WITH RECURSIVE
|
|
x(x) AS (VALUES(0) UNION ALL SELECT x+1 FROM x WHERE x<4),
|
|
y(y) AS (VALUES(0) UNION ALL SELECT y+1 FROM y WHERE y<4)
|
|
INSERT INTO rt2 SELECT x+5*y, x, x+2, y, y+2 FROM x, y;
|
|
|
|
/* A looser pattern of small boxes near 100, 0 */
|
|
WITH RECURSIVE
|
|
x(x) AS (VALUES(0) UNION ALL SELECT x+1 FROM x WHERE x<4),
|
|
y(y) AS (VALUES(0) UNION ALL SELECT y+1 FROM y WHERE y<4)
|
|
INSERT INTO rt2 SELECT 100+x+5*y, x*3+100, x*3+102, y*3, y*3+2 FROM x, y;
|
|
|
|
/* A looser pattern of larger boxes near 0, 200 */
|
|
WITH RECURSIVE
|
|
x(x) AS (VALUES(0) UNION ALL SELECT x+1 FROM x WHERE x<4),
|
|
y(y) AS (VALUES(0) UNION ALL SELECT y+1 FROM y WHERE y<4)
|
|
INSERT INTO rt2 SELECT 200+x+5*y, x*7, x*7+15, y*7+200, y*7+215 FROM x, y;
|
|
} {}
|
|
|
|
if 0 {
|
|
# Queries against each of the three clusters */
|
|
do_execsql_test rtreeE-1.1 {
|
|
SELECT id FROM rt2 WHERE id MATCH Qcircle(0.0, 0.0, 50.0) ORDER BY id;
|
|
} {0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24}
|
|
do_execsql_test rtreeE-1.2 {
|
|
SELECT id FROM rt2 WHERE id MATCH Qcircle(100.0, 0.0, 50.0) ORDER BY id;
|
|
} {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}
|
|
do_execsql_test rtreeE-1.3 {
|
|
SELECT id FROM rt2 WHERE id MATCH Qcircle(0.0, 200.0, 50.0) ORDER BY id;
|
|
} {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}
|
|
}
|
|
|
|
# The Qcircle geometry function gives a lower score to larger leaf-nodes.
|
|
# This causes the 200s to sort before the 100s and the 0s to sort before
|
|
# last.
|
|
#
|
|
do_execsql_test rtreeE-1.4 {
|
|
SELECT id FROM rt2 WHERE id MATCH Qcircle(0,0,1000) AND id%100==0
|
|
} {200 100 0}
|
|
|
|
finish_test
|