2 * Copyright (c) 2014, 2015 Cisco Systems, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
9 package org.opendaylight.controller.cluster.datastore.node.utils;
11 import com.google.common.base.Preconditions;
12 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
13 import org.opendaylight.yangtools.yang.data.api.schema.DataContainerChild;
14 import org.opendaylight.yangtools.yang.data.api.schema.DataContainerNode;
15 import org.opendaylight.yangtools.yang.data.api.schema.MixinNode;
16 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
17 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNodeContainer;
20 * NormalizedNodeNavigator walks a {@link NormalizedNodeVisitor} through the NormalizedNode.
22 public class NormalizedNodeNavigator {
24 private final org.opendaylight.controller.cluster.datastore.node.utils.NormalizedNodeVisitor visitor;
26 public NormalizedNodeNavigator(
27 org.opendaylight.controller.cluster.datastore.node.utils.NormalizedNodeVisitor visitor) {
28 Preconditions.checkNotNull(visitor, "visitor should not be null");
29 this.visitor = visitor;
32 public void navigate(String parentPath, NormalizedNode<?, ?> normalizedNode) {
33 if (parentPath == null) {
36 navigateNormalizedNode(0, parentPath, normalizedNode);
39 private void navigateDataContainerNode(int level, final String parentPath,
40 final DataContainerNode<?> dataContainerNode) {
41 visitor.visitNode(level, parentPath, dataContainerNode);
43 String newParentPath = parentPath + "/" + dataContainerNode.getIdentifier().toString();
45 final Iterable<DataContainerChild<? extends YangInstanceIdentifier.PathArgument, ?>> value = dataContainerNode
47 for (NormalizedNode<?, ?> node : value) {
48 if (node instanceof MixinNode && node instanceof NormalizedNodeContainer) {
49 navigateNormalizedNodeContainerMixin(level, newParentPath, (NormalizedNodeContainer<?, ?, ?>) node);
51 navigateNormalizedNode(level, newParentPath, node);
57 private void navigateNormalizedNodeContainerMixin(int level, final String parentPath,
58 NormalizedNodeContainer<?, ?, ?> node) {
59 visitor.visitNode(level, parentPath, node);
61 String newParentPath = parentPath + "/" + node.getIdentifier().toString();
63 final Iterable<? extends NormalizedNode<?, ?>> value = node.getValue();
64 for (NormalizedNode<?, ?> normalizedNode : value) {
65 if (normalizedNode instanceof MixinNode && normalizedNode instanceof NormalizedNodeContainer) {
66 navigateNormalizedNodeContainerMixin(level + 1, newParentPath,
67 (NormalizedNodeContainer<?, ?, ?>) normalizedNode);
69 navigateNormalizedNode(level, newParentPath, normalizedNode);
75 private void navigateNormalizedNode(int level, String parentPath, NormalizedNode<?, ?> normalizedNode) {
76 if (normalizedNode instanceof DataContainerNode) {
78 final DataContainerNode<?> dataContainerNode = (DataContainerNode<?>) normalizedNode;
80 navigateDataContainerNode(level + 1, parentPath, dataContainerNode);
82 visitor.visitNode(level + 1, parentPath, normalizedNode);