| /external/jemalloc/test/unit/ |
| rtree.c | 8 rtree_t *rtree = rtree_new(i, imalloc, idalloc); local
9 assert_u_eq(rtree_get(rtree, 0), 0,
11 rtree_delete(rtree);
21 rtree_t *rtree = rtree_new(i, imalloc, idalloc); local
23 rtree_set(rtree, 0, 1);
24 assert_u_eq(rtree_get(rtree, 0), 1,
27 rtree_set(rtree, ~((uintptr_t)0), 1);
28 assert_u_eq(rtree_get(rtree, ~((uintptr_t)0)), 1,
31 rtree_delete(rtree);
43 rtree_t *rtree = rtree_new(i, imalloc, idalloc) local
76 rtree_t *rtree = rtree_new(i, imalloc, idalloc); local
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| BBoxHierarchyTest.cpp | 159 // RTree
161 SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN); local
162 SkAutoUnref au(rtree);
163 tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter);
165 // Rtree that orders input rectangles on deferred insert.
|
| RTreeTest.cpp | 84 static void rtree_test_main(SkRTree* rtree, skiatest::Reporter* reporter) {
87 REPORTER_ASSERT(reporter, rtree);
111 rtree->insert(rects[i].data, rects[i].rect, true);
113 rtree->flushDeferredInserts();
114 run_queries(reporter, rand, rects, *rtree);
115 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
116 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
117 expectedDepthMax >= rtree->getDepth());
118 rtree->clear();
119 REPORTER_ASSERT(reporter, 0 == rtree->getCount())
146 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); local
[all...] |
| /external/skia/tests/ |
| RTreeTest.cpp | 80 static void rtree_test_main(SkRTree* rtree, skiatest::Reporter* reporter) {
83 REPORTER_ASSERT(reporter, NULL != rtree);
107 rtree->insert(rects[i].data, rects[i].rect, true);
109 rtree->flushDeferredInserts();
110 run_queries(reporter, rand, rects, *rtree);
111 REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
112 REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
113 expectedDepthMax >= rtree->getDepth());
114 rtree->clear();
115 REPORTER_ASSERT(reporter, 0 == rtree->getCount())
142 SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); local
[all...] |
| BBoxHierarchyTest.cpp | 159 // RTree
161 SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN); local
162 SkAutoUnref au(rtree);
163 tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter);
165 // Rtree that orders input rectangles on deferred insert.
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XObject.java | 347 public DocumentFragment rtree(XPathContext support) method in class:XObject
376 public DocumentFragment rtree() method in class:XObject
515 // result = rtree(support);
|
