// spells.js

// 3EProfiler (tm) character sheet source file.
// Copyright (C) 2003  Michael J. Eggertson.
// 
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 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 General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

// **

// Defines scripts used to maintain the spell list table.

function SpellSort(sortfunc)
{
  var tblrows = 
  [
    // Three child tables of the spells table, the first one is the spells
    // known table, which we don't care about, but get a reference to the
    // the rows of the remaining two tables.
    document.getElementById("spells").getElementsByTagName("table")[1].rows,
    document.getElementById("spells").getElementsByTagName("table")[2].rows
  ];
  
  // Copy the data from each of the items in the rows.
  debug.trace("Copying spell data...");
  var data = new Array();
  for (var i = 0; i < 2; i++)
  {
    for (var j = 1; j < tblrows[i].length; j++)
    {
      var thisdata = new Object();
      thisdata.spell = tblrows[i][j].cells[0].firstChild.value;
      thisdata.mem = tblrows[i][j].cells[1].firstChild.value;
      data.push(thisdata);
    }
  }

  // Now sort the data according to the given sortfunc.
  debug.trace("Sorting spell data...");
  data.sort(sortfunc);

  // Finally, re-copy all the data.
  debug.trace("Copying sorted spell data...");
  for (var i = 0; i < 2; i++)
  {
    for (var j = 1; j < tblrows[i].length; j++)
    {
      var thisdata = data.shift();
      tblrows[i][j].cells[0].firstChild.value = thisdata.spell;
      tblrows[i][j].cells[1].firstChild.value = thisdata.mem;
    }
  }

  debug.trace("Sorting complete.");
}

SpellSort.ByName = function(a, b)
{
  if ((a.spell.length == 0) && (b.spell.length == 0))
    return 0;
  else if (a.spell.length == 0)
    return 1;
  else if (b.spell.length == 0)
    return -1;
  return a.spell.localeCompare(b.spell);
}

SpellSort.ByMem = function(a, b)
{
  if ((a.mem.length == 0) && (b.mem.length == 0))
    return SpellSort.ByName(a, b);
  else if (a.mem.length == 0)
    return 1;
  else if (b.mem.length == 0)
    return -1;
  var comp = a.mem.localeCompare(b.mem);
  if (comp)
    return comp;
  else
    return SpellSort.ByName(a, b);
}

function CalcPsi() {
	if (disable_autocalc())
    return;
	
	var ab = "";
	var abMod = 0;
	var bonus = 0;
	
	if (sheet().PsiKeyAb.value.toLowerCase() != "int" && sheet().PsiKeyAb.value.toLowerCase() != "wis" && sheet().PsiKeyAb.value.toLowerCase() != "cha")
		return;
	
	ab = sheet().PsiKeyAb.value.toLowerCase();
	
	switch (ab) {
		case "int":
			ab = "Int";
			break
		case "wis":
			ab = "Wis";
			break
		case "cha":
			ab = "Cha";
			break
		default:
			return;
	}
	
	if (sheet()[ab + "TempMod"].value != "")
		abMod = parseInt(sheet()[ab + "TempMod"].value);
	else
		abMod = parseInt(sheet()[ab + "Mod"].value);

  ZeroFill(
    sheet().PowerPointsBonus,
	sheet().ManifesterLevel);
  
  bonus = 0.5 * parseInt(sheet().ManifesterLevel.value) * abMod;

  sheet().PowerPointsBonus.value = Math.floor(bonus);
  
  CalcPsiMax();
}

function CalcPsiMax() {
	if (disable_autocalc())
    return;
	
	ZeroFill(
		sheet().PowerPointsBase,
		sheet().PowerPointsBonus,
		sheet().PowerPointsMax);
	
	sheet().PowerPointsMax.value = parseInt(sheet().PowerPointsBase.value) + parseInt(sheet().PowerPointsBonus.value);
}