/*
SortTable
version 2
7th April 2007
Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
Instructions:
Download this file
Add to your HTML
Add class="sortable" to any table you'd like to make sortable
Click on the headers to sort
Thanks to many, many people for contributions and suggestions.
Licenced as X11: http://www.kryogenix.org/code/browser/licence.html
This basically means: do what you want with it.
Majorly rewritten by Ian Cabell (ian.cabell@gmail.com) for Football-Almanac
*/
var stIsIE = /*@cc_on!@*/false;
sorttable = {
init: function() {
// quit if this function has already been called
if (arguments.callee.done) return;
// flag this function so we don't do the same thing twice
arguments.callee.done = true;
if (!document.createElement || !document.getElementsByTagName) return;
sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
$$('table.sortable').each( function(tbl) {
sorttable.makeSortable( tbl );
});
// preload images
var t1 = new Image( 12, 14 );
t1.src = "/images/sort_down.gif";
var t2 = new Image( 12, 14 );
t2.src = "/images/sort_up.gif";
var t3 = new Image( 12, 14 );
t3.src = "/images/sort_none.gif";
},
makeSortable: function(table) {
if (table.getElementsByTagName('thead').length == 0)
{
// table doesn't have a tHead. Since it should have, create one and
// put the first table row in it.
the = document.createElement('thead');
the.appendChild(table.rows[0]);
table.insertBefore(the,table.firstChild);
}
// Safari doesn't support table.tHead, sigh
if (table.tHead == null)
table.tHead = table.getElementsByTagName('thead')[0];
if (table.tHead.rows.length != 1)
return; // can't cope with two header rows
// Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
// "total" rows, for example). This is B&R, since what you're supposed
// to do is put them in a tfoot. So, if there are sortbottom rows,
// for backwards compatibility, move them to tfoot (creating it if needed).
sortbottomrows = [];
for (var i=0; i');
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind)
{
tmp = sortfwdind.parentNode;
tmp.removeChild(sortfwdind);
tmp.appendChild(sortneuind2);
}
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind)
{
tmp = sortrevind.parentNode;
tmp.removeChild(sortrevind);
tmp.appendChild(sortneuind2);
}
// remove sorttable_sorted classes, remove sorted indicators, and add the non-sorted indicator
var pr = Element.extend( this.parentNode );
var tr = Element.extend( this );
pr.select('th').each( function(s) {
s.removeClassName('sorttable_sorted_reverse');
s.removeClassName('sorttable_sorted');
});
this.select('span').each( function(s2) { s2.remove(); } );
this.addClassName( 'sorttable_sorted' );
var sortfwdind = new Element( 'span', {'id': 'sorttable_sortfwdind'}).update(' ');
this.appendChild(sortfwdind);
// build an array to sort. This is a Schwartzian transform thing,
// i.e., we "decorate" each row with the actual sort key,
// sort based on the sort keys, and then put the rows back in order
// which is a lot faster because you only do getInnerText once per row
row_array = [];
col = this.sorttable_columnindex;
rows = this.sorttable_tbody.rows;
for (var j=0; j');
this.appendChild(sortrevind);
sorttable.reverse( this.sorttable_tbody );
}
});
}
}
},
guessType: function(table, column) {
// guess the type of a column based on its first non-blank row
sortfn = sorttable.sort_alpha;
for (var i=0; i 12) // definitely dd/mm
return sorttable.sort_ddmm;
else if (second > 12)
return sorttable.sort_mmdd;
else // looks like a date, assume that it's dd/mm (English imperialism!) and keep looking
sortfn = sorttable.sort_ddmm;
}
}
}
return sortfn;
},
getInnerText: function(node) {
// gets the text we want to use for sorting for a cell.
// strips leading and trailing whitespace.
// this is *not* a generic getInnerText function; it's special to sorttable.
// for example, you can override the cell text with a customkey attribute.
// it also gets .value for fields.
hasInputs = (typeof node.getElementsByTagName == 'function') && node.getElementsByTagName('input').length;
if (node.getAttribute("sorttable_customkey") != null)
return node.getAttribute("sorttable_customkey");
else if (typeof node.textContent != 'undefined' && !hasInputs)
return node.textContent.replace(/^\s+|\s+$/g, '');
else if (typeof node.innerText != 'undefined' && !hasInputs)
return node.innerText.replace(/^\s+|\s+$/g, '');
else if (typeof node.text != 'undefined' && !hasInputs)
return node.text.replace(/^\s+|\s+$/g, '');
else
{
switch (node.nodeType) {
case 3:
if (node.nodeName.toLowerCase() == 'input')
return node.value.replace(/^\s+|\s+$/g, '');
case 4:
return node.nodeValue.replace(/^\s+|\s+$/g, '');
break;
case 1:
case 11:
var innerText = '';
for (var i = 0; i < node.childNodes.length; i++)
{
innerText += sorttable.getInnerText(node.childNodes[i]);
}
return innerText.replace(/^\s+|\s+$/g, '');
break;
default:
return '';
}
}
},
reverse: function(tbody) {
// reverse the rows in a tbody
newrows = [];
for (var i=0; i=0; i--)
{
tbody.appendChild(newrows[i]);
}
delete newrows;
},
/* sort functions
each sort function takes two parameters, a and b
you are comparing a[0] and b[0] */
sort_numeric: function(a,b) {
aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));
if (isNaN(aa)) aa = 0;
bb = parseFloat(b[0].replace(/[^0-9.-]/g,''));
if (isNaN(bb)) bb = 0;
return aa-bb;
},
sort_alpha: function(a,b) {
if (a[0]==b[0]) return 0;
if (a[0] 0 )
{
var q = list[i]; list[i] = list[i+1]; list[i+1] = q;
swap = true;
}
} // for
t--;
if (!swap) break;
for(var i = t; i > b; --i)
{
if ( comp_func(list[i], list[i-1]) < 0 )
{
var q = list[i]; list[i] = list[i-1]; list[i-1] = q;
swap = true;
}
} // for
b++;
} // while(swap)
}
}
Event.observe(window, 'load', sorttable.init );
// written by Dean Edwards, 2005
// with input from Tino Zijdel, Matthias Miller, Diego Perini
// http://dean.edwards.name/weblog/2005/10/add-event/
function dean_addEvent(element, type, handler)
{
if (element.addEventListener)
element.addEventListener(type, handler, false);
else
{
// assign each event handler a unique ID
if (!handler.$$guid)
handler.$$guid = dean_addEvent.guid++;
// create a hash table of event types for the element
if (!element.events)
element.events = {};
// create a hash table of event handlers for each element/event pair
var handlers = element.events[type];
if (!handlers)
{
handlers = element.events[type] = {};
// store the existing event handler (if there is one)
if (element["on" + type])
handlers[0] = element["on" + type];
}
// store the event handler in the hash table
handlers[handler.$$guid] = handler;
// assign a global event handler to do all the work
element["on" + type] = handleEvent;
}
};
// a counter used to create unique IDs
dean_addEvent.guid = 1;
function removeEvent(element, type, handler) {
if (element.removeEventListener)
element.removeEventListener(type, handler, false);
else
{
// delete the event handler from the hash table
if (element.events && element.events[type])
delete element.events[type][handler.$$guid];
}
};
function handleEvent(event) {
var returnValue = true;
// grab the event object (IE uses a global event object)
event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);
// get a reference to the hash table of event handlers
var handlers = this.events[event.type];
// execute each event handler
for (var i in handlers)
{
this.$$handleEvent = handlers[i];
if (this.$$handleEvent(event) === false)
returnValue = false;
}
return returnValue;
};
function fixEvent(event) {
// add W3C standard event methods
event.preventDefault = fixEvent.preventDefault;
event.stopPropagation = fixEvent.stopPropagation;
return event;
};
fixEvent.preventDefault = function() {
this.returnValue = false;
};
fixEvent.stopPropagation = function() {
this.cancelBubble = true;
}
// Dean's forEach: http://dean.edwards.name/base/forEach.js
/*
forEach, version 1.0
Copyright 2006, Dean Edwards
License: http://www.opensource.org/licenses/mit-license.php
*/
// array-like enumeration
if (!Array.forEach) { // mozilla already supports this
Array.forEach = function(array, block, context) {
for (var i = 0; i < array.length; i++)
{
block.call(context, array[i], i, array);
}
};
}
// generic enumeration
Function.prototype.forEach = function(object, block, context) {
for (var key in object)
{
if (typeof this.prototype[key] == "undefined")
block.call(context, object[key], key, object);
}
};
// character enumeration
String.forEach = function(string, block, context) {
Array.forEach(string.split(""), function(chr, index) {
block.call(context, chr, index, string);
});
};
// globally resolve forEach enumeration
var forEach = function(object, block, context) {
if (object)
{
var resolve = Object; // default
if (object instanceof Function) // functions have a "length" property
resolve = Function;
else if (object.forEach instanceof Function)
{
// the object implements a custom forEach method so use that
object.forEach(block, context);
return;
}
else if (typeof object == "string") // the object is a string
resolve = String;
else if (typeof object.length == "number") // the object is array-like
resolve = Array;
resolve.forEach(object, block, context);
}
};
');
this.appendChild(sortfwdind);
// build an array to sort. This is a Schwartzian transform thing,
// i.e., we "decorate" each row with the actual sort key,
// sort based on the sort keys, and then put the rows back in order
// which is a lot faster because you only do getInnerText once per row
row_array = [];
col = this.sorttable_columnindex;
rows = this.sorttable_tbody.rows;
for (var j=0; j