forked from tofsjonas/sortable
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsortable.mega-advanced.js
executable file
·193 lines (169 loc) · 6.88 KB
/
sortable.mega-advanced.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
/**
* sortable mega-advanced 1.0
*
* Makes html tables sortable (has not been tested in ie9)
*
* If you only want simple sorting, use the standard one
*
* Here you can add any kind of sort you like
*
* It is quite flexible, but will slow it down, since there are
* a lot of extra conditions and function calls
*
* Styling is done in css.
*
* Copyleft 2017 Jonas Earendel
*
* This is free and unencumbered software released into the public domain.
*
* Anyone is free to copy, modify, publish, use, compile, sell, or
* distribute this software, either in source code form or as a compiled
* binary, for any purpose, commercial or non-commercial, and by any
* means.
*
* In jurisdictions that recognize copyright laws, the author or authors
* of this software dedicate any and all copyright interest in the
* software to the public domain. We make this dedication for the benefit
* of the public at large and to the detriment of our heirs and
* successors. We intend this dedication to be an overt act of
* relinquishment in perpetuity of all present and future rights to this
* software under copyright law.
*
* 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 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.
*
* For more information, please refer to <http://unlicense.org>
*
*/
// why encapsulate what is already encapsulated?
document.addEventListener( 'click', function ( e ) {
var down_class = ' dir-d ';
var up_class = ' dir-u ';
var regex_dir = / dir-(u|d) /;
var regex_table = /\bsortable\b/;
var get_data_attribute_name = 'data-sort';
var th_element = e.target;
var column_index;
/**
* So google closure doesn't throw a fit over the sometimes empty dir argument
* @param {EventTarget} element
* @param {string=} dir
* @return void
*/
function reclassify( element, dir ) {
element.className = element.className.replace( regex_dir, '' ) + dir || '';
}
// function getData( tr, func ) { // fewer chars, but the other one is prettier
// var cell = tr.cells[ column_index ];
// var data = cell.getAttribute( get_data_attribute_name ) || '';
// if ( !data.length ) {
// data = func.getData( cell )
// cell.setAttribute( get_data_attribute_name, data );
// }
// return data;
// }
function getData( tr, func ) {
var cell = tr.cells[ column_index ];
if ( !cell.hasAttribute( get_data_attribute_name ) ) {
cell.setAttribute( get_data_attribute_name, func.getData( cell ) );
}
return cell.getAttribute( get_data_attribute_name );
}
// Here are some examples of mega-advanced sorting "algorithms"
// The "useMe" function returns true or false if its getData is to be used
var get_data_functions = [
// Sort data sizes, such as GB, MB, kB, etc:
{
// if the th element has the class "size", do this
useMe: function () {
return /\bsize\b/.test( th_element.className );
},
getData: function ( cell ) {
var matches = cell.innerText.match( /(\d+)([kMGT])B/ )
var vals = {
k: 1,
M: 2,
G: 3,
T: 4,
};
return matches[ 1 ] * Math.pow( 1000, vals[ matches[ 2 ] ] )
},
},
{ // if you want to sort weird date formats, this is one possible solution:
useMe: function () {
// if the class of the table header element has a "date" in it:
return /\bdate\b/.test( th_element.className );
// if the content of the table header element has a "date" in it:
// return /\bdate\b/i.test( th_element.innerText );
},
getData: function () {
return cell.innerText.replace( /(\d+)\/(\d+)\/(\d+)/, '$3$1$2' )
},
},
{ // default
useMe: function () {
return true;
},
getData: function ( cell ) {
return cell.innerText;
},
},
];
if ( th_element.nodeName == 'TH' ) {
var table = th_element.offsetParent;
// make sure it is a sortable table
if ( regex_table.test( table.className ) ) {
var tr = th_element.parentNode;
var nodes = tr.cells;
// reset thead cells and get column index
for ( var i = 0; i < nodes.length; i++ ) {
if ( nodes[ i ] === th_element ) {
column_index = i;
} else {
reclassify( nodes[ i ] );
}
}
var dir = down_class;
// check if we're sorting up or down, and update the css accordingly
if ( th_element.className.indexOf( down_class ) !== -1 ) {
dir = up_class;
}
reclassify( th_element, dir );
// extract all table rows, so the sorting can start.
var org_tbody = table.tBodies[ 0 ];
// slightly faster if cloned, noticable for huge tables.
var rows = [].slice.call( org_tbody.cloneNode( true ).rows, 0 );
var reverse = ( dir == up_class );
var get_data_func;
for ( var i = 0; i < get_data_functions.length; i++ ) {
get_data_func = get_data_functions[ i ];
if ( get_data_func.useMe() ) break;
}
// sort them using custom built in array sort.
rows.sort( function ( a, b ) {
a = getData( a, get_data_func )
b = getData( b, get_data_func )
if ( reverse ) {
var c = a;
a = b;
b = c;
}
// return func.compare( a, b );
return isNaN( a - b ) ? a.localeCompare( b ) : a - b;
} );
// Make a clone without contents
var clone_tbody = org_tbody.cloneNode();
// Build a sorted table body and replace the old one.
for ( i = 0; i < rows.length; i++ ) {
clone_tbody.appendChild( rows[ i ] );
}
// And finally insert the end result
table.replaceChild( clone_tbody, org_tbody );
}
}
} );