gBarMax || gHeight < 1) {
gBarDir *= -1;
gBarCount = (Math.random() * 15)+3;
//dump("Changining directions: "+gBarDir+"\n");
if (gHeight > gBarMax) {
gHeight = gBarMax;
} else {
gHeight = 1;
}
} else {
if (gBarCount < 1) {
gBarDir *= -1;
gBarCount = (Math.random() * 15)+3;
//dump("----> "+gBarCount+"\n");
}
}
if (gGo) {
setTimeout("moveit()", 100);
}
}
function findNode(node, nodename)
{
var type = node.nodeType;
if (type == Node.ELEMENT_NODE) {
// open tag
//dump("\<" + node.tagName);
// dump the attributes if any
attributes = node.attributes;
if (null != attributes) {
var countAttrs = attributes.length;
var index = 0;
while(index < countAttrs) {
att = attributes[index];
if (null != att) {
//dump(" " + att.name + "=" + att.value+" ["+nodename+"]\n");
if (att.name == "id" && att.value == nodename) {
//dump("Found it!\n");
return node;
}
}
index++;
}
}
// recursively dump the children
if (node.hasChildNodes()) {
// close tag
//dump(">");
// get the children
var children = node.childNodes;
var length = children.length;
var count = 0;
while(count < length) {
child = children[count];
fndNode = findNode(child, nodename);
if (fndNode != null) {
return fndNode;
}
count++;
}
//dump("" + node.tagName + ">");
} else {
// close tag
//dump("/>");
}
}
// if it's a piece of text just dump the text
else if (type == Node.TEXT_NODE) {
//dump(node.data);
}
return null;
}
]]>
Simple Polygons
A Simple Graph