Explorar el Código

Add sortable.js for sortable tables in output.

This adds the sortable table JavaScript from
http://yoast.com/articles/sortable-table/ (version 1.5.7) and some
helper images from the same site.

[hoxu@users.sf.net: The license linked from sortable.js and the one linked from
yoast.com (to opensource.org) differ a bit (the middle sentence about
copyright/permissions notice is not in the first), so I'm including a verbatim
copy-paste from http://www.kryogenix.org/code/browser/licence.html here:
-----
Copyright (c) 1997-date Stuart Langridge

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 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.
-----
With the addition that Joost De Valk has improved the script.]
Signed-off-by: Heikki Hokkanen <hoxu@users.sf.net>
Tobias Gruetzmacher hace 17 años
padre
commit
7b61c4ba5b
Se han modificado 4 ficheros con 323 adiciones y 0 borrados
  1. BIN
      arrow-down.gif
  2. BIN
      arrow-none.gif
  3. BIN
      arrow-up.gif
  4. 323
    0
      sortable.js

BIN
arrow-down.gif Ver fichero


BIN
arrow-none.gif Ver fichero


BIN
arrow-up.gif Ver fichero


+ 323
- 0
sortable.js Ver fichero

@@ -0,0 +1,323 @@
1
+/*
2
+Table sorting script  by Joost de Valk, check it out at http://www.joostdevalk.nl/code/sortable-table/.
3
+Based on a script from http://www.kryogenix.org/code/browser/sorttable/.
4
+Distributed under the MIT license: http://www.kryogenix.org/code/browser/licence.html .
5
+
6
+Copyright (c) 1997-2007 Stuart Langridge, Joost de Valk.
7
+
8
+Version 1.5.7
9
+*/
10
+
11
+/* You can change these values */
12
+var image_path = "http://www.joostdevalk.nl/code/sortable-table/";
13
+var image_up = "arrowup.gif";
14
+var image_down = "arrowdown.gif";
15
+var image_none = "arrownone.gif";
16
+var europeandate = true;
17
+var alternate_row_colors = true;
18
+
19
+/* Don't change anything below this unless you know what you're doing */
20
+addEvent(window, "load", sortables_init);
21
+
22
+var SORT_COLUMN_INDEX;
23
+var thead = false;
24
+
25
+function sortables_init() {
26
+	// Find all tables with class sortable and make them sortable
27
+	if (!document.getElementsByTagName) return;
28
+	tbls = document.getElementsByTagName("table");
29
+	for (ti=0;ti<tbls.length;ti++) {
30
+		thisTbl = tbls[ti];
31
+		if (((' '+thisTbl.className+' ').indexOf("sortable") != -1) && (thisTbl.id)) {
32
+			ts_makeSortable(thisTbl);
33
+		}
34
+	}
35
+}
36
+
37
+function ts_makeSortable(t) {
38
+	if (t.rows && t.rows.length > 0) {
39
+		if (t.tHead && t.tHead.rows.length > 0) {
40
+			var firstRow = t.tHead.rows[t.tHead.rows.length-1];
41
+			thead = true;
42
+		} else {
43
+			var firstRow = t.rows[0];
44
+		}
45
+	}
46
+	if (!firstRow) return;
47
+	
48
+	// We have a first row: assume it's the header, and make its contents clickable links
49
+	for (var i=0;i<firstRow.cells.length;i++) {
50
+		var cell = firstRow.cells[i];
51
+		var txt = ts_getInnerText(cell);
52
+		if (cell.className != "unsortable" && cell.className.indexOf("unsortable") == -1) {
53
+			cell.innerHTML = '<a href="#" class="sortheader" onclick="ts_resortTable(this, '+i+');return false;">'+txt+'<span class="sortarrow">&nbsp;&nbsp;<img src="'+ image_path + image_none + '" alt="&darr;"/></span></a>';
54
+		}
55
+	}
56
+	if (alternate_row_colors) {
57
+		alternate(t);
58
+	}
59
+}
60
+
61
+function ts_getInnerText(el) {
62
+	if (typeof el == "string") return el;
63
+	if (typeof el == "undefined") { return el };
64
+	if (el.innerText) return el.innerText;	//Not needed but it is faster
65
+	var str = "";
66
+	
67
+	var cs = el.childNodes;
68
+	var l = cs.length;
69
+	for (var i = 0; i < l; i++) {
70
+		switch (cs[i].nodeType) {
71
+			case 1: //ELEMENT_NODE
72
+				str += ts_getInnerText(cs[i]);
73
+				break;
74
+			case 3:	//TEXT_NODE
75
+				str += cs[i].nodeValue;
76
+				break;
77
+		}
78
+	}
79
+	return str;
80
+}
81
+
82
+function ts_resortTable(lnk, clid) {
83
+	var span;
84
+	for (var ci=0;ci<lnk.childNodes.length;ci++) {
85
+		if (lnk.childNodes[ci].tagName && lnk.childNodes[ci].tagName.toLowerCase() == 'span') span = lnk.childNodes[ci];
86
+	}
87
+	var spantext = ts_getInnerText(span);
88
+	var td = lnk.parentNode;
89
+	var column = clid || td.cellIndex;
90
+	var t = getParent(td,'TABLE');
91
+	// Work out a type for the column
92
+	if (t.rows.length <= 1) return;
93
+	var itm = "";
94
+	var i = 0;
95
+	while (itm == "" && i < t.tBodies[0].rows.length) {
96
+		var itm = ts_getInnerText(t.tBodies[0].rows[i].cells[column]);
97
+		itm = trim(itm);
98
+		if (itm.substr(0,4) == "<!--" || itm.length == 0) {
99
+			itm = "";
100
+		}
101
+		i++;
102
+	}
103
+	if (itm == "") return; 
104
+	sortfn = ts_sort_caseinsensitive;
105
+	if (itm.match(/^\d\d[\/\.-][a-zA-z][a-zA-Z][a-zA-Z][\/\.-]\d\d\d\d$/)) sortfn = ts_sort_date;
106
+	if (itm.match(/^\d\d[\/\.-]\d\d[\/\.-]\d\d\d{2}?$/)) sortfn = ts_sort_date;
107
+	if (itm.match(/^-?[£$€Û¢´]\d/)) sortfn = ts_sort_numeric;
108
+	if (itm.match(/^-?(\d+[,\.]?)+(E[-+][\d]+)?%?$/)) sortfn = ts_sort_numeric;
109
+	SORT_COLUMN_INDEX = column;
110
+	var firstRow = new Array();
111
+	var newRows = new Array();
112
+	for (k=0;k<t.tBodies.length;k++) {
113
+		for (i=0;i<t.tBodies[k].rows[0].length;i++) { 
114
+			firstRow[i] = t.tBodies[k].rows[0][i]; 
115
+		}
116
+	}
117
+	for (k=0;k<t.tBodies.length;k++) {
118
+		if (!thead) {
119
+			// Skip the first row
120
+			for (j=1;j<t.tBodies[k].rows.length;j++) { 
121
+				newRows[j-1] = t.tBodies[k].rows[j];
122
+			}
123
+		} else {
124
+			// Do NOT skip the first row
125
+			for (j=0;j<t.tBodies[k].rows.length;j++) { 
126
+				newRows[j] = t.tBodies[k].rows[j];
127
+			}
128
+		}
129
+	}
130
+	newRows.sort(sortfn);
131
+	if (span.getAttribute("sortdir") == 'down') {
132
+			ARROW = '&nbsp;&nbsp;<img src="'+ image_path + image_down + '" alt="&darr;"/>';
133
+			newRows.reverse();
134
+			span.setAttribute('sortdir','up');
135
+	} else {
136
+			ARROW = '&nbsp;&nbsp;<img src="'+ image_path + image_up + '" alt="&uarr;"/>';
137
+			span.setAttribute('sortdir','down');
138
+	} 
139
+    // We appendChild rows that already exist to the tbody, so it moves them rather than creating new ones
140
+    // don't do sortbottom rows
141
+    for (i=0; i<newRows.length; i++) { 
142
+		if (!newRows[i].className || (newRows[i].className && (newRows[i].className.indexOf('sortbottom') == -1))) {
143
+			t.tBodies[0].appendChild(newRows[i]);
144
+		}
145
+	}
146
+    // do sortbottom rows only
147
+    for (i=0; i<newRows.length; i++) {
148
+		if (newRows[i].className && (newRows[i].className.indexOf('sortbottom') != -1)) 
149
+			t.tBodies[0].appendChild(newRows[i]);
150
+	}
151
+	// Delete any other arrows there may be showing
152
+	var allspans = document.getElementsByTagName("span");
153
+	for (var ci=0;ci<allspans.length;ci++) {
154
+		if (allspans[ci].className == 'sortarrow') {
155
+			if (getParent(allspans[ci],"table") == getParent(lnk,"table")) { // in the same table as us?
156
+				allspans[ci].innerHTML = '&nbsp;&nbsp;<img src="'+ image_path + image_none + '" alt="&darr;"/>';
157
+			}
158
+		}
159
+	}		
160
+	span.innerHTML = ARROW;
161
+	alternate(t);
162
+}
163
+
164
+function getParent(el, pTagName) {
165
+	if (el == null) {
166
+		return null;
167
+	} else if (el.nodeType == 1 && el.tagName.toLowerCase() == pTagName.toLowerCase()) {
168
+		return el;
169
+	} else {
170
+		return getParent(el.parentNode, pTagName);
171
+	}
172
+}
173
+
174
+function sort_date(date) {	
175
+	// y2k notes: two digit years less than 50 are treated as 20XX, greater than 50 are treated as 19XX
176
+	dt = "00000000";
177
+	if (date.length == 11) {
178
+		mtstr = date.substr(3,3);
179
+		mtstr = mtstr.toLowerCase();
180
+		switch(mtstr) {
181
+			case "jan": var mt = "01"; break;
182
+			case "feb": var mt = "02"; break;
183
+			case "mar": var mt = "03"; break;
184
+			case "apr": var mt = "04"; break;
185
+			case "may": var mt = "05"; break;
186
+			case "jun": var mt = "06"; break;
187
+			case "jul": var mt = "07"; break;
188
+			case "aug": var mt = "08"; break;
189
+			case "sep": var mt = "09"; break;
190
+			case "oct": var mt = "10"; break;
191
+			case "nov": var mt = "11"; break;
192
+			case "dec": var mt = "12"; break;
193
+			// default: var mt = "00";
194
+		}
195
+		dt = date.substr(7,4)+mt+date.substr(0,2);
196
+		return dt;
197
+	} else if (date.length == 10) {
198
+		if (europeandate == false) {
199
+			dt = date.substr(6,4)+date.substr(0,2)+date.substr(3,2);
200
+			return dt;
201
+		} else {
202
+			dt = date.substr(6,4)+date.substr(3,2)+date.substr(0,2);
203
+			return dt;
204
+		}
205
+	} else if (date.length == 8) {
206
+		yr = date.substr(6,2);
207
+		if (parseInt(yr) < 50) { 
208
+			yr = '20'+yr; 
209
+		} else { 
210
+			yr = '19'+yr; 
211
+		}
212
+		if (europeandate == true) {
213
+			dt = yr+date.substr(3,2)+date.substr(0,2);
214
+			return dt;
215
+		} else {
216
+			dt = yr+date.substr(0,2)+date.substr(3,2);
217
+			return dt;
218
+		}
219
+	}
220
+	return dt;
221
+}
222
+
223
+function ts_sort_date(a,b) {
224
+	dt1 = sort_date(ts_getInnerText(a.cells[SORT_COLUMN_INDEX]));
225
+	dt2 = sort_date(ts_getInnerText(b.cells[SORT_COLUMN_INDEX]));
226
+	
227
+	if (dt1==dt2) {
228
+		return 0;
229
+	}
230
+	if (dt1<dt2) { 
231
+		return -1;
232
+	}
233
+	return 1;
234
+}
235
+function ts_sort_numeric(a,b) {
236
+	var aa = ts_getInnerText(a.cells[SORT_COLUMN_INDEX]);
237
+	aa = clean_num(aa);
238
+	var bb = ts_getInnerText(b.cells[SORT_COLUMN_INDEX]);
239
+	bb = clean_num(bb);
240
+	return compare_numeric(aa,bb);
241
+}
242
+function compare_numeric(a,b) {
243
+	var a = parseFloat(a);
244
+	a = (isNaN(a) ? 0 : a);
245
+	var b = parseFloat(b);
246
+	b = (isNaN(b) ? 0 : b);
247
+	return a - b;
248
+}
249
+function ts_sort_caseinsensitive(a,b) {
250
+	aa = ts_getInnerText(a.cells[SORT_COLUMN_INDEX]).toLowerCase();
251
+	bb = ts_getInnerText(b.cells[SORT_COLUMN_INDEX]).toLowerCase();
252
+	if (aa==bb) {
253
+		return 0;
254
+	}
255
+	if (aa<bb) {
256
+		return -1;
257
+	}
258
+	return 1;
259
+}
260
+function ts_sort_default(a,b) {
261
+	aa = ts_getInnerText(a.cells[SORT_COLUMN_INDEX]);
262
+	bb = ts_getInnerText(b.cells[SORT_COLUMN_INDEX]);
263
+	if (aa==bb) {
264
+		return 0;
265
+	}
266
+	if (aa<bb) {
267
+		return -1;
268
+	}
269
+	return 1;
270
+}
271
+function addEvent(elm, evType, fn, useCapture)
272
+// addEvent and removeEvent
273
+// cross-browser event handling for IE5+,	NS6 and Mozilla
274
+// By Scott Andrew
275
+{
276
+	if (elm.addEventListener){
277
+		elm.addEventListener(evType, fn, useCapture);
278
+		return true;
279
+	} else if (elm.attachEvent){
280
+		var r = elm.attachEvent("on"+evType, fn);
281
+		return r;
282
+	} else {
283
+		alert("Handler could not be removed");
284
+	}
285
+}
286
+function clean_num(str) {
287
+	str = str.replace(new RegExp(/[^-?0-9.]/g),"");
288
+	return str;
289
+}
290
+function trim(s) {
291
+	return s.replace(/^\s+|\s+$/g, "");
292
+}
293
+function alternate(table) {
294
+	// Take object table and get all it's tbodies.
295
+	var tableBodies = table.getElementsByTagName("tbody");
296
+	// Loop through these tbodies
297
+	for (var i = 0; i < tableBodies.length; i++) {
298
+		// Take the tbody, and get all it's rows
299
+		var tableRows = tableBodies[i].getElementsByTagName("tr");
300
+		// Loop through these rows
301
+		// Start at 1 because we want to leave the heading row untouched
302
+		for (var j = 0; j < tableRows.length; j++) {
303
+			// Check if j is even, and apply classes for both possible results
304
+			if ( (j % 2) == 0  ) {
305
+				if ( !(tableRows[j].className.indexOf('odd') == -1) ) {
306
+					tableRows[j].className = tableRows[j].className.replace('odd', 'even');
307
+				} else {
308
+					if ( tableRows[j].className.indexOf('even') == -1 ) {
309
+						tableRows[j].className += " even";
310
+					}
311
+				}
312
+			} else {
313
+				if ( !(tableRows[j].className.indexOf('even') == -1) ) {
314
+					tableRows[j].className = tableRows[j].className.replace('even', 'odd');
315
+				} else {
316
+					if ( tableRows[j].className.indexOf('odd') == -1 ) {
317
+						tableRows[j].className += " odd";
318
+					}
319
+				}
320
+			} 
321
+		}
322
+	}
323
+}