Searched refs:candidate_node (Results 1 – 3 of 3) sorted by relevance
410 const NodeBase* candidate_node, in OverlapIncreaseToAdd() argument412 DCHECK(candidate_node); in OverlapIncreaseToAdd()415 if (candidate_node->rect().Contains(rect)) in OverlapIncreaseToAdd()425 if ((*it) == candidate_node) in OverlapIncreaseToAdd()429 candidate_node->rect(), overlap_node->rect()).size().GetArea(); in OverlapIncreaseToAdd()506 NodeBase* candidate_node = children_[i]; in LeastAreaEnlargement() local508 candidate_node->rect().size().GetArea(); in LeastAreaEnlargement()511 best_node = candidate_node; in LeastAreaEnlargement()514 candidate_node->rect().size().GetArea() < in LeastAreaEnlargement()517 best_node = candidate_node; in LeastAreaEnlargement()
230 const NodeBase* candidate_node,
138 const RTreeNodeBase* candidate_node, in NodeOverlapIncreaseToAdd() argument140 return node->OverlapIncreaseToAdd(rect, candidate_node, expanded_rect); in NodeOverlapIncreaseToAdd()