Lines Matching refs:siblings
328 const OrderedChildSet* siblings =
331 OrderedChildSet::const_iterator it = siblings->find(kernel);
332 return std::distance(siblings->begin(), it);
1093 // siblings.
1350 // items as siblings of items that do not maintain postions. It is required
1367 const OrderedChildSet* siblings =
1370 if (!siblings) {
1380 UniquePosition successor_pos = (*siblings->begin())->ref(UNIQUE_POSITION);
1391 DCHECK(!siblings->empty());
1401 // siblings with invalid positions at all. See TODO above.
1404 OrderedChildSet::const_iterator neighbour = siblings->find(predecessor);
1405 DCHECK(neighbour != siblings->end());
1408 if (neighbour == siblings->end()) {
1420 // in theory, but we're trying to deprecate support for siblings with and
