X-Git-Url: https://git.yukkurigames.com/?p=string-lerp.git;a=blobdiff_plain;f=string-lerp.js;h=6c240e44b61f9df46911224e1d51b6fd0aadca12;hp=fdf7df8765be728d4ba6c77bbaffd746a3dbe09b;hb=5bc5aa65b769e551177545fda77b31ea6c66467e;hpb=8ca7031e6a8079cecb8e06186c0d50cb2ab0aceb diff --git a/string-lerp.js b/string-lerp.js index fdf7df8..6c240e4 100644 --- a/string-lerp.js +++ b/string-lerp.js @@ -92,27 +92,30 @@ return editPath(costMatrix(source, target, ins, del, sub), target); } - function patch(diff, source) { - /** Apply a list of edits to source */ - var edit; - var i; + function patchArray(diff, source) { + for (var i = 0; i < diff.length; ++i) { + var edit = diff[i]; + source.splice(edit[1], edit[0], edit[2]); + } + return source; + } - if (Array.isArray(source)) { - for (i = 0; i < diff.length; ++i) { - edit = diff[i]; - source.splice(edit[1], edit[0], edit[2]); - } - } else { - for (i = 0; i < diff.length; ++i) { - edit = diff[i]; - var head = source.slice(0, edit[1]); - var tail = source.slice(edit[1] + edit[0]); - source = head + edit[2] + tail; - } + function patchString(diff, source) { + for (var i = 0; i < diff.length; ++i) { + var edit = diff[i]; + var head = source.slice(0, edit[1]); + var tail = source.slice(edit[1] + edit[0]); + source = head + edit[2] + tail; } return source; } + function patch(diff, source) { + /** Apply a list of edits to source */ + var patcher = Array.isArray(source) ? patchArray : patchString; + return patcher(diff, source); + } + var MULTI = /[\uD800-\uDBFF][\uDC00-\uDFFF]|[\u0300-\u036F\u1DC0-\u1DFF\u20D0-\u20FF\uFE20-\uFE2F]/; var GLYPH = /([\0-\u02FF\u0370-\u1DBF\u1E00-\u20CF\u2100-\uD7FF\uDC00-\uFE1F\uFE30-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF])([\u0300-\u036F\u1DC0-\u1DFF\u20D0-\u20FF\uFE20-\uFE2F]*)/g; @@ -134,6 +137,8 @@ // This split is not perfect for all languages, but at least // it won't create invalid surrogate pairs or orphaned // combining characters. + // + // TODO: The way this is called is a hack. if (source.match && (source.match(MULTI) || target.match(MULTI))) { var sourceGlyphs = source.match(GLYPH) || []; var targetGlyphs = target.match(GLYPH) || []; @@ -149,7 +154,7 @@ return patch(partial, target); } - var NUMBERS = /(-?\d+(?:\.\d+)?)/g; + var NUMBERS = /(-?\d{1,20}(?:\.\d{1,20})?)/g; function areNumericTwins(source, target) { /** Check if a and b differ only in numerals */ @@ -179,7 +184,6 @@ numerals gives undefined results. */ - // TODO: Try to preserve precision of the original numbers. var sourceParts = source.split(NUMBERS); var targetParts = target.split(NUMBERS); var destParts = targetParts; @@ -189,14 +193,35 @@ var part = nlerp(+sourcePart, +targetPart, amount); var sourcePoint = sourcePart.indexOf("."); var targetPoint = targetPart.indexOf("."); - if (sourcePoint === -1 && targetPoint === -1) - part = Math.round(part); - targetParts[i] = part.toString(); + var point = Math.round(nlerp( + sourcePoint >= 0 ? (sourcePart.length - 1) - sourcePoint : 0, + targetPoint >= 0 ? (targetPart.length - 1) - targetPoint : 0, + amount)); + targetParts[i] = part.toFixed(point); } return targetParts.join(""); } - function fastLerp(a, b, p) { + function fastLerpAstral(source, target, amount) { + var sourceGlyphs = source.match(GLYPH) || []; + var targetGlyphs = target.match(GLYPH) || []; + var sourceLength = Math.round(sourceGlyphs.length * amount); + var targetLength = Math.round(targetGlyphs.length * amount); + var head = targetGlyphs.slice(0, targetLength); + var tail = sourceGlyphs.slice(sourceLength, sourceGlyphs.length); + head.push.apply(head, tail); + return head.join(""); + } + + function fastLerpBasic(source, target, amount) { + var sourceLength = Math.round(source.length * amount); + var targetLength = Math.round(target.length * amount); + var head = target.substring(0, targetLength); + var tail = source.substring(sourceLength, source.length); + return head + tail; + } + + function fastLerp(source, target, amount) { /** Interpolate between two strings based on length This interpolation algorithm progressively replaces the @@ -208,22 +233,13 @@ // strings, e.g. in the megabyte range. These are large enough // that it should be fine to just pick a codepoint and search // for the nearest glyph start. - if (a.match(MULTI) || b.match(MULTI)) { - var ca = a.match(GLYPH) || []; - var cb = b.match(GLYPH) || []; - var calen = Math.round(ca.length * p); - var cblen = Math.round(cb.length * p); - var r = cb.slice(0, cblen); - r.push.apply(r, ca.slice(calen, ca.length)); - return r.join(""); - } else { - var alen = Math.round(a.length * p); - var blen = Math.round(b.length * p); - return b.substring(0, blen) + a.substring(alen, a.length); - } + if (source.match(MULTI) || target.match(MULTI)) + return fastLerpAstral(source, target, amount); + else + return fastLerpBasic(source, target, amount); } - function lerp(a, b, p) { + function lerp(source, target, amount) { /** Interpolate between two strings as best as possible If the strings are identical aside from numbers in them, @@ -234,23 +250,24 @@ Otherwise, they are passed through fastLerp. */ - a = a.toString(); - b = b.toString(); + source = source.toString(); + target = target.toString(); // Fast path for boundary cases. - if (p === 0) return a; - if (p === 1) return b; + if (amount === 0) return source; + if (amount === 1) return target; - if (areNumericTwins(a, b)) - return numericLerp(a, b, p); + if (areNumericTwins(source, target)) + return numericLerp(source, target, amount); // Numeric lerps should over- and under-shoot when fed numbers // outside 0 to 1, but other types cannot. - if (p < 0) return a; - if (p > 1) return b; + if (amount < 0) return source; + if (amount > 1) return target; - var n = a.length * b.length; - return ((n && n < MAX_MATRIX_SIZE) ? diffLerp : fastLerp)(a, b, p); + var n = source.length * target.length; + var appropriate = (n && n < MAX_MATRIX_SIZE) ? diffLerp : fastLerp; + return appropriate(source, target, amount); } exports.costMatrix = costMatrix;