ochko/prudge

Function tablesorter has 562 lines of code (exceeds 25 allowed). Consider refactoring.

Open

        function () {

            var parsers = [],
                widgets = [];

File jquery.tablesorter.js has 706 lines of code (exceeds 250 allowed). Consider refactoring.

Open

/*
 * 
 * TableSorter 2.0 - Client-side table sorting with ease!
 * Version 2.0.5b
 * @requires jQuery v1.2.3

Function construct has 99 lines of code (exceeds 25 allowed). Consider refactoring.

Open

            this.construct = function (settings) {
                return this.each(function () {
                    // if no thead or tbody quit.
                    if (!this.tHead || !this.tBodies) return;
                    // declare

Function computeTableHeaderCellIndexes has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

            function computeTableHeaderCellIndexes(t) {
                var matrix = [];
                var lookup = {};
                var thead = t.getElementsByTagName('THEAD')[0];
                var trs = thead.getElementsByTagName('TR');

Function appendToTable has 31 lines of code (exceeds 25 allowed). Consider refactoring.

Open

            function appendToTable(table, cache) {

                if (table.config.debug) {
                    var appendTime = new Date()
                }

Function multisort has 30 lines of code (exceeds 25 allowed). Consider refactoring.

Open

            function multisort(table, sortList, cache) {

                if (table.config.debug) {
                    var sortTime = new Date();
                }

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

Open

            function buildParserCache(table, $headers) {

                if (table.config.debug) {
                    var parsersDebug = "";
                }

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

Open

            function buildCache(table) {

                if (table.config.debug) {
                    var cacheTime = new Date();
                }

Avoid deeply nested control flow statements.

Open

                                        if (s[0] == i) {
                                            o.count = s[1];
                                            o.count++;
                                            s[1] = o.count % 2;
                                        }

Avoid deeply nested control flow statements.

Open

                                        if (a[j][0] != i) {
                                            config.sortList.push(a[j]);
                                        }

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

Open

                for (var i = 0; i < l; i++) {
                    if (parsers[i].id.toLowerCase() == name.toLowerCase()) {
                        return parsers[i];
                    }
                }

• Read up
  Read up

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

Open

                for (var i = 0; i < l; i++) {
                    if (widgets[i].id.toLowerCase() == name.toLowerCase()) {
                        return widgets[i];
                    }
                }

• Read up
  Read up

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

Open

            function sortText(a, b) {
                if (table.config.sortLocaleCompare) return a.localeCompare(b);
                return ((a < b) ? -1 : ((a > b) ? 1 : 0));
            };

• Read up
  Read up

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

Open

            function sortTextDesc(a, b) {
                if (table.config.sortLocaleCompare) return b.localeCompare(a);
                return ((b < a) ? -1 : ((b > a) ? 1 : 0));
            };

• Read up
  Read up

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

Open

                } else if (type == 'numeric' && direction == 'desc') {
                    return "(" + a + " === null && " + b + " === null) ? 0 :(" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : " + b + " - " + a + "));";
                }

• Read up
  Read up

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

Open

                } else if (type == 'text' && direction == 'desc') {
                    return "(" + a + " == " + b + " ? 0 : (" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : (" + b + " < " + a + ") ? -1 : 1 )));";
                } else if (type == 'numeric' && direction == 'asc') {
                    return "(" + a + " === null && " + b + " === null) ? 0 :(" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : " + a + " - " + b + "));";
                } else if (type == 'numeric' && direction == 'desc') {

• Read up
  Read up

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

Open

                if (type == 'text' && direction == 'asc') {
                    return "(" + a + " == " + b + " ? 0 : (" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : (" + a + " < " + b + ") ? -1 : 1 )));";
                } else if (type == 'text' && direction == 'desc') {
                    return "(" + a + " == " + b + " ? 0 : (" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : (" + b + " < " + a + ") ? -1 : 1 )));";
                } else if (type == 'numeric' && direction == 'asc') {

• Read up
  Read up

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

Open

                } else if (type == 'numeric' && direction == 'asc') {
                    return "(" + a + " === null && " + b + " === null) ? 0 :(" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : " + a + " - " + b + "));";
                } else if (type == 'numeric' && direction == 'desc') {
                    return "(" + a + " === null && " + b + " === null) ? 0 :(" + a + " === null ? Number.POSITIVE_INFINITY : (" + b + " === null ? Number.NEGATIVE_INFINITY : " + b + " - " + a + "));";
                }

• Read up
  Read up