Adding some delay in an recursive loop and breaking out of it on mouseover

Posted by Moak on Stack Overflow See other posts from Stack Overflow or by Moak
Published on 2010-06-09T02:58:12Z Indexed on 2010/06/09 3:02 UTC
Read the original article Hit count: 213

Filed under:

prototype

|

recursion

|

each

I have created a loop

function loopThem(){
    $$('#main-nav a').each(function(i, n) {
        i.up("#main-nav").down("li.active").removeClassName("active");
        i.up("li").addClassName("active");
        var target = i.readAttribute("href");
        i.up(".home-top").down("li.visible").removeClassName("visible");
        i.up(".home-top").down(target).addClassName("visible");
    });
    loopThem();
}

This function is called when the dom is loaded

document.observe("dom:loaded", function() {
     loopThem();
});

It does what I want as far as rotating through a set of banners, however it does so at light speed

How Can I
A add a delay between the changing? B stop the loop from continuing once I mouse over?

© Stack Overflow or respective owner

Related posts about prototype

Relation between [[Prototype]] and prototype in JavaScript

as seen on Stack Overflow - Search for 'Stack Overflow'
From http://www.jibbering.com/faq/faq_notes/closures.html : Note: ECMAScript defines an internal [[prototype]] property of the internal Object type. This property is not directly accessible with scripts, but it is the chain of objects referred to with the internal [[prototype]] property that is… >>> More
'click' observer in Prototype

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a page which contains several divs (each with a unique ID and the same class, 'parent'). Underneath each "parent" div, is a div with class "child" and unique ID name -child. This DIV is upon page load empty. Whenever you click on a parent DIV, the following code is executed. $$('div.parent')… >>> More
Javascript: prototype of Number

as seen on Stack Overflow - Search for 'Stack Overflow'
var x= 1; Number.prototype.test = function () { return this }; x.test() === x.test() // false Why does the === test return false? >>> More
equivalent of jQuery's "load" in prototype

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I am trying to find an equivalent for the following jQuery javascript: var x1 = setInterval(function() { $('#status').load("processor.php", {value:'name'} );}, 5000 ); I need to use Prototype for other applications on the page, and when I throw both jQuery and Prototype libraries in there… >>> More
Misunderstanding I have about javascript prototype inheritance

as seen on Stack Overflow - Search for 'Stack Overflow'
Simple questions. function p() { function A() { this.random = "random"; } A.prototype.newfunc = function(){ alert("5");} function B() { } B.prototype = new A(); var bObj = new B(); } Q1: When I… >>> More

Related posts about recursion

tail recursion vs. forward recursion

as seen on Stack Overflow - Search for 'Stack Overflow'
Can someone give me the difference between these two kinds recursions and example? specifically in ocaml. Thanks >>> More
Are there advantages for using recursion over iteration - other than sometimes readability and elegance?

as seen on Programmers - Search for 'Programmers'
I am about to make two assumptions. Please correct me if they're wrong: There isn't a recursive algorithm without an iterative equivalent. Iteration is always cheaper performance-wise than recursion (at least in general purpose languages such as Java, C++, Python etc.). If it's true that recursion… >>> More
Python recursive function error: "maximum recursion depth exceeded"

as seen on Stack Overflow - Search for 'Stack Overflow'
I solved Problem 10 of Project Euler with the following code, which works through brute force: def isPrime(n): for x in range(2, int(n**0.5)+1): if n % x == 0: return False return True def primeList(n): primes = [] for i in range(2,n): if isPrime(i): … >>> More
Dynamic Programming Recursion and a sprinkle of Memoization

as seen on Stack Overflow - Search for 'Stack Overflow'
I have this massive array of ints from 0-4 in this triangle. I am trying to learn dynamic programming with Ruby and would like some assistance in calculating the number of paths in the triangle that meet three criterion: You must start at one of the zero points in the row with 70 elements. Your… >>> More
How does the recursion here work?

as seen on Stack Overflow - Search for 'Stack Overflow'
code 1: public static int fibonacci (int n){ if (n == 0 || n == 1) { return 1; } else { return fibonacci (n-1) + fibonacci (n-2); } } how can you use fibonacci if you haven't gotten done explaining what it is yet? I've been able to understand… >>> More