3 This is part of the YARRG website. YARRG is a tool and website
4 for assisting players of Yohoho Puzzle Pirates.
6 Copyright (C) 2009 Ian Jackson <ijackson@chiark.greenend.org.uk>
7 Copyright (C) 2009 Clare Boothby
9 YARRG's client code etc. is covered by the ordinary GNU GPL (v3 or later).
10 The YARRG website is covered by the GNU Affero GPL v3 or later, which
11 basically means that every installation of the website will let you
14 This program is free software: you can redistribute it and/or modify
15 it under the terms of the GNU Affero General Public License as
16 published by the Free Software Foundation, either version 3 of the
17 License, or (at your option) any later version.
19 This program is distributed in the hope that it will be useful,
20 but WITHOUT ANY WARRANTY; without even the implied warranty of
21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 GNU Affero General Public License for more details.
24 You should have received a copy of the GNU Affero General Public License
25 along with this program. If not, see <http://www.gnu.org/licenses/>.
27 Yohoho and Puzzle Pirates are probably trademarks of Three Rings and
28 are used without permission. This program is not endorsed or
29 sponsored by Three Rings.
32 This Mason component generates Javascript for sorting tables in
40 $sortkeys => 'ts_sortkeys'
51 % my $sortfn= "ts_sort__$table";
52 function <% $sortfn %>(compar) {
53 debug('sorting compar='+compar);
54 var table= document.getElementById('<% $table %>');
55 var firstrow= table.getElementsByTagName('tr').item(0);
56 var tbody= firstrow.parentNode
57 var rows= tbody.childNodes
58 var newrows= new Array;
59 for (var rowix=0; rowix < rows.length; rowix++) {
60 var row= rows.item(rowix);
61 debug('process row '+rowix+' [[ '+row+' ]] id='+row.id)
62 if (!row.id) continue;
63 if (row.tagName != 'TR') continue;
67 for (var rowix=0; rowix < newrows.length; rowix++) {
68 var row= newrows[rowix];
69 debug('add row '+rowix+' [[ '+row+' ]]');
70 tbody.appendChild(row);
75 % foreach my $cix (0..$#$cols) {
76 % my $col= $cols->[$cix];
78 % next if $col->{NoSort};
80 % my $mapfn= "ts_compar${cix}_map__$table";
81 function <% $mapfn %>(rowelement) {
82 var rowid = rowelement.id;
83 % if ($col->{SortKey}) {
84 return <% $col->{SortKey} %>;
86 return <% $sortkeys %>[<% $cix %>][rowid];
90 % my $comparefn= "ts_compar${cix}_cmp0__$table";
91 function <% $comparefn %>(a,b) {
92 var a_key = <% $mapfn %>(a);
93 var b_key = <% $mapfn %>(b);
94 % if ($col->{Numeric}) {
97 if (a_key < b_key) return -1;
98 if (a_key > b_key) return +1;
103 % foreach my $reverse (qw(0 1)) {
104 % my $tcomparefn= "ts_compar${cix}_cmp${reverse}__$table";
106 % next unless $col->{DoReverse};
107 function <% $tcomparefn %>(a,b) { return -<% $comparefn %>(a,b); }
109 % $thhtml .= "<a href=\"javascript:$sortfn($tcomparefn)\">".
110 % ($reverse ? '∨' : '∧'). '</a>';
112 % if (length $thhtml) {
113 % $add_heads{$cix}= $thhtml;
117 function ts_onload__<% $table %>() {
118 var ts_add_heads= <% to_json_protecttags(\%add_heads) %>;
119 var table= document.getElementById('<% $table %>');
120 var firstth= table.getElementsByTagName('th').item(0);
121 var thlist= firstth.parentNode.getElementsByTagName('th');
122 debug('thlist='+thlist);
123 debug('thlist.item(2)=' + thlist.item(2));
124 for (var cix in ts_add_heads) {
125 var ah = ts_add_heads[cix];
126 debug('appending to cix='+cix+' ah='+ah);
127 thlist.item(cix).innerHTML += ah;