X-Git-Url: https://git.opendaylight.org/gerrit/gitweb?a=blobdiff_plain;ds=sidebyside;f=opendaylight%2Fmd-sal%2Fsal-distributed-datastore%2Fsrc%2Ftest%2Fjava%2Forg%2Fopendaylight%2Fcontroller%2Fcluster%2Fdatastore%2Futils%2FMockDataTreeChangeListener.java;fp=opendaylight%2Fmd-sal%2Fsal-distributed-datastore%2Fsrc%2Ftest%2Fjava%2Forg%2Fopendaylight%2Fcontroller%2Fcluster%2Fdatastore%2Futils%2FMockDataTreeChangeListener.java;h=9ba38c2616ae5ce0cf22b80bcf54f6e7c937cf12;hb=f40e99a51cd3fc2c9be3ac8aa0772bdb6b6ce479;hp=85a9666d6f631215e523a5277efc126b02ec0188;hpb=609f0bd2646991335ab40a9a2265dcc928c0e6f7;p=controller.git diff --git a/opendaylight/md-sal/sal-distributed-datastore/src/test/java/org/opendaylight/controller/cluster/datastore/utils/MockDataTreeChangeListener.java b/opendaylight/md-sal/sal-distributed-datastore/src/test/java/org/opendaylight/controller/cluster/datastore/utils/MockDataTreeChangeListener.java index 85a9666d6f..9ba38c2616 100644 --- a/opendaylight/md-sal/sal-distributed-datastore/src/test/java/org/opendaylight/controller/cluster/datastore/utils/MockDataTreeChangeListener.java +++ b/opendaylight/md-sal/sal-distributed-datastore/src/test/java/org/opendaylight/controller/cluster/datastore/utils/MockDataTreeChangeListener.java @@ -88,17 +88,16 @@ public class MockDataTreeChangeListener implements DOMDataTreeChangeListener { for (int i = 0; i < expPaths.length; i++) { final DataTreeCandidate candidate = changeList.get(i); - final Optional maybeDataAfter = candidate.getRootNode().getDataAfter(); - if (!maybeDataAfter.isPresent()) { + final NormalizedNode dataAfter = candidate.getRootNode().dataAfter(); + if (dataAfter == null) { fail(String.format("Change %d does not contain data after. Actual: %s", i + 1, - candidate.getRootNode())); + candidate.getRootNode())); } - final NormalizedNode dataAfter = maybeDataAfter.orElseThrow(); final Optional 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()); + dataAfter), expPaths[i].getLastPathArgument(), dataAfter.name()); } else { NormalizedNode nextChild = dataAfter; for (PathArgument pathArg: relativePath.orElseThrow().getPathArguments()) {