+ expChangeEventCount, expChangeEventCount - changeLatch.getCount()));
+ }
+
+ for (int i = 0; i < expPaths.length; i++) {
+ final DataTreeCandidate candidate = changeList.get(i);
+ final Optional<NormalizedNode<?, ?>> maybeDataAfter = candidate.getRootNode().getDataAfter();
+ if (!maybeDataAfter.isPresent()) {
+ fail(String.format("Change %d does not contain data after. Actual: %s", i + 1,
+ candidate.getRootNode()));
+ }
+
+ final NormalizedNode<?, ?> dataAfter = maybeDataAfter.get();
+ final Optional<YangInstanceIdentifier> relativePath = expPaths[i].relativeTo(candidate.getRootPath());
+ if (!relativePath.isPresent()) {
+ assertEquals(String.format("Change %d does not contain %s. Actual: %s", i + 1, expPaths[i],
+ dataAfter), expPaths[i].getLastPathArgument(), dataAfter.getIdentifier());
+ } else {
+ NormalizedNode<?, ?> nextChild = dataAfter;
+ for (PathArgument pathArg: relativePath.get().getPathArguments()) {
+ boolean found = false;
+ if (nextChild instanceof NormalizedNodeContainer) {
+ Optional<NormalizedNode<?, ?>> maybeChild = ((NormalizedNodeContainer)nextChild)
+ .getChild(pathArg);
+ if (maybeChild.isPresent()) {
+ found = true;
+ nextChild = maybeChild.get();
+ }
+ }
+
+ if (!found) {
+ fail(String.format("Change %d does not contain %s. Actual: %s", i + 1, expPaths[i], dataAfter));
+ }
+ }
+ }