// Project 5      CST112 Michael Young


String title=  "The Family";
String author=  "Michael Young, CST112";
String help= "Press first letter of word for action ( or 'Q' to Quit)";
float broadway;


String[] names={  "Bam", "Jerry", "Danny", "Ryan",
  "Sam", "Marcus", "Fenix", "Ralph",
  "Ronald", "Cupcake", "Princess", "Connor" };

//  Person 
int Total=8;
Person[] peeps=  new Person[Total];

//// SETUP.
void setup() {
  size(800, 600);
  broadway=  height-100;

  reset();
}

void reset() {
 
  for (int j=0; j<Total; j++ ) {
    peeps[j]=  new Person( names[j] );
  }
}


// CLASS 
class Person {
  float w, h;
  float r, g, b;
  String name="?";
  // CONSTRUCTORS 
  Person( String who ) {
    w=  random( 30, 60 );
    h=  random( 50, 100 );
    // Random colors.
    r=  random(200);
    g=  random(200);
    b=  random(200);
    name=  who;
  }

  // METHODS

  void show( float x, float y ) {
    fill( r, g, b );
    rectMode( CENTER );
    rect( x, y-h/2, w, h );
      
    // Postion of Names/Height/Weight //
    text( name, x-20, y+20 );
    text( w, x-20, y+42 );
    text( h, x-20, y+54 );
  }
  
  }


// NEXT FRAME
void draw() {
  background(100, 23, 200);
  scene();
  showAll();    
  messages();
}

void scene() {
  noStroke();
  fill(214, 216, 216);
  
  rect(0, broadway, width, height);
}

// Display all objects in array.
void showAll() {
  float x=50, y=broadway;
  

  for (int j=0; j<Total; j++ ) {
    peeps[j].show( x, y );
    x=  x + 100;
  }
}  

void messages() {
  fill(0);
  textSize(24);
  text( title, width/6, 30 );
  textSize(12);
  text( author, 20, height-20 );
  text( help, width/6, 50 );
  text( "Keys: Q(Quit), O(Order), T(Tallest), S(Shortest), R(Random) ", width/6, 65 );
}

void shortest( Person[] p, int l ) {
  int k;
  k=  whereShort( p, l );
  swap( p, k,l-1 );
}

//// EVENTS: Keypress
void keyPressed() {
  if (key == 'q') exit();
  if (key == 'r') reset();
  if (key == 's') shortest( peeps,Total );
  if (key == 't') tall( peeps, Total );
  if (key == 'o') order( peeps, Total );
}
// Move tallest/shortest to end
void tall( Person[] p, int l ) {
    
  int k;
  k=  whereTall( p, l );
  swap( p, k, l-1 );
}
// Find the index of tallest (or shortest).
int whereTall( Person[] p, int l ) {
  int iTallest=0;
  for (int j=1; j<Total; j++ ) {
    if ( p[j].h > p[iTallest].h ) iTallest=j;
  }
  return iTallest;
}
int whereShort( Person[] p, int l ) {
  int iShortest=0;
  for (int j=1; j<Total; j++ ) {
    if ( p[j].h < p[iShortest].h ) iShortest=j;
  }
  return iShortest;
}
// Changes 2 of the items
void swap( Person[] p, int a, int b ) {
  Person tmp;
  tmp=  p[a];
  p[a]=  p[b];
  p[b]=  tmp;
}


// Sort entire array. //
void order( Person q[], int l ) {
  for (int k=l; k>1; k--) {
    tall( q, k );
  }
}