- case WRITE:
- // FIXME: this is a linear walk. We need a Map of these in order to
- // do something like getChildMap().get(identifier);
- for (DataTreeCandidateNode c : getChildNodes()) {
- if (identifier.equals(c.getIdentifier())) {
- return c;
+ if (canHaveChildren(oldMeta, newMeta)) {
+ final Optional<NormalizedNode<?, ?>> maybeChild = getContainer(newMeta != null ? newMeta : oldMeta).getChild(identifier);
+ if (maybeChild.isPresent()) {
+ return TO_UNMODIFIED_NODE.apply(maybeChild.get());
+ } else {
+ return null;