anchor.diff:                updated = true;
                 break;
               }
  -            parent.insertChild(bNode, aNode, context, attached);
  +            parent._insertChild(bNode, aNode, context, attached);
             }
           }
   
           if (updated) {
             while (i < b.length) {
  -            parent.insertChild(b[i++], null, context, attached);
  +            parent._insertChild(b[i++], null, context, attached);
             }
           } else {
  -          parent.removeChild(aNode, context);
  +          parent._removeChild(aNode, context);
           }
         } else if (b.length == 1) {
           // fast path when [b] have 1 child
  
positive.code: 
    // All nodes from [b] are updated, remove the rest from [a].
    while (bStart <= bEnd) {
      parent.insertChild(b[bStart++], next, context, attached);
    }
  }
  
  
negative.code:         }
  
          if (removed) {
            parent._removeChild(aNode, context);
            removeOffset++;
          }
        }
  