<%doc>

 This is part of the YARRG website.  YARRG is a tool and website
 for assisting players of Yohoho Puzzle Pirates.

 Copyright (C) 2009 Ian Jackson <ijackson@chiark.greenend.org.uk>
 Copyright (C) 2009 Clare Boothby

  YARRG's client code etc. is covered by the ordinary GNU GPL (v3 or later).
  The YARRG website is covered by the GNU Affero GPL v3 or later, which
   basically means that every installation of the website will let you
   download the source.

 This program is free software: you can redistribute it and/or modify
 it under the terms of the GNU Affero General Public License as
 published by the Free Software Foundation, either version 3 of the
 License, or (at your option) any later version.

 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU Affero General Public License for more details.

 You should have received a copy of the GNU Affero General Public License
 along with this program.  If not, see <http://www.gnu.org/licenses/>.

 Yohoho and Puzzle Pirates are probably trademarks of Three Rings and
 are used without permission.  This program is not endorsed or
 sponsored by Three Rings.


 This Mason component generates Javascript for sorting tables in
 DHTML.


</%doc>

<%args>
$table => 'ts_table'
$sortkeys => 'ts_sortkeys'
$throw => undef
$tbrow => undef
$rowclass => undef
$cols
</%args>

<%doc>
	Numeric
	SortKey
	MapFn
	NoSort
	DoReverse
</%doc>

<&| script &>

% print $m->content();

%	my $sortfn= "ts_s_$table";
function <% $sortfn %>(compar) {
  debug('sorting compar='+compar);
  var table= document.getElementById('<% $table %>');
  var firstrow= table.getElementsByTagName('tr').item(0);
  var tbody= firstrow.parentNode
  var rows= tbody.childNodes
  var newrows= new Array;
  var finalrows= new Array;
  var rowix= 0;
%	if (defined $throw) {
  for (; rowix < rows.length; rowix++) {
    var row= rows.item(rowix);
    if (row.id == '<% $throw %>') break;
    debug('skip row '+rowix+' [[ '+row+' ]] id='+row.id);
  }
  rowix++;
%	}
  for (; rowix < rows.length; rowix++) {
    var row= rows.item(rowix);
%	if (defined $tbrow) {
    if (row.id == '<% $tbrow %>') break;
%	}
    if (!row.id) { debug('noid row '+rowix+' [[ '+row+' ]]'); continue; }
    if (row.tagName != 'TR') {
      debug('no-tr row '+rowix+' tagName='+row.tagName+' [[ '+row+' ]]');
      continue;
    }
    debug('process row '+rowix+' [[ '+row+' ]] id='+row.id);
    newrows.push(row);
  }
  for (; rowix < rows.length; rowix++) {
    var row= rows.item(rowix);
    finalrows.push(row);
    debug('final row '+rowix+' [[ '+row+' ]]');
  }
  newrows.sort(compar);
%	if (defined $rowclass) {
  for (var rowix=0; rowix < newrows.length; rowix++) {
    var row= newrows[rowix];
    var classname= '<% $rowclass %>'+(rowix % 2);
    debug('fix row '+rowix+' class '+classname);
    row.className= classname;
  }
%	}
  newrows= newrows.concat(finalrows);
  for (var rowix=0; rowix < newrows.length; rowix++) {
    var row= newrows[rowix];
    debug('add row '+rowix+' [[ '+row+' ]]');
    tbody.appendChild(row);
  }
}

% my %add_heads;
% foreach my $cix (0..$#$cols) {
%	my $col= $cols->[$cix];
%	my $thhtml= '';
%	next if $col->{NoSort};

%	my $mapfn= "ts_${cix}m_$table";
function <% $mapfn %>(re) {
  var rowid = re.id;
%	if ($col->{SortKey}) {
  return <% $col->{SortKey} %>;
%	} else {
%		my $sk= "$sortkeys"."[$cix][rowid]";
%		if ($col->{MapFn}) {
  return <% $col->{MapFn} %>(<% $sk %>);
%		} else {
  return <% $sk %>;
%		}
%	}
}

%	my $comparefn= "ts_${cix}c0_$table";
function <% $comparefn %>(a,b) {
  var ak = <% $mapfn %>(a);
  var bk = <% $mapfn %>(b);
%	if ($col->{Numeric}) {
  return ak - bk
%	} else {
  if (ak < bk) return -1;
  if (ak > bk) return +1;
  return 0;
%	}
}

%	foreach my $reverse (qw(1 0)) {
%		my $tcomparefn= "ts_${cix}c${reverse}_$table";
%		if ($reverse) {
%			next unless $col->{DoReverse};
function <% $tcomparefn %>(a,b) { return -<% $comparefn %>(a,b); }

%		}
%		$thhtml .= "<a href=\"javascript:$sortfn($tcomparefn)\">".
%				($reverse ? '&or;' : '&and;'). '</a>';
%	}
%	if (length $thhtml) {
%		$add_heads{$cix}= $thhtml;
%	}
% }

function ts_onload__<% $table %>() {
  var ts_add_heads= <% to_json_protecttags(\%add_heads) %>;
  var ctr= document.getElementById('<% defined($throw) ? $throw : $table %>');
  var firstth= ctr.getElementsByTagName('th').item(0);
  var thlist= firstth.parentNode.getElementsByTagName('th');
  debug('thlist='+thlist);
  debug('thlist.item(2)=' + thlist.item(2));
  for (var cix in ts_add_heads) {
    if (!ts_add_heads.hasOwnProperty(cix)) continue;
    var ah = ts_add_heads[cix];
    debug('appending to cix='+cix+' ah='+ah);
    thlist.item(cix).innerHTML += ah;
  }
}

register_onload(ts_onload__<% $table %>);
</&>