X-Git-Url: https://git.opendaylight.org/gerrit/gitweb?a=blobdiff_plain;f=opendaylight%2Fmd-sal%2Fsal-dom-broker%2Fsrc%2Ftest%2Fjava%2Forg%2Fopendaylight%2Fcontroller%2Fmd%2Fsal%2Fdom%2Fstore%2Fimpl%2Ftree%2Fdata%2FModificationMetadataTreeTest.java;fp=opendaylight%2Fmd-sal%2Fsal-dom-broker%2Fsrc%2Ftest%2Fjava%2Forg%2Fopendaylight%2Fcontroller%2Fmd%2Fsal%2Fdom%2Fstore%2Fimpl%2FModificationMetadataTreeTest.java;h=bc27c551558b91e2b47582bdbac9db63a1eeacd7;hb=8d160966fa8752235d01bb8dc57c11391b86f187;hp=efa5068fb61a2ebbcfc7eb8e9e4ca35d7fd3ac40;hpb=3f00001b2652f56ba9fc73681aeac27cb0e0d7df;p=controller.git diff --git a/opendaylight/md-sal/sal-dom-broker/src/test/java/org/opendaylight/controller/md/sal/dom/store/impl/ModificationMetadataTreeTest.java b/opendaylight/md-sal/sal-dom-broker/src/test/java/org/opendaylight/controller/md/sal/dom/store/impl/tree/data/ModificationMetadataTreeTest.java similarity index 86% rename from opendaylight/md-sal/sal-dom-broker/src/test/java/org/opendaylight/controller/md/sal/dom/store/impl/ModificationMetadataTreeTest.java rename to opendaylight/md-sal/sal-dom-broker/src/test/java/org/opendaylight/controller/md/sal/dom/store/impl/tree/data/ModificationMetadataTreeTest.java index efa5068fb6..bc27c55155 100644 --- a/opendaylight/md-sal/sal-dom-broker/src/test/java/org/opendaylight/controller/md/sal/dom/store/impl/ModificationMetadataTreeTest.java +++ b/opendaylight/md-sal/sal-dom-broker/src/test/java/org/opendaylight/controller/md/sal/dom/store/impl/tree/data/ModificationMetadataTreeTest.java @@ -1,4 +1,11 @@ -package org.opendaylight.controller.md.sal.dom.store.impl; +/* + * Copyright (c) 2014 Cisco Systems, Inc. and others. All rights reserved. + * + * This program and the accompanying materials are made available under the + * terms of the Eclipse Public License v1.0 which accompanies this distribution, + * and is available at http://www.eclipse.org/legal/epl-v10.html + */ +package org.opendaylight.controller.md.sal.dom.store.impl.tree.data; import static org.junit.Assert.assertEquals; import static org.junit.Assert.assertFalse; @@ -19,7 +26,10 @@ import static org.opendaylight.yangtools.yang.data.impl.schema.ImmutableNodes.ma import org.junit.Before; import org.junit.Test; -import org.opendaylight.controller.md.sal.dom.store.impl.tree.StoreMetadataNode; +import org.opendaylight.controller.md.sal.dom.store.impl.SchemaAwareApplyOperationRoot; +import org.opendaylight.controller.md.sal.dom.store.impl.TestModel; +import org.opendaylight.controller.md.sal.dom.store.impl.tree.DataTree; +import org.opendaylight.controller.md.sal.dom.store.impl.tree.DataTreeModification; import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier; import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier.NodeIdentifier; import org.opendaylight.yangtools.yang.data.api.schema.ContainerNode; @@ -137,10 +147,10 @@ public class ModificationMetadataTreeTest { @Test public void basicReadWrites() { - DataTreeModification modificationTree = DataTreeModification.from(new DataTree.Snapshot(schemaContext, + DataTreeModification modificationTree = new InMemoryDataTreeModification(new InMemoryDataTreeSnapshot(schemaContext, StoreMetadataNode.createRecursively(createDocumentOne(), UnsignedLong.valueOf(5))), new SchemaAwareApplyOperationRoot(schemaContext)); - Optional> originalBarNode = modificationTree.read(OUTER_LIST_2_PATH); + Optional> originalBarNode = modificationTree.readNode(OUTER_LIST_2_PATH); assertTrue(originalBarNode.isPresent()); assertSame(BAR_NODE, originalBarNode.get()); @@ -149,13 +159,13 @@ public class ModificationMetadataTreeTest { // reads node to /outer-list/1/inner_list/two/value // and checks if node is already present - Optional> barTwoCModified = modificationTree.read(TWO_TWO_VALUE_PATH); + Optional> barTwoCModified = modificationTree.readNode(TWO_TWO_VALUE_PATH); assertTrue(barTwoCModified.isPresent()); assertEquals(ImmutableNodes.leafNode(VALUE_QNAME, "test"), barTwoCModified.get()); // delete node to /outer-list/1/inner_list/two/value modificationTree.delete(TWO_TWO_VALUE_PATH); - Optional> barTwoCAfterDelete = modificationTree.read(TWO_TWO_VALUE_PATH); + Optional> barTwoCAfterDelete = modificationTree.readNode(TWO_TWO_VALUE_PATH); assertFalse(barTwoCAfterDelete.isPresent()); } @@ -164,7 +174,8 @@ public class ModificationMetadataTreeTest { /** * Creates empty Snapshot with associated schema context. */ - DataTree t = DataTree.create(schemaContext); + DataTree t = InMemoryDataTreeFactory.getInstance().create(); + t.setSchemaContext(schemaContext); /** * @@ -172,9 +183,7 @@ public class ModificationMetadataTreeTest { * context. * */ - DataTreeModification modificationTree = DataTreeModification.from(t.takeSnapshot(), new SchemaAwareApplyOperationRoot( - schemaContext)); - return modificationTree; + return t.takeSnapshot().newModification(new SchemaAwareApplyOperationRoot(schemaContext)); } @Test @@ -195,14 +204,14 @@ public class ModificationMetadataTreeTest { /** * Reads list node from /test/outer-list */ - Optional> potentialOuterList = modificationTree.read(OUTER_LIST_PATH); + Optional> potentialOuterList = modificationTree.readNode(OUTER_LIST_PATH); assertTrue(potentialOuterList.isPresent()); /** * Reads container node from /test and verifies that it contains test * node */ - Optional> potentialTest = modificationTree.read(TEST_PATH); + Optional> potentialTest = modificationTree.readNode(TEST_PATH); ContainerNode containerTest = assertPresentAndType(potentialTest, ContainerNode.class); /** @@ -219,8 +228,8 @@ public class ModificationMetadataTreeTest { public void writeSubtreeReadChildren() { DataTreeModification modificationTree = createEmptyModificationTree(); modificationTree.write(TEST_PATH, createTestContainer()); - Optional> potential = modificationTree.read(TWO_TWO_PATH); - MapEntryNode node = assertPresentAndType(potential, MapEntryNode.class); + Optional> potential = modificationTree.readNode(TWO_TWO_PATH); + assertPresentAndType(potential, MapEntryNode.class); } @Test @@ -229,11 +238,11 @@ public class ModificationMetadataTreeTest { modificationTree.write(TEST_PATH, createTestContainer()); // We verify data are present - Optional> potentialBeforeDelete = modificationTree.read(TWO_TWO_PATH); - MapEntryNode node = assertPresentAndType(potentialBeforeDelete, MapEntryNode.class); + Optional> potentialBeforeDelete = modificationTree.readNode(TWO_TWO_PATH); + assertPresentAndType(potentialBeforeDelete, MapEntryNode.class); modificationTree.delete(TWO_TWO_PATH); - Optional> potentialAfterDelete = modificationTree.read(TWO_TWO_PATH); + Optional> potentialAfterDelete = modificationTree.readNode(TWO_TWO_PATH); assertFalse(potentialAfterDelete.isPresent()); }