ftexampl6.js

非常好的JAVASCRIPT树型

function addToTree(addFolder)
{
addImage("modem","modem.gif")
addImage("globe","globe.gif")
aux2 = insDoc(addFolder, gLnk("previous 10","previoustree("+addFolder.id+")"))
aux2.setIcon("globe","globe","modem","modem")
aux2.setStatusBar("previoustree("+addFolder.id+")")
idcounter = 0;
for (i=0; i < 10; i++)
	{
	aux1 = assN[i]
	insDoc(addFolder, gLnk(aux1.desc,aux1.href))
	}
aux2 = insDoc(addFolder, gLnk("next 10","nexttree("+addFolder.id+")"))
aux2.setIcon("globe","globe","modem","modem")
aux2.setStatusBar("nexttree("+addFolder.id+")")
}

function nexttree(folderId) 
{ 
var cF = 0 
cF = indexOfEntries[folderId] 
if (!cF.navObj && bV == 1) cF.navObj = doc.all["node" + cF.id]
for (i=cF.nC - 2; i > 0; i--)
	{
      if (cF.c[i].hidden == false)
		{
		nSoFar = i
		break;
		}
	}

nStart = nSoFar -9
nEnd = nSoFar + 1

if (nEnd + 10 <= cF.nC)
{
      for (i= nStart; i < nEnd; i++)
		{
           cF.c[i].hide()
		cF.c[i].hidden = true
		}
	for (i = nEnd; i < nEnd + 10; i++)
		{
		cF.c[i].display()
		cF.c[i].hidden = false
		}
}
else
{
for (i=nSoFar; i < 10 + nSoFar; i++)
	{
	aux1 = assN[i]
	if (aux1)
		{
		aux2 = cF.c[cF.nC - 1]
		insDoc(cF, gLnk(aux1.desc,aux1.href))
		cF.c[cF.nC-2] = cF.c[cF.nC -1]
		cF.c[cF.nC - 1] = aux2
		}
	}
if (bV > 0) prior = cF.navObj
if (bV == 2) doc.yPos = cF.c[0].navObj.top + cF.c[0].navObj.clip.height
      for (i= nStart; i < nEnd; i++)
		{
      	cF.c[i].hide()
		cF.c[i].hidden = true
		}
	if (bV == 1) 
		{
		strbufarray = new Array
		strbufIndex = 0
		}
	for (i=nEnd ; i < cF.nC-1; i++)
		{
		cF.c[i].nodeParent = cF
		cF.c[i].initialize(cF.nodeLevel + 1, 0, cF.nodeLeftSide, doc, prior) 

		}
	if (bV == 1)
		{ 
      	htmlStr = strbufarray.join("")
		prior.insertAdjacentHTML("AfterEnd",htmlStr)
		}
}
if (bV == 0)
	setTimeout("rewritepage()",50)
else
	doc.close()
needRewrite = true
}

function previoustree(folderId) 
{ 
var cF = 0 
cF = indexOfEntries[folderId] 
for (i=cF.nC - 2; i > 0; i--)
	{
      if (cF.c[i].hidden == false)
		{
		nSoFar = i
		break;
		}
	}

if (nSoFar == 10) {alert("No previous nodes"); return;}
if (bV > 0)
	{
if (nSoFar < 20) nSoFar = 20
nStart = nSoFar -9
nEnd = nSoFar + 1
      for (i= nStart; i < nEnd; i++)
		{
            cF.c[i].hide()
		cF.c[i].hidden = true
		}

      for (i= nStart-10; i < nStart; i++)
		{
           cF.c[i].display()
		cF.c[i].hidden = false
		}
	}
needRewrite = true
}

function node(desc, href, suid){
this.desc = desc
this.href = href
this.suid = suid
this.children = new Array
this.nChildren = 0
this.addCN = addCN
return
}
function addCN(childNode) 
{ 
  this.children[this.nChildren] = childNode 
  this.nChildren++ 
  return childNode 
} 


assN = new Object()
iconFolder = "../../images/" 
ftFolder = "../../"

commonLink = "javascript:parent."
useTextLinks = 1
fT = gFld("<B>Equipment classes</B>", "")
aux1 = insFld(fT, gFld("O",""))


idcounter = 0
assN[idcounter] = new node("O RING","outputequip(5354)")
idcounter++; assN[idcounter] = new node("OBLIQUE PATTERN","outputequip(7445)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-100","outputequip(5014)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-100","outputequip(1455)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-101","outputequip(1456)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-101","outputequip(5015)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-102","outputequip(5016)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-102","outputequip(1457)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-103","outputequip(1458)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-103","outputequip(5017)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-104","outputequip(5018)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-104","outputequip(1459)")
idcounter++; assN[idcounter] = new node("OCTAGONAL RING GASKET NO R-105","outputequip(1460)")