(function (win) { var NodeCtor = win.Node; if (!NodeCtor || !NodeCtor.prototype || win.__hpxTranslateGuard) return; if (typeof win.WeakMap !== "function" || typeof win.Map !== "function") return; if (typeof win.MutationObserver !== "function") return; win.__hpxTranslateGuard = true; var proto = NodeCtor.prototype; var rawRemoveChild = proto.removeChild; var rawInsertBefore = proto.insertBefore; var rawContains = proto.contains; var nodeValue = Object.getOwnPropertyDescriptor(proto, "nodeValue"); var slice = Array.prototype.slice; /* original text node -> { texts: [original text nodes], fonts: [ elements] } */ var swapOf = new win.WeakMap(); var remembered = 0; var observer = null; function isNode(n) { return !!n && typeof n.nodeType === "number"; } function isFont(n) { return !!n && n.nodeType === 1 && n.nodeName === "FONT"; } function remember(texts, fonts) { var swap = { texts: texts, fonts: fonts }; for (var i = 0; i < texts.length; i++) { if (!swapOf.has(texts[i])) remembered++; swapOf.set(texts[i], swap); } } /* One element's changes in this batch. Undo them, newest first, to get the children it had before the batch. Then walk the before and after lists side by side: between two unchanged neighbours, the text nodes that left were replaced by the elements that arrived. */ function learnParent(parent, recs) { var after = slice.call(parent.childNodes); var before = after.slice(); var arrived = []; var i, j, r, at; for (i = recs.length - 1; i >= 0; i--) { r = recs[i]; for (j = r.addedNodes.length - 1; j >= 0; j--) { arrived.push(r.addedNodes[j]); at = before.indexOf(r.addedNodes[j]); if (at !== -1) before.splice(at, 1); } if (r.removedNodes.length) { if (r.previousSibling) { at = before.indexOf(r.previousSibling); if (at === -1) return; at++; } else if (r.nextSibling) { at = before.indexOf(r.nextSibling); if (at === -1) return; } else { at = 0; } before.splice.apply(before, [at, 0].concat(slice.call(r.removedNodes))); } } var a = 0; var b = 0; while (true) { var texts = []; var fonts = []; var clean = true; while (a < before.length && after.indexOf(before[a]) === -1) { if (before[a].nodeType === 3 && before[a].parentNode === null) texts.push(before[a]); else clean = false; a++; } while (b < after.length && before.indexOf(after[b]) === -1) { if (isFont(after[b]) && arrived.indexOf(after[b]) !== -1) fonts.push(after[b]); else clean = false; b++; } if (clean && texts.length && fonts.length) remember(texts, fonts); if (a >= before.length || b >= after.length) return; /* unchanged neighbours in a different order: something moved them, stop guessing */ if (before[a] !== after[b]) return; a++; b++; } } function learn(records) { var byParent = new win.Map(); for (var i = 0; i < records.length; i++) { var r = records[i]; if (r.type !== "childList") continue; var entry = byParent.get(r.target); if (!entry) { entry = { recs: [], text: false, font: false }; byParent.set(r.target, entry); } entry.recs.push(r); for (var j = 0; j < r.removedNodes.length; j++) if (r.removedNodes[j].nodeType === 3) entry.text = true; for (var k = 0; k < r.addedNodes.length; k++) if (isFont(r.addedNodes[k])) entry.font = true; } byParent.forEach(function (entry, parent) { if (entry.text && entry.font) learnParent(parent, entry.recs); }); } function flush() { if (!observer) return; var pending = observer.takeRecords(); if (pending.length) learn(pending); } /* If the translator replaced this node, put the original text nodes back where the elements are and take the elements out. */ function restore(node) { flush(); if (!remembered) return; var swap = swapOf.get(node); if (!swap) return; var anchor = null; var i; for (i = 0; i < swap.fonts.length; i++) { if (swap.fonts[i].parentNode) { anchor = swap.fonts[i]; break; } } for (i = 0; i < swap.texts.length; i++) { var t = swap.texts[i]; if (anchor && t.parentNode === null) rawInsertBefore.call(anchor.parentNode, t, anchor); if (swapOf.get(t) === swap) { swapOf.delete(t); remembered--; } } /* no anchor: the translator already took its elements out ("Show original") */ if (anchor) { var parent = anchor.parentNode; for (i = 0; i < swap.fonts.length; i++) { if (swap.fonts[i].parentNode === parent) rawRemoveChild.call(parent, swap.fonts[i]); } } } proto.removeChild = function (child) { if (isNode(child) && child.parentNode !== this) { restore(child); if (child.parentNode !== this) { /* wrapped inside something under this parent: take it out of there */ if (child.parentNode && rawContains.call(this, child)) { return rawRemoveChild.call(child.parentNode, child); } /* already gone from this parent, which is what the caller wanted */ return child; } } return rawRemoveChild.call(this, child); }; proto.insertBefore = function (node, ref) { if (isNode(ref) && ref.parentNode !== this) { restore(ref); if (ref.parentNode !== this) { /* wrapped inside something under this parent: insert before the wrapper */ if (ref !== this && ref.parentNode && rawContains.call(this, ref)) { var top = ref; while (top && top.parentNode !== this) top = top.parentNode; return rawInsertBefore.call(this, node, top); } /* already a child here: leave it where it is rather than reorder blindly */ if (isNode(node) && node.parentNode === this) return node; /* the reference node is gone: keep the new node on the page, at the end */ return rawInsertBefore.call(this, node, null); } } return rawInsertBefore.call(this, node, ref); }; /* React changes text with textNode.nodeValue = "...". On a text node the translator replaced, that change would be invisible (the old translation stays on screen), so the originals go back first. */ if (nodeValue && nodeValue.get && nodeValue.set && nodeValue.configurable) { var setValue = nodeValue.set; Object.defineProperty(proto, "nodeValue", { configurable: true, enumerable: nodeValue.enumerable, get: nodeValue.get, set: function (value) { setValue.call(this, value); if (observer && this.nodeType === 3 && this.parentNode === null) restore(this); } }); } function watch() { if (observer || !win.document.documentElement) return; observer = new win.MutationObserver(learn); observer.observe(win.document.documentElement, { childList: true, subtree: true }); } /* translation only starts after the page has loaded, so parsing is not watched */ if (win.document.readyState === "loading") { win.document.addEventListener("DOMContentLoaded", watch); } else { watch(); } })(window);

Créez votre compte.