import java.util.Date;
import java.util.List;
import java.util.Map;
-import java.util.Stack;
+import java.util.Deque;
+import java.util.LinkedList;
import org.junit.Assert;
import org.junit.Before;
@Before
public void setUp() throws Exception {
ns = "urn:ietf:params:xml:ns:netconf:base:1.0";
- qName = new QName(
+ qName = QName.create(
new URI(ns),
new Date(42), "yang-data-impl-mutableTest");
network = NodeHelper.buildTestConfigTree(qName);
@Test
public void testBuildPath() throws Exception {
SimpleNode<?> needle = network.getCompositesByName("topologies").iterator().next()
- .getCompositesByName("topology").iterator().next()
- .getSimpleNodesByName("topology-id").iterator().next();
+ .getCompositesByName("topology").iterator().next()
+ .getSimpleNodesByName("topology-id").iterator().next();
String breadCrumbs = NodeUtils.buildPath(needle);
Assert.assertEquals("network.topologies.topology.topology-id", breadCrumbs);
@Test
public void testBuildNodeMap() {
CompositeNode topology = network.getCompositesByName("topologies").iterator().next()
- .getCompositesByName("topology").iterator().next();
+ .getCompositesByName("topology").iterator().next();
Map<QName, List<Node<?>>> nodeMap = NodeUtils.buildNodeMap(topology.getValue());
Assert.assertEquals(3, nodeMap.size());
*/
@Test
public void testLoadConfigByGroovy() throws IOException, Exception {
- CompositeNode treeRoot = NodeHelper.loadConfigByGroovy("./config02.groovy");
- Document shadowTree = NodeUtils.buildShadowDomTree(treeRoot);
- try {
+ CompositeNode treeRoot = NodeHelper.loadConfigByGroovy("./config02.groovy");
+ Document shadowTree = NodeUtils.buildShadowDomTree(treeRoot);
+ try {
checkFamilyBinding(treeRoot);
} catch (Exception e) {
LOG.error(e.getMessage());
throw e;
}
- NodeHelper.compareXmlTree(shadowTree, "./config02g-shadow.xml", getClass());
+ NodeHelper.compareXmlTree(shadowTree, "./config02g-shadow.xml", getClass());
}
private static void checkFamilyBinding(final CompositeNode treeRoot) throws Exception {
- Stack<CompositeNode> jobQueue = new Stack<>();
+ Deque<CompositeNode> jobQueue = new LinkedList<>();
jobQueue.push(treeRoot);
while (!jobQueue.isEmpty()) {