// Dartmouth CS 2, Winter 2009, Chris Bailey-Kellogg
// Notes 6 | Sketch 2

// Vertices of a shape
int maxVertices = 100;
float[] x = new float[maxVertices], y = new float[maxVertices];
// Which vertex is next to add
int v = 0;
// Which vertex is being dragged (-1 if none)
int dragging = -1;
// Curve tightness
int tight=0;

void setup()
{
  size(400,400);
  background(0);
  smooth();
  textFont(loadFont("LucidaSans-24.vlw"));
  curveTightness(tight);
  println("T/t: increase/decrease tightness");
  println("p: print Processing commands");
}

void draw()
{
  background(0);
  noFill(); stroke(255);
  // Create a shape from the current vertices
  beginShape();
  for (int i=0; i<v; i++) curveVertex(x[i],y[i]);
  endShape();
  // Label the vertices
  if (v>0) {
    // Interior points (on curve)
    fill(0,255,0); noStroke();
    for (int i=1; i<v-1; i++) {
      ellipse(x[i],y[i],10,10);
      text(i,x[i],y[i]);
    }
    // Start and end points (not on curve)
    fill(255,0,0);
    ellipse(x[0],y[0],10,10);
    text("S",x[0],y[0]);
    ellipse(x[v-1],y[v-1],10,10);
    text("E",x[v-1],y[v-1]);
  }
}

void mousePressed()
{
  // See if any vertex is close enough to be dragged
  dragging = -1;
  for (int i=0; i<v; i++) {
    if (dist(mouseX,mouseY,x[i],y[i]) < 10) dragging = i;
  }
  if (dragging < 0) {  // Nobody's close; add a new vertex
    x[v] = mouseX;
    y[v] = mouseY;
    if (v<maxVertices) v++;
  }
}

void mouseDragged()
{
  if (dragging >= 0) {
    x[dragging] = mouseX;
    y[dragging] = mouseY;
  }
}

void mouseReleased()
{
  dragging = -1;
}

void keyPressed()
{
  if (key=='p') {  // Print vertices
    for (int i=0; i<v; i++)
      println("curveVertex("+x[i]+","+y[i]+");");
  }
  else if (key=='T') { // Increase curve tightness
    tight++;
    curveTightness(tight);
    println("curveTightness("+tight+");");
  }
  else if (key=='t') {
    tight--;
    curveTightness(tight);
    println("curveTightness("+tight+");");
  }
}