()
| 77 | } |
| 78 | |
| 79 | public void apply() { |
| 80 | Set<ObjectGraphNode> applied = new LinkedHashSet<>(); |
| 81 | State current = this; |
| 82 | while (current != null) { |
| 83 | for (StateValue val : current.values()) { |
| 84 | if (!applied.contains(val.node)) { |
| 85 | System.out.print(val.node.parent.parent != null ? val.node.parent.parent.name + "." : ""); |
| 86 | System.out.print(val.node.parent != null ? val.node.parent.name + "." : ""); |
| 87 | System.out.print(val.node.name); |
| 88 | System.out.print("=="); |
| 89 | System.out.println(val.value == null ? "NULL" : val.value.getClass().toString()); |
| 90 | val.node.setCurrentValue(val.value); |
| 91 | applied.add(val.node); |
| 92 | } |
| 93 | } |
| 94 | if (!current.deltaState) { |
| 95 | current = null; |
| 96 | } else { |
| 97 | current = current.previousState; |
| 98 | } |
| 99 | } |
| 100 | } |
| 101 | } |
no test coverage detected