103     auto newIt = newDependencies.begin();  in refresh()  local
105     while (oldIt != oldDependencies.end() && newIt != newDependencies.end()) {  in refresh()
107         if (lessThan(*oldIt, *newIt)) { // handle deleted node  in refresh()
109 …while (oldIt != oldDependencies.end() && lessThan(*oldIt, *newIt)) { ++oldIt; } // if more than on…  in refresh()
114         } else if (lessThan(*newIt, *oldIt)) { // handle added node  in refresh()
116 …    for (auto addIt = newIt; addIt != newDependencies.end() && lessThan(*addIt, *oldIt); ++addIt) {  in refresh()
121                 (*newIt)->setParent(oldBindingNode);  in refresh()
122                 oldIt = oldDependencies.insert(oldIt, std::move(*newIt));  in refresh()
124                 ++newIt;  in refresh()
128 … refresh(oldIt->get(), std::move(newIt->get()->dependencies()), createIndex(idx, 0, oldIt->get()));  in refresh()
130             ++newIt;  in refresh()
133     if (oldIt == oldDependencies.end() && newIt != newDependencies.end()) {  in refresh()
136         const auto count = std::distance(newIt, newDependencies.end());  in refresh()
139         while (newIt != newDependencies.end()) {  in refresh()
140             (*newIt)->setParent(oldBindingNode);  in refresh()
141             oldDependencies.push_back(std::move(*newIt));  in refresh()
142             ++newIt;  in refresh()