piral-blazor 1.0.0-pre.2217 → 1.0.0

package/lib/internal/Rendering/LogicalElements.js

@@ -1,265 +0,0 @@
-"use strict";
-/*
-  A LogicalElement plays the same role as an Element instance from the point of view of the
-  API consumer. Inserting and removing logical elements updates the browser DOM just the same.
-
-  The difference is that, unlike regular DOM mutation APIs, the LogicalElement APIs don't use
-  the underlying DOM structure as the data storage for the element hierarchy. Instead, the
-  LogicalElement APIs take care of tracking hierarchical relationships separately. The point
-  of this is to permit a logical tree structure in which parent/child relationships don't
-  have to be materialized in terms of DOM element parent/child relationships. And the reason
-  why we want that is so that hierarchies of Blazor components can be tracked even when those
-  components' render output need not be a single literal DOM element.
-
-  Consumers of the API don't need to know about the implementation, but how it's done is:
-  - Each LogicalElement is materialized in the DOM as either:
-    - A Node instance, for actual Node instances inserted using 'insertLogicalChild' or
-      for Element instances promoted to LogicalElement via 'toLogicalElement'
-    - A Comment instance, for 'logical container' instances inserted using 'createAndInsertLogicalContainer'
-  - Then, on that instance (i.e., the Node or Comment), we store an array of 'logical children'
-    instances, e.g.,
-      [firstChild, secondChild, thirdChild, ...]
-    ... plus we store a reference to the 'logical parent' (if any)
-  - The 'logical children' array means we can look up in O(1):
-    - The number of logical children (not currently implemented because not required, but trivial)
-    - The logical child at any given index
-  - Whenever a logical child is added or removed, we update the parent's array of logical children
-*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getClosestDomElement = exports.permuteLogicalChildren = exports.getLogicalChildrenArray = exports.isSvgElement = exports.getLogicalChild = exports.getLogicalSiblingEnd = exports.getLogicalParent = exports.removeLogicalChild = exports.insertLogicalChild = exports.createAndInsertLogicalContainer = exports.toLogicalElement = exports.toLogicalRootCommentElement = void 0;
-var logicalChildrenPropname = createSymbolOrFallback('_blazorLogicalChildren');
-var logicalParentPropname = createSymbolOrFallback('_blazorLogicalParent');
-var logicalEndSiblingPropname = createSymbolOrFallback('_blazorLogicalEnd');
-function toLogicalRootCommentElement(start, end) {
-    // Now that we support start/end comments as component delimiters we are going to be setting up
-    // adding the components rendered output as siblings of the start/end tags (between).
-    // For that to work, we need to appropriately configure the parent element to be a logical element
-    // with all their children being the child elements.
-    // For example, imagine you have
-    // <app>
-    // <div><p>Static content</p></div>
-    // <!-- start component
-    // <!-- end component
-    // <footer>Some other content</footer>
-    // <app>
-    // We want the parent element to be something like
-    // *app
-    // |- *div
-    // |- *component
-    // |- *footer
-    if (!start.parentNode) {
-        throw new Error("Comment not connected to the DOM " + start.textContent);
-    }
-    var parent = start.parentNode;
-    var parentLogicalElement = toLogicalElement(parent, /* allow existing contents */ true);
-    var children = getLogicalChildrenArray(parentLogicalElement);
-    Array.from(parent.childNodes).forEach(function (n) { return children.push(n); });
-    start[logicalParentPropname] = parentLogicalElement;
-    // We might not have an end comment in the case of non-prerendered components.
-    if (end) {
-        start[logicalEndSiblingPropname] = end;
-        toLogicalElement(end, /* allowExistingcontents */ true);
-    }
-    return toLogicalElement(start, /* allowExistingContents */ true);
-}
-exports.toLogicalRootCommentElement = toLogicalRootCommentElement;
-function toLogicalElement(element, allowExistingContents) {
-    // Normally it's good to assert that the element has started empty, because that's the usual
-    // situation and we probably have a bug if it's not. But for the element that contain prerendered
-    // root components, we want to let them keep their content until we replace it.
-    if (element.childNodes.length > 0 && !allowExistingContents) {
-        throw new Error('New logical elements must start empty, or allowExistingContents must be true');
-    }
-    element[logicalChildrenPropname] = [];
-    return element;
-}
-exports.toLogicalElement = toLogicalElement;
-function createAndInsertLogicalContainer(parent, childIndex) {
-    var containerElement = document.createComment('!');
-    insertLogicalChild(containerElement, parent, childIndex);
-    return containerElement;
-}
-exports.createAndInsertLogicalContainer = createAndInsertLogicalContainer;
-function insertLogicalChild(child, parent, childIndex) {
-    var childAsLogicalElement = child;
-    if (child instanceof Comment) {
-        var existingGrandchildren = getLogicalChildrenArray(childAsLogicalElement);
-        if (existingGrandchildren && getLogicalChildrenArray(childAsLogicalElement).length > 0) {
-            // There's nothing to stop us implementing support for this scenario, and it's not difficult
-            // (after inserting 'child' itself, also iterate through its logical children and physically
-            // put them as following-siblings in the DOM). However there's no scenario that requires it
-            // presently, so if we did implement it there'd be no good way to have tests for it.
-            throw new Error('Not implemented: inserting non-empty logical container');
-        }
-    }
-    if (getLogicalParent(childAsLogicalElement)) {
-        // Likewise, we could easily support this scenario too (in this 'if' block, just splice
-        // out 'child' from the logical children array of its previous logical parent by using
-        // Array.prototype.indexOf to determine its previous sibling index).
-        // But again, since there's not currently any scenario that would use it, we would not
-        // have any test coverage for such an implementation.
-        throw new Error('Not implemented: moving existing logical children');
-    }
-    var newSiblings = getLogicalChildrenArray(parent);
-    if (childIndex < newSiblings.length) {
-        // Insert
-        var nextSibling = newSiblings[childIndex];
-        nextSibling.parentNode.insertBefore(child, nextSibling);
-        newSiblings.splice(childIndex, 0, childAsLogicalElement);
-    }
-    else {
-        // Append
-        appendDomNode(child, parent);
-        newSiblings.push(childAsLogicalElement);
-    }
-    childAsLogicalElement[logicalParentPropname] = parent;
-    if (!(logicalChildrenPropname in childAsLogicalElement)) {
-        childAsLogicalElement[logicalChildrenPropname] = [];
-    }
-}
-exports.insertLogicalChild = insertLogicalChild;
-function removeLogicalChild(parent, childIndex) {
-    var childrenArray = getLogicalChildrenArray(parent);
-    var childToRemove = childrenArray.splice(childIndex, 1)[0];
-    // If it's a logical container, also remove its descendants
-    if (childToRemove instanceof Comment) {
-        var grandchildrenArray = getLogicalChildrenArray(childToRemove);
-        while (grandchildrenArray.length > 0) {
-            removeLogicalChild(childToRemove, 0);
-        }
-    }
-    // Finally, remove the node itself
-    var domNodeToRemove = childToRemove;
-    domNodeToRemove.parentNode.removeChild(domNodeToRemove);
-}
-exports.removeLogicalChild = removeLogicalChild;
-function getLogicalParent(element) {
-    return element[logicalParentPropname] || null;
-}
-exports.getLogicalParent = getLogicalParent;
-function getLogicalSiblingEnd(element) {
-    return element[logicalEndSiblingPropname] || null;
-}
-exports.getLogicalSiblingEnd = getLogicalSiblingEnd;
-function getLogicalChild(parent, childIndex) {
-    return getLogicalChildrenArray(parent)[childIndex];
-}
-exports.getLogicalChild = getLogicalChild;
-function isSvgElement(element) {
-    return getClosestDomElement(element).namespaceURI === 'http://www.w3.org/2000/svg';
-}
-exports.isSvgElement = isSvgElement;
-function getLogicalChildrenArray(element) {
-    return element[logicalChildrenPropname];
-}
-exports.getLogicalChildrenArray = getLogicalChildrenArray;
-function permuteLogicalChildren(parent, permutationList) {
-    // The permutationList must represent a valid permutation, i.e., the list of 'from' indices
-    // is distinct, and the list of 'to' indices is a permutation of it. The algorithm here
-    // relies on that assumption.
-    // Each of the phases here has to happen separately, because each one is designed not to
-    // interfere with the indices or DOM entries used by subsequent phases.
-    // Phase 1: track which nodes we will move
-    var siblings = getLogicalChildrenArray(parent);
-    permutationList.forEach(function (listEntry) {
-        listEntry.moveRangeStart = siblings[listEntry.fromSiblingIndex];
-        listEntry.moveRangeEnd = findLastDomNodeInRange(listEntry.moveRangeStart);
-    });
-    // Phase 2: insert markers
-    permutationList.forEach(function (listEntry) {
-        var marker = (listEntry.moveToBeforeMarker = document.createComment('marker'));
-        var insertBeforeNode = siblings[listEntry.toSiblingIndex + 1];
-        if (insertBeforeNode) {
-            insertBeforeNode.parentNode.insertBefore(marker, insertBeforeNode);
-        }
-        else {
-            appendDomNode(marker, parent);
-        }
-    });
-    // Phase 3: move descendants & remove markers
-    permutationList.forEach(function (listEntry) {
-        var insertBefore = listEntry.moveToBeforeMarker;
-        var parentDomNode = insertBefore.parentNode;
-        var elementToMove = listEntry.moveRangeStart;
-        var moveEndNode = listEntry.moveRangeEnd;
-        var nextToMove = elementToMove;
-        while (nextToMove) {
-            var nextNext = nextToMove.nextSibling;
-            parentDomNode.insertBefore(nextToMove, insertBefore);
-            if (nextToMove === moveEndNode) {
-                break;
-            }
-            else {
-                nextToMove = nextNext;
-            }
-        }
-        parentDomNode.removeChild(insertBefore);
-    });
-    // Phase 4: update siblings index
-    permutationList.forEach(function (listEntry) {
-        siblings[listEntry.toSiblingIndex] = listEntry.moveRangeStart;
-    });
-}
-exports.permuteLogicalChildren = permuteLogicalChildren;
-function getClosestDomElement(logicalElement) {
-    if (logicalElement instanceof Element) {
-        return logicalElement;
-    }
-    else if (logicalElement instanceof Comment) {
-        return logicalElement.parentNode;
-    }
-    else {
-        throw new Error('Not a valid logical element');
-    }
-}
-exports.getClosestDomElement = getClosestDomElement;
-function getLogicalNextSibling(element) {
-    var siblings = getLogicalChildrenArray(getLogicalParent(element));
-    var siblingIndex = Array.prototype.indexOf.call(siblings, element);
-    return siblings[siblingIndex + 1] || null;
-}
-function appendDomNode(child, parent) {
-    // This function only puts 'child' into the DOM in the right place relative to 'parent'
-    // It does not update the logical children array of anything
-    if (parent instanceof Element) {
-        parent.appendChild(child);
-    }
-    else if (parent instanceof Comment) {
-        var parentLogicalNextSibling = getLogicalNextSibling(parent);
-        if (parentLogicalNextSibling) {
-            // Since the parent has a logical next-sibling, its appended child goes right before that
-            parentLogicalNextSibling.parentNode.insertBefore(child, parentLogicalNextSibling);
-        }
-        else {
-            // Since the parent has no logical next-sibling, keep recursing upwards until we find
-            // a logical ancestor that does have a next-sibling or is a physical element.
-            appendDomNode(child, getLogicalParent(parent));
-        }
-    }
-    else {
-        // Should never happen
-        throw new Error("Cannot append node because the parent is not a valid logical element. Parent: " + parent);
-    }
-}
-// Returns the final node (in depth-first evaluation order) that is a descendant of the logical element.
-// As such, the entire subtree is between 'element' and 'findLastDomNodeInRange(element)' inclusive.
-function findLastDomNodeInRange(element) {
-    if (element instanceof Element) {
-        return element;
-    }
-    var nextSibling = getLogicalNextSibling(element);
-    if (nextSibling) {
-        // Simple case: not the last logical sibling, so take the node before the next sibling
-        return nextSibling.previousSibling;
-    }
-    else {
-        // Harder case: there's no logical next-sibling, so recurse upwards until we find
-        // a logical ancestor that does have one, or a physical element
-        var logicalParent = getLogicalParent(element);
-        return logicalParent instanceof Element ? logicalParent.lastChild : findLastDomNodeInRange(logicalParent);
-    }
-}
-function createSymbolOrFallback(fallback) {
-    return typeof Symbol === 'function' ? Symbol() : fallback;
-}
-//# sourceMappingURL=LogicalElements.js.map

package/lib/internal/Rendering/LogicalElements.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"LogicalElements.js","sourceRoot":"","sources":["../../../src/internal/Rendering/LogicalElements.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;EAyBE;;;AAEF,IAAM,uBAAuB,GAAG,sBAAsB,CAAC,wBAAwB,CAAC,CAAC;AACjF,IAAM,qBAAqB,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,CAAC;AAC7E,IAAM,yBAAyB,GAAG,sBAAsB,CAAC,mBAAmB,CAAC,CAAC;AAE9E,SAAgB,2BAA2B,CAAC,KAAc,EAAE,GAAY;IACtE,+FAA+F;IAC/F,qFAAqF;IACrF,kGAAkG;IAClG,oDAAoD;IACpD,gCAAgC;IAChC,QAAQ;IACR,mCAAmC;IACnC,uBAAuB;IACvB,qBAAqB;IACrB,sCAAsC;IACtC,QAAQ;IACR,kDAAkD;IAClD,OAAO;IACP,UAAU;IACV,gBAAgB;IAChB,aAAa;IACb,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE;QACrB,MAAM,IAAI,KAAK,CAAC,sCAAoC,KAAK,CAAC,WAAa,CAAC,CAAC;KAC1E;IAED,IAAM,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;IAChC,IAAM,oBAAoB,GAAG,gBAAgB,CAAC,MAAM,EAAE,6BAA6B,CAAC,IAAI,CAAC,CAAC;IAC1F,IAAM,QAAQ,GAAG,uBAAuB,CAAC,oBAAoB,CAAC,CAAC;IAC/D,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,QAAQ,CAAC,IAAI,CAAE,CAA+B,CAAC,EAA/C,CAA+C,CAAC,CAAC;IAC9F,KAAK,CAAC,qBAAqB,CAAC,GAAG,oBAAoB,CAAC;IACpD,8EAA8E;IAC9E,IAAI,GAAG,EAAE;QACP,KAAK,CAAC,yBAAyB,CAAC,GAAG,GAAG,CAAC;QACvC,gBAAgB,CAAC,GAAG,EAAE,2BAA2B,CAAC,IAAI,CAAC,CAAC;KACzD;IACD,OAAO,gBAAgB,CAAC,KAAK,EAAE,2BAA2B,CAAC,IAAI,CAAC,CAAC;AACnE,CAAC;AAhCD,kEAgCC;AAED,SAAgB,gBAAgB,CAAC,OAAa,EAAE,qBAA+B;IAC7E,4FAA4F;IAC5F,iGAAiG;IACjG,+EAA+E;IAC/E,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,qBAAqB,EAAE;QAC3D,MAAM,IAAI,KAAK,CAAC,8EAA8E,CAAC,CAAC;KACjG;IAED,OAAO,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC;IACtC,OAAQ,OAAqC,CAAC;AAChD,CAAC;AAVD,4CAUC;AAED,SAAgB,+BAA+B,CAAC,MAAsB,EAAE,UAAkB;IACxF,IAAM,gBAAgB,GAAG,QAAQ,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;IACrD,kBAAkB,CAAC,gBAAgB,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IACzD,OAAQ,gBAA0C,CAAC;AACrD,CAAC;AAJD,0EAIC;AAED,SAAgB,kBAAkB,CAAC,KAAW,EAAE,MAAsB,EAAE,UAAkB;IACxF,IAAM,qBAAqB,GAAI,KAA+B,CAAC;IAC/D,IAAI,KAAK,YAAY,OAAO,EAAE;QAC5B,IAAM,qBAAqB,GAAG,uBAAuB,CAAC,qBAAqB,CAAC,CAAC;QAC7E,IAAI,qBAAqB,IAAI,uBAAuB,CAAC,qBAAqB,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;YACtF,4FAA4F;YAC5F,4FAA4F;YAC5F,2FAA2F;YAC3F,oFAAoF;YACpF,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;SAC3E;KACF;IAED,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,EAAE;QAC3C,uFAAuF;QACvF,sFAAsF;QACtF,oEAAoE;QACpE,sFAAsF;QACtF,qDAAqD;QACrD,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;KACtE;IAED,IAAM,WAAW,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE;QACnC,SAAS;QACT,IAAM,WAAW,GAAI,WAAW,CAAC,UAAU,CAAiB,CAAC;QAC7D,WAAW,CAAC,UAAW,CAAC,YAAY,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACzD,WAAW,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;KAC1D;SAAM;QACL,SAAS;QACT,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC7B,WAAW,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;KACzC;IAED,qBAAqB,CAAC,qBAAqB,CAAC,GAAG,MAAM,CAAC;IACtD,IAAI,CAAC,CAAC,uBAAuB,IAAI,qBAAqB,CAAC,EAAE;QACvD,qBAAqB,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC;KACrD;AACH,CAAC;AAtCD,gDAsCC;AAED,SAAgB,kBAAkB,CAAC,MAAsB,EAAE,UAAkB;IAC3E,IAAM,aAAa,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IACtD,IAAM,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7D,2DAA2D;IAC3D,IAAI,aAAa,YAAY,OAAO,EAAE;QACpC,IAAM,kBAAkB,GAAG,uBAAuB,CAAC,aAAa,CAAC,CAAC;QAClE,OAAO,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE;YACpC,kBAAkB,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;SACtC;KACF;IAED,kCAAkC;IAClC,IAAM,eAAe,GAAI,aAA6B,CAAC;IACvD,eAAe,CAAC,UAAW,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;AAC3D,CAAC;AAfD,gDAeC;AAED,SAAgB,gBAAgB,CAAC,OAAuB;IACtD,OAAQ,OAAO,CAAC,qBAAqB,CAAoB,IAAI,IAAI,CAAC;AACpE,CAAC;AAFD,4CAEC;AAED,SAAgB,oBAAoB,CAAC,OAAuB;IAC1D,OAAQ,OAAO,CAAC,yBAAyB,CAAoB,IAAI,IAAI,CAAC;AACxE,CAAC;AAFD,oDAEC;AAED,SAAgB,eAAe,CAAC,MAAsB,EAAE,UAAkB;IACxE,OAAO,uBAAuB,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AACrD,CAAC;AAFD,0CAEC;AAED,SAAgB,YAAY,CAAC,OAAuB;IAClD,OAAO,oBAAoB,CAAC,OAAO,CAAC,CAAC,YAAY,KAAK,4BAA4B,CAAC;AACrF,CAAC;AAFD,oCAEC;AAED,SAAgB,uBAAuB,CAAC,OAAuB;IAC7D,OAAO,OAAO,CAAC,uBAAuB,CAAqB,CAAC;AAC9D,CAAC;AAFD,0DAEC;AAED,SAAgB,sBAAsB,CAAC,MAAsB,EAAE,eAAuC;IACpG,2FAA2F;IAC3F,uFAAuF;IACvF,6BAA6B;IAE7B,wFAAwF;IACxF,uEAAuE;IAEvE,0CAA0C;IAC1C,IAAM,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC;IACjD,eAAe,CAAC,OAAO,CAAC,UAAC,SAA+C;QACtE,SAAS,CAAC,cAAc,GAAG,QAAQ,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC;QAChE,SAAS,CAAC,YAAY,GAAG,sBAAsB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,0BAA0B;IAC1B,eAAe,CAAC,OAAO,CAAC,UAAC,SAA+C;QACtE,IAAM,MAAM,GAAG,CAAC,SAAS,CAAC,kBAAkB,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjF,IAAM,gBAAgB,GAAI,QAAQ,CAAC,SAAS,CAAC,cAAc,GAAG,CAAC,CAAiB,CAAC;QACjF,IAAI,gBAAgB,EAAE;YACpB,gBAAgB,CAAC,UAAW,CAAC,YAAY,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;SACrE;aAAM;YACL,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;SAC/B;IACH,CAAC,CAAC,CAAC;IAEH,6CAA6C;IAC7C,eAAe,CAAC,OAAO,CAAC,UAAC,SAA+C;QACtE,IAAM,YAAY,GAAG,SAAS,CAAC,kBAAmB,CAAC;QACnD,IAAM,aAAa,GAAG,YAAY,CAAC,UAAW,CAAC;QAC/C,IAAM,aAAa,GAAG,SAAS,CAAC,cAAe,CAAC;QAChD,IAAM,WAAW,GAAG,SAAS,CAAC,YAAa,CAAC;QAC5C,IAAI,UAAU,GAAI,aAAoC,CAAC;QACvD,OAAO,UAAU,EAAE;YACjB,IAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,CAAC;YACxC,aAAa,CAAC,YAAY,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;YAErD,IAAI,UAAU,KAAK,WAAW,EAAE;gBAC9B,MAAM;aACP;iBAAM;gBACL,UAAU,GAAG,QAAQ,CAAC;aACvB;SACF;QAED,aAAa,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,iCAAiC;IACjC,eAAe,CAAC,OAAO,CAAC,UAAC,SAA+C;QACtE,QAAQ,CAAC,SAAS,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC,cAAe,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC;AAnDD,wDAmDC;AAED,SAAgB,oBAAoB,CAAC,cAA8B;IACjE,IAAI,cAAc,YAAY,OAAO,EAAE;QACrC,OAAO,cAAc,CAAC;KACvB;SAAM,IAAI,cAAc,YAAY,OAAO,EAAE;QAC5C,OAAO,cAAc,CAAC,UAAsB,CAAC;KAC9C;SAAM;QACL,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;KAChD;AACH,CAAC;AARD,oDAQC;AAcD,SAAS,qBAAqB,CAAC,OAAuB;IACpD,IAAM,QAAQ,GAAG,uBAAuB,CAAC,gBAAgB,CAAC,OAAO,CAAE,CAAC,CAAC;IACrE,IAAM,YAAY,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACrE,OAAO,QAAQ,CAAC,YAAY,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC;AAC5C,CAAC;AAED,SAAS,aAAa,CAAC,KAAW,EAAE,MAAsB;IACxD,uFAAuF;IACvF,4DAA4D;IAC5D,IAAI,MAAM,YAAY,OAAO,EAAE;QAC7B,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;KAC3B;SAAM,IAAI,MAAM,YAAY,OAAO,EAAE;QACpC,IAAM,wBAAwB,GAAI,qBAAqB,CAAC,MAAM,CAAiB,CAAC;QAChF,IAAI,wBAAwB,EAAE;YAC5B,yFAAyF;YACzF,wBAAwB,CAAC,UAAW,CAAC,YAAY,CAAC,KAAK,EAAE,wBAAwB,CAAC,CAAC;SACpF;aAAM;YACL,qFAAqF;YACrF,6EAA6E;YAC7E,aAAa,CAAC,KAAK,EAAE,gBAAgB,CAAC,MAAM,CAAE,CAAC,CAAC;SACjD;KACF;SAAM;QACL,sBAAsB;QACtB,MAAM,IAAI,KAAK,CAAC,mFAAiF,MAAQ,CAAC,CAAC;KAC5G;AACH,CAAC;AAED,wGAAwG;AACxG,oGAAoG;AACpG,SAAS,sBAAsB,CAAC,OAAuB;IACrD,IAAI,OAAO,YAAY,OAAO,EAAE;QAC9B,OAAO,OAAO,CAAC;KAChB;IAED,IAAM,WAAW,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;IACnD,IAAI,WAAW,EAAE;QACf,sFAAsF;QACtF,OAAS,WAA4B,CAAC,eAAe,CAAC;KACvD;SAAM;QACL,iFAAiF;QACjF,+DAA+D;QAC/D,IAAM,aAAa,GAAG,gBAAgB,CAAC,OAAO,CAAE,CAAC;QACjD,OAAO,aAAa,YAAY,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,aAAa,CAAC,CAAC;KAC3G;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,QAAgB;IAC9C,OAAO,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC5D,CAAC"}

package/lib/internal/Rendering/RenderBatch/BinaryDecoder.d.ts

@@ -1,5 +0,0 @@
-export declare function readInt32LE(buffer: Uint8Array, position: number): any;
-export declare function readUint32LE(buffer: Uint8Array, position: number): any;
-export declare function readUint64LE(buffer: Uint8Array, position: number): any;
-export declare function readLEB128(buffer: Uint8Array, position: number): number;
-export declare function numLEB128Bytes(value: number): 1 | 2 | 3 | 4;

package/lib/internal/Rendering/RenderBatch/BinaryDecoder.js

@@ -1,42 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.numLEB128Bytes = exports.readLEB128 = exports.readUint64LE = exports.readUint32LE = exports.readInt32LE = void 0;
-var uint64HighPartShift = Math.pow(2, 32);
-var maxSafeNumberHighPart = Math.pow(2, 21) - 1; // The high-order int32 from Number.MAX_SAFE_INTEGER
-function readInt32LE(buffer, position) {
-    return buffer[position] | (buffer[position + 1] << 8) | (buffer[position + 2] << 16) | (buffer[position + 3] << 24);
-}
-exports.readInt32LE = readInt32LE;
-function readUint32LE(buffer, position) {
-    return (buffer[position] + (buffer[position + 1] << 8) + (buffer[position + 2] << 16) + ((buffer[position + 3] << 24) >>> 0)); // The >>> 0 coerces the value to unsigned
-}
-exports.readUint32LE = readUint32LE;
-function readUint64LE(buffer, position) {
-    // This cannot be done using bit-shift operators in JavaScript, because
-    // those all implicitly convert to int32
-    var highPart = readUint32LE(buffer, position + 4);
-    if (highPart > maxSafeNumberHighPart) {
-        throw new Error("Cannot read uint64 with high order part " + highPart + ", because the result would exceed Number.MAX_SAFE_INTEGER.");
-    }
-    return highPart * uint64HighPartShift + readUint32LE(buffer, position);
-}
-exports.readUint64LE = readUint64LE;
-function readLEB128(buffer, position) {
-    var result = 0;
-    var shift = 0;
-    for (var index = 0; index < 4; index++) {
-        var byte = buffer[position + index];
-        result |= (byte & 127) << shift;
-        if (byte < 128) {
-            break;
-        }
-        shift += 7;
-    }
-    return result;
-}
-exports.readLEB128 = readLEB128;
-function numLEB128Bytes(value) {
-    return value < 128 ? 1 : value < 16384 ? 2 : value < 2097152 ? 3 : 4;
-}
-exports.numLEB128Bytes = numLEB128Bytes;
-//# sourceMappingURL=BinaryDecoder.js.map

package/lib/internal/Rendering/RenderBatch/BinaryDecoder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"BinaryDecoder.js","sourceRoot":"","sources":["../../../../src/internal/Rendering/RenderBatch/BinaryDecoder.ts"],"names":[],"mappings":";;;AAAA,IAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC5C,IAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,oDAAoD;AAEvG,SAAgB,WAAW,CAAC,MAAkB,EAAE,QAAgB;IAC9D,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AACtH,CAAC;AAFD,kCAEC;AAED,SAAgB,YAAY,CAAC,MAAkB,EAAE,QAAgB;IAC/D,OAAO,CACL,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CACrH,CAAC,CAAC,0CAA0C;AAC/C,CAAC;AAJD,oCAIC;AAED,SAAgB,YAAY,CAAC,MAAkB,EAAE,QAAgB;IAC/D,uEAAuE;IACvE,wCAAwC;IACxC,IAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;IACpD,IAAI,QAAQ,GAAG,qBAAqB,EAAE;QACpC,MAAM,IAAI,KAAK,CACb,6CAA2C,QAAQ,+DAA4D,CAChH,CAAC;KACH;IAED,OAAO,QAAQ,GAAG,mBAAmB,GAAG,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AACzE,CAAC;AAXD,oCAWC;AAED,SAAgB,UAAU,CAAC,MAAkB,EAAE,QAAgB;IAC7D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE;QACtC,IAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;QACtC,MAAM,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,KAAK,CAAC;QAChC,IAAI,IAAI,GAAG,GAAG,EAAE;YACd,MAAM;SACP;QACD,KAAK,IAAI,CAAC,CAAC;KACZ;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAZD,gCAYC;AAED,SAAgB,cAAc,CAAC,KAAa;IAC1C,OAAO,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvE,CAAC;AAFD,wCAEC"}

package/lib/internal/Rendering/RenderBatch/OutOfProcessRenderBatch.d.ts

@@ -1,18 +0,0 @@
-import { RenderBatch, ArrayRange, RenderTreeDiff, ArrayValues, RenderTreeFrame, RenderTreeDiffReader, RenderTreeFrameReader, RenderTreeEditReader, ArrayRangeReader, ArrayBuilderSegmentReader } from './RenderBatch';
-export declare class OutOfProcessRenderBatch implements RenderBatch {
-    private batchData;
-    constructor(batchData: Uint8Array);
-    updatedComponents(): ArrayRange<RenderTreeDiff>;
-    referenceFrames(): ArrayRange<RenderTreeFrame>;
-    disposedComponentIds(): ArrayRange<number>;
-    disposedEventHandlerIds(): ArrayRange<number>;
-    updatedComponentsEntry(values: ArrayValues<RenderTreeDiff>, index: number): RenderTreeDiff;
-    referenceFramesEntry(values: ArrayValues<RenderTreeFrame>, index: number): RenderTreeFrame;
-    disposedComponentIdsEntry(values: ArrayValues<number>, index: number): number;
-    disposedEventHandlerIdsEntry(values: ArrayValues<number>, index: number): number;
-    diffReader: RenderTreeDiffReader;
-    editReader: RenderTreeEditReader;
-    frameReader: RenderTreeFrameReader;
-    arrayRangeReader: ArrayRangeReader;
-    arrayBuilderSegmentReader: ArrayBuilderSegmentReader;
-}

package/lib/internal/Rendering/RenderBatch/OutOfProcessRenderBatch.js

@@ -1,193 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.OutOfProcessRenderBatch = void 0;
-var Utf8Decoder_1 = require("./Utf8Decoder");
-var BinaryDecoder_1 = require("./BinaryDecoder");
-var updatedComponentsEntryLength = 4; // Each is a single int32 giving the location of the data
-var referenceFramesEntryLength = 20; // 1 int for frame type, then 16 bytes for type-specific data
-var disposedComponentIdsEntryLength = 4; // Each is an int32 giving the ID
-var disposedEventHandlerIdsEntryLength = 8; // Each is an int64 giving the ID
-var editsEntryLength = 16; // 4 ints
-var stringTableEntryLength = 4; // Each is an int32 giving the string data location, or -1 for null
-var OutOfProcessRenderBatch = /** @class */ (function () {
-    function OutOfProcessRenderBatch(batchData) {
-        this.batchData = batchData;
-        var stringReader = new OutOfProcessStringReader(batchData);
-        this.arrayRangeReader = new OutOfProcessArrayRangeReader(batchData);
-        this.arrayBuilderSegmentReader = new OutOfProcessArrayBuilderSegmentReader(batchData);
-        this.diffReader = new OutOfProcessRenderTreeDiffReader(batchData);
-        this.editReader = new OutOfProcessRenderTreeEditReader(batchData, stringReader);
-        this.frameReader = new OutOfProcessRenderTreeFrameReader(batchData, stringReader);
-    }
-    OutOfProcessRenderBatch.prototype.updatedComponents = function () {
-        return BinaryDecoder_1.readInt32LE(this.batchData, this.batchData.length - 20); // 5th-from-last int32
-    };
-    OutOfProcessRenderBatch.prototype.referenceFrames = function () {
-        return BinaryDecoder_1.readInt32LE(this.batchData, this.batchData.length - 16); // 4th-from-last int32
-    };
-    OutOfProcessRenderBatch.prototype.disposedComponentIds = function () {
-        return BinaryDecoder_1.readInt32LE(this.batchData, this.batchData.length - 12); // 3rd-from-last int32
-    };
-    OutOfProcessRenderBatch.prototype.disposedEventHandlerIds = function () {
-        return BinaryDecoder_1.readInt32LE(this.batchData, this.batchData.length - 8); // 2th-from-last int32
-    };
-    OutOfProcessRenderBatch.prototype.updatedComponentsEntry = function (values, index) {
-        var tableEntryPos = values + index * updatedComponentsEntryLength;
-        return BinaryDecoder_1.readInt32LE(this.batchData, tableEntryPos);
-    };
-    OutOfProcessRenderBatch.prototype.referenceFramesEntry = function (values, index) {
-        return (values + index * referenceFramesEntryLength);
-    };
-    OutOfProcessRenderBatch.prototype.disposedComponentIdsEntry = function (values, index) {
-        var entryPos = values + index * disposedComponentIdsEntryLength;
-        return BinaryDecoder_1.readInt32LE(this.batchData, entryPos);
-    };
-    OutOfProcessRenderBatch.prototype.disposedEventHandlerIdsEntry = function (values, index) {
-        var entryPos = values + index * disposedEventHandlerIdsEntryLength;
-        return BinaryDecoder_1.readUint64LE(this.batchData, entryPos);
-    };
-    return OutOfProcessRenderBatch;
-}());
-exports.OutOfProcessRenderBatch = OutOfProcessRenderBatch;
-var OutOfProcessRenderTreeDiffReader = /** @class */ (function () {
-    function OutOfProcessRenderTreeDiffReader(batchDataUint8) {
-        this.batchDataUint8 = batchDataUint8;
-    }
-    OutOfProcessRenderTreeDiffReader.prototype.componentId = function (diff) {
-        // First int32 is componentId
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, diff);
-    };
-    OutOfProcessRenderTreeDiffReader.prototype.edits = function (diff) {
-        // Entries data starts after the componentId (which is a 4-byte int)
-        return diff + 4;
-    };
-    OutOfProcessRenderTreeDiffReader.prototype.editsEntry = function (values, index) {
-        return values + index * editsEntryLength;
-    };
-    return OutOfProcessRenderTreeDiffReader;
-}());
-var OutOfProcessRenderTreeEditReader = /** @class */ (function () {
-    function OutOfProcessRenderTreeEditReader(batchDataUint8, stringReader) {
-        this.batchDataUint8 = batchDataUint8;
-        this.stringReader = stringReader;
-    }
-    OutOfProcessRenderTreeEditReader.prototype.editType = function (edit) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, edit); // 1st int
-    };
-    OutOfProcessRenderTreeEditReader.prototype.siblingIndex = function (edit) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, edit + 4); // 2nd int
-    };
-    OutOfProcessRenderTreeEditReader.prototype.newTreeIndex = function (edit) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, edit + 8); // 3rd int
-    };
-    OutOfProcessRenderTreeEditReader.prototype.moveToSiblingIndex = function (edit) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, edit + 8); // 3rd int
-    };
-    OutOfProcessRenderTreeEditReader.prototype.removedAttributeName = function (edit) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, edit + 12); // 4th int
-        return this.stringReader.readString(stringIndex);
-    };
-    return OutOfProcessRenderTreeEditReader;
-}());
-var OutOfProcessRenderTreeFrameReader = /** @class */ (function () {
-    function OutOfProcessRenderTreeFrameReader(batchDataUint8, stringReader) {
-        this.batchDataUint8 = batchDataUint8;
-        this.stringReader = stringReader;
-    }
-    // For render frames, the 2nd-4th ints have different meanings depending on frameType.
-    // It's the caller's responsibility not to evaluate properties that aren't applicable to the frameType.
-    OutOfProcessRenderTreeFrameReader.prototype.frameType = function (frame) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame); // 1st int
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.subtreeLength = function (frame) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 4); // 2nd int
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.elementReferenceCaptureId = function (frame) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 4); // 2nd int
-        return this.stringReader.readString(stringIndex);
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.componentId = function (frame) {
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 8); // 3rd int
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.elementName = function (frame) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 8); // 3rd int
-        return this.stringReader.readString(stringIndex);
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.textContent = function (frame) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 4); // 2nd int
-        return this.stringReader.readString(stringIndex);
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.markupContent = function (frame) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 4); // 2nd int
-        return this.stringReader.readString(stringIndex);
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.attributeName = function (frame) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 4); // 2nd int
-        return this.stringReader.readString(stringIndex);
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.attributeValue = function (frame) {
-        var stringIndex = BinaryDecoder_1.readInt32LE(this.batchDataUint8, frame + 8); // 3rd int
-        return this.stringReader.readString(stringIndex);
-    };
-    OutOfProcessRenderTreeFrameReader.prototype.attributeEventHandlerId = function (frame) {
-        return BinaryDecoder_1.readUint64LE(this.batchDataUint8, frame + 12); // Bytes 12-19
-    };
-    return OutOfProcessRenderTreeFrameReader;
-}());
-var OutOfProcessStringReader = /** @class */ (function () {
-    function OutOfProcessStringReader(batchDataUint8) {
-        this.batchDataUint8 = batchDataUint8;
-        // Final int gives start position of the string table
-        this.stringTableStartIndex = BinaryDecoder_1.readInt32LE(batchDataUint8, batchDataUint8.length - 4);
-    }
-    OutOfProcessStringReader.prototype.readString = function (index) {
-        if (index === -1) {
-            // Special value encodes 'null'
-            return null;
-        }
-        else {
-            var stringTableEntryPos = BinaryDecoder_1.readInt32LE(this.batchDataUint8, this.stringTableStartIndex + index * stringTableEntryLength);
-            // By default, .NET's BinaryWriter gives LEB128-length-prefixed UTF-8 data.
-            // This is convenient enough to decode in JavaScript.
-            var numUtf8Bytes = BinaryDecoder_1.readLEB128(this.batchDataUint8, stringTableEntryPos);
-            var charsStart = stringTableEntryPos + BinaryDecoder_1.numLEB128Bytes(numUtf8Bytes);
-            var utf8Data = new Uint8Array(this.batchDataUint8.buffer, this.batchDataUint8.byteOffset + charsStart, numUtf8Bytes);
-            return Utf8Decoder_1.decodeUtf8(utf8Data);
-        }
-    };
-    return OutOfProcessStringReader;
-}());
-var OutOfProcessArrayRangeReader = /** @class */ (function () {
-    function OutOfProcessArrayRangeReader(batchDataUint8) {
-        this.batchDataUint8 = batchDataUint8;
-    }
-    OutOfProcessArrayRangeReader.prototype.count = function (arrayRange) {
-        // First int is count
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, arrayRange);
-    };
-    OutOfProcessArrayRangeReader.prototype.values = function (arrayRange) {
-        // Entries data starts after the 'count' int (i.e., after 4 bytes)
-        return arrayRange + 4;
-    };
-    return OutOfProcessArrayRangeReader;
-}());
-var OutOfProcessArrayBuilderSegmentReader = /** @class */ (function () {
-    function OutOfProcessArrayBuilderSegmentReader(batchDataUint8) {
-        this.batchDataUint8 = batchDataUint8;
-    }
-    OutOfProcessArrayBuilderSegmentReader.prototype.offset = function (arrayBuilderSegment) {
-        // Not used by the out-of-process representation of RenderBatch data.
-        // This only exists on the ArrayBuilderSegmentReader for the shared-memory representation.
-        return 0;
-    };
-    OutOfProcessArrayBuilderSegmentReader.prototype.count = function (arrayBuilderSegment) {
-        // First int is count
-        return BinaryDecoder_1.readInt32LE(this.batchDataUint8, arrayBuilderSegment);
-    };
-    OutOfProcessArrayBuilderSegmentReader.prototype.values = function (arrayBuilderSegment) {
-        // Entries data starts after the 'count' int (i.e., after 4 bytes)
-        return arrayBuilderSegment + 4;
-    };
-    return OutOfProcessArrayBuilderSegmentReader;
-}());
-//# sourceMappingURL=OutOfProcessRenderBatch.js.map

package/lib/internal/Rendering/RenderBatch/OutOfProcessRenderBatch.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"OutOfProcessRenderBatch.js","sourceRoot":"","sources":["../../../../src/internal/Rendering/RenderBatch/OutOfProcessRenderBatch.ts"],"names":[],"mappings":";;;AAgBA,6CAA2C;AAC3C,iDAAwF;AAExF,IAAM,4BAA4B,GAAG,CAAC,CAAC,CAAC,yDAAyD;AACjG,IAAM,0BAA0B,GAAG,EAAE,CAAC,CAAC,6DAA6D;AACpG,IAAM,+BAA+B,GAAG,CAAC,CAAC,CAAC,iCAAiC;AAC5E,IAAM,kCAAkC,GAAG,CAAC,CAAC,CAAC,iCAAiC;AAC/E,IAAM,gBAAgB,GAAG,EAAE,CAAC,CAAC,SAAS;AACtC,IAAM,sBAAsB,GAAG,CAAC,CAAC,CAAC,mEAAmE;AAErG;IACE,iCAAoB,SAAqB;QAArB,cAAS,GAAT,SAAS,CAAY;QACvC,IAAM,YAAY,GAAG,IAAI,wBAAwB,CAAC,SAAS,CAAC,CAAC;QAE7D,IAAI,CAAC,gBAAgB,GAAG,IAAI,4BAA4B,CAAC,SAAS,CAAC,CAAC;QACpE,IAAI,CAAC,yBAAyB,GAAG,IAAI,qCAAqC,CAAC,SAAS,CAAC,CAAC;QACtF,IAAI,CAAC,UAAU,GAAG,IAAI,gCAAgC,CAAC,SAAS,CAAC,CAAC;QAClE,IAAI,CAAC,UAAU,GAAG,IAAI,gCAAgC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAChF,IAAI,CAAC,WAAW,GAAG,IAAI,iCAAiC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IACpF,CAAC;IAED,mDAAiB,GAAjB;QACE,OAAO,2BAAW,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,sBAAsB;IACxF,CAAC;IAED,iDAAe,GAAf;QACE,OAAO,2BAAW,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,sBAAsB;IACxF,CAAC;IAED,sDAAoB,GAApB;QACE,OAAO,2BAAW,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,sBAAsB;IACxF,CAAC;IAED,yDAAuB,GAAvB;QACE,OAAO,2BAAW,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,sBAAsB;IACvF,CAAC;IAED,wDAAsB,GAAtB,UAAuB,MAAmC,EAAE,KAAa;QACvE,IAAM,aAAa,GAAI,MAAc,GAAG,KAAK,GAAG,4BAA4B,CAAC;QAC7E,OAAO,2BAAW,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;IACpD,CAAC;IAED,sDAAoB,GAApB,UAAqB,MAAoC,EAAE,KAAa;QACtE,OAAO,CAAE,MAAc,GAAG,KAAK,GAAG,0BAA0B,CAAQ,CAAC;IACvE,CAAC;IAED,2DAAyB,GAAzB,UAA0B,MAA2B,EAAE,KAAa;QAClE,IAAM,QAAQ,GAAI,MAAc,GAAG,KAAK,GAAG,+BAA+B,CAAC;QAC3E,OAAO,2BAAW,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED,8DAA4B,GAA5B,UAA6B,MAA2B,EAAE,KAAa;QACrE,IAAM,QAAQ,GAAI,MAAc,GAAG,KAAK,GAAG,kCAAkC,CAAC;QAC9E,OAAO,4BAAY,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAWH,8BAAC;AAAD,CAAC,AAvDD,IAuDC;AAvDY,0DAAuB;AAyDpC;IACE,0CAAoB,cAA0B;QAA1B,mBAAc,GAAd,cAAc,CAAY;IAAG,CAAC;IAElD,sDAAW,GAAX,UAAY,IAAoB;QAC9B,6BAA6B;QAC7B,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAE,IAAW,CAAC,CAAC;IACvD,CAAC;IAED,gDAAK,GAAL,UAAM,IAAoB;QACxB,oEAAoE;QACpE,OAAQ,IAAY,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,qDAAU,GAAV,UAAW,MAAmC,EAAE,KAAa;QAC3D,OAAQ,MAAc,GAAG,KAAK,GAAG,gBAAgB,CAAC;IACpD,CAAC;IACH,uCAAC;AAAD,CAAC,AAhBD,IAgBC;AAED;IACE,0CAAoB,cAA0B,EAAU,YAAsC;QAA1E,mBAAc,GAAd,cAAc,CAAY;QAAU,iBAAY,GAAZ,YAAY,CAA0B;IAAG,CAAC;IAElG,mDAAQ,GAAR,UAAS,IAAoB;QAC3B,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAE,IAAW,CAAC,CAAC,CAAC,UAAU;IAClE,CAAC;IAED,uDAAY,GAAZ,UAAa,IAAoB;QAC/B,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,IAAY,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;IACxE,CAAC;IAED,uDAAY,GAAZ,UAAa,IAAoB;QAC/B,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,IAAY,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;IACxE,CAAC;IAED,6DAAkB,GAAlB,UAAmB,IAAoB;QACrC,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,IAAY,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;IACxE,CAAC;IAED,+DAAoB,GAApB,UAAqB,IAAoB;QACvC,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,IAAY,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IACH,uCAAC;AAAD,CAAC,AAvBD,IAuBC;AAED;IACE,2CAAoB,cAA0B,EAAU,YAAsC;QAA1E,mBAAc,GAAd,cAAc,CAAY;QAAU,iBAAY,GAAZ,YAAY,CAA0B;IAAG,CAAC;IAElG,sFAAsF;IACtF,uGAAuG;IAEvG,qDAAS,GAAT,UAAU,KAAsB;QAC9B,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAE,KAAY,CAAC,CAAC,CAAC,UAAU;IACnE,CAAC;IAED,yDAAa,GAAb,UAAc,KAAsB;QAClC,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;IACzE,CAAC;IAED,qEAAyB,GAAzB,UAA0B,KAAsB;QAC9C,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED,uDAAW,GAAX,UAAY,KAAsB;QAChC,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;IACzE,CAAC;IAED,uDAAW,GAAX,UAAY,KAAsB;QAChC,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED,uDAAW,GAAX,UAAY,KAAsB;QAChC,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED,yDAAa,GAAb,UAAc,KAAsB;QAClC,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAE,CAAC;IACpD,CAAC;IAED,yDAAa,GAAb,UAAc,KAAsB;QAClC,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED,0DAAc,GAAd,UAAe,KAAsB;QACnC,IAAM,WAAW,GAAG,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACpF,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;IAED,mEAAuB,GAAvB,UAAwB,KAAsB;QAC5C,OAAO,4BAAY,CAAC,IAAI,CAAC,cAAc,EAAG,KAAa,GAAG,EAAE,CAAC,CAAC,CAAC,cAAc;IAC/E,CAAC;IACH,wCAAC;AAAD,CAAC,AAnDD,IAmDC;AAED;IAGE,kCAAoB,cAA0B;QAA1B,mBAAc,GAAd,cAAc,CAAY;QAC5C,qDAAqD;QACrD,IAAI,CAAC,qBAAqB,GAAG,2BAAW,CAAC,cAAc,EAAE,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,6CAAU,GAAV,UAAW,KAAa;QACtB,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;YAChB,+BAA+B;YAC/B,OAAO,IAAI,CAAC;SACb;aAAM;YACL,IAAM,mBAAmB,GAAG,2BAAW,CACrC,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,qBAAqB,GAAG,KAAK,GAAG,sBAAsB,CAC5D,CAAC;YAEF,2EAA2E;YAC3E,qDAAqD;YACrD,IAAM,YAAY,GAAG,0BAAU,CAAC,IAAI,CAAC,cAAc,EAAE,mBAAmB,CAAC,CAAC;YAC1E,IAAM,UAAU,GAAG,mBAAmB,GAAG,8BAAc,CAAC,YAAY,CAAC,CAAC;YACtE,IAAM,QAAQ,GAAG,IAAI,UAAU,CAC7B,IAAI,CAAC,cAAc,CAAC,MAAM,EAC1B,IAAI,CAAC,cAAc,CAAC,UAAU,GAAG,UAAU,EAC3C,YAAY,CACb,CAAC;YACF,OAAO,wBAAU,CAAC,QAAQ,CAAC,CAAC;SAC7B;IACH,CAAC;IACH,+BAAC;AAAD,CAAC,AA9BD,IA8BC;AAED;IACE,sCAAoB,cAA0B;QAA1B,mBAAc,GAAd,cAAc,CAAY;IAAG,CAAC;IAElD,4CAAK,GAAL,UAAS,UAAyB;QAChC,qBAAqB;QACrB,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAE,UAAiB,CAAC,CAAC;IAC7D,CAAC;IAED,6CAAM,GAAN,UAAU,UAAyB;QACjC,kEAAkE;QAClE,OAAQ,UAAkB,GAAG,CAAC,CAAC;IACjC,CAAC;IACH,mCAAC;AAAD,CAAC,AAZD,IAYC;AAED;IACE,+CAAoB,cAA0B;QAA1B,mBAAc,GAAd,cAAc,CAAY;IAAG,CAAC;IAElD,sDAAM,GAAN,UAAU,mBAA2C;QACnD,qEAAqE;QACrE,0FAA0F;QAC1F,OAAO,CAAC,CAAC;IACX,CAAC;IAED,qDAAK,GAAL,UAAS,mBAA2C;QAClD,qBAAqB;QACrB,OAAO,2BAAW,CAAC,IAAI,CAAC,cAAc,EAAE,mBAA0B,CAAC,CAAC;IACtE,CAAC;IAED,sDAAM,GAAN,UAAU,mBAA2C;QACnD,kEAAkE;QAClE,OAAQ,mBAA2B,GAAG,CAAC,CAAC;IAC1C,CAAC;IACH,4CAAC;AAAD,CAAC,AAlBD,IAkBC"}

package/lib/internal/Rendering/RenderBatch/RenderBatch.d.ts

@@ -1,87 +0,0 @@
-export interface RenderBatch {
-    updatedComponents(): ArrayRange<RenderTreeDiff>;
-    referenceFrames(): ArrayRange<RenderTreeFrame>;
-    disposedComponentIds(): ArrayRange<number>;
-    disposedEventHandlerIds(): ArrayRange<number>;
-    updatedComponentsEntry(values: ArrayValues<RenderTreeDiff>, index: number): RenderTreeDiff;
-    referenceFramesEntry(values: ArrayValues<RenderTreeFrame>, index: number): RenderTreeFrame;
-    disposedComponentIdsEntry(values: ArrayValues<number>, index: number): number;
-    disposedEventHandlerIdsEntry(values: ArrayValues<number>, index: number): number;
-    diffReader: RenderTreeDiffReader;
-    editReader: RenderTreeEditReader;
-    frameReader: RenderTreeFrameReader;
-    arrayRangeReader: ArrayRangeReader;
-    arrayBuilderSegmentReader: ArrayBuilderSegmentReader;
-}
-export interface ArrayRangeReader {
-    count<T>(arrayRange: ArrayRange<T>): number;
-    values<T>(arrayRange: ArrayRange<T>): ArrayValues<T>;
-}
-export interface ArrayBuilderSegmentReader {
-    offset<T>(arrayBuilderSegment: ArrayBuilderSegment<T>): number;
-    count<T>(arrayBuilderSegment: ArrayBuilderSegment<T>): number;
-    values<T>(arrayBuilderSegment: ArrayBuilderSegment<T>): ArrayValues<T>;
-}
-export interface RenderTreeDiffReader {
-    componentId(diff: RenderTreeDiff): number;
-    edits(diff: RenderTreeDiff): ArrayBuilderSegment<RenderTreeEdit>;
-    editsEntry(values: ArrayValues<RenderTreeEdit>, index: number): RenderTreeEdit;
-}
-export interface RenderTreeEditReader {
-    editType(edit: RenderTreeEdit): EditType;
-    siblingIndex(edit: RenderTreeEdit): number;
-    newTreeIndex(edit: RenderTreeEdit): number;
-    moveToSiblingIndex(edit: RenderTreeEdit): number;
-    removedAttributeName(edit: RenderTreeEdit): string | null;
-}
-export interface RenderTreeFrameReader {
-    frameType(frame: RenderTreeFrame): FrameType;
-    subtreeLength(frame: RenderTreeFrame): number;
-    elementReferenceCaptureId(frame: RenderTreeFrame): string | null;
-    componentId(frame: RenderTreeFrame): number;
-    elementName(frame: RenderTreeFrame): string | null;
-    textContent(frame: RenderTreeFrame): string | null;
-    markupContent(frame: RenderTreeFrame): string;
-    attributeName(frame: RenderTreeFrame): string | null;
-    attributeValue(frame: RenderTreeFrame): string | null;
-    attributeEventHandlerId(frame: RenderTreeFrame): number;
-}
-export interface ArrayRange<T> {
-    ArrayRange__DO_NOT_IMPLEMENT: any;
-}
-export interface ArrayBuilderSegment<T> {
-    ArrayBuilderSegment__DO_NOT_IMPLEMENT: any;
-}
-export interface ArrayValues<T> {
-    ArrayValues__DO_NOT_IMPLEMENT: any;
-}
-export interface RenderTreeDiff {
-    RenderTreeDiff__DO_NOT_IMPLEMENT: any;
-}
-export interface RenderTreeFrame {
-    RenderTreeFrame__DO_NOT_IMPLEMENT: any;
-}
-export interface RenderTreeEdit {
-    RenderTreeEdit__DO_NOT_IMPLEMENT: any;
-}
-export declare enum EditType {
-    prependFrame = 1,
-    removeFrame = 2,
-    setAttribute = 3,
-    removeAttribute = 4,
-    updateText = 5,
-    stepIn = 6,
-    stepOut = 7,
-    updateMarkup = 8,
-    permutationListEntry = 9,
-    permutationListEnd = 10
-}
-export declare enum FrameType {
-    element = 1,
-    text = 2,
-    attribute = 3,
-    component = 4,
-    region = 5,
-    elementReferenceCapture = 6,
-    markup = 8
-}