diff --git a/cjs/index.js b/cjs/index.js
index 4566c30..818cb6e 100644
--- a/cjs/index.js
+++ b/cjs/index.js
@@ -38,7 +38,7 @@ module.exports = (parentNode, a, b, get, before) => {
     if (aEnd === aStart) {
       // we could be in a situation where the rest of nodes that
       // need to be added are not at the end, and in such case
-      // the node to `insertBefore`, if the index is more than 0
+      // the node to `moveBefore`, if the index is more than 0
       // must be retrieved, otherwise it's gonna be the first item.
       const node = bEnd < bLength ?
         (bStart ?
@@ -46,7 +46,7 @@ module.exports = (parentNode, a, b, get, before) => {
           get(b[bEnd - bStart], 0)) :
         before;
       while (bStart < bEnd)
-        parentNode.insertBefore(get(b[bStart++], 1), node);
+        parentNode.moveBefore(get(b[bStart++], 1), node);
     }
     // remove head or tail: fast path
     else if (bEnd === bStart) {
@@ -81,11 +81,11 @@ module.exports = (parentNode, a, b, get, before) => {
       // [1, 2, 3, 4, 5]
       // [1, 2, 3, 5, 6, 4]
       const node = get(a[--aEnd], -1).nextSibling;
-      parentNode.insertBefore(
+      parentNode.moveBefore(
         get(b[bStart++], 1),
         get(a[aStart++], -1).nextSibling
       );
-      parentNode.insertBefore(get(b[--bEnd], 1), node);
+      parentNode.moveBefore(get(b[--bEnd], 1), node);
       // mark the future index as identical (yeah, it's dirty, but cheap 👍)
       // The main reason to do this, is that when a[aEnd] will be reached,
       // the loop will likely be on the fast path, as identical to b[bEnd].
@@ -131,7 +131,7 @@ module.exports = (parentNode, a, b, get, before) => {
           if (sequence > (index - bStart)) {
             const node = get(a[aStart], 0);
             while (bStart < index)
-              parentNode.insertBefore(get(b[bStart++], 1), node);
+              parentNode.moveBefore(get(b[bStart++], 1), node);
           }
           // if the effort wasn't good enough, fallback to a replace,
           // moving both source and target indexes forward, hoping that some
diff --git a/esm/index.js b/esm/index.js
index fdc7508..08ff862 100644
--- a/esm/index.js
+++ b/esm/index.js
@@ -37,7 +37,7 @@ export default (parentNode, a, b, get, before) => {
     if (aEnd === aStart) {
       // we could be in a situation where the rest of nodes that
       // need to be added are not at the end, and in such case
-      // the node to `insertBefore`, if the index is more than 0
+      // the node to `moveBefore`, if the index is more than 0
       // must be retrieved, otherwise it's gonna be the first item.
       const node = bEnd < bLength ?
         (bStart ?
@@ -45,7 +45,7 @@ export default (parentNode, a, b, get, before) => {
           get(b[bEnd - bStart], 0)) :
         before;
       while (bStart < bEnd)
-        parentNode.insertBefore(get(b[bStart++], 1), node);
+        parentNode.moveBefore(get(b[bStart++], 1), node);
     }
     // remove head or tail: fast path
     else if (bEnd === bStart) {
@@ -80,11 +80,11 @@ export default (parentNode, a, b, get, before) => {
       // [1, 2, 3, 4, 5]
       // [1, 2, 3, 5, 6, 4]
       const node = get(a[--aEnd], -1).nextSibling;
-      parentNode.insertBefore(
+      parentNode.moveBefore(
         get(b[bStart++], 1),
         get(a[aStart++], -1).nextSibling
       );
-      parentNode.insertBefore(get(b[--bEnd], 1), node);
+      parentNode.moveBefore(get(b[--bEnd], 1), node);
       // mark the future index as identical (yeah, it's dirty, but cheap 👍)
       // The main reason to do this, is that when a[aEnd] will be reached,
       // the loop will likely be on the fast path, as identical to b[bEnd].
@@ -130,7 +130,7 @@ export default (parentNode, a, b, get, before) => {
           if (sequence > (index - bStart)) {
             const node = get(a[aStart], 0);
             while (bStart < index)
-              parentNode.insertBefore(get(b[bStart++], 1), node);
+              parentNode.moveBefore(get(b[bStart++], 1), node);
           }
           // if the effort wasn't good enough, fallback to a replace,
           // moving both source and target indexes forward, hoping that some
diff --git a/index.js b/index.js
index 2c0e9b7..c820f84 100644
--- a/index.js
+++ b/index.js
@@ -40,10 +40,10 @@ var udomdiff = (function (exports) {
       if (aEnd === aStart) {
         // we could be in a situation where the rest of nodes that
         // need to be added are not at the end, and in such case
-        // the node to `insertBefore`, if the index is more than 0
+        // the node to `moveBefore`, if the index is more than 0
         // must be retrieved, otherwise it's gonna be the first item.
         var node = bEnd < bLength ? bStart ? get(b[bStart - 1], -0).nextSibling : get(b[bEnd - bStart], 0) : before;
-        while (bStart < bEnd) parentNode.insertBefore(get(b[bStart++], 1), node);
+        while (bStart < bEnd) parentNode.moveBefore(get(b[bStart++], 1), node);
       }
       // remove head or tail: fast path
       else if (bEnd === bStart) {
@@ -74,8 +74,8 @@ var udomdiff = (function (exports) {
         // [1, 2, 3, 4, 5]
         // [1, 2, 3, 5, 6, 4]
         var _node = get(a[--aEnd], -1).nextSibling;
-        parentNode.insertBefore(get(b[bStart++], 1), get(a[aStart++], -1).nextSibling);
-        parentNode.insertBefore(get(b[--bEnd], 1), _node);
+        parentNode.moveBefore(get(b[bStart++], 1), get(a[aStart++], -1).nextSibling);
+        parentNode.moveBefore(get(b[--bEnd], 1), _node);
         // mark the future index as identical (yeah, it's dirty, but cheap 👍)
         // The main reason to do this, is that when a[aEnd] will be reached,
         // the loop will likely be on the fast path, as identical to b[bEnd].
@@ -118,7 +118,7 @@ var udomdiff = (function (exports) {
             // will be processed at zero cost
             if (sequence > index - bStart) {
               var _node2 = get(a[aStart], 0);
-              while (bStart < index) parentNode.insertBefore(get(b[bStart++], 1), _node2);
+              while (bStart < index) parentNode.moveBefore(get(b[bStart++], 1), _node2);
             }
             // if the effort wasn't good enough, fallback to a replace,
             // moving both source and target indexes forward, hoping that some
diff --git a/min.js b/min.js
index 6bd938b..eb68f50 100644
--- a/min.js
+++ b/min.js
@@ -1 +1 @@
-var udomdiff=(e=>(e.default=function(e,r,i,f,l){for(var n=i.length,t=r.length,o=n,s=0,a=0,v=null;s<t||a<o;)if(t===s)for(var d=o<n?a?f(i[a-1],-0).nextSibling:f(i[o-a],0):l;a<o;)e.insertBefore(f(i[a++],1),d);else if(o===a)for(;s<t;)v&&v.has(r[s])||e.removeChild(f(r[s],-1)),s++;else if(r[s]===i[a])s++,a++;else if(r[t-1]===i[o-1])t--,o--;else if(r[s]===i[o-1]&&i[a]===r[t-1]){var g=f(r[--t],-1).nextSibling;e.insertBefore(f(i[a++],1),f(r[s++],-1).nextSibling),e.insertBefore(f(i[--o],1),g),r[t]=i[o]}else{if(!v)for(var v=new Map,h=a;h<o;)v.set(i[h],h++);if(v.has(r[s])){var u=v.get(r[s]);if(a<u&&u<o){for(var b=s,B=1;++b<t&&b<o&&v.get(r[b])===u+B;)B++;if(u-a<B)for(var c=f(r[s],0);a<u;)e.insertBefore(f(i[a++],1),c);else e.replaceChild(f(i[a++],1),f(r[s++],-1))}else s++}else e.removeChild(f(r[s++],-1))}return i},Object.defineProperty(e,"__esModule",{value:!0}),e))({}).default;
\ No newline at end of file
+var udomdiff=(e=>(e.default=function(e,r,f,l,i){for(var o=f.length,v=r.length,a=o,n=0,t=0,s=null;n<v||t<a;)if(v===n)for(var d=a<o?t?l(f[t-1],-0).nextSibling:l(f[a-t],0):i;t<a;)e.moveBefore(l(f[t++],1),d);else if(a===t)for(;n<v;)s&&s.has(r[n])||e.removeChild(l(r[n],-1)),n++;else if(r[n]===f[t])n++,t++;else if(r[v-1]===f[a-1])v--,a--;else if(r[n]===f[a-1]&&f[t]===r[v-1]){var g=l(r[--v],-1).nextSibling;e.moveBefore(l(f[t++],1),l(r[n++],-1).nextSibling),e.moveBefore(l(f[--a],1),g),r[v]=f[a]}else{if(!s)for(var s=new Map,h=t;h<a;)s.set(f[h],h++);if(s.has(r[n])){var m=s.get(r[n]);if(t<m&&m<a){for(var u=n,b=1;++u<v&&u<a&&s.get(r[u])===m+b;)b++;if(m-t<b)for(var B=l(r[n],0);t<m;)e.moveBefore(l(f[t++],1),B);else e.replaceChild(l(f[t++],1),l(r[n++],-1))}else n++}else e.removeChild(l(r[n++],-1))}return f},Object.defineProperty(e,"__esModule",{value:!0}),e))({}).default;
\ No newline at end of file
diff --git a/new.js b/new.js
index a0376df..4447542 100644
--- a/new.js
+++ b/new.js
@@ -1 +1 @@
-var udomdiff=function(e){"use strict";return e.default=(e,t,i,l,r)=>{const f=i.length;let n=t.length,s=f,o=0,c=0,u=null;for(;o<n||c<s;)if(n===o){const t=s<f?c?l(i[c-1],-0).nextSibling:l(i[s-c],0):r;for(;c<s;)e.insertBefore(l(i[c++],1),t)}else if(s===c)for(;o<n;)u&&u.has(t[o])||e.removeChild(l(t[o],-1)),o++;else if(t[o]===i[c])o++,c++;else if(t[n-1]===i[s-1])n--,s--;else if(t[o]===i[s-1]&&i[c]===t[n-1]){const r=l(t[--n],-1).nextSibling;e.insertBefore(l(i[c++],1),l(t[o++],-1).nextSibling),e.insertBefore(l(i[--s],1),r),t[n]=i[s]}else{if(!u){u=new Map;let e=c;for(;e<s;)u.set(i[e],e++)}if(u.has(t[o])){const r=u.get(t[o]);if(c<r&&r<s){let f=o,d=1;for(;++f<n&&f<s&&u.get(t[f])===r+d;)d++;if(d>r-c){const f=l(t[o],0);for(;c<r;)e.insertBefore(l(i[c++],1),f)}else e.replaceChild(l(i[c++],1),l(t[o++],-1))}else o++}else e.removeChild(l(t[o++],-1))}return i},Object.defineProperty(e,"__esModule",{value:!0}),e}({}).default;
+var udomdiff=function(e){"use strict";return e.default=(e,l,o,f,t)=>{const i=o.length;let r=l.length,n=i,s=0,c=0,u=null;for(;s<r||c<n;)if(r===s){const l=n<i?c?f(o[c-1],-0).nextSibling:f(o[n-c],0):t;for(;c<n;)e.moveBefore(f(o[c++],1),l)}else if(n===c)for(;s<r;)u&&u.has(l[s])||e.removeChild(f(l[s],-1)),s++;else if(l[s]===o[c])s++,c++;else if(l[r-1]===o[n-1])r--,n--;else if(l[s]===o[n-1]&&o[c]===l[r-1]){const t=f(l[--r],-1).nextSibling;e.moveBefore(f(o[c++],1),f(l[s++],-1).nextSibling),e.moveBefore(f(o[--n],1),t),l[r]=o[n]}else{if(!u){u=new Map;let e=c;for(;e<n;)u.set(o[e],e++)}if(u.has(l[s])){const t=u.get(l[s]);if(c<t&&t<n){let i=s,d=1;for(;++i<r&&i<n&&u.get(l[i])===t+d;)d++;if(d>t-c){const i=f(l[s],0);for(;c<t;)e.moveBefore(f(o[c++],1),i)}else e.replaceChild(f(o[c++],1),f(l[s++],-1))}else s++}else e.removeChild(f(l[s++],-1))}return o},Object.defineProperty(e,"__esModule",{value:!0}),e}({}).default;