Home
last modified time | relevance | path

Searched refs:high_bounds (Results 1 – 3 of 3) sorted by relevance

/external/chromium_org/ui/gfx/geometry/
Dr_tree_base.cc246 const Rects& high_bounds( in Split() local
249 ChooseSplitIndex(min_children, end_index, low_bounds, high_bounds); in Split()
253 return DivideChildren(low_bounds, high_bounds, sort, split_index); in Split()
354 const Rects& high_bounds) { in ChooseSplitIndex() argument
355 DCHECK_EQ(low_bounds.size(), high_bounds.size()); in ChooseSplitIndex()
358 low_bounds[start_index], high_bounds[start_index]).size().GetArea(); in ChooseSplitIndex()
360 high_bounds[start_index].size().GetArea(); in ChooseSplitIndex()
364 UnionRects(low_bounds[p], high_bounds[p]).size().GetArea(); in ChooseSplitIndex()
366 low_bounds[p].size().GetArea() + high_bounds[p].size().GetArea(); in ChooseSplitIndex()
385 const Rects& high_bounds) { in SmallestMarginSum() argument
[all …]
Dr_tree_base.h175 const Rects& high_bounds);
190 const Rects& high_bounds);
237 const Rects& high_bounds,
Dr_tree_unittest.cc162 const RTreeRects& high_bounds) { in NodeSmallestMarginSum() argument
164 start_index, end_index, low_bounds, high_bounds); in NodeSmallestMarginSum()
170 const RTreeRects& high_bounds) { in NodeChooseSplitIndex() argument
172 min_children, max_children, low_bounds, high_bounds); in NodeChooseSplitIndex()
178 const RTreeRects& high_bounds, in NodeDivideChildren() argument
182 low_bounds, high_bounds, sorted_children, split_index); in NodeDivideChildren()
509 RTreeRects high_bounds; in TEST_F() local
516 high_bounds.push_back(Rect(0, 0, 10, 10)); in TEST_F()
520 test_node.get(), low_bounds, high_bounds, sorted_children, 5)); in TEST_F()