function MM_swapImgRestore() { //v3.0
  var i,x,a=document.MM_sr; for(i=0;a&&i<a.length&&(x=a[i])&&x.oSrc;i++) x.src=x.oSrc;
}

function MM_preloadImages() { //v3.0
  var d=document; if(d.images){ if(!d.MM_p) d.MM_p=new Array();
    var i,j=d.MM_p.length,a=MM_preloadImages.arguments; for(i=0; i<a.length; i++)
    if (a[i].indexOf("#")!=0){ d.MM_p[j]=new Image; d.MM_p[j++].src=a[i];}}
}

function MM_findObj(n, d) { //v3.0
  var p,i,x;  if(!d) d=document; if((p=n.indexOf("?"))>0&&parent.frames.length) {
    d=parent.frames[n.substring(p+1)].document; n=n.substring(0,p);}
  if(!(x=d[n])&&d.all) x=d.all[n]; for (i=0;!x&&i<d.forms.length;i++) x=d.forms[i][n];
  for(i=0;!x&&d.layers&&i<d.layers.length;i++) x=MM_findObj(n,d.layers[i].document); return x;
}

function MM_swapImage() { //v3.0
  var i,j=0,x,a=MM_swapImage.arguments; document.MM_sr=new Array; for(i=0;i<(a.length-2);i+=3)
   if ((x=MM_findObj(a[i]))!=null){document.MM_sr[j++]=x; if(!x.oSrc) x.oSrc=x.src; x.src=a[i+2];}
}



// var Level = "";

// Knoten ermitteln
function getNode(aNodeAdress)
{
    var i       = -1;
    for (i = 0; i < myTree.length; i++)
    {
        if (myTree[i].nodeAdress == aNodeAdress)
        {
            return  myTree[i];
        }
    }
    return null;
}

// Level aus Übergabeparameter myLevel ermitteln
function getLevel(){
    var a = window.location.search;
    if (a.indexOf("?myLevel=") > -1 )
    {
        a = a.substring(a.indexOf("?myLevel=") + 9, a.length );
        if( a.length > 0)
        {
            Level = a;
            return;
        }
        else
        {
            Level = "";
            return;
        }
    }
}
getLevel();



/* left navigation function */
function getHtmlCodeLeftMenu( )
{
	var str = "";
	if ( levelDeepness == 2)
	{		 
		for (i=0; i<parentBrothersNode.length; i++)
		{			
			if ( parentBrothersNode[i].nodeAdress == currentParentNode )
			{
				  // Das ist mein direkter Vater
				str = str + '<tr>';
				str = str + '</tr>';
				str = str + '<tr>';
				str = str + '  <td colspan="2"  class="navleft-aktiv"><a href="' + parentBrothersNode[i].target + '" class="navleft-aktiv">' + parentBrothersNode[i].label + '</a></td>';
				str = str + '</tr>';

				for (j=0; j<brotherNodes.length; j++)
				{
					if ( brotherNodes[j].nodeAdress == Level )
					{
					  // Das bin ich
					  str = str + '<tr>';
					  str = str + '  <td  colspan="2" class="navleft2-aktiv" valign="top"  height="20"><a href="' + brotherNodes[j].target + '" class="navleft2-aktiv">' + brotherNodes[j].label + '</a></td>';
					  str = str + '</tr>';
					  
					  // hier die Kinder anzeigen
					  for (x=0; x<childNodes.length; x++)			
					  {

						  str = str + '<tr>';
						  str = str + '  <td  class="navleft2">&nbsp;</td>';					  
						  str = str + '  <td  class="navleft2" valign="top"><a href="' + childNodes[x].target + '" class="navleft2">' + childNodes[x].label + '</a></td>';
						  str = str + '</tr>';
						  str = str + '<tr>';
						  str = str + '  <td colspan="3" height="8"  class="navleft2">&nbsp;</td>';	
						  str = str + '</tr>';						  
					
					  }
					}
					else
					{
					  // Meine Brüder
					  str = str + '<tr>';
					  str = str + '  <td colspan="2" class="navleft2" valign="top"><a href="' + brotherNodes[j].target + '" class="navleft2">' + brotherNodes[j].label + '</a></td>';
					  str = str + '</tr>';
					  
					}
				}
			}
			else
			{
				  // Die Brüder meines Vaters
				str = str + '<tr>';
				  str = str + '  <td  colspan="2" class="navleft"><a href="' + parentBrothersNode[i].target + '" class="navleft">' + parentBrothersNode[i].label + '</a></td>';
				  str = str + '</tr>';
			}
		}
	}
	else
	{
		if ( levelDeepness == 0)
		{
			for (j=0; j<childNodes.length; j++)
			{
			  // Meine Kinder
			  str = str + '<tr>';
			  str = str + '  <td class="navleft" ><a href="' + childNodes[j].target + '" class="navleft">' + childNodes[j].label + '</a></td>';
			  str = str + '</tr>';
			}
		}
		if ( levelDeepness == 1)
		{
			for (i=0; i<brotherNodes.length; i++)
			{

				if ( brotherNodes[i].nodeAdress == Level )
				{
					  // Das bin ich selbst
					  str = str + '<tr>';
					  str = str + '  <td class="navleft-aktiv"><a href="' + brotherNodes[i].target + '" class="navleft">' + brotherNodes[i].label + '</a></td>';
					  str = str + '</tr>';

					for (j=0; j<childNodes.length; j++)
					{

					  // Meine Kinder
					  str = str + '<tr>';
					  str = str + '  <td class="navleft2" valign="top" ><a href="' + childNodes[j].target + '" class="navleft2">' + childNodes[j].label + '</a></td>';
					  str = str + '</tr>';
					}
				}
				else
				{
					  // Meine Brüder
					  str = str + '<tr>';
					  str = str + '  <td class="navleft"><a href="' + brotherNodes[i].target + '" class="navleft">' + brotherNodes[i].label + '</a></td>';
					  str = str + '</tr>';
				}
			}
		}
		if ( levelDeepness == 3)
		{
			for (p=0; p<grandpaBrothersNode.length; p++ )
			{
				if ( grandpaBrothersNode[p].nodeAdress == currentGrandpaNode )
				{
					// Das ist mein direkter Oppa
					str = str + '<tr>';
					str = str + '  <td colspan="2"  class="navleft-aktiv"><a href="' + grandpaBrothersNode[p].target + '" class="navleft-aktiv">' + grandpaBrothersNode[p].label + '</a></td>';
					str = str + '</tr>';
					for (i=0; i<parentBrothersNode.length; i++)
					{	
						if ( parentBrothersNode[i].nodeAdress == currentParentNode )
						{
							str = str + '<tr>';
							str = str + '  <td  class="navleft2-aktiv">&nbsp;</td>';					  
					  		str = str + '  <td  colspan="2" class="navleft2-aktiv" valign="top"><a href="' + parentBrothersNode[i].target + '" class="navleft2-aktiv">' + parentBrothersNode[i].label + '</a></td>';
					  		str = str + '</tr>';	
							for (b=0; b<brotherNodes.length; b++)
							{	
								if ( brotherNodes[b].nodeAdress == Level )
								{
								
									str = str + '<tr>';
									str = str + '  <td  class="navleft2-aktiv">&nbsp;</td>';	
									str = str + '  <td  class="navleft2-aktiv">&nbsp;</td>';					  
									str = str + '  <td  class="navleft2-aktiv" valign="top"><a href="' + brotherNodes[b].target + '" class="navleft2-aktiv">' + brotherNodes[b].label + '</a></td>';
									str = str + '</tr>';
									str = str + '<tr>';
									str = str + '  <td colspan="3" height="8"  class="navleft2">&nbsp;</td>';	
									str = str + '</tr>';			
						  
						  											
								}
								else
								{
									str = str + '<tr>';
									str = str + '  <td  class="navleft2">&nbsp;</td>';	
									str = str + '  <td  class="navleft2">&nbsp;</td>';					  
									str = str + '  <td  class="navleft2" valign="top"><a href="' + brotherNodes[b].target + '" class="navleft2">' + brotherNodes[b].label + '</a></td>';
									str = str + '</tr>';
									str = str + '<tr>';
									str = str + '  <td colspan="3" height="8"  class="navleft2">&nbsp;</td>';	
									str = str + '</tr>';			
						  
								}
							}															
						}
						else
						{
					  		str = str + '<tr>';
					  		str = str + '  <td  class="navleft2">&nbsp;</td>';					  
					  		str = str + '  <td  colspan="2" class="navleft2" valign="top"><a href="' + parentBrothersNode[i].target + '" class="navleft2">' + parentBrothersNode[i].label + '</a></td>';
					  		str = str + '</tr>';
						}
					}				
				}
				else
				{
					// Die Brueder von meinem Opa anzeigen
					str = str + '<tr>';
					str = str + '  <td  class="navleft">&nbsp;</td>';				  
					str = str + '  <td  colspan="2" class="navleft"><a href="' + grandpaBrothersNode[p].target + '" class="navleft">' + grandpaBrothersNode[p].label + '</a></td>';
					str = str + '</tr>';						
				}				
			}
		}
	}

	return str;
}




// Knoten ermitteln
function getNode(aNodeAdress)
{
    var i       = -1;
    for (i = 0; i < myTree.length; i++)
    {
        if (myTree[i].nodeAdress == aNodeAdress)
        {
            return  myTree[i];
        }
    }
    return null;
}

// Level aus Übergabeparameter myLevel ermitteln
function getLevel(){
    var a = window.location.search;
    if (a.indexOf("?myLevel=") > -1 )
    {
        a = a.substring(a.indexOf("?myLevel=") + 9, a.length );
        if( a.length > 0)
        {
            Level = a;
            return;
        }
        else
        {
            Level = "";
            return;
        }
    }
}
getLevel();

// Top Level
//var TopLevel = "";
function Node_getTopNodes()
{
    var i       = -1;
    var result  = new Array();
    for (i = 0; i < myTree.length; i++)
    {
       if (myTree[i].nodeAdress.length == 2 )
       {
           result[result.length] = myTree[i];
       }
    }
    return result;
}

function getHtmlCodeLayerMenu( navLevel )
{
	var arr = new Array();
	arr = topNodes;

	var str = '';
	for (i=0; i<arr.length; i++)
	{
		if ( Level.indexOf(arr[i].nodeAdress) != -1 )
		{
			str = str + '  <TD class=top_navigation_active><A';
			str = str + '	href="' + arr[i].target + '">' + arr[i].label + '</A></td>';
		}
		else
		{
			str = str + '  <TD class=top_navigation><A';
			str = str + '	href="' + arr[i].target + '">' + arr[i].label + '</A></td>';
		}
		
	}

	//alert( str );
	return str;
}


/* site location */
function getNavigationHelp()
{
    // Prüfen, ob die notwendigen Javascript-Navigationsdaten vorhanden sind
    if (typeof  myTree != "undefined")
    {
		// ermittle die Parents des aktuellen Standortes
		// iteriere dazu über die Anzahl der enthaltenen Adressen
		// 2 Punkte == 2 Parents ... == 3 Adressen
		// "_2.1.0" ==> "_2.1.0", "_2.1","_2"

		var Knoten;
		var Adresse 	= Level;
		var Anzahl 		= Adresse.match(/\./g);

		if(Anzahl == null)
		{
			if(Adresse.length > 0)
			{
				//Es wurde eine Toplevel Seite aufgerufen, z.B. "_0"
				Knoten = getNode(Adresse);

				document.write('<a href="'+ Node_getURL(Knoten) +'">');
				document.write(Node_getLabel(Knoten));
				document.write('</a>')
			}

      		return;

		}


		if (Anzahl.length > 0)
		{
			// Es wurde eine Seite auf einer unteren Ebene aufgerufen, z.B. "_0.1"

			var Adressen 	= new Array(Anzahl.length);

			for (i=0; i<= Anzahl.length; i++)
			{
				Adressen[i] = Adresse;
				Adresse = Adresse.substring(0, Adresse.lastIndexOf(".") );
			}


			// Reihenfolge umdrehen
			Adressen.reverse();

			// Ausgabe der Einträge
			for(i=0; i<= Anzahl.length; i++)
			{
				Knoten = getNode(Adressen[i]);

				 
				{
					
				document.write('<td>&nbsp;</td><td><a href="'+ Node_getURL(Knoten) +'" class="titel">');
				document.write(Node_getLabel(Knoten));
				document.write('</a></td>')
				}
				 
			}
		}
	}
}


function Node_getBrothers(aNodeAdress)
{
	var orgAdress = aNodeAdress;

	var pos  = -1;
	pos = aNodeAdress.lastIndexOf( "." );
	if ( pos != -1 )
	{
		aNodeAdress = aNodeAdress.substring(0, pos );
	}

    var i       = -1;
    var result  = new Array();
    for (i = 0; i < myTree.length; i++)
    {
       if (myTree[i].nodeAdress.indexOf(aNodeAdress) == 0 && myTree[i].nodeAdress.length == orgAdress.length )
       {
           result[result.length] = myTree[i];
       }
    }
    return result;
}

function getLevelDeepness(currentAddress )
{
	// punkte "." in der aktuellen Adresse zählen
	var dotCounter = 0;
	var dotFound = false;
	var dotPos = -1;

	do
	{
		dotPos = currentAddress.indexOf("." );
		if ( dotPos != -1 )
		{
			dotCounter = dotCounter + 1;
			dotFound = true;
			currentAddress = currentAddress.substring(dotPos+2, currentAddress.length );
		}
		else
		{
			dotFound = false;
		}

	} while (dotFound == true);
	return (dotCounter);
}


function Node_getChilds(aNodeAdress)
{
    var i       = -1;
    var result  = new Array();
    for (i = 0; i < myTree.length; i++)
    {
        if (myTree[i].nodeAdress.length > aNodeAdress.length)
        {
            if (myTree[i].nodeAdress.indexOf(aNodeAdress) == 0 &&
                myTree[i].nodeAdress.substring(aNodeAdress.length+1).indexOf('.') == -1 &&
                (myTree[i].nodeAdress.charAt(aNodeAdress.length) == '.'  ||
                 aNodeAdress.length == 0))
            {
                result[result.length] = myTree[i];
            }
        }
    }
    return result;
}

function Node_getBrothers(aNodeAdress)
{
	var orgAdress = aNodeAdress;

	var pos  = -1;
	pos = aNodeAdress.lastIndexOf( "." );
	if ( pos != -1 )
	{
		aNodeAdress = aNodeAdress.substring(0, pos );
	}

    var i       = -1;
    var result  = new Array();
    for (i = 0; i < myTree.length; i++)
    {
       if (myTree[i].nodeAdress.indexOf(aNodeAdress) == 0 && myTree[i].nodeAdress.length == orgAdress.length )
       {
           result[result.length] = myTree[i];
       }
    }
    return result;
}


var levelDeepness = getLevelDeepness(Level);
var brotherNodes = Node_getBrothers( Level );
var childNodes = Node_getChilds( Level );
var parentNodes = new Array();
var grandPaNodes = new Array();
var parentBrothersNode = new Array();
var grandpaBrothersNode = new Array();
var currentParentNode = "";
var currentGrandpaNode = "";
var topNodes = Node_getTopNodes( );

// Wenn Level 2 dann besondere behandlung
if ( levelDeepness == 2)
{
	pos = Level.lastIndexOf(".");
	if (pos != -1 )
		currentParentNode = Level.substring(0, pos);
	brotherNodes = Node_getBrothers( Level );
	parentBrothersNode = Node_getBrothers( currentParentNode );
	
}
// Wenn Level 3 dann besondere behandlung
if ( levelDeepness == 3)
{
	pos = Level.lastIndexOf(".");
	if (pos != -1 )
		currentParentNode = Level.substring(0, pos);
	
	pos = currentParentNode.lastIndexOf(".");
	if (pos != -1 )
		currentGrandpaNode = currentParentNode.substring(0, pos);
		
	brotherNodes = Node_getBrothers( Level );
	parentBrothersNode = Node_getBrothers( currentParentNode );
	grandpaBrothersNode = Node_getBrothers( currentGrandpaNode );	
}

function getSitemap( adress )
{
    if (typeof  myTree != "undefined")
    {
		var sitemap = Node_getChilds(adress);

		var w = "";			// String mit der Adresse, der durchsucht wird fuer feststellen der Ebene

		var x = 0;			 // Allgemeiner Schleifenzaehler fuer Abarbeitung des Baumes

		var y = new Array(); // Array mit den Positionen des Punktes in der Adresse
							 // Die Laenge des Arrays wird als Kriterium fuer das Einrueckender Zellen genommen

		var z = 0;			 // Allgemeiner Schleifenzähler, innere Schleife



		for (x = 0; x < sitemap.length; x++)
	    {

			w = sitemap[x].nodeAdress;
			y = w.match(/\./g);



			// Wenn Ebene 1: Leerzeile vorschalten
			if( !y )
			{
					document.writeln("<tr><td colspan=10>&nbsp;</td></tr>");
			}

			// Nur ausgeben, wenn Link nicht leer und Label nicht "new node"
			var emptyNode = false;
			if( dummy == 'new page' || sitemap[x].target == ''){
				emptyNode = true;
			}

			// Nur ausgeben, wenn keine Dummy-Ebene
			var dummy = sitemap[x].label;

			if(dummy.substring(0,5) != 'dummy' && ! emptyNode )
			{



				// Neue Zeile
				document.writeln("<tr>");

				if(y)
				{
					// einruecken, pro Ebene um 1 Zelle
					for(z=0; z< y.length; z++)
					{

							document.write("<td>&nbsp;</td>");

					}
				}



				// Wenn Ebene 1: Colspan setzen
				if(y)
				{
					if( y.length == 1)
					{
						document.write( '<td colspan=8 class=navleft-height><img src="images/arrow.gif" hspace=3> <a href=\"' + sitemap[x].target + '\">'  + sitemap[x].label +  '</a></td> ');
					}
					else
					{
						// colspan = 10-y.length
						document.write( '<td colspan=');
						document.write( 10-y.length-1);
						document.write('> <a href=\"' + sitemap[x].target + '\">'  + sitemap[x].label +  '</a></td> ');
					}
				}
				else
				{
					document.write( '<td colspan=10> <a href=\"' + sitemap[x].target + '\">'  + sitemap[x].label +  '</a></td> ');
				}

				// Neue Zeile abschliessen
				document.writeln(" </tr> ");

			} // Ende Pruefung auf Dummy-Ebene

			// rekursiver Aufruf für SubTrees
			if( ! emptyNode ){
				getSitemap(sitemap[x].nodeAdress );
			}
		}
	}
}