jmuheim/base

File diff_match_patch.js has 641 lines of code (exceeds 250 allowed). Consider refactoring.

Open

(function() {
    function diff_match_patch() {
        this.Diff_Timeout = 1;
        this.Diff_EditCost = 4;
        this.Match_Threshold = 0.5;

Consider simplifying this complex logical expression.

Open

            if (!(a[c].length1 <= b)) {
                var d = a[c];
                a.splice(c--, 1);
                for (var e = d.start1, f = d.start2, g = ""; 0 !== d.diffs.length;) {
                    var h = new diff_match_patch.patch_obj,

Function diff_cleanupSemanticLossless has 36 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.diff_cleanupSemanticLossless = function(a) {
        function b(a, b) {
            if (!a || !b) return 6;
            var c = a.charAt(a.length - 1),
                d = b.charAt(0),

Consider simplifying this complex logical expression.

Open

            else if (-1 == a[f][0] ? i = !0 : j = !0, e && (g && h && j && i || e.length < this.Diff_EditCost / 2 && 3 == g + h + j + i)) a.splice(c[d - 1], 0, [-1, e]), a[c[d - 1] + 1][0] = 1, d--, e = null, g && h ? (j = i = !0, d = 0) : (d--, f = 0 < d ? c[d - 1] : -1, j = i = !1), b = !0;

Function diff_lineMode_ has 33 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.diff_lineMode_ = function(a, b, c) {
        var d = this.diff_linesToChars_(a, b);
        a = d.chars1;
        b = d.chars2;
        d = d.lineArray;

Function diff_bisect_ has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.diff_bisect_ = function(a, b, c) {
        for (var d = a.length, e = b.length, f = Math.ceil((d + e) / 2), g = f, h = 2 * f, j = Array(h), i = Array(h), k = 0; k < h; k++) j[k] = -1, i[k] = -1;
        j[g + 1] = 0;
        i[g + 1] = 0;
        for (var k = d - e, q = 0 != k % 2, r = 0, t = 0, p = 0, w = 0, v = 0; v < f && !((new Date).getTime() > c); v++) {

Function patch_make has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.patch_make = function(a, b, c) {
        var d;
        if ("string" == typeof a && "string" == typeof b && "undefined" == typeof c) d = a, b = this.diff_main(d, b, !0), 2 < b.length && (this.diff_cleanupSemantic(b), this.diff_cleanupEfficiency(b));
        else if (a && "object" == typeof a && "undefined" == typeof b && "undefined" == typeof c) b = a, d = this.diff_text1(b);
        else if ("string" == typeof a && b && "object" == typeof b && "undefined" == typeof c) d = a;

Function patch_fromText has 29 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.patch_fromText = function(a) {
        var b = [];
        if (!a) return b;
        a = a.split("\n");
        for (var c = 0, d = /^@@ -(\d+),?(\d*) \+(\d+),?(\d*) @@$/; c < a.length;) {

Function match_bitap_ has 29 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.match_bitap_ = function(a, b, c) {
        function d(a, d) {
            var e = a / b.length,
                g = Math.abs(c - d);
            return !f.Match_Distance ? g ? 1 : e : e + g / f.Match_Distance

Function patch_apply has 27 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.patch_apply = function(a, b) {
        if (0 == a.length) return [b, []];
        a = this.patch_deepCopy(a);
        var c = this.patch_addPadding(a);
        b = c + b + c;

Function diff_bisectSplit_ has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

    diff_match_patch.prototype.diff_bisectSplit_ = function(a, b, c, d, e) {

Similar blocks of code found in 2 locations. Consider refactoring.

Open

            "" === e[2] ? (f.start1--, f.length1 = 1) : "0" == e[2] ? f.length1 = 0 : (f.start1--, f.length1 = parseInt(e[2], 10));

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

            "" === e[4] ? (f.start2--, f.length2 = 1) : "0" == e[4] ? f.length2 = 0 : (f.start2--, f.length2 =
                parseInt(e[4], 10));

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

                u = n == -v || n != v && i[l - 1] < i[l + 1] ? i[l + 1] : i[l - 1] + 1;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        b = 0 === this.length2 ? this.start2 + ",0" : 1 == this.length2 ? this.start2 + 1 : this.start2 + 1 + "," + this.length2;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

                m = n == -v || n != v && j[l - 1] < j[l + 1] ? j[l + 1] : j[l - 1] + 1;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        a = 0 === this.length1 ? this.start1 + ",0" : 1 == this.length1 ? this.start1 + 1 : this.start1 + 1 + "," + this.length1;

• Read up
  Read up