/*-------------------------------------------------------------------
Original Script Author's Statement (don't remove):
This script is based on ideas of the author.
You may copy, modify and use it for any purpose. The only condition is that if you publish web pages that use this script
you point to its author at a suitable place and don't remove this Statement from it. It's your responsibility to handle
possible bugs even if you didn't modify anything. I cannot promise any support.
Dieter Bungers GMD (www.gmd.de) and infovation (www.infovation.de)
This Script Author's Statement (don't remove):
This script is based on ideas of Dieter (thanks) and modified for educational purposes.
Iva Nachtigalova (nachtigi@vscht.cz) and DCCE ICT Prague (uprt.vscht.cz)
--------------------------------------------------------------------*/
var dir = "";
var theHref = "";
var theChapter = "";
var bookmark;
var previousNumber = currentNumber;
function reDisplay(currentNumber,currentIsExpanded) {
var currentNumArray = currentNumber.split(".");
var currentLevel = currentNumArray.length - 1;
if (String(Number(currentIsExpanded)) == "NaN") {
for (dir = "", i = 0; i < tree.length; i++)
if (tree[i][0] == previousNumber)
if (tree[i][2].match(new RegExp("[/]","g")) != null)
for (j = 0; j < tree[i][2].match(new RegExp("[/]","g")).length; j++)
dir = dir + "../";
if (reDisplay.arguments.length == 2) bookmark = currentIsExpanded;
currentIsExpanded = false;
} else
bookmark = "";
leftFrame.document.open();
leftFrame.document.writeln("\n");
leftFrame.document.writeln("\n");
leftFrame.document.writeln("");
leftFrame.document.writeln("\t" + name + "");
leftFrame.document.writeln("\t");
leftFrame.document.writeln("\t");
leftFrame.document.writeln("\n");
leftFrame.document.writeln("");
leftFrame.document.writeln("
Obsah
");
for (i = 0; i < tree.length; i++)
if (tree[i][0] == currentNumber)
var currentHref = tree[i][2];
for (i = 0; i < tree.length; i++) {
thisNumber = tree[i][0];
var isPreviousNumber = (thisNumber == previousNumber);
var isCurrentNumber = (thisNumber == currentNumber);
if (isCurrentNumber) {
theChapter = tree[i][1];
theHref = tree[i][2];
}
var thisNumArray = thisNumber.split(".");
var thisLevel = thisNumArray.length - 1;
var toDisplay = true;
if (thisLevel > 0) {
for (j = 0; j < thisLevel; j++) {
toDisplay = (j > currentLevel) ? false : toDisplay && (thisNumArray[j] == currentNumArray[j]);
}
}
thisIsExpanded = toDisplay && (thisNumArray[thisLevel] == currentNumArray[thisLevel]);
if (currentIsExpanded) {
toDisplay = toDisplay && (thisLevel <= currentLevel);
if (isCurrentNumber) thisIsExpanded = false;
}
if (toDisplay) {
if ((showFirst) && (i == 0)) leftFrame.document.writeln("