/* * 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.yangtools.yang.data.api.schema; import static com.google.common.base.Preconditions.checkNotNull; import com.google.common.annotations.Beta; import com.google.common.base.Optional; import com.google.common.base.Strings; import java.util.Iterator; import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier; import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.AugmentationIdentifier; import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifierWithPredicates; import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeWithValue; import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument; /** * A set of utility methods for interacting with {@link NormalizedNode} objects. */ @Beta public final class NormalizedNodes { private static final int STRINGTREE_INDENT = 4; private NormalizedNodes() { throw new UnsupportedOperationException("Utility class should not be instantiated"); } public static Optional> findNode(final YangInstanceIdentifier rootPath, final NormalizedNode rootNode, final YangInstanceIdentifier childPath) { final Optional relativePath = childPath.relativeTo(rootPath); if (relativePath.isPresent()) { return findNode(rootNode, relativePath.get()); } else { return Optional.absent(); } } public static Optional> findNode(final NormalizedNode tree, final YangInstanceIdentifier path) { checkNotNull(tree, "Tree must not be null"); checkNotNull(path, "Path must not be null"); Optional> currentNode = Optional.> of(tree); final Iterator pathIterator = path.getPathArguments().iterator(); while (currentNode.isPresent() && pathIterator.hasNext()) { currentNode = getDirectChild(currentNode.get(), pathIterator.next()); } return currentNode; } @SuppressWarnings({ "unchecked", "rawtypes" }) public static Optional> getDirectChild(final NormalizedNode node, final PathArgument pathArg) { if (node instanceof LeafNode || node instanceof LeafSetEntryNode) { return Optional.absent(); } else if (node instanceof DataContainerNode) { return (Optional) ((DataContainerNode) node).getChild(pathArg); } else if (node instanceof MapNode && pathArg instanceof NodeIdentifierWithPredicates) { return (Optional) ((MapNode) node).getChild((NodeIdentifierWithPredicates) pathArg); } else if (node instanceof LeafSetNode) { return (Optional) ((LeafSetNode) node).getChild((NodeWithValue) pathArg); } return Optional.absent(); } /** * Convert a data subtree under a node into a human-readable string format. * * @param node Data subtree root * @return String containing a human-readable form of the subtree. */ public static String toStringTree(final NormalizedNode node) { final StringBuilder builder = new StringBuilder(); toStringTree(builder, node, 0); return builder.toString(); } private static void toStringTree(final StringBuilder builder, final NormalizedNode node, final int offset) { final String prefix = Strings.repeat(" ", offset); builder.append(prefix).append(toStringTree(node.getIdentifier())); if (node instanceof NormalizedNodeContainer) { final NormalizedNodeContainer container = (NormalizedNodeContainer) node; builder.append(" {\n"); for (NormalizedNode child : container.getValue()) { toStringTree(builder, child, offset + STRINGTREE_INDENT); } builder.append(prefix).append('}'); } else { builder.append(' ').append(node.getValue()); } builder.append('\n'); } private static String toStringTree(final PathArgument identifier) { if (identifier instanceof NodeIdentifierWithPredicates) { StringBuilder builder = new StringBuilder(); builder.append(identifier.getNodeType().getLocalName()); builder.append(((NodeIdentifierWithPredicates) identifier).getKeyValues().values()); return builder.toString(); } else if (identifier instanceof AugmentationIdentifier) { return "augmentation"; } else { return identifier.getNodeType().getLocalName(); } } }