Searched refs:mergeIdx (Results 1 – 2 of 2) sorted by relevance
60 int mergeIdx = getChildIndexIfExists(Children, ChildToMerge); in reduceChildren() local61 if (mergeIdx == -1) { in reduceChildren()65 Children[mergeIdx].merge(std::move(ChildToMerge)); in reduceChildren()72 int mergeIdx = getChildIndexIfExists(Children, ChildToMerge); in reduceChildren() local73 if (mergeIdx == -1) { in reduceChildren()77 Children[mergeIdx].merge(std::move(ChildToMerge)); in reduceChildren()84 int mergeIdx = getChildIndexIfExists(Children, ChildToMerge); in reduceChildren() local85 if (mergeIdx == -1) { in reduceChildren()89 Children[mergeIdx].merge(std::move(ChildToMerge)); in reduceChildren()
1404 int mergeIdx, contIdx; in mergeInfoLocked() local1410 mergeIdx = contIdx = 0; in mergeInfoLocked()1412 while (mergeIdx < mergeMax || contIdx < contMax) { in mergeInfoLocked()1413 if (mergeIdx == mergeMax) { in mergeInfoLocked()1419 pNewSorted.add(pMergedInfo.itemAt(mergeIdx)); in mergeInfoLocked()1420 mergeIdx++; in mergeInfoLocked()1421 } else if (pMergedInfo.itemAt(mergeIdx) == pContents.itemAt(contIdx)) { in mergeInfoLocked()1424 mergeIdx++; in mergeInfoLocked()1426 } else if (pMergedInfo.itemAt(mergeIdx).isLessThan(pContents.itemAt(contIdx))) { in mergeInfoLocked()1428 pNewSorted.add(pMergedInfo.itemAt(mergeIdx)); in mergeInfoLocked()[all …]