@microsoft/fast-element 2.0.0-beta.2 → 2.0.0-beta.5

package/dist/esm/observation/splice-strategies.js

@@ -1,400 +0,0 @@
-import { emptyArray } from "../platform.js";
-import { Splice, SpliceStrategy, SpliceStrategySupport, } from "./arrays.js";
-// Note: This function is *based* on the computation of the Levenshtein
-// "edit" distance. The one change is that "updates" are treated as two
-// edits - not one. With Array splices, an update is really a delete
-// followed by an add. By retaining this, we optimize for "keeping" the
-// maximum array items in the original array. For example:
-//
-//   'xxxx123' to '123yyyy'
-//
-// With 1-edit updates, the shortest path would be just to update all seven
-// characters. With 2-edit updates, we delete 4, leave 3, and add 4. This
-// leaves the substring '123' intact.
-function calcEditDistances(current, currentStart, currentEnd, old, oldStart, oldEnd) {
-    // "Deletion" columns
-    const rowCount = oldEnd - oldStart + 1;
-    const columnCount = currentEnd - currentStart + 1;
-    const distances = new Array(rowCount);
-    let north;
-    let west;
-    // "Addition" rows. Initialize null column.
-    for (let i = 0; i < rowCount; ++i) {
-        distances[i] = new Array(columnCount);
-        distances[i][0] = i;
-    }
-    // Initialize null row
-    for (let j = 0; j < columnCount; ++j) {
-        distances[0][j] = j;
-    }
-    for (let i = 1; i < rowCount; ++i) {
-        for (let j = 1; j < columnCount; ++j) {
-            if (current[currentStart + j - 1] === old[oldStart + i - 1]) {
-                distances[i][j] = distances[i - 1][j - 1];
-            }
-            else {
-                north = distances[i - 1][j] + 1;
-                west = distances[i][j - 1] + 1;
-                distances[i][j] = north < west ? north : west;
-            }
-        }
-    }
-    return distances;
-}
-// This starts at the final weight, and walks "backward" by finding
-// the minimum previous weight recursively until the origin of the weight
-// matrix.
-function spliceOperationsFromEditDistances(distances) {
-    let i = distances.length - 1;
-    let j = distances[0].length - 1;
-    let current = distances[i][j];
-    const edits = [];
-    while (i > 0 || j > 0) {
-        if (i === 0) {
-            edits.push(2 /* Edit.add */);
-            j--;
-            continue;
-        }
-        if (j === 0) {
-            edits.push(3 /* Edit.delete */);
-            i--;
-            continue;
-        }
-        const northWest = distances[i - 1][j - 1];
-        const west = distances[i - 1][j];
-        const north = distances[i][j - 1];
-        let min;
-        if (west < north) {
-            min = west < northWest ? west : northWest;
-        }
-        else {
-            min = north < northWest ? north : northWest;
-        }
-        if (min === northWest) {
-            if (northWest === current) {
-                edits.push(0 /* Edit.leave */);
-            }
-            else {
-                edits.push(1 /* Edit.update */);
-                current = northWest;
-            }
-            i--;
-            j--;
-        }
-        else if (min === west) {
-            edits.push(3 /* Edit.delete */);
-            i--;
-            current = west;
-        }
-        else {
-            edits.push(2 /* Edit.add */);
-            j--;
-            current = north;
-        }
-    }
-    return edits.reverse();
-}
-function sharedPrefix(current, old, searchLength) {
-    for (let i = 0; i < searchLength; ++i) {
-        if (current[i] !== old[i]) {
-            return i;
-        }
-    }
-    return searchLength;
-}
-function sharedSuffix(current, old, searchLength) {
-    let index1 = current.length;
-    let index2 = old.length;
-    let count = 0;
-    while (count < searchLength && current[--index1] === old[--index2]) {
-        count++;
-    }
-    return count;
-}
-function intersect(start1, end1, start2, end2) {
-    // Disjoint
-    if (end1 < start2 || end2 < start1) {
-        return -1;
-    }
-    // Adjacent
-    if (end1 === start2 || end2 === start1) {
-        return 0;
-    }
-    // Non-zero intersect, span1 first
-    if (start1 < start2) {
-        if (end1 < end2) {
-            return end1 - start2; // Overlap
-        }
-        return end2 - start2; // Contained
-    }
-    // Non-zero intersect, span2 first
-    if (end2 < end1) {
-        return end2 - start1; // Overlap
-    }
-    return end1 - start1; // Contained
-}
-/**
- * @remarks
- * Lacking individual splice mutation information, the minimal set of
- * splices can be synthesized given the previous state and final state of an
- * array. The basic approach is to calculate the edit distance matrix and
- * choose the shortest path through it.
- *
- * Complexity: O(l * p)
- *   l: The length of the current array
- *   p: The length of the old array
- */
-function calc(current, currentStart, currentEnd, old, oldStart, oldEnd) {
-    let prefixCount = 0;
-    let suffixCount = 0;
-    const minLength = Math.min(currentEnd - currentStart, oldEnd - oldStart);
-    if (currentStart === 0 && oldStart === 0) {
-        prefixCount = sharedPrefix(current, old, minLength);
-    }
-    if (currentEnd === current.length && oldEnd === old.length) {
-        suffixCount = sharedSuffix(current, old, minLength - prefixCount);
-    }
-    currentStart += prefixCount;
-    oldStart += prefixCount;
-    currentEnd -= suffixCount;
-    oldEnd -= suffixCount;
-    if (currentEnd - currentStart === 0 && oldEnd - oldStart === 0) {
-        return emptyArray;
-    }
-    if (currentStart === currentEnd) {
-        const splice = new Splice(currentStart, [], 0);
-        while (oldStart < oldEnd) {
-            splice.removed.push(old[oldStart++]);
-        }
-        return [splice];
-    }
-    else if (oldStart === oldEnd) {
-        return [new Splice(currentStart, [], currentEnd - currentStart)];
-    }
-    const ops = spliceOperationsFromEditDistances(calcEditDistances(current, currentStart, currentEnd, old, oldStart, oldEnd));
-    const splices = [];
-    let splice = void 0;
-    let index = currentStart;
-    let oldIndex = oldStart;
-    for (let i = 0; i < ops.length; ++i) {
-        switch (ops[i]) {
-            case 0 /* Edit.leave */:
-                if (splice !== void 0) {
-                    splices.push(splice);
-                    splice = void 0;
-                }
-                index++;
-                oldIndex++;
-                break;
-            case 1 /* Edit.update */:
-                if (splice === void 0) {
-                    splice = new Splice(index, [], 0);
-                }
-                splice.addedCount++;
-                index++;
-                splice.removed.push(old[oldIndex]);
-                oldIndex++;
-                break;
-            case 2 /* Edit.add */:
-                if (splice === void 0) {
-                    splice = new Splice(index, [], 0);
-                }
-                splice.addedCount++;
-                index++;
-                break;
-            case 3 /* Edit.delete */:
-                if (splice === void 0) {
-                    splice = new Splice(index, [], 0);
-                }
-                splice.removed.push(old[oldIndex]);
-                oldIndex++;
-                break;
-            // no default
-        }
-    }
-    if (splice !== void 0) {
-        splices.push(splice);
-    }
-    return splices;
-}
-function merge(splice, splices) {
-    let inserted = false;
-    let insertionOffset = 0;
-    for (let i = 0; i < splices.length; i++) {
-        const current = splices[i];
-        current.index += insertionOffset;
-        if (inserted) {
-            continue;
-        }
-        const intersectCount = intersect(splice.index, splice.index + splice.removed.length, current.index, current.index + current.addedCount);
-        if (intersectCount >= 0) {
-            // Merge the two splices
-            splices.splice(i, 1);
-            i--;
-            insertionOffset -= current.addedCount - current.removed.length;
-            splice.addedCount += current.addedCount - intersectCount;
-            const deleteCount = splice.removed.length + current.removed.length - intersectCount;
-            if (!splice.addedCount && !deleteCount) {
-                // merged splice is a noop. discard.
-                inserted = true;
-            }
-            else {
-                let currentRemoved = current.removed;
-                if (splice.index < current.index) {
-                    // some prefix of splice.removed is prepended to current.removed.
-                    const prepend = splice.removed.slice(0, current.index - splice.index);
-                    prepend.push(...currentRemoved);
-                    currentRemoved = prepend;
-                }
-                if (splice.index + splice.removed.length >
-                    current.index + current.addedCount) {
-                    // some suffix of splice.removed is appended to current.removed.
-                    const append = splice.removed.slice(current.index + current.addedCount - splice.index);
-                    currentRemoved.push(...append);
-                }
-                splice.removed = currentRemoved;
-                if (current.index < splice.index) {
-                    splice.index = current.index;
-                }
-            }
-        }
-        else if (splice.index < current.index) {
-            // Insert splice here.
-            inserted = true;
-            splices.splice(i, 0, splice);
-            i++;
-            const offset = splice.addedCount - splice.removed.length;
-            current.index += offset;
-            insertionOffset += offset;
-        }
-    }
-    if (!inserted) {
-        splices.push(splice);
-    }
-}
-function project(array, changes) {
-    let splices = [];
-    const initialSplices = [];
-    for (let i = 0, ii = changes.length; i < ii; i++) {
-        merge(changes[i], initialSplices);
-    }
-    for (let i = 0, ii = initialSplices.length; i < ii; ++i) {
-        const splice = initialSplices[i];
-        if (splice.addedCount === 1 && splice.removed.length === 1) {
-            if (splice.removed[0] !== array[splice.index]) {
-                splices.push(splice);
-            }
-            continue;
-        }
-        splices = splices.concat(calc(array, splice.index, splice.index + splice.addedCount, splice.removed, 0, splice.removed.length));
-    }
-    return splices;
-}
-/**
- * A SpliceStrategy that attempts to merge all splices into the minimal set of
- * splices needed to represent the change from the old array to the new array.
- * @public
- */
-export const mergeSpliceStrategy = Object.freeze({
-    support: SpliceStrategySupport.optimized,
-    normalize(previous, current, changes) {
-        if (previous === void 0) {
-            if (changes === void 0) {
-                return emptyArray;
-            }
-            return changes.length > 1 ? project(current, changes) : changes;
-        }
-        return calc(current, 0, current.length, previous, 0, previous.length);
-    },
-    pop(array, observer, pop, args) {
-        const notEmpty = array.length > 0;
-        const result = pop.apply(array, args);
-        if (notEmpty) {
-            observer.addSplice(new Splice(array.length, [result], 0));
-        }
-        return result;
-    },
-    push(array, observer, push, args) {
-        const result = push.apply(array, args);
-        observer.addSplice(new Splice(array.length - args.length, [], args.length).adjustTo(array));
-        return result;
-    },
-    reverse(array, observer, reverse, args) {
-        observer.flush();
-        const oldArray = array.slice();
-        const result = reverse.apply(array, args);
-        observer.reset(oldArray);
-        return result;
-    },
-    shift(array, observer, shift, args) {
-        const notEmpty = array.length > 0;
-        const result = shift.apply(array, args);
-        if (notEmpty) {
-            observer.addSplice(new Splice(0, [result], 0));
-        }
-        return result;
-    },
-    sort(array, observer, sort, args) {
-        observer.flush();
-        const oldArray = array.slice();
-        const result = sort.apply(array, args);
-        observer.reset(oldArray);
-        return result;
-    },
-    splice(array, observer, splice, args) {
-        const result = splice.apply(array, args);
-        observer.addSplice(new Splice(+args[0], result, args.length > 2 ? args.length - 2 : 0).adjustTo(array));
-        return result;
-    },
-    unshift(array, observer, unshift, args) {
-        const result = unshift.apply(array, args);
-        observer.addSplice(new Splice(0, [], args.length).adjustTo(array));
-        return result;
-    },
-});
-/**
- * A splice strategy that doesn't create splices, but instead
- * tracks every change as a full array reset.
- * @public
- */
-export const resetSpliceStrategy = Object.freeze({
-    support: SpliceStrategySupport.reset,
-    normalize(previous, current, changes) {
-        return SpliceStrategy.reset;
-    },
-    pop(array, observer, pop, args) {
-        const result = pop.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-    push(array, observer, push, args) {
-        const result = push.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-    reverse(array, observer, reverse, args) {
-        const result = reverse.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-    shift(array, observer, shift, args) {
-        const result = shift.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-    sort(array, observer, sort, args) {
-        const result = sort.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-    splice(array, observer, splice, args) {
-        const result = splice.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-    unshift(array, observer, unshift, args) {
-        const result = unshift.apply(array, args);
-        observer.reset(array);
-        return result;
-    },
-});