/*
SortTable
version 2.1
7th April 2007
Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
19 Feb 2008
Fixed some jslint errors to support DokuWiki (http://www.splitbrain.org) js compression
function reinitsort()
sorttable.reinit
added by Otto Vainio to allow sort tables updated with javascript.
Otto Vainio (otto@valjakko.net)
27.11.2008
Changed line 77 document.getElementsByTagName('table') to div.getElementsByTagName('table')
To allow multiple sortable tables in same page
(Thanks to Hans Sampiemon)
14.1.2009
Added option for default sorting.
Use dokuwiki event registration.
27.1.2009
Cleaned some jlint errors to make this workable, when css+js compress is set in dokuwiki
10.5.2011
* version 2.5 Fixed problems with secionediting, footnotes and edittable
18.7.2013
* version 2.6 Added support for jQuery and dokuwiki Weatherwax ->
28.5.2014
* version 2.7 Fixed problem with first row not getting sorted
30.5.2014
* version 2.8 Fixed problem with first row not getting sorted in default sort. Added option "sumrow" to prevent sum line sort.
13.8.2014
* version 2.9 Fixed problem with header row being sorted in earlier versions of dokuwiki. Added option for sorting back to default
6.7.2015
* version 2.11 Added ip address sort. Thanks Chefkeks
Instructions:
Used from dokuwiki
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.
*/
var stIsIE = /*@cc_on!@*/false;
var tableid = 0;
sorttable = {
reinit: function() {
arguments.callee.done = true;
// kill the timer
//if (_timer) {clearInterval(_timer);}
if (!document.createElement || !document.getElementsByTagName) {return;}
// sorttable.DATE_RE = /^(\d\d?)[\/\.\-](\d\d?)[\/\.\-]((\d\d)?\d\d)$/;
sorttable.DATE_RE = /^(\d\d?)[\/\.\-](\d\d?)[\/\.\-]((\d\d)?\d\d)( (\d\d?)[:\.]?(\d\d?))?$/;
forEach(document.getElementsByTagName('table'), function(table) {
if (table.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortable(table);
}
});
forEach(document.getElementsByTagName('div'), function(div) {
if (div.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortablediv(div);
}
});
},
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;
// kill the timer
//if (_timer) {clearInterval(_timer);}
if (!document.createElement || !document.getElementsByTagName) {return;}
// sorttable.DATE_RE = /^(\d\d?)[\/\.\-](\d\d?)[\/\.\-]((\d\d)?\d\d)$/;
sorttable.DATE_RE = /^(\d\d?)[\/\.\-](\d\d?)[\/\.\-]((\d\d)?\d\d)( (\d\d?):?(\d\d?))?$/;
forEach(document.getElementsByTagName('table'), function(table) {
if (table.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortable(table);
}
});
forEach(document.getElementsByTagName('div'), function(div) {
if (div.className.search(/\bsortable\b/) != -1) {
sorttable.makeSortablediv(div);
}
});
},
makeSortablediv: function(div) {
if (div.getElementsByTagName('table').length === 0) {
} else {
forEach(div.getElementsByTagName('table'), function(table) {
colid=div.className;
//overs = new Array();
var patt1=/\bcol_\d_[a-z]+/gi;
var overs = new Array();
if (colid.search(patt1) != -1) {
var overrides = new Array();
overrides = colid.match(patt1);
var xo="";
for (xo in overrides)
{
if (xo == "")
{
} else {
try
{
var tmp = overrides[xo].split("_");
var ind = tmp[1];
var val = tmp[2];
overs[ind]=val;
}
catch (e)
{
}
}
}
colid = colid.replace(patt1,'');
}
var patt2=/\bsortbottom_?\d?/gi;
var bottoms = 0;
if (colid.search(patt2) != -1) {
var bs = new Array();
bs = colid.match(patt2);
try
{
var tmp = bs[0].split("_");
//var ind = tmp[1];
var val=1;
if(tmp.length>1) {
val = tmp[1];
}
bottoms=val;
}
catch (e)
{
}
}
var patt2ph=/\bthreephase/gi;
var ph2=true;
if (colid.search(patt2ph) != -1) {
ph2=false;
}
sorttable.makeSortable(table,overs,bottoms,ph2);
var pattdefault=/\bsortr?\d/gi;
if (colid.search(pattdefault) != -1) {
var mi= new Array();
mi = colid.match(pattdefault);
colid = mi[0].replace('sort','');
if (!colid != '')
{
colid = colid.trim();
}
revs=false;
if (colid.search(/\br/) != -1) {
revs=true;
colid = colid.replace('r','');
}
sorttable.defaultSort(table,colid,revs);
}
});
}
},
defaultSort: function(table, colid, revs) {
// theadrow = table.tHead.rows[0].cells;
havetHead = table.tHead;
var sindex=1;
if (havetHead) {
sindex=0;
}
theadrow = table.rows[0].cells;
colid--;
colname ="col"+colid;
// remove sorttable_sorted classes
var thiscell=false;
forEach(theadrow, function(cell) {
colclass=cell.className;
classname = colclass.split(" ");
if (classname[0]==colname)
// if (cell.className==colname)
{
thiscell=cell;
}
// if (cell.nodeType == 1) { // an element
// cell.className = cell.className.replace('sorttable_sorted_reverse','');
// cell.className = cell.className.replace('sorttable_sorted','');
// }
});
if (thiscell===false) {return;}
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
thiscell.className += ' sorttable_sorted';
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? ' 6' : ' ▾';
thiscell.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 = thiscell.sorttable_columnindex;
rows = thiscell.sorttable_tbody.rows;
for (var j=sindex; j5' : ' ▴';
thiscell.appendChild(sortrevind);
}
},
makeSortable: function(table,overrides, bottoms, ph2) {
// tableid++;
/*
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
*/
// table.tHead.className += ' tableid'+tableid;
// 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 = [];
if (bottoms>0) {
frombottom=table.rows.length-bottoms;
for (var i=table.rows.length-1; i>=frombottom; i--) {
// if (bottoms=0; ii--) {
tfo.appendChild(sortbottomrows[ii]);
}
delete sortbottomrows;
}
}
// work through each column and calculate its type
havetHead = table.tHead;
var sindex=1;
if (havetHead) {
sindex=0;
}
headrow = table.rows[0].cells;
// for (var i=0; i5' : ' ▴';
this.appendChild(sortrevind);
return;
}
if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) {
if (ph2==false) {
sorttable.original_order(this.sorttable_tbody,this.sindex);
forEach(theadrow.childNodes, function(cell) {
if (cell.nodeType == 1) { // an element
cell.className = cell.className.replace('sorttable_sorted_reverse','');
cell.className = cell.className.replace('sorttable_sorted','');
}
});
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
return;
} else {
// if we're already sorted by this column in reverse, just
// re-reverse the table, which is quicker
sorttable.reverse(this.sorttable_tbody,this.sindex);
this.className = this.className.replace('sorttable_sorted_reverse',
'sorttable_sorted');
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
// this.removeChild(document.getElementById('sorttable_sortrevind'));
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? ' 6' : ' ▾';
this.appendChild(sortfwdind);
return;
}
}
// remove sorttable_sorted classes
// theadrow = this.parentNode;
forEach(theadrow.childNodes, function(cell) {
if (cell.nodeType == 1) { // an element
cell.className = cell.className.replace('sorttable_sorted_reverse','');
cell.className = cell.className.replace('sorttable_sorted','');
}
});
sortfwdind = document.getElementById('sorttable_sortfwdind');
if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
sortrevind = document.getElementById('sorttable_sortrevind');
if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
this.className += ' sorttable_sorted';
sortfwdind = document.createElement('span');
sortfwdind.id = "sorttable_sortfwdind";
sortfwdind.innerHTML = stIsIE ? ' 6' : ' ▾';
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;
sindex = this.sindex;
for (var j=sindex; j 12) {
// definitely dd/mm
// return sorttable.sort_ddmm;
set=1;
DDMM=1;
} else if (second > 12) {
set=1;
MMDD=1;
// return sorttable.sort_mmdd;
} else {
// looks like a date, but we can't tell which, so assume
// that it's dd/mm (English imperialism!) and keep looking
set=1;
DDMM=1;
// sortfn = sorttable.sort_ddmm;
}
}
// if nothing known then assume text
if (set==0) {
TEXT=1;
}
set=0;
}
}
if (TEXT>0 || NUM+DDMM+MMDD>1) return sorttable.sort_alpha;
if (IP>0) return sorttable.sort_ipaddr;
if (NUM>0) return sorttable.sort_numeric;
if (DDMM>0) return sorttable.sort_ddmm;
if (MMDD>0) return sorttable.sort_mmdd;
},
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,sindex) {
// reverse the rows in a tbody
newrows = [];
for (var i=sindex; i=0; i--) {
tbody.appendChild(newrows[i]);
}
delete newrows;
},
original_order: function(tbody,isindex) {
// 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 = [];
rows = tbody.rows;
sindex = isindex;
for (var j=sindex; j 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)
}
};
/* ******************************************************************
Supporting functions: bundled here to avoid depending on a library
****************************************************************** */
// Dean Edwards/Matthias Miller/John Resig
// 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);
}
};
if ('undefined' != typeof(window.addEvent)) {
window.addEvent(window, 'load', sorttable.init);
} else {
jQuery(function() {
sorttable.init();
});
}
//sorttable.init;
function reinitsort() {
sorttable.reinit();
}