52     mChildren = hierarchy.mChildren;  in LayerHierarchy()
70     for (auto& [child, childVariant] : mChildren) {  in traverse()
80     for (auto it = mChildren.begin(); it < mChildren.end(); it++) {  in traverseInZOrder()
103     insertSorted(mChildren, {child, variant});  in addChild()
107     auto it = std::find_if(mChildren.begin(), mChildren.end(),  in removeChild()
111     LLOG_ALWAYS_FATAL_WITH_TRACE_IF(it == mChildren.end(), "Could not find child!");  in removeChild()
112     mChildren.erase(it);  in removeChild()
116     std::sort(mChildren.begin(), mChildren.end(), layerZCompare);  in sortChildrenByZOrder()
120     auto it = std::find_if(mChildren.begin(), mChildren.end(),  in updateChild()
124     LLOG_ALWAYS_FATAL_WITH_TRACE_IF(it == mChildren.end(), "Could not find child!");  in updateChild()
143     if (mChildren.empty()) {  in getDebugStringShort()
146         debug += std::to_string(mChildren.size()) + " children";  in getDebugStringShort()
170     for (size_t i = 0; i < mChildren.size(); i++) {  in dump()
171         auto& [child, childVariant] = mChildren[i];  in dump()
173         const bool lastChild = i == (mChildren.size() - 1);  in dump()
272         for (auto& [child, childVariant] : hierarchy->mChildren) {  in getDescendants()
326     for (auto& [child, variant] : hierarchy->mChildren) {  in onLayerDestroyed()
345     auto it = hierarchy->mChildren.begin();  in updateMirrorLayer()
346     while (it != hierarchy->mChildren.end()) {  in updateMirrorLayer()
348             it = hierarchy->mChildren.erase(it);  in updateMirrorLayer()