Fetch sources of minimized JS files

The MIT License (MIT)

Copyright (c) 2015 Terrill Dent www.terrill.ca

Permission is hereby granted, free of charge, to any person obtaining a copy

of this software and associated documentation files (the "Software"), to deal

in the Software without restriction, including without limitation the rights

to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

copies of the Software, and to permit persons to whom the Software is

furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all

copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE

SOFTWARE.

#!/bin/sh

wget -q -N https://raw.githubusercontent.com/terrilldent/tsorter/master/dist/tsorter.js

wget -q -N https://raw.githubusercontent.com/terrilldent/tsorter/master/dist/tsorter.min.js

/*!

 * tsorter 2.0.0 - Copyright 2015 Terrill Dent, http://terrill.ca

 * JavaScript HTML Table Sorter

 * Released under MIT license, http://terrill.ca/sorting/tsorter/LICENSE

 */

var tsorter = (function()

{

    'use strict';

    var sorterPrototype,

        addEvent,

        removeEvent,

        hasEventListener = !!document.addEventListener;

    if( !Object.create ){

        // Define Missing Function

        Object.create = function( prototype ) {

            var Obj = function(){return undefined;};

            Obj.prototype = prototype;

            return new Obj();

        };

    }

    // Cross Browser event binding

    addEvent = function( element, eventName, callback ) { 

        if( hasEventListener ) { 

            element.addEventListener(eventName, callback, false ); 

        } else {

            element.attachEvent( 'on' + eventName, callback); 

        }

    };

    // Cross Browser event removal

    removeEvent = function( element, eventName, callback ) { 

        if( hasEventListener ) { 

            element.removeEventListener(eventName, callback, false ); 

        } else {

            element.detachEvent( 'on' + eventName, callback); 

        }

    };

    sorterPrototype = {

        getCell: function(row)

        {

            var that = this;

            return that.trs[row].cells[that.column];

        },

        /* SORT

         * Sorts a particular column. If it has been sorted then call reverse

         * if not, then use quicksort to get it sorted.

         * Sets the arrow direction in the headers.

         * @param oTH - the table header cell (<th>) object that is clicked

         */

        sort: function( e )

        {   

            var that = this,

                th = e.target;

            // TODO: make sure target 'th' is not a child element of a <th> 

            //  We can't use currentTarget because of backwards browser support

            //  IE6,7,8 don't have it.

            // set the data retrieval function for this column 

            that.column = th.cellIndex;

            that.get = that.getAccessor( th.getAttribute('data-tsorter') );

            if( that.prevCol === that.column )

            {

                // if already sorted, reverse

                th.className = th.className !== 'descend' ? 'descend' : 'ascend';

                that.reverseTable();

            }

            else

            {

                // not sorted - call quicksort

                th.className = 'descend';

                if( that.prevCol !== -1 && that.ths[that.prevCol].className !== 'exc_cell'){

                    that.ths[that.prevCol].className = '';

                }

                that.quicksort(0, that.trs.length);

            }

            that.prevCol = that.column;

        },

        /* 

         * Choose Data Accessor Function

         * @param: the html structure type (from the data-type attribute)

         */

        getAccessor: function(sortType)

        {

            var that = this,

                accessors = that.accessors;

            if( accessors && accessors[ sortType ] ){

                return accessors[ sortType ];

            }

            switch( sortType )

            {   

                case "link":

                    return function(row){

                        return that.getCell(row).firstChild.firstChild.nodeValue;

                    };

                case "input":

                    return function(row){  

                        return that.getCell(row).firstChild.value;

                    };

                case "numeric":

                    return function(row){  

                        return parseFloat( that.getCell(row).firstChild.nodeValue.replace(/\D/g,''), 10 );

                    };

                default: /* Plain Text */

                    return function(row){  

                        return that.getCell(row).firstChild.nodeValue.toLowerCase();

                    };

            }

        },

        /* 

         * Exchange

         * A complicated way of exchanging two rows in a table.

         * Exchanges rows at index i and j

         */

        exchange: function(i, j)

        {

            var that = this,

                tbody = that.tbody,

                trs = that.trs,

                tmpNode;

            if( i === j+1 ) {

                tbody.insertBefore(trs[i], trs[j]);

            } else if( j === i+1 ) {

                tbody.insertBefore(trs[j], trs[i]);

            } else {

                tmpNode = tbody.replaceChild(trs[i], trs[j]);

                if( !trs[i] ) {

                    tbody.appendChild(tmpNode);

                } else {

                    tbody.insertBefore(tmpNode, trs[i]);

                }

            }

        },

        /* 

         * REVERSE TABLE

         * Reverses a table ordering

         */

        reverseTable: function()

        {

            var that = this,

                i;

            for( i = 1; i < that.trs.length; i++ ) {

                that.tbody.insertBefore( that.trs[i], that.trs[0] );

            }

        },

        /*

         * QUICKSORT

         * @param: lo - the low index of the array to sort

         * @param: hi - the high index of the array to sort

         */

        quicksort: function(lo, hi)

        {

            var i, j, pivot,

                that = this;

            if( hi <= lo+1 ){ return; }

            if( (hi - lo) === 2 ) {

                if(that.get(hi-1) > that.get(lo)) {

                    that.exchange(hi-1, lo);   

                }

                return;

            }

            i = lo + 1;

            j = hi - 1;

            if( that.get(lo) > that.get( i) ){ that.exchange( i, lo); }

            if( that.get( j) > that.get(lo) ){ that.exchange(lo,  j); }

            if( that.get(lo) > that.get( i) ){ that.exchange( i, lo); }

            pivot = that.get(lo);

            while(true) {

                j--;

                while(pivot > that.get(j)){ j--; }

                i++;

                while(that.get(i) > pivot){ i++; }

                if(j <= i){ break; }

                that.exchange(i, j);

            }

            that.exchange(lo, j);

            if((j-lo) < (hi-j)) {

                that.quicksort(lo, j);

                that.quicksort(j+1, hi);

            } else {

                that.quicksort(j+1, hi);

                that.quicksort(lo, j);

            }

        },

        init: function( table, initialSortedColumn, customDataAccessors ){

            var that = this,

                i;

            if( typeof table === 'string' ){

                table = document.getElementById(table);

            }

            that.table = table;

            that.ths   = table.getElementsByTagName("th");

            that.tbody = table.tBodies[0];

            that.trs   = that.tbody.getElementsByTagName("tr");

            that.prevCol = ( initialSortedColumn && initialSortedColumn > 0 ) ? initialSortedColumn : -1;

            that.accessors = customDataAccessors;

            that.boundSort = that.sort.bind( that );

            for( i = 0; i < that.ths.length; i++ ) {

                addEvent( that.ths[i], 'click', that.boundSort );

            }

        },

        destroy: function(){

            var that = this,

                i;

            if( that.ths ){

                for( i = 0; i < that.ths.length; i++ ) {

                    removeEvent( that.ths[i], 'click', that.boundSort );

                }

            }

        }

    };

    // Create a new sorter given a table element

    return {

        create: function( table, initialSortedColumn, customDataAccessors )

        {

            var sorter = Object.create( sorterPrototype );

            sorter.init( table, initialSortedColumn, customDataAccessors );

            return sorter;

        }

    };

}());

/*!

 * tsorter 2.0.0 - Copyright 2015 Terrill Dent, http://terrill.ca

 * JavaScript HTML Table Sorter

 * Released under MIT license, http://terrill.ca/sorting/tsorter/LICENSE

 */

var tsorter=function(){"use strict";var a,b,c,d=!!document.addEventListener;return Object.create||(Object.create=function(a){var b=function(){};return b.prototype=a,new b}),b=function(a,b,c){d?a.addEventListener(b,c,!1):a.attachEvent("on"+b,c)},c=function(a,b,c){d?a.removeEventListener(b,c,!1):a.detachEvent("on"+b,c)},a={getCell:function(a){var b=this;return b.trs[a].cells[b.column]},sort:function(a){var b=this,c=a.target;b.column=c.cellIndex,b.get=b.getAccessor(c.getAttribute("data-tsorter")),b.prevCol===b.column?(c.className="descend"!==c.className?"descend":"ascend",b.reverseTable()):(c.className="descend",-1!==b.prevCol&&"exc_cell"!==b.ths[b.prevCol].className&&(b.ths[b.prevCol].className=""),b.quicksort(0,b.trs.length)),b.prevCol=b.column},getAccessor:function(a){var b=this,c=b.accessors;if(c&&c[a])return c[a];switch(a){case"link":return function(a){return b.getCell(a).firstChild.firstChild.nodeValue};case"input":return function(a){return b.getCell(a).firstChild.value};case"numeric":return function(a){return parseFloat(b.getCell(a).firstChild.nodeValue.replace(/\D/g,""),10)};default:return function(a){return b.getCell(a).firstChild.nodeValue.toLowerCase()}}},exchange:function(a,b){var c,d=this,e=d.tbody,f=d.trs;a===b+1?e.insertBefore(f[a],f[b]):b===a+1?e.insertBefore(f[b],f[a]):(c=e.replaceChild(f[a],f[b]),f[a]?e.insertBefore(c,f[a]):e.appendChild(c))},reverseTable:function(){var a,b=this;for(a=1;a<b.trs.length;a++)b.tbody.insertBefore(b.trs[a],b.trs[0])},quicksort:function(a,b){var c,d,e,f=this;if(!(a+1>=b)){if(b-a===2)return void(f.get(b-1)>f.get(a)&&f.exchange(b-1,a));for(c=a+1,d=b-1,f.get(a)>f.get(c)&&f.exchange(c,a),f.get(d)>f.get(a)&&f.exchange(a,d),f.get(a)>f.get(c)&&f.exchange(c,a),e=f.get(a);;){for(d--;e>f.get(d);)d--;for(c++;f.get(c)>e;)c++;if(c>=d)break;f.exchange(c,d)}f.exchange(a,d),b-d>d-a?(f.quicksort(a,d),f.quicksort(d+1,b)):(f.quicksort(d+1,b),f.quicksort(a,d))}},init:function(a,c,d){var e,f=this;for("string"==typeof a&&(a=document.getElementById(a)),f.table=a,f.ths=a.getElementsByTagName("th"),f.tbody=a.tBodies[0],f.trs=f.tbody.getElementsByTagName("tr"),f.prevCol=c&&c>0?c:-1,f.accessors=d,f.boundSort=f.sort.bind(f),e=0;e<f.ths.length;e++)b(f.ths[e],"click",f.boundSort)},destroy:function(){var a,b=this;if(b.ths)for(a=0;a<b.ths.length;a++)c(b.ths[a],"click",b.boundSort)}},{create:function(b,c,d){var e=Object.create(a);return e.init(b,c,d),e}}}();

 No newline at end of file

Copyright (c) 2015, University of Washington Interactive Data Lab

All rights reserved.

Redistribution and use in source and binary forms, with or without

modification, are permitted provided that the following conditions are met:

1. Redistributions of source code must retain the above copyright notice, this

   list of conditions and the following disclaimer.

2. Redistributions in binary form must reproduce the above copyright notice,

   this list of conditions and the following disclaimer in the documentation

   and/or other materials provided with the distribution.

3. Neither the name of the copyright holder nor the names of its contributors

  may be used to endorse or promote products derived from this software

  without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE

DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE

FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR

SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER

CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,

OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE

OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.