-
Notifications
You must be signed in to change notification settings - Fork 0
/
WallMatrix.pde
1117 lines (992 loc) · 39.9 KB
/
WallMatrix.pde
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/***********
Wall Matrix
***********/
/*
* stores current wall cell data...
* currentMatrix is a hashtable represeenting the current frame, each cell is given an id for ex.
* ex:
* -----
* [0,0] = top left
* [82,44] = bottom right
*
* Copyright Chris Malcolm, NBBJ digital 2018
* http://www.nbbj.com/about/digital-practice/
*
*/
import java.util.Hashtable;
import java.util.Set;
import java.util.Random;
import java.util.Arrays;
import java.util.UUID;
class WallMatrix {
//currentMatrix
Hashtable<String, MatrixCell> currentMatrix = new Hashtable();
//bounds
int totalRows, totalColumns;
//settings
int[] lengthRange;
int matrixId = 0; //deckId to pair with vertical bar id..incrementall grows
//float[] defaultSpeeds = new float[]{1,1.2,3}; //default speeds (randomly to chose from)
float[] randSpeeds; //random selection from default speeds depending on amount of columns
float popularityFactor = 0; //0.0-1.0 number representing popularity
float[] catBreakdown;
color[] cr, crHot;
float currentState = 0.0; //state of day (represents index for colorStates + speedStates)
//float[] speedStates = new float[]{.75, .85,.95,1.0,1.1};
float[][] speedStates = new float[][]{
new float[]{.5, 0.75, 1, 1.25},
new float[]{.5, 0.5, 0.75, 1.0},
new float[]{.5, 0.75, 1, 1.25},
new float[]{.5, 0.75, 1, 1.25},
new float[]{.75, 1.25, 1.5, 1.75}
};
int[][] barStates = new int[][]{
new int[]{12,15},
new int[]{9,12},
new int[]{5,8},
new int[]{4,7},
new int[]{3,5}
};
//color states are the possible states (ratio of cool tones)
float[] colorStates = new float[]{1, 0.9, 0.75, 0.1, 0.0};
//delta moves: the deltat relationship to moving of states
//percentage 0 = delta, 1 = change for +, 2 = change for -
float[][] deltaMoves = new float[][]{
new float[]{0, -1.0, -1.0}, //no major change always degrade
new float[]{4, 1.0, -1.0},
new float[]{6, 2.0, -2.0},
new float[]{10, 3.0, -3.0},
new float[]{15, 4.0, -4.0}
};
String ANIMATION_MODE = "down"; //up or down..animation mode
// generateColorRange(c1, c2, steps): generates color array based on 2 colors and steps
private color[] generateColorRange(color c1, color c2, int steps) {
color[] colorArr = new color[steps];
for (int i=0; i<steps; i++) {
//generate
int[] rgbVals = new int[]{
(int)(red(c1)+((red(c2)-red(c1))/steps)*i),
(int)(green(c1)+((green(c2)-green(c1))/steps)*i),
(int)(blue(c1)+((blue(c2)-blue(c1))/steps)*i)};
colorArr[i] = color(rgbVals[0], rgbVals[1], rgbVals[2]);
}
return colorArr;
}
//generateMatrix(lengthRange, catBreakdown, colorRange, colorRangeHot): generates a new matrix
//ex generateMatrix([1,2], [15%,10%,40%,..], [color(1,2,3), color(1,2,5)], [color(2,4,6), color(2,4,5)])
public Hashtable generateMatrix(Hashtable Matrix) {
Hashtable<String, MatrixCell> tmpMatrix = Matrix;
//log(new Object[]{"length range: ", lengthRange, "catBreakdown: ", catBreakdown});
// log(new Object[]{"cr: ", cr, "crHot: ", crHot});
int steps = catBreakdown.length;
color[] colorRangeCool = generateColorRange(cr[0], cr[1], steps);
int verticalBarId = 0;
int maxIters = 9000;
int count=0;
while (!matrixIsFull(tmpMatrix) && count<maxIters) {
//first fill with random amounts until full
for (int ci=0; ci<totalColumns; ci++) {
if (!columnIsFull(tmpMatrix, ci)) {
//get color and number
//FAKE country values!
lengthRange = barStates[(int)currentState];
//<--- end fake country values
tmpMatrix = insertVerticalBarAtColIndex(tmpMatrix, ci, createBarId(matrixId, verticalBarId),(int)random(colorRangeCool.length), (int)random(lengthRange[0], lengthRange[1]+1));
//log(new Object[]{"matrix:\n",tmpMatrix,"\n\n"});
verticalBarId++;
}
}
count++;
}
//log(new Object[]{"total bars:", getBarIdsByMatrixId(tmpMatrix, matrixId).length,"\n", getBarIdsByMatrixId(tmpMatrix, matrixId)});
//TODO: get count of bars for newly generated matrix id
//Object[] distroTest = getListByDistributionBreakdown(new Object[]{0,1}, 21, new float[]{.7,.3});
//log(new Object[]{"you got it dawggg...", distroTest});
//then .. run various distribution routines for cells, and apply coloration + tones, than return that damn matrix
tmpMatrix = reColorizeMatrix(tmpMatrix);
return tmpMatrix;
}
//this looks at any unseen bars + recolorizes them before they start to appear given the latest id..
public Hashtable reColorizeMatrix(Hashtable tmpMatrix){
//before we setwarmcool, lets reId the bars that are not visible currently to the current verticalBarId
tmpMatrix = reIdUnseenBars(tmpMatrix);
//apply warmcoolfactor to current new matrix ids.
tmpMatrix = setWarmCool(tmpMatrix, matrixId);
//apply category tones
tmpMatrix = setCatTones(tmpMatrix, matrixId);
matrixId++;
return tmpMatrix;
}
public boolean isStartOfBar(Hashtable matrix, int rowIndex, int colIndex){
String tmpId = getIdStr(rowIndex,colIndex);
if (matrix.containsKey(tmpId)){
MatrixCell cell = (MatrixCell)matrix.get(tmpId);
if (cell.pixelId==0){
return true;
}else{
return false;
}
}else{
return false;
}
}
public Hashtable updateMatrixId(Hashtable matrix, int rowIndex, int colIndex, int matrixId){
String tmpId;
MatrixCell tmpCell;
//then update this cell
tmpId = getIdStr(rowIndex, colIndex);
tmpCell = (MatrixCell)matrix.get(tmpId);
//log(new Object[]{"id change:", tmpCell.verticalBarId, "--> ", matrixId});
tmpCell.verticalBarId = updateBarId(tmpCell.verticalBarId, matrixId);
//log(new Object[]{"id change (new):", tmpCell.verticalBarId});
matrix.put(tmpId, tmpCell);
return matrix;
}
//get next vertical bar starting cell
public MatrixCell getNextVerticalBarStart(Hashtable matrix, int rowIndexStart, int colIndex){
MatrixCell result = (MatrixCell)matrix.get(getIdStr(rowIndexStart, colIndex));
int[] rowDomain = getRowDomain(matrix, colIndex);
if (ANIMATION_MODE.equals("up")){
for (int rowIndex = rowIndexStart+1; rowIndex<=rowDomain[1]; rowIndex++){
if (isStartOfBar(matrix, rowIndex, colIndex)){
return (MatrixCell)matrix.get(getIdStr(rowIndex, colIndex));
}
}
}else{
for (int rowIndex = rowIndexStart-1; rowIndex>=rowDomain[0]; rowIndex--){
if (isStartOfBar(matrix, rowIndex, colIndex)){
return (MatrixCell)matrix.get(getIdStr(rowIndex, colIndex));
}
}
}
return result; //safety net if last cell..
}
public Hashtable reIdUnseenBars(Hashtable matrix){
//first check the first unseen row, less than -1 for down, totalRows for up
int firstUnseenRow;
if (ANIMATION_MODE.equals("up")){
firstUnseenRow = totalRows; //up routine
}else{
firstUnseenRow = -1; //down routine
}
//go through each column and get first bar that is unseen...aka first cell where pixelId==0..that is start of a vertical bar
//...once there, any other rows beyond..we should change id to current vertical bar
for (int colIndex=0; colIndex<totalColumns; colIndex++){
int[] rowDomain = getRowDomain(matrix, colIndex);
boolean firstBarFound = false;
if (ANIMATION_MODE.equals("up")){
//up routine
for (int rowIndex = firstUnseenRow; rowIndex<=rowDomain[1]; rowIndex++){
if (firstBarFound==false){
if (isStartOfBar(matrix, rowIndex,colIndex)){
firstBarFound = true;
}
}
if (firstBarFound){
matrix = updateMatrixId(matrix, rowIndex, colIndex, matrixId);
}
}
}else{
//down routine
for (int rowIndex = firstUnseenRow; rowIndex>=rowDomain[0]; rowIndex--){
if (firstBarFound==false){
if (isStartOfBar(matrix, rowIndex, colIndex)){
firstBarFound = true;
}
}
if (firstBarFound){
matrix = updateMatrixId(matrix, rowIndex, colIndex, matrixId);
}
}
}
}
return matrix;
}
//rand int from bank of options
public float[] getNItemsRandomlyFromArr(float[] bank, int count){
float[] result = new float[count];
for (int i=0; i<count; i++){
result[i] = bank[floor(random(0,bank.length))];
}
return result;
}
//get range
public int[] range(int st, int end){
int[] arr = new int[end+1-st];
for (int i =0; i<end+1-st; i++){
arr[i] = st+i;
}
return arr;
}
//set warm and cool given the currentMatrix and mId
public Hashtable<String, MatrixCell> setCatTones(Hashtable<String, MatrixCell> matrix, int mId){
Set<String> keys = matrix.keySet();
Hashtable<String, Object> barDictionary = getListByDistributionBreakdown(range(0,catBreakdown.length+1), getBarIdsByMatrixId(matrix, mId), catBreakdown);
for (String key : keys) {
MatrixCell cell = matrix.get(key);
if (barDictionary.containsKey(cell.verticalBarId)){
matrix.get(key).colorIndex = (int)barDictionary.get(cell.verticalBarId);
}
}
return matrix;
}
//update current state
public void updateCurrentState(){
//get todays date in google trends format i.e. YYYY-MM-DD 2014-02-06
String currentDateStr = win.getGoogleDateFormat();
//get date values as array
int[] dateValues = gt.getDateValuesAsList(""); //"" = no filter
//get date strings as array
String[] dateStrings = gt.getDateStringsAsList("","googleFormat"); //"" = no filter
float tmpCurrentState = 0;
float tmpDelta = 0;
float change;
for (int i=1; i<dateValues.length; i++){
//calc delta..see how much state should change
tmpDelta = dateValues[i]-dateValues[i-1];
//calc step change
change = calculateStateChange(tmpDelta);
//log(new Object[]{"date:",dateStrings[i],"original:", tmpCurrentState,"change to do: ", change, " --> new: ", tmpCurrentState+change});
tmpCurrentState = constrain(tmpCurrentState+change, 0, colorStates.length-1);
if (dateStrings[i].equals(currentDateStr)){
break; //exit for loop we done.
}
}
//currentState = constrain(tmpCurrentState, 0, colorStates.length-1);
currentState = calculateStateIndex(tmpDelta);
log (new Object[]{"current state is:", currentState});
}
//set warm and cool given the currentMatrix and mId
public Hashtable<String, MatrixCell> setWarmCool(Hashtable<String, MatrixCell> matrix, int mId){
Set<String> keys = matrix.keySet();
float ratio = colorStates[floor(currentState)];
Hashtable<String, Object> barDictionary = getListByDistributionBreakdown(new Object[]{false,true}, getBarIdsByMatrixId(matrix, mId), new float[]{ratio,1-ratio});
//log(new Object[]{"bar dictionary:", barDictionary});
for (String key : keys) {
MatrixCell cell = matrix.get(key);
if (barDictionary.containsKey(cell.verticalBarId)){
matrix.get(key).isWarm = (boolean)barDictionary.get(cell.verticalBarId);
}
}
return matrix;
}
//calculate state change..depending on delta, returns adjustment to state (amount of steps..which will turn into an index.
public float calculateStateChange(float delta){
float[] currState, currStateNext;
float finalChange = 0;
for (int i=0; i<deltaMoves.length; i++){
currState = deltaMoves[i];
currStateNext = (i+1!=deltaMoves.length) ? deltaMoves[i+1] : new float[]{100, 0}; //if last make a new one at 100
//log(new Object[]{"testing...",currState[0], "<",abs(delta),"<",currStateNext[0]});
//check if it exists in range..if so..get ratio
if (currState[0]<=abs(delta) && abs(delta)< currStateNext[0]){
// log(new Object[]{"winner!!"});
//if positive use + speed, else use - speed
finalChange = (delta<0) ? currState[2] : currState[1];
break;
}
}
return finalChange;
}
public float calculateStateIndex(float delta){
float[] currState, currStateNext;
float finalIndex = 0;
for (int i=0; i<deltaMoves.length; i++){
currState = deltaMoves[i];
currStateNext = (i+1!=deltaMoves.length) ? deltaMoves[i+1] : new float[]{100, 0}; //if last make a new one at 100
//log(new Object[]{"testing...",currState[0], "<",abs(delta),"<",currStateNext[0]});
//check if it exists in range..if so..get ratio
if (delta<0){
finalIndex = 0;
} else if (currState[0]<=abs(delta) && abs(delta)< currStateNext[0]){
// log(new Object[]{"winner!!"});
//if positive use + speed, else use - speed
finalIndex = i;
break;
}
}
return finalIndex;
}
public String updateBarId(String barId, int newMatrixId){
return createBarId(newMatrixId, explodeBarId(barId)[1]);
}
public int[] explodeBarId(String barId){
String[] pieces = barId.split("_");
return new int[]{Integer.parseInt(pieces[0]), Integer.parseInt(pieces[1])};
}
public String createBarId(int mId, int bId){
return mId+"_"+bId;
}
//count amount of bars in the matrix
public String[] getBarIds(Hashtable<String, MatrixCell> matrix) {
ArrayList<String> uniqueIds = new ArrayList();
Set<String> keys = matrix.keySet();
MatrixCell tmpCell;
for (String key : keys) {
tmpCell = matrix.get(key);
if (uniqueIds.indexOf(tmpCell.verticalBarId)==-1){
uniqueIds.add(tmpCell.verticalBarId);
}
}
String[] newArr = uniqueIds.toArray(new String[uniqueIds.size()]);
Arrays.sort(newArr);
return newArr;
}
public String[] getBarIdsByMatrixId(Hashtable<String, MatrixCell> matrix, int mId){
ArrayList<String> filteredIds = new ArrayList();
String[] uniqueBars = getBarIds(matrix);
for (int i=0; i<uniqueBars.length; i++){
if (explodeBarId(uniqueBars[i])[0]==mId){
filteredIds.add(uniqueBars[i]);
}
}
String[] newArr = filteredIds.toArray(new String[filteredIds.size()]);
return newArr;
}
//get random hashtable of items(indices) given an amount needed and disribution ratio breakdown
public Hashtable<String, Object> getListByDistributionBreakdown(Object[] items, String[] keys, float[] distribution) {
Hashtable<String,Object> hashtable = new Hashtable();
ArrayList<Object> list = new ArrayList();
for (int i=0; i<distribution.length; i++){
for (int j=0; j<distribution[i]*(float)keys.length; j++){
list.add(items[i]);
}
}
Object[] tmpArr = shuffle(list.toArray(new Object[list.size()]));
for (int i=0; i< keys.length; i++){
hashtable.put(keys[i], tmpArr[i]);
}
return hashtable;
}
//overload for ints
public Hashtable<String, Object> getListByDistributionBreakdown(int[] items, String[] keys, float[] distribution) {
Object[] objArr = new Object[items.length];
for (int i=0; i<items.length; i++){
objArr[i] = items[i];
}
return getListByDistributionBreakdown(objArr, keys, distribution);
}
public Object[] shuffle(Object[] array){
Random rgen = new Random(); // Random number generator
for (int i=0; i<array.length; i++) {
int randomPosition = rgen.nextInt(array.length);
Object temp = array[i];
array[i] = array[randomPosition];
array[randomPosition] = temp;
}
return array;
}
//prettyprint wall matrix
public String prettyPrint() {
String resStr = "";
for (int i =0; i<totalColumns; i++) {
for (int j=0; j<totalRows; j++) {
if (cellExists(getIdStr(j, i))) {
resStr+=". ";
} else {
resStr+="# ";
}
}
resStr+="\n";
}
return resStr;
}
public color getColorByUUID(String uuid){
Set<String> keys = currentMatrix.keySet();
MatrixCell tmpCell = currentMatrix.get(getIdStr(0,0)); //in case we dont find one...
for (String key: keys){
tmpCell = currentMatrix.get(key);
if (tmpCell.uuid.equals(uuid)){
return getColor(tmpCell);
}
}
return getColor(tmpCell); //safety net?
}
//basis for inserting a cell
private Hashtable insertCell(
Hashtable matrix, //matrix
int rowIndex, //row to add to bar to
int colIndex, //col to add to
int pixelIndex, //pixel to add to
int colorIndex, //colorIndex
int pixelLength, //pixelLength
boolean isWarm, //warm or cool tone
String verticalBarId, //vertical bar id
String nextVerticalBarId //vertical bar id
){
//we build the pixel up
int modifier;
if (ANIMATION_MODE.equals("up")) { //going up
modifier = 1; //we're building the bar upstream (index wise)
} else {
modifier = -1; //we're building the bar downstream (index wise)
}
//log(new Object[]{"key exists?", matrix.containsKey(getIdStr(rowIndex+(pixelIndex*modifier), colIndex))});
matrix.put(getIdStr(rowIndex+(pixelIndex*modifier), colIndex), new MatrixCell(
colorIndex,
pixelLength,
pixelIndex,
isWarm,
verticalBarId,
nextVerticalBarId
));
return matrix;
}
private Hashtable insertVerticalBarAtColIndex(Hashtable matrix, int colIndex,String verticalBarId, int colorIndex, int pixelLength) {
//insert random bar at last empty spot
int nextIndex = getNextEmpty(matrix, colIndex);
// log(new Object[]{"next index:",nextIndex});
if (nextIndex==-1) {
log(new Object[]{"safety net issue! column:", colIndex, "next index:", nextIndex});
}
String prevBarOriginCellUUID;
int previousRowIndex = (ANIMATION_MODE.equals("up") ? nextIndex+1 : nextIndex-1);
MatrixCell prevCell = (MatrixCell)matrix.get(getIdStr(previousRowIndex, colIndex));
//we get verticalbar id
if (prevCell!=null){
prevBarOriginCellUUID = prevCell.uuid;
}else{
prevBarOriginCellUUID = "None";
}
for (int i =0; i<pixelLength; i++) {
//insert cell given a row + bar pixel index
matrix = insertCell(matrix, nextIndex, colIndex, i, colorIndex, pixelLength, false,verticalBarId, prevBarOriginCellUUID);
}
return matrix;
}
//turns row + col into an id for hash table
private String getIdStr(int row, int col) {
return str(row)+":"+str(col);
}
public int[] parseIdStrToIntArr(String idStr) {
int[] idArr = new int[2];
String[] pieces = idStr.split(":");
for (int i = 0; i<pieces.length; i++) {
idArr[i] = Integer.parseInt(pieces[i]);
}
return idArr;
}
//matrixIsFull(matrix): test if all columns have reached capacity
private boolean matrixIsFull(Hashtable matrix) {
boolean isFull = true;
int start, end;
start = 0;
end= totalColumns;
for (int i =start; i<end; i++) {
if (!columnIsFull(matrix, i)) {
isFull = false;
}
}
return isFull;
}
//columnIsFull(matrix, colIndex)
private boolean columnIsFull(Hashtable matrix, int colIndex) {
//determine last row , based on ing mode.
int lastRowIndex;
if (ANIMATION_MODE.equals("up")) {
lastRowIndex = totalRows-1;
} else {
lastRowIndex = 0;
}
//if its not null its full.
return (matrix.containsKey(getIdStr(lastRowIndex, colIndex)));
}
//get the row that is considered to be the last empty matrix.
private int getLastEmptyIndex(Hashtable matrix){
//get domain of domains basically
int[][] rowDomains = getRowDomains(matrix);
//we need to find the largest min and smallest max actually...
int[] minMaxDomain = new int[]{rowDomains[0][0], rowDomains[0][1]};
for (int i=0; i<rowDomains.length; i++){
if (rowDomains[i][0]>minMaxDomain[0]){ //largest min of all the domains
minMaxDomain[0] = rowDomains[i][0];
}
if (rowDomains[i][1]<minMaxDomain[1]){ //smallest max of all the domains
minMaxDomain[1] = rowDomains[i][1];
}
}
//return beginning domain if down, return end domain if up
if (ANIMATION_MODE.equals("up")) {
return minMaxDomain[1];
}else{
return minMaxDomain[0];
}
}
//remapMatrixRowOrigin: take a matrix (truncated one for instance, and remap the ids row counterpart to new origin)
private Hashtable remapMatrixRowOrigin(Hashtable matrix, int newOrigin){
Hashtable newMatrix = new Hashtable(); // new store
//so first we get min max domain
int[] minMaxDomain = getDomainOfDomains(getRowDomains(matrix));
int domainLength = getDomainLength(minMaxDomain);
int sourceStart, sourceEnd,targetStart, targetEnd;
targetStart = newOrigin;
if (ANIMATION_MODE.equals("up")) { //going up
sourceStart = minMaxDomain[0]; //0
sourceEnd = minMaxDomain[1]; //length-1
targetEnd = targetStart+(domainLength-1);
}else{
sourceStart = minMaxDomain[1]; //length-1
sourceEnd = minMaxDomain[0]; //0
targetEnd = targetStart-(domainLength-1);
}
Set<String> keys = matrix.keySet();
for (String key : keys) {
int[] idIntArr = parseIdStrToIntArr(key);
//this should be the remapping to the new index
int newRow = (int)map(idIntArr[0], sourceStart, sourceEnd, targetStart, targetEnd);
newMatrix.put(getIdStr(newRow, idIntArr[1]), matrix.get(key));
}
return newMatrix;
}
//transferMatrixOverflow(sourceMatrix): move stuff past max to new matrix
private Hashtable[] transferMatrixOverflow(Hashtable sourceMatrix) { Hashtable<String, MatrixCell> tmpMatrix = new Hashtable();
Hashtable<String,MatrixCell> newMatrix = new Hashtable();
//anything over totalrows..
int lastEmptyIndex = getLastEmptyIndex(sourceMatrix);
Set<String> keys = sourceMatrix.keySet();
for (String key : keys) {
int[] idIntArr = parseIdStrToIntArr(key);
boolean isOverflow;
int newFixedIndex;
if (ANIMATION_MODE.equals("up")) {
isOverflow = (idIntArr[0]>lastEmptyIndex); // above totalrow index
newFixedIndex =idIntArr[0]; //fix so starts at 0 and builds down
} else {
isOverflow = (idIntArr[0]<lastEmptyIndex); // below 0 index
newFixedIndex = idIntArr[0]; //fix so -1 starts at length-1 and builds up
}
if (isOverflow) {
//_log(new Object[]{"overflow: ", idIntArr," --> ", newFixedIndex});
tmpMatrix.put(getIdStr(newFixedIndex, idIntArr[1]), (MatrixCell)sourceMatrix.get(key));
} else {
newMatrix.put(key, (MatrixCell)sourceMatrix.get(key));
}
}
//remap truncated to real base (bc we use it to generate new matrix later),...depending on animation up = 0, down = length-1
tmpMatrix = remapMatrixRowOrigin(tmpMatrix, (ANIMATION_MODE.equals("up") ? 0 : totalRows-1));
return new Hashtable[]{newMatrix,tmpMatrix};
}
/*
//emptyMatrix(matrix): clear out a matrix
private void emptyMatrix(Hashtable matrix){
matrix.clear();
}
*/
//getNextEmpty(matrix, colIndex): get the next row index that is empty given column index
private int getNextEmpty(Hashtable matrix, int colIndex) {
//nextempty depends on animation mode
int start, end;
//lets get domain which can exceed 0-totalRows domain
int[] domain = new int[]{0,totalRows};
//log(new Object[]{"domain..", domain});
if (ANIMATION_MODE.equals("up")) { //going up
start = domain[0]; //0
end= domain[1]; //totalRows
for (int i=start; i<end; i++) {
if (!matrix.containsKey(getIdStr(i, colIndex))) {
return i;
}
}
} else { //going down
start = domain[1]-1; //totalRows-1
end= domain[0]; //0
for (int i=start; i>=end; i--) {
if (!matrix.containsKey(getIdStr(i, colIndex))) {
return i;
}
}
}
//safety net
return -1;
}
public boolean cellExists(String id) {
return (currentMatrix.containsKey(id));
}
//getCells(cellIds)
//getCell(cellId)
public MatrixCell getCell(String cellId) {
return currentMatrix.get(cellId);
}
//setCells(cellIds, cellValues)
//setCell(cellId, cellValue)
public void setCell(String cellId, MatrixCell cellValue) {
currentMatrix.put(cellId, cellValue);
}
//pop indivud
//popRow(matrix): pop off last row in matrix
public Hashtable popRow(Hashtable matrix) {
int lastRowIndex;
if (ANIMATION_MODE.equals("up")) {
lastRowIndex = 0; // last row is 0 when shifting up
} else {
lastRowIndex = totalRows-1; // last row is 0 when shifting up
}
//remove last row added
for (int i=0; i<totalColumns; i++) {
matrix.remove(getIdStr(lastRowIndex, i));
}
//iterate through hastable and pop everything up by 1.
Hashtable<String, MatrixCell> tmpMatrix = new Hashtable();
Set<String> keys = matrix.keySet();
for (String key : keys) {
int[] rowColArr = parseIdStrToIntArr(key);
//put everyone up 1
int shiftFactor;
if (ANIMATION_MODE.equals("up")) {
shiftFactor = -1; // -1 means shift up 1
} else {
shiftFactor = 1; // 1 means move down 1
}
tmpMatrix.put(getIdStr(rowColArr[0]+shiftFactor, rowColArr[1]), (MatrixCell)matrix.get(key));
}
return tmpMatrix;
}
public Hashtable combineMatrices(Hashtable m1, Hashtable m2) {
//get through each collumnn
//testing this should start at 6 now
for (int colIndex = 0; colIndex<totalColumns; colIndex++){
//get domain of colindex of m1..we need
int nextRow = getNextEmpty(m1, colIndex);
//get column of next
Hashtable rowsInCurrentColumn = getRowsInAColumn(m2, colIndex);
//remap to last index
rowsInCurrentColumn = remapMatrixRowOrigin(rowsInCurrentColumn, nextRow);
//place them in hashtable..
m1.putAll(rowsInCurrentColumn);
}
return m1;
/*
Set<String> keys = m2.keySet();
for (String key : keys) {
int[] rowColArr = parseIdStrToIntArr(key);
int indexModifier;
if (ANIMATION_MODE.equals("up")) {
indexModifier = totalRows-1; //append to last row so 0 -> 85, 1 -> 86
} else {
indexModifier = -1*(totalRows-1); //append to first row so if (rows = 85), 84-> -1 83 --> -2
//log(new Object[]{"from tmp matrix:", rowColArr[0], " --> ", rowColArr[0]+indexModifier});
}
//append to end of of lastRowIndex
m1.put(getIdStr(rowColArr[0]+indexModifier, rowColArr[1]), (MatrixCell)m2.get(key));
}
return m1;
*/
}
//get all Row Domains
public int[][] getRowDomains(Hashtable matrix){
int[][] rowDomains = new int[totalColumns][2];
for (int i=0; i<totalColumns; i++){
rowDomains[i] = getRowDomain(matrix, i);
}
return rowDomains;
}
//get the row domain (based on index)
public int[] getRowDomain(Hashtable matrix, int colIndex){
int[] domain = new int[]{99999,-99999};
//restrict to a specific column
Hashtable rowsInAColumn = getRowsInAColumn(matrix, colIndex);
Set<String> keys = rowsInAColumn.keySet();
for (String key : keys) {
//get row index and compare to our current domain
int currentRow = parseIdStrToIntArr(key)[0];
//peep domain
if (currentRow<domain[0]){
domain[0] = currentRow;
}else if (currentRow>domain[1]){
domain[1] = currentRow;
}
}
return domain;
}
//given a set of domains [start, end]...compute the min and max domain..
public int[] getDomainOfDomains(int[][] domains){
int min = domains[0][0];
int max = domains[0][1];
for (int i=0; i< domains.length; i++){
if (domains[i][0]<min){
min = domains[i][0];
}
if (domains[i][1]>max){
max = domains[i][1];
}
}
return new int[]{min, max};
}
//compute domain length of a domain
public int getDomainLength(int[] domain){
return domain[1]-domain[0];
}
//get value within a domain, given an index...so if domain is -2 --> 2 than @index 0 = -5, @index 2 =0
public int getValueFromDomainByIndex(int[] domain, int index){
int count = 0;
for (int i=domain[0]; i<=domain[1]; i++){
if (count==index){
return i;
}
count++;
}
return -999999999; //safety net
}
//get rows of a specified column as a single dim hashtable (like a filter).
public Hashtable getRowsInAColumn(Hashtable matrix, int colIndex){
Hashtable result = new Hashtable();
Set<String> keys = matrix.keySet();
for (String key : keys) {
int[] idPieces = parseIdStrToIntArr(key);
if (idPieces[1]==colIndex){
result.put(key, matrix.get(key));
}
}
return result;
}
//way to typecast generic shiftarr..
public MatrixCell[] shiftArrayMatrix(Object[] arr, int shiftAmount){
Object[] tmpArr = shiftArray(arr, shiftAmount);
MatrixCell[] resultArr = new MatrixCell[tmpArr.length];
for (int i =0; i<tmpArr.length; i++){
resultArr[i] = (MatrixCell)tmpArr[i];
}
return resultArr;
}
//shift a single array, -1 shift back 1 = pop
public Object[] shiftArray(Object[] arr, int shiftAmount){
Object[] newArr = new Object[arr.length-abs(shiftAmount)];
int oldIndex = -1;
for (int i = 0; i < newArr.length; i++) {
int newIndex = i;
if (shiftAmount<0){
//-1 , for up animation remove from beginning (index=0)
oldIndex = i+abs(shiftAmount);
}else{
//1, for down animation remove from end (index=length-1)
oldIndex = i;
}
newArr[newIndex] = arr[oldIndex];
//log(new Object[]{"shift amount:", shiftAmount, "i:", i, "new arr index: ", (newIndex)+"/"+newArr.length, "old arr index:", oldIndex,"/", arr.length});
}
return newArr;
}
public void shiftColumnsAdditionalSpeed(){
int extra = 0;
float amountToShift, frameNum;
for (int colIndex=0; colIndex<randSpeeds.length; colIndex++){ //columns
amountToShift = randSpeeds[colIndex]; //could be 0 , 1 , or 2
if (amountToShift%1!=0){
frameNum = floor(map(amountToShift%1,1,0,4,0)); //if amountoshift = 1.25, than .25 than 4 frames
extra = (frameCount%frameNum==0) ? 1 : 0;
}
popOffColumn(colIndex, floor(amountToShift)+extra);
}
}
//true workerbee for forcepadding..use if character not a space
public String forcePaddingSpecific(Object obj, int desiredPadding, String character){
String str = obj.toString();
for (int i=0; i<desiredPadding; i++){
if (i>=str.length()){
str+=character;
}
}
return str;
}
//to be used with visualize matrix..pad text with minimum amount of character lengths.
public String forcePadding(Object obj, int desiredPadding){
return forcePaddingSpecific(obj, desiredPadding, " ");
}
//visualize matrix as text...for debugging..
public String matrixVisualize(Hashtable matrix){
String finalText = "\n";
int paddingForce = 3;
String tabSize = " ";
String breakLine = "-"; //1 more than tab size length
//get domains
int[][] rowDomains = getRowDomains(matrix);
//get min max of all the domains
int[] rowMinMax = getDomainOfDomains(rowDomains);
log(new Object[]{"row min max:", rowMinMax});
//print column indices
//go through each rowindex
finalText += forcePadding(" ", paddingForce)+tabSize; //blank row id for these guys
for (int colIndex = 0; colIndex<totalColumns; colIndex++){
finalText += forcePadding(colIndex, paddingForce) +tabSize;
}
finalText += "\n";
for (int rowIndex=rowMinMax[0]; rowIndex<=rowMinMax[1]; rowIndex++){
//Indivate column header and breaks for visible area
if (rowIndex==0 || rowIndex==totalRows){
String tmpBreakStr = forcePaddingSpecific("-", paddingForce,"-")+breakLine;
finalText += tmpBreakStr; //blank row id for these guys
for (int colIndex = 0; colIndex<totalColumns; colIndex++){
finalText += tmpBreakStr; //if its not the beginning of the row min..then its just to show a break line for visibile stuff
}
finalText += "\n";
}
//print row id
finalText+= forcePadding(rowIndex, paddingForce)+tabSize;
//indicate if cell is "empty","null",or "filled"
for (int colIndex = 0; colIndex<totalColumns; colIndex++){
//grab the value there ..it exist?
String symbol=" "; //nothing..
String id = getIdStr(rowIndex, colIndex);
if (matrix.containsKey(id)){
if (matrix.get(id)!=null){
symbol = "# "; //matrix cell value !
}else{
symbol = ". "; //null! uh oh..shouldnt exist
}
}
//now print row
finalText+= forcePadding(symbol, paddingForce)+tabSize;
}
finalText+= "\n";
}
return finalText;
}
//pop off specified amount depeding on column..
public void popOffColumn(int colIndex, int amountToShift){
int modifier;
int[] rowDomain = getRowDomain(currentMatrix, colIndex);
//depending on animation mode
if (ANIMATION_MODE.equals("up")) {
modifier= 1;
} else {
modifier = -1;
}
String[] idsToRemove = new String[amountToShift];
String targetId, sourceId;
int count = 0;
//make a copy
Hashtable<String, MatrixCell> currentMatrixOrig = (Hashtable<String, MatrixCell>)currentMatrix.clone();
for (int i=rowDomain[0]; i<=rowDomain[1]; i++){
//check if need to remove
targetId = getIdStr(i, colIndex);
sourceId = getIdStr(i+amountToShift*modifier, colIndex); //- modifier = shift up, + modifer = shift down
boolean addToRemoved = (ANIMATION_MODE.equals("up")) ? i>(rowDomain[1]-amountToShift) : i<rowDomain[0]+amountToShift;
if (addToRemoved){ //these will need to be removed after a shift
idsToRemove[count] = targetId;
count++;
}
if ( currentMatrixOrig.get(sourceId)!=null){
//log(new Object[]{"targetId: ", targetId, " sourceId:", sourceId});
currentMatrix.put(targetId, currentMatrixOrig.get(sourceId)); //start from bottom and go backwards
}
}
// log(new Object[]{"to remove:", amountToShift});
// log(new Object[]{"domain after shift:", getRowDomain(currentMatrix, colIndex)});
for (int i=0; i<idsToRemove.length; i++) {
// log(new Object[]{"removing..", idsToRemove[i]});
currentMatrix.remove(idsToRemove[i]);
}
// log(new Object[]{"new domain for col index #", colIndex,":", getRowDomain(currentMatrix, colIndex),"\n-------\n"});
}
public color getColor(MatrixCell cell){
color c;
if (cell.isWarm){
c = warmColorRange[cell.colorIndex];
}else{
c = coolColorRange[cell.colorIndex];
}
return c;
}
//populate currentmatrix with the next bar color info
public void generateNextBarColorInfo(){