OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:RTree
(Results
1 - 5
of
5
) sorted by null
/external/chromium_org/ui/gfx/geometry/
r_tree.h
24
class
RTree
: public RTreeBase {
31
// of the nodes within
RTree
, which adjusts the base of the logarithm in the
40
RTree
(size_t min_children, size_t max_children);
41
~
RTree
();
74
// A map of supplied keys to their Node representation within the
RTree
, for
79
DISALLOW_COPY_AND_ASSIGN(
RTree
);
83
RTree
<Key>::
RTree
(size_t min_children, size_t max_children)
88
RTree
<Key>::~
RTree
() {
[
all
...]
r_tree_unittest.cc
14
typedef
RTree
<int> RT;
16
// Given a pointer to an
RTree
, traverse it and verify that its internal
17
// structure is consistent with
RTree
semantics.
19
// If
RTree
is empty it should have an empty rectangle.
41
// the
RTree
for consistency with
RTree
semantics.
109
// Accessors to private members of
RTree
::Node.
114
// Provides access for tests to private methods of
RTree
::Node.
803
// An empty
RTree
should never return AppendIntersectingRecords results, and
[
all
...]
/external/chromium_org/third_party/skia/tests/
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
...]
/external/chromium_org/ui/views/
view.h
[
all
...]
Completed in 211 milliseconds