03=repition01=20130419

Upload: gene-kao

Post on 04-Jun-2018

212 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/13/2019 03=Repition01=20130419

    1/39

    Processing

    03

    Repetition I

    I

  • 8/13/2019 03=Repition01=20130419

    2/39

    Control 2: Repetition

  • 8/13/2019 03=Repition01=20130419

    3/39

    size(1000,200);

    background(0);

    for (int i = 0; i

  • 8/13/2019 03=Repition01=20130419

    4/39

    size(1275,200);

    background(0);

    smooth();

    for (int i = 0; i

  • 8/13/2019 03=Repition01=20130419

    5/39

    for (int i = 0; i < 5; i += 1) {fill(51*(i+1));

    ellipse(100,100,200-i*40,200-i*40);

    }

    fill(51);ellipse(100,100,200,200);

    fill(102);

    ellipse(100,100,160,160);

    fill(153);ellipse(100,100,120,120);

    fill(204);

    ellipse(100,100,80,80);

    fill(255);

    ellipse(100,100,40,40);

  • 8/13/2019 03=Repition01=20130419

    6/39

    size(200, 200);

    line( 20, 20, 20, 180);

    line( 40, 20, 40, 180);

    line( 60, 20, 60, 180);line( 80, 20, 80, 180);

    line(100, 20, 100, 180);

    line(120, 20, 120, 180);

    line(140, 20, 140, 180);

    line(160, 20, 160, 180);line(180, 20, 180, 180);

  • 8/13/2019 03=Repition01=20130419

    7/39

    size(200, 200);

    for(int i = 20; i < 200; i += 20) {

    line(i, 20, i, 180);}

    for (init; test; update) {statements

    }

    for (;;) {

    }

  • 8/13/2019 03=Repition01=20130419

    8/39

    for int i = 20; i < 200; i += 20) {line i, 20, i, 180);

    }1.ii= 20

    2. i < 200

    line(i, 20, i, 180);3. i += 20 (i = i + 20)

    line( 20, 20, 20, 180);

    line( 40, 20, 40, 180);

    line(180, 20, 180, 180);

    ?

  • 8/13/2019 03=Repition01=20130419

    9/39

    9

  • 8/13/2019 03=Repition01=20130419

    10/39

    size(200, 200);

    for(int i = 10; i < 200; i += 10) {line(i, 10, i, 190);

    }

  • 8/13/2019 03=Repition01=20130419

    11/39

  • 8/13/2019 03=Repition01=20130419

    12/39

    size(200, 200);

    for(int i = 10; i < 200; i += 10) {line(10, i, 190, i);

    }

  • 8/13/2019 03=Repition01=20130419

    13/39

  • 8/13/2019 03=Repition01=20130419

    14/39

    size(200, 200);

    for(int i = 10; i < 200; i += 10) {

    line(10, i, 190, i);

    }

    for(int i = 10; i < 200; i += 10) {

    line(i, 10, i, 190);

    }

  • 8/13/2019 03=Repition01=20130419

    15/39

    size(200, 200);

    for(int i = 10; i < 200; i += 10) {

    line(10, i, 190, i);

    line(i, 10, i, 190);

    }

  • 8/13/2019 03=Repition01=20130419

    16/39

  • 8/13/2019 03=Repition01=20130419

    17/39

    size(200, 200);

    smooth();

    strokeWeight(5);

    for(int i = 20; i < 200; i += 20) {

    line(i, 20, i + 20, 180);

    }

  • 8/13/2019 03=Repition01=20130419

    18/39

    0.05 0.95

    19

  • 8/13/2019 03=Repition01=20130419

    19/39

    size(200, 200);

    smooth();

    for(int i = 10; i < 200; i += 10) {

    strokeWeight(i /20);

    line(i, 10, i, 190);

    }

  • 8/13/2019 03=Repition01=20130419

    20/39

  • 8/13/2019 03=Repition01=20130419

    21/39

    size(200, 200);

    background(255);

    smooth();for (int i = 0; i

  • 8/13/2019 03=Repition01=20130419

    22/39

  • 8/13/2019 03=Repition01=20130419

    23/39

    size(200, 200);

    background(255);

    smooth();for (int i = 0; i

  • 8/13/2019 03=Repition01=20130419

    24/39

  • 8/13/2019 03=Repition01=20130419

    25/39

    size(200, 200);background(255);

    smooth();

    for (int i = 0; i

  • 8/13/2019 03=Repition01=20130419

    26/39

    size(201, 201);

    background(255);smooth();

    for (int i = 0; i

  • 8/13/2019 03=Repition01=20130419

    27/39

  • 8/13/2019 03=Repition01=20130419

    28/39

    size(200, 200);

    noFill();

    for (int i = 0; i < 100; i += 10) {

    rect(i, i, 200-2*i, 200-2*i);

    }

  • 8/13/2019 03=Repition01=20130419

    29/39

  • 8/13/2019 03=Repition01=20130419

    30/39

    size(200, 200);

    for (int i = 0; i < 100; i += 10) {fill(i / 100.0 * 255);

    rect(i, i, 200-2*i, 200-2*i);

    }

  • 8/13/2019 03=Repition01=20130419

    31/39

  • 8/13/2019 03=Repition01=20130419

    32/39

    size(200, 200);

    for (int i = 0; i < 100; i += 10) {fill(i / 100.0 * 255, i / 100.0 * 255, 0);

    rect(i, i, 200-2*i, 200-2*i);

    }

  • 8/13/2019 03=Repition01=20130419

    33/39

  • 8/13/2019 03=Repition01=20130419

    34/39

    size(200, 200);smooth();

    noFill();

    for (int i = 10; i < 100; i += 10) {

    strokeWeight(i / 10);

    rect(i, i, 200 - 2 * i, 200 - 2 * i );

    }

  • 8/13/2019 03=Repition01=20130419

    35/39

  • 8/13/2019 03=Repition01=20130419

    36/39

    size(200, 200);background(255);

    smooth();

    ellipseMode(CORNER);for (int i = 0; i < 100; i += 10) {

    fill(i / 100.0 * 255,i / 100.0 * 255,0);

    ellipse(i, i, 200-2*i, 200-2*i);}

  • 8/13/2019 03=Repition01=20130419

    37/39

  • 8/13/2019 03=Repition01=20130419

    38/39

    size(200, 200);

    background(0);smooth();

    noStroke();

    ellipseMode(CORNER);for (int i = 0; i < 100; i += 10) {

    fill(i / 100.0 * 255,i / 100.0 * 255,0);

    ellipse(i, i, 200-2*i, 200-2*i);

    }

  • 8/13/2019 03=Repition01=20130419

    39/39

    Ch. 5 - 604/19/2013