References

summary
public	C RecurseDeeper
public	F Split(k: number, xBegin: number, xEnd: number, distanceLeft: number, distance: number) Split.
public	F StackEntry(D: number, li: number, lj: number, ri: number, rj: number) StackEntry.
public	F arrayAlloc(maxValue: number, length: number): Int8Array \| Int16Array \| Int32Array ArrayAlloc.
public	F arrayRealloc(maxValue: number, B: Int8Array \| Int16Array \| Int32Array): Int8Array \| Int16Array \| Int32Array ArrayRealloc.
public	F arrayType(maxValue: number): Int8ArrayConstructor \| Int16ArrayConstructor \| Int32ArrayConstructor ArrayType.
public	F backwardExtend(cMin: number, cMax: number, cx: number, V: {[x: number]}, eq: Function, lj: number, rj: number) Diagonal backward extension subroutine.
public	F backwardStep(V: {[x: number]}, cMin: number, cMax: number, cmD: number) Diagonal backward step.
public	F boundAlloc(MAX: number, li: number, lj: number): number BoundAlloc.
public	F diff(MAX: number, eq: Function, li: number, lj: number, ri: number, rj: number): IterableIterator Yields diff rectangles.
public	F diff32(MAX: number, eq: Function, li: number, lj: number, ri: number, rj: number): IterableIterator Yields diff rectangles.
public	F forwardExtend(cMin: number, cMax: number, cx: number, V: {[x: number]}, eq: Function, lj: number, rj: number) Diagonal forward extension subroutine.
public	F forwardStep(V: {[x: number]}, cMin: number, cMax: number, cpD: number) Diagonal forward step.
public	F int32(x: any): number Int32.
public	F lBound(D: number, N: number): number Computes a lower bound for the signed distance.
public	F longestCommonPrefix(eq: Function, ai: number, aj: number, bi: number, bj: number): * LongestCommonPrefix.
public	F longestCommonSuffix(eq: Function, aj: number, ai: number, bj: number, bi: number): * LongestCommonSuffix.
public	F makeScan(method: Function): Function MakeScan.
public	F makeScan32(method: Function): Function MakeScan.
public	F oneWay(MAX: number, eq: Function, li: number, lj: number, ri: number, rj: number): Split Scan from begin to end.
public	F oneWayAlloc(MAX: number, li: number, lj: number, ri: number, rj: number, init: number): {"array": , "center": } DiagonalAlloc.
public	F recurse(MAX: number, eq: Function, li: number, lj: number, ri: number, rj: number): IterableIterator Recurse.
public	F recurseDeep(MAX: number, eq: Function, li: number, lj: number, ri: number, rj: number): IterableIterator RecurseDeep.
public	F recurseDeeperStep(B: Int8Array \| Int16Array \| Int32Array, stack: StackEntry[], eq: Function): number[] RecurseDeeper.
public	F twoWay(MAX: number, eq: Function, li: number, lj: number, ri: number, rj: number): * Scan from begin to middle and end to middle.
public	F twoWayAlloc(MAX: number, li: number, lj: number, ri: number, rj: number): {"V": , "centerF": , "centerB": *} TwoWayAlloc.
public	F twoWayRealloc(B: Int8Array \| Int16Array \| Int32Array, MAX: number, li: number, lj: number, ri: number, rj: number): {"V": , "centerF": , "centerB": *} TwoWayRealloc.
public	F twoWayScan(MAX: number, V: {[x: number], length: number}, centerF: number, centerB: number, eq: Function, li: number, lj: number, ri: number, rj: number): Split Scan from begin to middle and end to middle.
public	F uBound(D: number, N: number): number Computes an upper bound for the signed distance.