if (foundNode != null && nextPath.iterator().hasNext()) {
foundNode = findNodeIn(foundNode, nextPath);
}
if (foundNode != null && nextPath.iterator().hasNext()) {
foundNode = findNodeIn(foundNode, nextPath);
}
if (parent instanceof DataNodeContainer) {
final DataNodeContainer parentDataNodeContainer = (DataNodeContainer) parent;
if (parent instanceof DataNodeContainer) {
final DataNodeContainer parentDataNodeContainer = (DataNodeContainer) parent;
if (foundNode != null && nextPath.iterator().hasNext()) {
foundNode = findNodeIn(foundNode, nextPath);
}
if (foundNode != null && nextPath.iterator().hasNext()) {
foundNode = findNodeIn(foundNode, nextPath);
}
if (foundNode == null) {
// fallback that tries to map into one of the child cases
for (final CaseSchemaNode caseNode : ((ChoiceSchemaNode) parent).getCases()) {
if (foundNode == null) {
// fallback that tries to map into one of the child cases
for (final CaseSchemaNode caseNode : ((ChoiceSchemaNode) parent).getCases()) {
if (maybeChild != null) {
foundNode = findNodeIn(maybeChild, nextPath);
break;
if (maybeChild != null) {
foundNode = findNodeIn(maybeChild, nextPath);
break;