// Dartmouth CS 2, Winter 2009, Chris Bailey-Kellogg
// Notes 13 | Sketch 1
// Variation on Reas & Fry (43-12)

Ring[] rings = new Ring[50];  // at most 50 at a time
int current = 0;  // for next mouse press

void setup() 
{
  smooth();
  for (int i=0; i<rings.length; i++) {
    rings[i] = new Ring();
  }
}

void draw() 
{
  background(0);
  for (int i=0; i<rings.length; i++) rings[i].display();
  for (int i=0; i<rings.length; i++) rings[i].grow();
}

// Click to create a new Ring
void mousePressed() 
{
  rings[current].start(mouseX, mouseY);
  current++;
  if (current == rings.length) {
    // wrap around -- reuse rings that presumably are done by now
    current = 0;
  }
}