this.findPrevious = function(node, criteria, downOnly, maxRoot){    if (!node)        return null;        for (var sib = node.previousSibling; sib; sib = sib.previousSibling)    {        var prev = this.findPreviousUp(sib, criteria);        if (prev)            return prev;        if (criteria(sib))            return sib;    }        if (!downOnly)    {        var next = this.findPreviousUp(node, criteria);        if (next)            return next;    }    if (node.parentNode && node.parentNode != maxRoot)    {        if (criteria(node.parentNode))            return node.parentNode;                return this.findPrevious(node.parentNode, criteria, true);    }};
2454	/local1/tlutelli/issta_data/temp/all_js/javascript/2007_temp/2007/2454/8237a6359bebacf3e34f1134ef713c687c8e3edb/lib.js/clean/extension/content/firebug/lib.js