Searched refs:min_children (Results 1 - 4 of 4) sorted by relevance
/external/chromium_org/ui/gfx/geometry/ |
H A D | r_tree.h | 30 // |min_children| and |max_children| allows for adjustment of the average size 38 // Then |min_children| can bet set to a quantity slightly less than half of 40 RTree(size_t min_children, size_t max_children); 83 RTree<Key>::RTree(size_t min_children, size_t max_children) argument 84 : RTreeBase(min_children, max_children) {
|
H A D | r_tree_base.h | 34 RTreeBase(size_t min_children, size_t max_children); 154 // Returns a sibling to this Node with at least min_children and no greater 157 scoped_ptr<NodeBase> Split(size_t min_children, size_t max_children);
|
H A D | r_tree_base.cc | 201 scoped_ptr<RTreeBase::NodeBase> RTreeBase::Node::Split(size_t min_children, argument 231 // min_children <= children_.size() <= max_children. 232 size_t end_index = std::min(max_children, children_.size() - min_children); 234 SmallestMarginSum(min_children, 238 SmallestMarginSum(min_children, 249 ChooseSplitIndex(min_children, end_index, low_bounds, high_bounds); 529 RTreeBase::RTreeBase(size_t min_children, size_t max_children) argument 531 min_children_(min_children),
|
H A D | r_tree_unittest.cc | 43 size_t min_children, 48 EXPECT_GE(node->count(), min_children); 52 ValidateNode(node->child(i), min_children, max_children); 167 size_t NodeChooseSplitIndex(size_t min_children, argument 172 min_children, max_children, low_bounds, high_bounds); 42 ValidateNode(const RTreeBase::NodeBase* node_base, size_t min_children, size_t max_children) argument
|
Completed in 85 milliseconds