Home
last modified time | relevance | path

Searched refs:rtree (Results 1 – 25 of 38) sorted by relevance

12

/external/chromium_org/third_party/sqlite/src/ext/rtree/
Drtree1.test23 # rtree-1.*: Creating/destroying r-tree tables.
24 # rtree-2.*: Test the implicit constraints - unique rowid and
27 # rtree-3.*: Linear scans of r-tree data.
28 # rtree-4.*: Test INSERT
29 # rtree-5.*: Test DELETE
30 # rtree-6.*: Test UPDATE
31 # rtree-7.*: Test renaming an r-tree table.
32 # rtree-8.*: Test constrained scans of r-tree data.
35 ifcapable !rtree {
41 # Test cases rtree-1.* test CREATE and DROP table statements.
[all …]
Drtree_perf.tcl26 set sql2 {CREATE VIRTUAL TABLE rtree USING rtree(ii, x1, x2, y1, y2)}
52 db eval {INSERT INTO rtree VALUES($ii, $x1, $x2, $y1, $y2)}
71 db eval {SELECT * FROM rtree WHERE x1<$x1 AND x2>$x2 AND y1<$y1 AND y2>$y2}
Drtree3.test21 ifcapable !rtree {
56 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2);
69 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2);
83 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2);
117 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2);
147 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2);
170 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2);
192 execsql { CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2) }
221 CREATE VIRTUAL TABLE rt USING rtree(ii, x1, x2, y1, y2, z1, z2);
Drtree7.test12 # Test that nothing goes wrong if an rtree table is created, then the
22 ifcapable !rtree||!vacuum {
30 CREATE VIRTUAL TABLE rt USING rtree(id, x1, x2, y1, y2);
DrtreeB.test19 ifcapable !rtree { finish_test ; return }
23 CREATE VIRTUAL TABLE t1 USING rtree(ii, x0, y0, x1, y1);
Dtkt3363.test21 ifcapable !rtree {
27 execsql { CREATE VIRTUAL TABLE t1 USING rtree(ii, x1, x2, y1, y2) }
Drtree4.test12 # Randomized test cases for the rtree extension.
20 ifcapable !rtree {
69 # Construct an rtree virtual table and an ordinary btree table
83 db eval "CREATE VIRTUAL TABLE rx USING rtree(id, [join $clist ,])"
134 # This should force a full-table scan on the rtree.
151 # This should force a full-table scan on the rtree.
Drtree9.test19 ifcapable !rtree { finish_test ; return }
24 CREATE VIRTUAL TABLE rt USING rtree(id, x1, x2, y1, y2, z1, z2);
91 CREATE VIRTUAL TABLE rt2 USING rtree(id, xmin, xmax, ymin, ymax);
DREADME33 CREATE VIRTUAL TABLE <name> USING rtree(<column-names>)
37 CREATE VIRTUAL TABLE boxes USING rtree(boxno, xmin, xmax, ymin, ymax);
105 gcc -shared rtree.c -o libSqliteRtree.so
Drtree6.test19 ifcapable !rtree {
54 CREATE VIRTUAL TABLE t1 USING rtree(ii, x1, x2, y1, y2);
110 CREATE VIRTUAL TABLE t3 USING rtree(id, x1, x2, y1, y2);
/external/jemalloc/test/unit/
Drtree.c8 rtree_t *rtree = rtree_new(i, imalloc, idalloc); in TEST_BEGIN() local
9 assert_u_eq(rtree_get(rtree, 0), 0, in TEST_BEGIN()
11 rtree_delete(rtree); in TEST_BEGIN()
21 rtree_t *rtree = rtree_new(i, imalloc, idalloc); in TEST_BEGIN() local
23 rtree_set(rtree, 0, 1); in TEST_BEGIN()
24 assert_u_eq(rtree_get(rtree, 0), 1, in TEST_BEGIN()
27 rtree_set(rtree, ~((uintptr_t)0), 1); in TEST_BEGIN()
28 assert_u_eq(rtree_get(rtree, ~((uintptr_t)0)), 1, in TEST_BEGIN()
31 rtree_delete(rtree); in TEST_BEGIN()
43 rtree_t *rtree = rtree_new(i, imalloc, idalloc); in TEST_BEGIN() local
[all …]
/external/skia/tests/
DRTreeTest.cpp80 static void rtree_test_main(SkRTree* rtree, skiatest::Reporter* reporter) { in rtree_test_main() argument
83 REPORTER_ASSERT(reporter, NULL != rtree); in rtree_test_main()
107 rtree->insert(rects[i].data, rects[i].rect, true); in rtree_test_main()
109 rtree->flushDeferredInserts(); in rtree_test_main()
110 run_queries(reporter, rand, rects, *rtree); in rtree_test_main()
111 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); in rtree_test_main()
112 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && in rtree_test_main()
113 expectedDepthMax >= rtree->getDepth()); in rtree_test_main()
114 rtree->clear(); in rtree_test_main()
115 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); in rtree_test_main()
[all …]
DBBoxHierarchyTest.cpp161 SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN); in DEF_TEST() local
162 SkAutoUnref au(rtree); in DEF_TEST()
163 tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); in DEF_TEST()
/external/jemalloc/include/jemalloc/internal/
Drtree.h40 void rtree_delete(rtree_t *rtree);
41 void rtree_prefork(rtree_t *rtree);
42 void rtree_postfork_parent(rtree_t *rtree);
43 void rtree_postfork_child(rtree_t *rtree);
51 uint8_t rtree_get_locked(rtree_t *rtree, uintptr_t key);
53 uint8_t rtree_get(rtree_t *rtree, uintptr_t key);
54 bool rtree_set(rtree_t *rtree, uintptr_t key, uint8_t val);
61 f(rtree_t *rtree, uintptr_t key) \
68 RTREE_LOCK(&rtree->mutex); \
69 for (i = lshift = 0, height = rtree->height, node = rtree->root;\
[all …]
/external/chromium_org/third_party/skia/tests/
DRTreeTest.cpp84 static void rtree_test_main(SkRTree* rtree, skiatest::Reporter* reporter) { in rtree_test_main() argument
87 REPORTER_ASSERT(reporter, rtree); in rtree_test_main()
111 rtree->insert(rects[i].data, rects[i].rect, true); in rtree_test_main()
113 rtree->flushDeferredInserts(); in rtree_test_main()
114 run_queries(reporter, rand, rects, *rtree); in rtree_test_main()
115 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); in rtree_test_main()
116 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && in rtree_test_main()
117 expectedDepthMax >= rtree->getDepth()); in rtree_test_main()
118 rtree->clear(); in rtree_test_main()
119 REPORTER_ASSERT(reporter, 0 == rtree->getCount()); in rtree_test_main()
[all …]
DBBoxHierarchyTest.cpp161 SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN); in DEF_TEST() local
162 SkAutoUnref au(rtree); in DEF_TEST()
163 tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter); in DEF_TEST()
/external/jemalloc/src/
Drtree.c62 rtree_delete_subtree(rtree_t *rtree, void **node, unsigned level) in rtree_delete_subtree() argument
65 if (level < rtree->height - 1) { in rtree_delete_subtree()
68 nchildren = ZU(1) << rtree->level2bits[level]; in rtree_delete_subtree()
72 rtree_delete_subtree(rtree, child, level + 1); in rtree_delete_subtree()
75 rtree->dalloc(node); in rtree_delete_subtree()
79 rtree_delete(rtree_t *rtree) in rtree_delete() argument
82 rtree_delete_subtree(rtree, rtree->root, 0); in rtree_delete()
83 rtree->dalloc(rtree); in rtree_delete()
87 rtree_prefork(rtree_t *rtree) in rtree_prefork() argument
90 malloc_mutex_prefork(&rtree->mutex); in rtree_prefork()
[all …]
/external/chromium_org/third_party/sqlite/src/test/
Drtree.test8 # This file runs all rtree related tests.
14 ifcapable rtree {
15 run_test_suite rtree
/external/chromium_org/third_party/sqlite/src/
DMakefile.vxworks193 -I$(TOP)/ext/rtree -I$(TOP)/ext/icu -I$(TOP)/ext/fts3 \
210 random.o resolve.o rowset.o rtree.o select.o status.o \
343 $(TOP)/ext/rtree/rtree.h \
344 $(TOP)/ext/rtree/rtree.c
447 $(TOP)/ext/rtree/rtree.h
592 rtree.o: $(TOP)/ext/rtree/rtree.c $(HDR) $(EXTHDR)
593 $(TCCX_SHARED) -DSQLITE_CORE -c $(TOP)/ext/rtree/rtree.c
Dmain.mk48 TCCX += -I$(TOP)/ext/rtree -I$(TOP)/ext/icu -I$(TOP)/ext/fts3
65 random.o resolve.o rowset.o rtree.o select.o status.o \
211 $(TOP)/ext/rtree/rtree.h \
212 $(TOP)/ext/rtree/rtree.c
361 $(TOP)/ext/rtree/rtree.h
514 rtree.o: $(TOP)/ext/rtree/rtree.c $(HDR) $(EXTHDR)
515 $(TCCX) -DSQLITE_CORE -c $(TOP)/ext/rtree/rtree.c
Dmanifest83 F ext/rtree/README 6315c0d73ebf0ec40dedb5aa0e942bc8b54e3761
84 F ext/rtree/rtree.c f5fa951eba03c41d292958064604a033021acdee
85 F ext/rtree/rtree.h 834dbcb82dc85b2481cde6a07cdadfddc99e9b9e
86 F ext/rtree/rtree1.test dbd4250ac0ad367a262eb9676f7e3080b0368206
87 F ext/rtree/rtree2.test acbb3a4ce0f4fbc2c304d2b4b784cfa161856bba
88 F ext/rtree/rtree3.test a494da55c30ee0bc9b01a91c80c81b387b22d2dc
89 F ext/rtree/rtree4.test 0061e6f464fd3dc6a79f82454c5a1c3dadbe42af
90 F ext/rtree/rtree5.test ce3d7ccae2cfd9d2e1052b462424964c9bdcda12
91 F ext/rtree/rtree6.test 0b380bd9af93f3bc496eef42502a336f58949c1b
92 F ext/rtree/rtree7.test bcb647b42920b3b5d025846689147778485cc318
[all …]
DMakefile.in29 TCC = @CC@ @CPPFLAGS@ @CFLAGS@ -I. -I${TOP}/src -I${TOP}/ext/rtree
177 random.lo resolve.lo rowset.lo rtree.lo select.lo status.lo \
325 $(TOP)/ext/rtree/rtree.h \
326 $(TOP)/ext/rtree/rtree.c
467 $(TOP)/ext/rtree/rtree.h
471 $(TOP)/ext/rtree/sqlite3rtree.h
847 rtree.lo: $(TOP)/ext/rtree/rtree.c $(HDR) $(EXTHDR)
848 $(LTCOMPILE) -DSQLITE_CORE -c $(TOP)/ext/rtree/rtree.c
/external/jemalloc/android/test/
Drun_unit.sh19 $test_dir/rtree
/external/jemalloc/
DAndroid.mk71 src/rtree.c \
173 test/unit/rtree.c \
/external/skia/dm/
DDMReplayTask.cpp10 DEFINE_bool(rtree, true, "If true, run picture replay tests with an rtree.");

12