-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUITreeNode.pde
More file actions
133 lines (114 loc) · 3.7 KB
/
UITreeNode.pde
File metadata and controls
133 lines (114 loc) · 3.7 KB
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
/*
* Copyright (c) 2010 The Jackson Laboratory
*
* This software was developed by Matt Hibbs' Lab at The Jackson
* Laboratory (see http://cbfg.jax.org/).
*
* This is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this software. If not, see <http://www.gnu.org/licenses/>.
*/
class UITreeNode extends UIComponent {
String title;
boolean checked = false, hasChildren = false, expanded = false;
ArrayList<Boolean> c_expanded;
color drawcolor = 0x00;
ArrayList<UITreeNode> items;
UITreeNode(String t) {
super();
title = t;
drawcolor = color(random(256), random(256), random(256));
items = new ArrayList<UITreeNode>();
}
UITreeNode(String t, boolean c) {
super();
title = t;
hasChildren = c;
if (hasChildren) c_expanded = new ArrayList<Boolean>();
drawcolor = color(random(256), random(256), random(256));
items = new ArrayList<UITreeNode>();
}
void add(int i, UITreeNode o) {
if (hasChildren) {
c_expanded.add(i, Boolean.FALSE);
}
if (o instanceof UITreeNode) {
UITreeNode newnode = (UITreeNode)o;
String oldname = newnode.title;
boolean jmp = false;
int iter = 1;
while (!jmp) { // append (num) to the name if one with that name already exists
jmp = true;
for (int j = 0; j < size(); j++) {
if (get(j).title.equalsIgnoreCase(newnode.title)) {
jmp = false;
break;
}
}
if (!jmp) {
newnode.title = oldname + "("+(iter++)+")";
}
}
items.add(i, newnode);
}
items.add(i, o);
}
boolean add(UITreeNode o) {
if (hasChildren) {
c_expanded.add(Boolean.FALSE);
}
if (o instanceof UITreeNode) {
UITreeNode newnode = (UITreeNode)o;
String oldname = newnode.title;
boolean jmp = false;
int iter = 1;
while (!jmp) {
jmp = true;
for (int i = 0; i < size(); i++) {
if (get(i).title.equalsIgnoreCase(newnode.title)) {
jmp = false;
break;
}
}
if (!jmp) {
newnode.title = oldname + "("+(iter++)+")";
}
}
return items.add(newnode);
}
return items.add(o);
}
UITreeNode remove(int i) {
if (hasChildren) {
c_expanded.remove(i);
}
return items.remove(i);
}
UITreeNode get(int i) {
return items.get(i);
}
Object last() {
return items.get(size() - 1);
}
boolean is(String ot) {
return title.equalsIgnoreCase(ot);
}
void toggleExpanded() {
expanded = !expanded;
}
void toggleChecked() {
checked = !checked;
}
int size() {
return items.size();
}
}