                         removes.append(Reorder.Remove(key: midKey, from: midCursor - midRemovedCount))
                         midCursor += 1
                         midRemovedCount += 1
-
-                        // If `nextMidChild` is same as `newChild`...
-                        if let nextMidChild = midChildren[safe: midCursor],
-                            let nextMidKey = nextMidChild?.key, nextMidKey === newKey
-                        {
-                            midCursor += 1
-                            newCursor += 1
-                        }
-                        else {
-                            inserts.append(Reorder.Insert(key: newKey, to: newCursor))
-                            newCursor += 1
-                        }
                     }
 
                 // If "same key" or "neither has key"...

                midRemovedCount += 1
            }

            let midChild: AnyVTree<Msg>?
            if midCursor < midCount {
                midChild = midChildren[midCursor]
            }
            else {
                midChild = nil
            }

            switch (midChild?.key, newChild.key) {


        var midRemovedCount = 0 // offset adjustment for reorder-index calculation

        while newCursor < newCount {
            // Append `Remove` while `midChild` is nil.
            while midCursor < midCount && midChildren[midCursor] == nil {
                removes.append(Reorder.Remove(key: nil, from: midCursor - midRemovedCount))
