RTreeTest.cpp revision 1f45e934b68a5985b2127ec871ff593c3bfc7c2e 
1
2/*
3 * Copyright 2012 Google Inc.
4 *
5 * Use of this source code is governed by a BSD-style license that can be
6 * found in the LICENSE file.
7 */
8
9#include "Test.h"
10#include "SkRandom.h"
11#include "SkRTree.h"
12#include "SkTSort.h"
13
14static const size_t MIN_CHILDREN = 6;
15static const size_t MAX_CHILDREN = 11;
16
17static const size_t NUM_RECTS = 200;
18static const size_t NUM_ITERATIONS = 100;
19static const size_t NUM_QUERIES = 50;
20
21struct DataRect {
22    SkIRect rect;
23    void* data;
24};
25
26static SkIRect random_rect(SkRandom& rand) {
27    SkIRect rect = {0,0,0,0};
28    while (rect.isEmpty()) {
29        rect.fLeft   = rand.nextS() % 1000;
30        rect.fRight  = rand.nextS() % 1000;
31        rect.fTop    = rand.nextS() % 1000;
32        rect.fBottom = rand.nextS() % 1000;
33        rect.sort();
34    }
35    return rect;
36}
37
38static void random_data_rects(SkRandom& rand, DataRect out[], int n) {
39    for (int i = 0; i < n; ++i) {
40        out[i].rect = random_rect(rand);
41        out[i].data = reinterpret_cast<void*>(i);
42    }
43}
44
45static bool verify_query(SkIRect query, DataRect rects[],
46                         SkTDArray<void*>& found) {
47    SkTDArray<void*> expected;
48    // manually intersect with every rectangle
49    for (int i = 0; i < NUM_RECTS; ++i) {
50        if (SkIRect::IntersectsNoEmptyCheck(query, rects[i].rect)) {
51            expected.push(rects[i].data);
52        }
53    }
54
55    if (expected.count() != found.count()) {
56        return false;
57    }
58
59    if (0 == expected.count()) {
60        return true;
61    }
62
63    // Just cast to long since sorting by the value of the void*'s was being problematic...
64    SkTQSort(reinterpret_cast<long*>(expected.begin()),
65             reinterpret_cast<long*>(expected.end() - 1));
66    SkTQSort(reinterpret_cast<long*>(found.begin()),
67             reinterpret_cast<long*>(found.end() - 1));
68    return found == expected;
69}
70
71static void runQueries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[],
72                       SkRTree& tree) {
73    for (int i = 0; i < NUM_QUERIES; ++i) {
74        SkTDArray<void*> hits;
75        SkIRect query = random_rect(rand);
76        tree.search(query, &hits);
77        REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
78    }
79}
80
81static void TestRTree(skiatest::Reporter* reporter) {
82    DataRect rects[NUM_RECTS];
83    SkRandom rand;
84    SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN);
85    REPORTER_ASSERT(reporter, NULL != rtree);
86
87    int expectedDepthMin = -1;
88    int expectedDepthMax = -1;
89
90    int tmp = NUM_RECTS;
91    while (tmp > 0) {
92        tmp -= static_cast<int>(pow(static_cast<double>(MAX_CHILDREN),
93                                static_cast<double>(expectedDepthMin + 1)));
94        ++expectedDepthMin;
95    }
96
97    tmp = NUM_RECTS;
98    while (tmp > 0) {
99        tmp -= static_cast<int>(pow(static_cast<double>(MIN_CHILDREN),
100                                static_cast<double>(expectedDepthMax + 1)));
101        ++expectedDepthMax;
102    }
103
104    for (int i = 0; i < NUM_ITERATIONS; ++i) {
105        random_data_rects(rand, rects, NUM_RECTS);
106
107        // First try bulk-loaded inserts
108        for (int i = 0; i < NUM_RECTS; ++i) {
109            rtree->insert(rects[i].data, rects[i].rect, true);
110        }
111        rtree->flushDeferredInserts();
112        runQueries(reporter, rand, rects, *rtree);
113        REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
114        REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
115                                  expectedDepthMax >= rtree->getDepth());
116        rtree->clear();
117        REPORTER_ASSERT(reporter, 0 == rtree->getCount());
118
119        // Then try immediate inserts
120        for (int i = 0; i < NUM_RECTS; ++i) {
121            rtree->insert(rects[i].data, rects[i].rect);
122        }
123        runQueries(reporter, rand, rects, *rtree);
124        REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
125        REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
126                                  expectedDepthMax >= rtree->getDepth());
127        rtree->clear();
128        REPORTER_ASSERT(reporter, 0 == rtree->getCount());
129
130        // And for good measure try immediate inserts, but in reversed order
131        for (int i = NUM_RECTS - 1; i >= 0; --i) {
132            rtree->insert(rects[i].data, rects[i].rect);
133        }
134        runQueries(reporter, rand, rects, *rtree);
135        REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount());
136        REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() &&
137                                  expectedDepthMax >= rtree->getDepth());
138        rtree->clear();
139        REPORTER_ASSERT(reporter, 0 == rtree->getCount());
140    }
141}
142
143#include "TestClassDef.h"
144DEFINE_TESTCLASS("RTree", RTreeTestClass, TestRTree)
145