snipplrCallback({"id":67993,"title":"some-data-visualization-in-processing","source":"
  1. String<\/span><\/a>[<\/span>]<\/span> data;<\/span><\/div><\/li>
  2. String<\/span><\/a>[<\/span>]<\/span> dataLine;<\/span> \/\/for breaking it down<\/span><\/div><\/li>
  3. String<\/span><\/a>[<\/span>]<\/span>[<\/span>]<\/span> fullData;<\/span><\/div><\/li>
  4. int<\/span>[<\/span>]<\/span>[<\/span>]<\/span>[<\/span>]<\/span> buildings =<\/span> new<\/span> int<\/span>[<\/span>155<\/span>]<\/span>[<\/span>9<\/span>]<\/span>[<\/span>2<\/span>]<\/span>;<\/span> \/\/<\/span><\/div><\/li>
  5.  <\/div><\/li>
  6. \/\/\/\/\/\/\/\/\/\/\/\/<\/span><\/div><\/li>
  7. \/\/Get the data and format it, so we can use it for drawing<\/span><\/div><\/li>
  8. \/\/\/\/\/\/\/\/\/\/\/\/<\/span><\/div><\/li>
  9.  <\/div><\/li>
  10. data =<\/span> loadStrings(<\/span>"data.txt"<\/span>)<\/span>;<\/span> \/\/gets the raw data in CVS format<\/span><\/div><\/li>
  11.   dataLine =<\/span> splitTokens(<\/span>data[<\/span>1<\/span>]<\/span>, ","<\/span>)<\/span>;<\/span> <\/div><\/li>
  12.   fullData =<\/span> new<\/span> String<\/span><\/a>[<\/span>data.length<\/span>]<\/span>[<\/span>dataLine.length<\/span>]<\/span>;<\/span><\/div><\/li>
  13.  <\/div><\/li>
  14.   \/\/split the individual lines where the comma is<\/span><\/div><\/li>
  15.   for<\/span> (<\/span>int<\/span> i =<\/span>0<\/span> ;<\/span> i <<\/span> data.length<\/span>;<\/span> i++<\/span>)<\/span> {<\/span><\/div><\/li>
  16.     dataLine =<\/span> splitTokens(<\/span>data[<\/span>i]<\/span>, ","<\/span>)<\/span>;<\/span><\/div><\/li>
  17.     for<\/span> (<\/span>int<\/span> j =<\/span>0<\/span> ;<\/span> j <<\/span> dataLine.length<\/span>;<\/span> j++<\/span>)<\/span> {<\/span><\/div><\/li>
  18.       fullData[<\/span>i]<\/span>[<\/span>j]<\/span> =<\/span> dataLine[<\/span>j]<\/span>;<\/span><\/div><\/li>
  19.     }<\/span><\/div><\/li>
  20.   }<\/span><\/div><\/li>
  21.  <\/div><\/li>
  22.   \/\/create the erray which we will use for drawing (this array stores year numbers and corresponding instances)<\/span><\/div><\/li>
  23.   for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <<\/span> 9<\/span>;<\/span> j++<\/span>)<\/span> {<\/span><\/div><\/li>
  24.     for<\/span> (<\/span>int<\/span> i =<\/span>0<\/span> ;<\/span> i <<\/span> buildings.length<\/span>;<\/span> i++<\/span>)<\/span> {<\/span><\/div><\/li>
  25.       buildings[<\/span>i]<\/span>[<\/span>j]<\/span>[<\/span>0<\/span>]<\/span> =<\/span> i +<\/span> 1854<\/span>;<\/span><\/div><\/li>
  26.       buildings[<\/span>i]<\/span>[<\/span>j]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 0<\/span>;<\/span><\/div><\/li>
  27.     }<\/span><\/div><\/li>
  28.   }<\/span><\/div><\/li>
  29.   \/\/count frequencies (this should actually be done with two for-loops instead of one, but I am lazy<\/span><\/div><\/li>
  30.   for<\/span> (<\/span>int<\/span> i =<\/span>0<\/span> ;<\/span> i <<\/span> data.length<\/span>;<\/span> i++<\/span>)<\/span> {<\/span><\/div><\/li>
  31.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 1<\/span>)<\/span> {<\/span><\/div><\/li>
  32.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>0<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>0<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  33.     }<\/span><\/div><\/li>
  34.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 2<\/span>)<\/span> {<\/span><\/div><\/li>
  35.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>1<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>1<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  36.     }<\/span><\/div><\/li>
  37.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 3<\/span>)<\/span> {<\/span><\/div><\/li>
  38.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>2<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>2<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  39.     }<\/span><\/div><\/li>
  40.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 4<\/span>)<\/span> {<\/span><\/div><\/li>
  41.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>3<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>3<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  42.     }<\/span><\/div><\/li>
  43.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 5<\/span>)<\/span> {<\/span><\/div><\/li>
  44.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>4<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>4<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  45.     }<\/span><\/div><\/li>
  46.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 6<\/span>)<\/span> {<\/span><\/div><\/li>
  47.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>5<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>5<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  48.     }<\/span><\/div><\/li>
  49.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 7<\/span>)<\/span> {<\/span><\/div><\/li>
  50.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>6<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>6<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  51.     }<\/span><\/div><\/li>
  52.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 8<\/span>)<\/span> {<\/span><\/div><\/li>
  53.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>7<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>7<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  54.     }<\/span><\/div><\/li>
  55.     if<\/span> (<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>1<\/span>]<\/span>)<\/span> ==<\/span> 9<\/span>)<\/span> {<\/span><\/div><\/li>
  56.       buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>8<\/span>]<\/span>[<\/span>1<\/span>]<\/span> =<\/span> 1<\/span>+<\/span> buildings[<\/span>(<\/span>int<\/span>(<\/span>fullData[<\/span>i]<\/span>[<\/span>2<\/span>]<\/span>)<\/span> -<\/span> 1854<\/span>)<\/span>]<\/span>[<\/span>8<\/span>]<\/span>[<\/span>1<\/span>]<\/span> ;<\/span><\/div><\/li>
  57.     }<\/span><\/div><\/li>
  58.   }<\/span><\/div><\/li>
  59.  <\/div><\/li>
  60. \/\/\/\/\/\/\/\/\/\/\/\/<\/span><\/div><\/li>
  61. \/\/draw the graph<\/span><\/div><\/li>
  62. \/\/\/\/\/\/\/\/\/\/\/\/<\/span><\/div><\/li>
  63.   background(<\/span>0<\/span>)<\/span>;<\/span><\/div><\/li>
  64.   strokeWeight(<\/span>1<\/span>)<\/span>;<\/span><\/div><\/li>
  65.   size (<\/span>1200<\/span>, 700<\/span>)<\/span>;<\/span><\/div><\/li>
  66.   float<\/span> spacing =<\/span> width\/<\/span>float<\/span>(<\/span>buildings.length<\/span>+<\/span>1<\/span>)<\/span>;<\/span><\/div><\/li>
  67.   translate(<\/span>50<\/span>, 50<\/span>)<\/span>;<\/span><\/div><\/li>
  68.   scale(<\/span>0.9<\/span>, 0.9<\/span>)<\/span>;<\/span><\/div><\/li>
  69.  <\/div><\/li>
  70.  <\/div><\/li>
  71.  <\/div><\/li>
  72.   \/\/vertical lines<\/span><\/div><\/li>
  73.   for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span> ;<\/span> i <<\/span> buildings.length<\/span>+<\/span>1<\/span>;<\/span> i++<\/span>)<\/span> {<\/span> <\/div><\/li>
  74.     stroke(<\/span>25<\/span>)<\/span>;<\/span><\/div><\/li>
  75.     line(<\/span> i *<\/span> spacing, height, i *<\/span> spacing, 0<\/span>)<\/span>;<\/span><\/div><\/li>
  76.   }<\/span><\/div><\/li>
  77.   \/\/thicker lines and years<\/span><\/div><\/li>
  78.   for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span> ;<\/span> i <<\/span> buildings.length<\/span>+<\/span>1<\/span>;<\/span> i++<\/span>)<\/span> {<\/span> <\/div><\/li>
  79.     if<\/span> (<\/span>(<\/span>i-<\/span>1<\/span>)<\/span>%<\/span>5 ==<\/span> 0<\/span>)<\/span> {<\/span><\/div><\/li>
  80.       stroke(<\/span>55<\/span>)<\/span>;<\/span><\/div><\/li>
  81.       line(<\/span> (<\/span>i+<\/span>1<\/span>)<\/span> *<\/span> spacing, height, (<\/span>i+<\/span>1<\/span>)<\/span> *<\/span> spacing, 0<\/span>)<\/span>;<\/span><\/div><\/li>
  82.       pushMatrix(<\/span>)<\/span>;<\/span><\/div><\/li>
  83.       translate(<\/span>i *<\/span> spacing, height-<\/span>20<\/span>)<\/span>;<\/span><\/div><\/li>
  84.       rotate(<\/span>PI\/<\/span>4<\/span>)<\/span>;<\/span><\/div><\/li>
  85.       text(<\/span>i+<\/span>1854<\/span>, 0<\/span>, 0<\/span>)<\/span>;<\/span><\/div><\/li>
  86.       popMatrix(<\/span>)<\/span>;<\/span><\/div><\/li>
  87.     }<\/span><\/div><\/li>
  88.   }<\/span><\/div><\/li>
  89.  <\/div><\/li>
  90.   \/\/horizontal Lines <\/span><\/div><\/li>
  91.   for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span> ;<\/span> i <<\/span> 9<\/span>;<\/span> i++<\/span>)<\/span> {<\/span> <\/div><\/li>
  92.     stroke(<\/span>35<\/span>)<\/span>;<\/span><\/div><\/li>
  93.     line(<\/span> width, (<\/span>i+<\/span>1<\/span>)<\/span>*<\/span> height\/<\/span>10<\/span>, 0<\/span>, (<\/span>i+<\/span>1<\/span>)<\/span>*<\/span> height\/<\/span>10<\/span>)<\/span>;<\/span><\/div><\/li>
  94.  <\/div><\/li>
  95.  <\/div><\/li>
  96.   }<\/span><\/div><\/li>
  97.  <\/div><\/li>
  98. \/\/ displaying the actual data<\/span><\/div><\/li>
  99.   for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <<\/span> 9<\/span>;<\/span> j++<\/span>)<\/span> {<\/span><\/div><\/li>
  100.     translate (<\/span>0<\/span>, height\/<\/span>10<\/span>)<\/span>;<\/span><\/div><\/li>
  101.     stroke(<\/span>30<\/span>*<\/span>j, 10<\/span>*<\/span>j+<\/span>1000<\/span>, 255<\/span>-<\/span> 30<\/span>*<\/span>j)<\/span>;<\/span><\/div><\/li>
  102.     strokeWeight(<\/span>1<\/span>)<\/span>;<\/span><\/div><\/li>
  103.     for<\/span> (<\/span>int<\/span> i =<\/span> 1<\/span> ;<\/span> i <<\/span> buildings.length<\/span>;<\/span> i++<\/span>)<\/span> {<\/span> <\/div><\/li>
  104.       float<\/span> previousOffset =<\/span> buildings[<\/span>i-<\/span>1<\/span>]<\/span>[<\/span>j]<\/span>[<\/span>1<\/span>]<\/span>;<\/span><\/div><\/li>
  105.       float<\/span> offset =<\/span> buildings[<\/span>i]<\/span>[<\/span>j]<\/span>[<\/span>1<\/span>]<\/span>;<\/span><\/div><\/li>
  106.       if<\/span> (<\/span>previousOffset +<\/span> offset ><\/span> 0<\/span>)<\/span> {<\/span><\/div><\/li>
  107.         line(<\/span>i *<\/span> spacing, previousOffset\/<\/span>2<\/span>, (<\/span>i+<\/span>1<\/span>)<\/span> *<\/span> spacing, offset\/<\/span>2<\/span>)<\/span>;<\/span><\/div><\/li>
  108.         line(<\/span>i *<\/span> spacing, -<\/span> previousOffset\/<\/span>2<\/span>, (<\/span>i+<\/span>1<\/span>)<\/span> *<\/span> spacing, -<\/span> offset\/<\/span>2<\/span>)<\/span>;<\/span><\/div><\/li>
  109.       }<\/span><\/div><\/li>
  110.     }<\/span><\/div><\/li>
  111.   }<\/span><\/div><\/li><\/ol><\/pre>","link":"https:\/\/snipplr.com\/view\/67993\/some-data-visualization-in-processing"});