+/*\r
+ SortTable\r
+ version 2\r
+ 7th April 2007\r
+ Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/\r
+\r
+ Instructions:\r
+ Download this file\r
+ Add <script src="sorttable.js"></script> to your HTML\r
+ Add class="sortable" to any table you'd like to make sortable\r
+ Click on the headers to sort\r
+\r
+ Thanks to many, many people for contributions and suggestions.\r
+ Licenced as X11: http://www.kryogenix.org/code/browser/licence.html\r
+ This basically means: do what you want with it.\r
+*/\r
+\r
+\r
+var stIsIE = /*@cc_on!@*/false;\r
+\r
+sorttable = {\r
+ init: function() {\r
+ // quit if this function has already been called\r
+ if (arguments.callee.done) return;\r
+ // flag this function so we don't do the same thing twice\r
+ arguments.callee.done = true;\r
+ // kill the timer\r
+ if (_timer) clearInterval(_timer);\r
+\r
+ if (!document.createElement || !document.getElementsByTagName) return;\r
+\r
+ sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;\r
+\r
+ forEach(document.getElementsByTagName('table'), function(table) {\r
+ if (table.className.search(/\bsortable\b/) != -1) {\r
+ sorttable.makeSortable(table);\r
+ }\r
+ });\r
+\r
+ },\r
+\r
+ makeSortable: function(table) {\r
+ if (table.getElementsByTagName('thead').length == 0) {\r
+ // table doesn't have a tHead. Since it should have, create one and\r
+ // put the first table row in it.\r
+ the = document.createElement('thead');\r
+ the.appendChild(table.rows[0]);\r
+ table.insertBefore(the,table.firstChild);\r
+ }\r
+ // Safari doesn't support table.tHead, sigh\r
+ if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];\r
+\r
+ if (table.tHead.rows.length != 1) return; // can't cope with two header rows\r
+\r
+ // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as\r
+ // "total" rows, for example). This is B&R, since what you're supposed\r
+ // to do is put them in a tfoot. So, if there are sortbottom rows,\r
+ // for backwards compatibility, move them to tfoot (creating it if needed).\r
+ sortbottomrows = [];\r
+ for (var i=0; i<table.rows.length; i++) {\r
+ if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {\r
+ sortbottomrows[sortbottomrows.length] = table.rows[i];\r
+ }\r
+ }\r
+ if (sortbottomrows) {\r
+ if (table.tFoot == null) {\r
+ // table doesn't have a tfoot. Create one.\r
+ tfo = document.createElement('tfoot');\r
+ table.appendChild(tfo);\r
+ }\r
+ for (var i=0; i<sortbottomrows.length; i++) {\r
+ tfo.appendChild(sortbottomrows[i]);\r
+ }\r
+ delete sortbottomrows;\r
+ }\r
+\r
+ // work through each column and calculate its type\r
+ headrow = table.tHead.rows[0].cells;\r
+ for (var i=0; i<headrow.length; i++) {\r
+ // manually override the type with a sorttable_type attribute\r
+ if (!headrow[i].className.match(/\bsorttable_nosort\b/)) { // skip this col\r
+ mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/);\r
+ if (mtch) { override = mtch[1]; }\r
+ if (mtch && typeof sorttable["sort_"+override] == 'function') {\r
+ headrow[i].sorttable_sortfunction = sorttable["sort_"+override];\r
+ } else {\r
+ headrow[i].sorttable_sortfunction = sorttable.guessType(table,i);\r
+ }\r
+ // make it clickable to sort\r
+ headrow[i].sorttable_columnindex = i;\r
+ headrow[i].sorttable_tbody = table.tBodies[0];\r
+ dean_addEvent(headrow[i],"click", sorttable.innerSortFunction = function(e) {\r
+\r
+ if (this.className.search(/\bsorttable_sorted\b/) != -1) {\r
+ // if we're already sorted by this column, just\r
+ // reverse the table, which is quicker\r
+ sorttable.reverse(this.sorttable_tbody);\r
+ this.className = this.className.replace('sorttable_sorted',\r
+ 'sorttable_sorted_reverse');\r
+ this.removeChild(document.getElementById('sorttable_sortfwdind'));\r
+ sortrevind = document.createElement('span');\r
+ sortrevind.id = "sorttable_sortrevind";\r
+ sortrevind.innerHTML = stIsIE ? ' <font face="webdings">5</font>' : ' ▴';\r
+ this.appendChild(sortrevind);\r
+ return;\r
+ }\r
+ if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) {\r
+ // if we're already sorted by this column in reverse, just\r
+ // re-reverse the table, which is quicker\r
+ sorttable.reverse(this.sorttable_tbody);\r
+ this.className = this.className.replace('sorttable_sorted_reverse',\r
+ 'sorttable_sorted');\r
+ this.removeChild(document.getElementById('sorttable_sortrevind'));\r
+ sortfwdind = document.createElement('span');\r
+ sortfwdind.id = "sorttable_sortfwdind";\r
+ sortfwdind.innerHTML = stIsIE ? ' <font face="webdings">6</font>' : ' ▾';\r
+ this.appendChild(sortfwdind);\r
+ return;\r
+ }\r
+\r
+ // remove sorttable_sorted classes\r
+ theadrow = this.parentNode;\r
+ forEach(theadrow.childNodes, function(cell) {\r
+ if (cell.nodeType == 1) { // an element\r
+ cell.className = cell.className.replace('sorttable_sorted_reverse','');\r
+ cell.className = cell.className.replace('sorttable_sorted','');\r
+ }\r
+ });\r
+ sortfwdind = document.getElementById('sorttable_sortfwdind');\r
+ if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }\r
+ sortrevind = document.getElementById('sorttable_sortrevind');\r
+ if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }\r
+\r
+ this.className += ' sorttable_sorted';\r
+ sortfwdind = document.createElement('span');\r
+ sortfwdind.id = "sorttable_sortfwdind";\r
+ sortfwdind.innerHTML = stIsIE ? ' <font face="webdings">6</font>' : ' ▾';\r
+ this.appendChild(sortfwdind);\r
+\r
+ // build an array to sort. This is a Schwartzian transform thing,\r
+ // i.e., we "decorate" each row with the actual sort key,\r
+ // sort based on the sort keys, and then put the rows back in order\r
+ // which is a lot faster because you only do getInnerText once per row\r
+ row_array = [];\r
+ col = this.sorttable_columnindex;\r
+ rows = this.sorttable_tbody.rows;\r
+ for (var j=0; j<rows.length; j++) {\r
+ row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];\r
+ }\r
+ /* If you want a stable sort, uncomment the following line */\r
+ //sorttable.shaker_sort(row_array, this.sorttable_sortfunction);\r
+ /* and comment out this one */\r
+ row_array.sort(this.sorttable_sortfunction);\r
+\r
+ tb = this.sorttable_tbody;\r
+ for (var j=0; j<row_array.length; j++) {\r
+ tb.appendChild(row_array[j][1]);\r
+ }\r
+\r
+ delete row_array;\r
+ });\r
+ }\r
+ }\r
+ },\r
+\r
+ guessType: function(table, column) {\r
+ // guess the type of a column based on its first non-blank row\r
+ sortfn = sorttable.sort_alpha;\r
+ for (var i=0; i<table.tBodies[0].rows.length; i++) {\r
+ text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);\r
+ if (text != '') {\r
+ if (text.match(/^-?[£$¤]?[\d,.]+%?$/)) {\r
+ return sorttable.sort_numeric;\r
+ }\r
+ // check for a date: dd/mm/yyyy or dd/mm/yy\r
+ // can have / or . or - as separator\r
+ // can be mm/dd as well\r
+ possdate = text.match(sorttable.DATE_RE)\r
+ if (possdate) {\r
+ // looks like a date\r
+ first = parseInt(possdate[1]);\r
+ second = parseInt(possdate[2]);\r
+ if (first > 12) {\r
+ // definitely dd/mm\r
+ return sorttable.sort_ddmm;\r
+ } else if (second > 12) {\r
+ return sorttable.sort_mmdd;\r
+ } else {\r
+ // looks like a date, but we can't tell which, so assume\r
+ // that it's dd/mm (English imperialism!) and keep looking\r
+ sortfn = sorttable.sort_ddmm;\r
+ }\r
+ }\r
+ }\r
+ }\r
+ return sortfn;\r
+ },\r
+\r
+ getInnerText: function(node) {\r
+ // gets the text we want to use for sorting for a cell.\r
+ // strips leading and trailing whitespace.\r
+ // this is *not* a generic getInnerText function; it's special to sorttable.\r
+ // for example, you can override the cell text with a customkey attribute.\r
+ // it also gets .value for <input> fields.\r
+\r
+ if (!node) return "";\r
+\r
+ hasInputs = (typeof node.getElementsByTagName == 'function') &&\r
+ node.getElementsByTagName('input').length;\r
+\r
+ if (node.getAttribute("sorttable_customkey") != null) {\r
+ return node.getAttribute("sorttable_customkey");\r
+ }\r
+ else if (typeof node.textContent != 'undefined' && !hasInputs) {\r
+ return node.textContent.replace(/^\s+|\s+$/g, '');\r
+ }\r
+ else if (typeof node.innerText != 'undefined' && !hasInputs) {\r
+ return node.innerText.replace(/^\s+|\s+$/g, '');\r
+ }\r
+ else if (typeof node.text != 'undefined' && !hasInputs) {\r
+ return node.text.replace(/^\s+|\s+$/g, '');\r
+ }\r
+ else {\r
+ switch (node.nodeType) {\r
+ case 3:\r
+ if (node.nodeName.toLowerCase() == 'input') {\r
+ return node.value.replace(/^\s+|\s+$/g, '');\r
+ }\r
+ case 4:\r
+ return node.nodeValue.replace(/^\s+|\s+$/g, '');\r
+ break;\r
+ case 1:\r
+ case 11:\r
+ var innerText = '';\r
+ for (var i = 0; i < node.childNodes.length; i++) {\r
+ innerText += sorttable.getInnerText(node.childNodes[i]);\r
+ }\r
+ return innerText.replace(/^\s+|\s+$/g, '');\r
+ break;\r
+ default:\r
+ return '';\r
+ }\r
+ }\r
+ },\r
+\r
+ reverse: function(tbody) {\r
+ // reverse the rows in a tbody\r
+ newrows = [];\r
+ for (var i=0; i<tbody.rows.length; i++) {\r
+ newrows[newrows.length] = tbody.rows[i];\r
+ }\r
+ for (var i=newrows.length-1; i>=0; i--) {\r
+ tbody.appendChild(newrows[i]);\r
+ }\r
+ delete newrows;\r
+ },\r
+\r
+ /* sort functions\r
+ each sort function takes two parameters, a and b\r
+ you are comparing a[0] and b[0] */\r
+ sort_numeric: function(a,b) {\r
+ aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));\r
+ if (isNaN(aa)) aa = 0;\r
+ bb = parseFloat(b[0].replace(/[^0-9.-]/g,''));\r
+ if (isNaN(bb)) bb = 0;\r
+ return aa-bb;\r
+ },\r
+ sort_alpha: function(a,b) {\r
+ if (a[0]==b[0]) return 0;\r
+ if (a[0]<b[0]) return -1;\r
+ return 1;\r
+ },\r
+ sort_ddmm: function(a,b) {\r
+ mtch = a[0].match(sorttable.DATE_RE);\r
+ y = mtch[3]; m = mtch[2]; d = mtch[1];\r
+ if (m.length == 1) m = '0'+m;\r
+ if (d.length == 1) d = '0'+d;\r
+ dt1 = y+m+d;\r
+ mtch = b[0].match(sorttable.DATE_RE);\r
+ y = mtch[3]; m = mtch[2]; d = mtch[1];\r
+ if (m.length == 1) m = '0'+m;\r
+ if (d.length == 1) d = '0'+d;\r
+ dt2 = y+m+d;\r
+ if (dt1==dt2) return 0;\r
+ if (dt1<dt2) return -1;\r
+ return 1;\r
+ },\r
+ sort_mmdd: function(a,b) {\r
+ mtch = a[0].match(sorttable.DATE_RE);\r
+ y = mtch[3]; d = mtch[2]; m = mtch[1];\r
+ if (m.length == 1) m = '0'+m;\r
+ if (d.length == 1) d = '0'+d;\r
+ dt1 = y+m+d;\r
+ mtch = b[0].match(sorttable.DATE_RE);\r
+ y = mtch[3]; d = mtch[2]; m = mtch[1];\r
+ if (m.length == 1) m = '0'+m;\r
+ if (d.length == 1) d = '0'+d;\r
+ dt2 = y+m+d;\r
+ if (dt1==dt2) return 0;\r
+ if (dt1<dt2) return -1;\r
+ return 1;\r
+ },\r
+\r
+ shaker_sort: function(list, comp_func) {\r
+ // A stable sort function to allow multi-level sorting of data\r
+ // see: http://en.wikipedia.org/wiki/Cocktail_sort\r
+ // thanks to Joseph Nahmias\r
+ var b = 0;\r
+ var t = list.length - 1;\r
+ var swap = true;\r
+\r
+ while(swap) {\r
+ swap = false;\r
+ for(var i = b; i < t; ++i) {\r
+ if ( comp_func(list[i], list[i+1]) > 0 ) {\r
+ var q = list[i]; list[i] = list[i+1]; list[i+1] = q;\r
+ swap = true;\r
+ }\r
+ } // for\r
+ t--;\r
+\r
+ if (!swap) break;\r
+\r
+ for(var i = t; i > b; --i) {\r
+ if ( comp_func(list[i], list[i-1]) < 0 ) {\r
+ var q = list[i]; list[i] = list[i-1]; list[i-1] = q;\r
+ swap = true;\r
+ }\r
+ } // for\r
+ b++;\r
+\r
+ } // while(swap)\r
+ }\r
+}\r
+\r
+/* ******************************************************************\r
+ Supporting functions: bundled here to avoid depending on a library\r
+ ****************************************************************** */\r
+\r
+// Dean Edwards/Matthias Miller/John Resig\r
+\r
+/* for Mozilla/Opera9 */\r
+if (document.addEventListener) {\r
+ document.addEventListener("DOMContentLoaded", sorttable.init, false);\r
+}\r
+\r
+/* for Internet Explorer */\r
+/*@cc_on @*/\r
+/*@if (@_win32)\r
+ document.write("<script id=__ie_onload defer src=javascript:void(0)><\/script>");\r
+ var script = document.getElementById("__ie_onload");\r
+ script.onreadystatechange = function() {\r
+ if (this.readyState == "complete") {\r
+ sorttable.init(); // call the onload handler\r
+ }\r
+ };\r
+/*@end @*/\r
+\r
+/* for Safari */\r
+if (/WebKit/i.test(navigator.userAgent)) { // sniff\r
+ var _timer = setInterval(function() {\r
+ if (/loaded|complete/.test(document.readyState)) {\r
+ sorttable.init(); // call the onload handler\r
+ }\r
+ }, 10);\r
+}\r
+\r
+/* for other browsers */\r
+window.onload = sorttable.init;\r
+\r
+// written by Dean Edwards, 2005\r
+// with input from Tino Zijdel, Matthias Miller, Diego Perini\r
+\r
+// http://dean.edwards.name/weblog/2005/10/add-event/\r
+\r
+function dean_addEvent(element, type, handler) {\r
+ if (element.addEventListener) {\r
+ element.addEventListener(type, handler, false);\r
+ } else {\r
+ // assign each event handler a unique ID\r
+ if (!handler.$$guid) handler.$$guid = dean_addEvent.guid++;\r
+ // create a hash table of event types for the element\r
+ if (!element.events) element.events = {};\r
+ // create a hash table of event handlers for each element/event pair\r
+ var handlers = element.events[type];\r
+ if (!handlers) {\r
+ handlers = element.events[type] = {};\r
+ // store the existing event handler (if there is one)\r
+ if (element["on" + type]) {\r
+ handlers[0] = element["on" + type];\r
+ }\r
+ }\r
+ // store the event handler in the hash table\r
+ handlers[handler.$$guid] = handler;\r
+ // assign a global event handler to do all the work\r
+ element["on" + type] = handleEvent;\r
+ }\r
+};\r
+// a counter used to create unique IDs\r
+dean_addEvent.guid = 1;\r
+\r
+function removeEvent(element, type, handler) {\r
+ if (element.removeEventListener) {\r
+ element.removeEventListener(type, handler, false);\r
+ } else {\r
+ // delete the event handler from the hash table\r
+ if (element.events && element.events[type]) {\r
+ delete element.events[type][handler.$$guid];\r
+ }\r
+ }\r
+};\r
+\r
+function handleEvent(event) {\r
+ var returnValue = true;\r
+ // grab the event object (IE uses a global event object)\r
+ event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);\r
+ // get a reference to the hash table of event handlers\r
+ var handlers = this.events[event.type];\r
+ // execute each event handler\r
+ for (var i in handlers) {\r
+ this.$$handleEvent = handlers[i];\r
+ if (this.$$handleEvent(event) === false) {\r
+ returnValue = false;\r
+ }\r
+ }\r
+ return returnValue;\r
+};\r
+\r
+function fixEvent(event) {\r
+ // add W3C standard event methods\r
+ event.preventDefault = fixEvent.preventDefault;\r
+ event.stopPropagation = fixEvent.stopPropagation;\r
+ return event;\r
+};\r
+fixEvent.preventDefault = function() {\r
+ this.returnValue = false;\r
+};\r
+fixEvent.stopPropagation = function() {\r
+ this.cancelBubble = true;\r
+}\r
+\r
+// Dean's forEach: http://dean.edwards.name/base/forEach.js\r
+/*\r
+ forEach, version 1.0\r
+ Copyright 2006, Dean Edwards\r
+ License: http://www.opensource.org/licenses/mit-license.php\r
+*/\r
+\r
+// array-like enumeration\r
+if (!Array.forEach) { // mozilla already supports this\r
+ Array.forEach = function(array, block, context) {\r
+ for (var i = 0; i < array.length; i++) {\r
+ block.call(context, array[i], i, array);\r
+ }\r
+ };\r
+}\r
+\r
+// generic enumeration\r
+Function.prototype.forEach = function(object, block, context) {\r
+ for (var key in object) {\r
+ if (typeof this.prototype[key] == "undefined") {\r
+ block.call(context, object[key], key, object);\r
+ }\r
+ }\r
+};\r
+\r
+// character enumeration\r
+String.forEach = function(string, block, context) {\r
+ Array.forEach(string.split(""), function(chr, index) {\r
+ block.call(context, chr, index, string);\r
+ });\r
+};\r
+\r
+// globally resolve forEach enumeration\r
+var forEach = function(object, block, context) {\r
+ if (object) {\r
+ var resolve = Object; // default\r
+ if (object instanceof Function) {\r
+ // functions have a "length" property\r
+ resolve = Function;\r
+ } else if (object.forEach instanceof Function) {\r
+ // the object implements a custom forEach method so use that\r
+ object.forEach(block, context);\r
+ return;\r
+ } else if (typeof object == "string") {\r
+ // the object is a string\r
+ resolve = String;\r
+ } else if (typeof object.length == "number") {\r
+ // the object is array-like\r
+ resolve = Array;\r
+ }\r
+ resolve.forEach(object, block, context);\r
+ }\r
+};\r