| 181 | } |
| 182 | |
| 183 | protected TreeMap<Integer, Set<Consumer<Integer>>> collectChildrenPasses() { |
| 184 | |
| 185 | |
| 186 | if (this.children() |
| 187 | .size() == 0) return null; |
| 188 | |
| 189 | TreeMap<Integer, Set<Consumer<Integer>>> t = new TreeMap<>(); |
| 190 | |
| 191 | for (Box c : children()) { |
| 192 | LinkedHashMapAndArrayList<Perform> p = c.properties.get(passes); |
| 193 | if (p == null) continue; |
| 194 | for (Perform pp : p.values()) { |
| 195 | int[] ap = pp.getPasses(); |
| 196 | for (int x : ap) |
| 197 | t.computeIfAbsent(x, k -> new LinkedHashSet<>()) |
| 198 | .add(pp); |
| 199 | } |
| 200 | } |
| 201 | |
| 202 | return t; |
| 203 | } |
| 204 | |
| 205 | /** |
| 206 | * updates everything in the internalScene. This is the main entry point for performing a complete update cycle. |