@cleanslate/sdk 0.1.0

package/dist/core/diff/diff.d.ts

@@ -0,0 +1,151 @@
+export declare class StringDiffSequence implements ISequence {
+    private source;
+    constructor(source: string);
+    getElements(): Int32Array | number[] | string[];
+}
+export declare function stringDiff(original: string, modified: string, pretty: boolean): IDiffChange[];
+export interface ISequence {
+    getElements(): Int32Array | number[] | string[];
+    getStrictElement?(index: number): string;
+}
+export interface IDiffChange {
+    /**
+     * The position of the first element in the original sequence which
+     * this change affects.
+     */
+    originalStart: number;
+    /**
+     * The number of elements from the original sequence which were
+     * affected.
+     */
+    originalLength: number;
+    /**
+     * The position of the first element in the modified sequence which
+     * this change affects.
+     */
+    modifiedStart: number;
+    /**
+     * The number of elements from the modified sequence which were
+     * affected (added).
+     */
+    modifiedLength: number;
+}
+export interface IContinueProcessingPredicate {
+    (furthestOriginalIndex: number, matchLengthOfLongest: number): boolean;
+}
+export interface IDiffResult {
+    quitEarly: boolean;
+    changes: IDiffChange[];
+}
+/**
+ * An implementation of the difference algorithm described in
+ * "An O(ND) Difference Algorithm and its variations" by Eugene W. Myers
+ */
+export declare class LcsDiff {
+    private readonly ContinueProcessingPredicate;
+    private readonly _originalSequence;
+    private readonly _modifiedSequence;
+    private readonly _hasStrings;
+    private readonly _originalStringElements;
+    private readonly _originalElementsOrHash;
+    private readonly _modifiedStringElements;
+    private readonly _modifiedElementsOrHash;
+    private m_forwardHistory;
+    private m_reverseHistory;
+    /**
+     * Constructs the DiffFinder
+     */
+    constructor(originalSequence: ISequence, modifiedSequence: ISequence, continueProcessingPredicate?: IContinueProcessingPredicate | null);
+    private static _isStringArray;
+    private static _getElements;
+    private ElementsAreEqual;
+    private ElementsAreStrictEqual;
+    private static _getStrictElement;
+    private OriginalElementsAreEqual;
+    private ModifiedElementsAreEqual;
+    ComputeDiff(pretty: boolean): IDiffResult;
+    /**
+     * Computes the differences between the original and modified input
+     * sequences on the bounded range.
+     * @returns An array of the differences between the two input sequences.
+     */
+    private _ComputeDiff;
+    /**
+     * Private helper method which computes the differences on the bounded range
+     * recursively.
+     * @returns An array of the differences between the two input sequences.
+     */
+    private ComputeDiffRecursive;
+    private WALKTRACE;
+    /**
+     * Given the range to compute the diff on, this method finds the point:
+     * (midOriginal, midModified)
+     * that exists in the middle of the LCS of the two sequences and
+     * is the point at which the LCS problem may be broken down recursively.
+     * This method will try to keep the LCS trace in memory. If the LCS recursion
+     * point is calculated and the full trace is available in memory, then this method
+     * will return the change list.
+     * @param originalStart The start bound of the original sequence range
+     * @param originalEnd The end bound of the original sequence range
+     * @param modifiedStart The start bound of the modified sequence range
+     * @param modifiedEnd The end bound of the modified sequence range
+     * @param midOriginal The middle point of the original sequence range
+     * @param midModified The middle point of the modified sequence range
+     * @returns The diff changes, if available, otherwise null
+     */
+    private ComputeRecursionPoint;
+    /**
+     * Shifts the given changes to provide a more intuitive diff.
+     * While the first element in a diff matches the first element after the diff,
+     * we shift the diff down.
+     *
+     * @param changes The list of changes to shift
+     * @returns The shifted changes
+     */
+    private PrettifyChanges;
+    private _findBetterContiguousSequence;
+    private _contiguousSequenceScore;
+    private _OriginalIsBoundary;
+    private _OriginalRegionIsBoundary;
+    private _ModifiedIsBoundary;
+    private _ModifiedRegionIsBoundary;
+    private _boundaryScore;
+    /**
+     * Concatenates the two input DiffChange lists and returns the resulting
+     * list.
+     * @param The left changes
+     * @param The right changes
+     * @returns The concatenated list
+     */
+    private ConcatenateChanges;
+    /**
+     * Returns true if the two changes overlap and can be merged into a single
+     * change
+     * @param left The left change
+     * @param right The right change
+     * @param mergedChange The merged change if the two overlap, null otherwise
+     * @returns True if the two changes overlap
+     */
+    private ChangesOverlap;
+    /**
+     * Helper method used to clip a diagonal index to the range of valid
+     * diagonals. This also decides whether or not the diagonal index,
+     * if it exceeds the boundary, should be clipped to the boundary or clipped
+     * one inside the boundary depending on the Even/Odd status of the boundary
+     * and numDifferences.
+     * @param diagonal The index of the diagonal to clip.
+     * @param numDifferences The current number of differences being iterated upon.
+     * @param diagonalBaseIndex The base reference diagonal.
+     * @param numDiagonals The total number of diagonals.
+     * @returns The clipped diagonal index.
+     */
+    private ClipDiagonalBound;
+}
+/**
+ * Computes the Levenshtein distance between two strings.
+ * @param firstString - The first string.
+ * @param secondString - The second string.
+ * @returns The Levenshtein distance.
+ */
+export declare function computeLevenshteinDistance(firstString: string, secondString: string): number;
+//# sourceMappingURL=diff.d.ts.map

package/dist/core/diff/diff.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../../../src/core/diff/diff.ts"],"names":[],"mappings":"AAaA,qBAAa,kBAAmB,YAAW,SAAS;IAEvC,OAAO,CAAC,MAAM;gBAAN,MAAM,EAAE,MAAM;IAElC,WAAW,IAAI,UAAU,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE;CAQ/C;AAED,wBAAgB,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,WAAW,EAAE,CAE7F;AAED,MAAM,WAAW,SAAS;IACzB,WAAW,IAAI,UAAU,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IAChD,gBAAgB,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;CACzC;AAED,MAAM,WAAW,WAAW;IAC3B;;;OAGG;IACH,aAAa,EAAE,MAAM,CAAC;IAEtB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAC;IAEvB;;;OAGG;IACH,aAAa,EAAE,MAAM,CAAC;IAEtB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,4BAA4B;IAC5C,CAAC,qBAAqB,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,GAAG,OAAO,CAAC;CACvE;AAED,MAAM,WAAW,WAAW;IAC3B,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,WAAW,EAAE,CAAC;CACvB;AAiKD;;;GAGG;AACH,qBAAa,OAAO;IAEnB,OAAO,CAAC,QAAQ,CAAC,2BAA2B,CAAsC;IAElF,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAY;IAC9C,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAY;IAC9C,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAU;IACtC,OAAO,CAAC,QAAQ,CAAC,uBAAuB,CAAW;IACnD,OAAO,CAAC,QAAQ,CAAC,uBAAuB,CAAa;IACrD,OAAO,CAAC,QAAQ,CAAC,uBAAuB,CAAW;IACnD,OAAO,CAAC,QAAQ,CAAC,uBAAuB,CAAa;IAErD,OAAO,CAAC,gBAAgB,CAAe;IACvC,OAAO,CAAC,gBAAgB,CAAe;IAEvC;;OAEG;gBACS,gBAAgB,EAAE,SAAS,EAAE,gBAAgB,EAAE,SAAS,EAAE,2BAA2B,GAAE,4BAA4B,GAAG,IAAW;IAmB7I,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B,OAAO,CAAC,MAAM,CAAC,YAAY;IAkB3B,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,sBAAsB;IAS9B,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAOhC,OAAO,CAAC,wBAAwB;IAOhC,OAAO,CAAC,wBAAwB;IAOzB,WAAW,CAAC,MAAM,EAAE,OAAO,GAAG,WAAW;IAIhD;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAiBpB;;;;OAIG;IACH,OAAO,CAAC,oBAAoB;IAoF5B,OAAO,CAAC,SAAS;IA8HjB;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,qBAAqB;IA4O7B;;;;;;;OAOG;IACH,OAAO,CAAC,eAAe;IAoIvB,OAAO,CAAC,6BAA6B;IAyBrC,OAAO,CAAC,wBAAwB;IAWhC,OAAO,CAAC,mBAAmB;IAO3B,OAAO,CAAC,yBAAyB;IAajC,OAAO,CAAC,mBAAmB;IAO3B,OAAO,CAAC,yBAAyB;IAajC,OAAO,CAAC,cAAc;IAMtB;;;;;;OAMG;IACH,OAAO,CAAC,kBAAkB;IAyB1B;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAyBtB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,iBAAiB;CAoBzB;AA6JD;;;;;GAKG;AACH,wBAAgB,0BAA0B,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAa5F"}