2 * Copyright (c) 2014 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
8 package org.opendaylight.yangtools.yang.data.api.schema;
10 import static java.util.Objects.requireNonNull;
12 import com.google.common.annotations.Beta;
13 import com.google.common.collect.Lists;
14 import com.google.common.collect.Maps;
15 import java.util.Arrays;
17 import java.util.Optional;
18 import org.eclipse.jdt.annotation.NonNull;
19 import org.eclipse.jdt.annotation.Nullable;
20 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
21 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.AugmentationIdentifier;
22 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifier;
23 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifierWithPredicates;
24 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeWithValue;
25 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
26 import org.opendaylight.yangtools.yang.model.api.stmt.SchemaNodeIdentifier.Descendant;
29 * A set of utility methods for interacting with {@link NormalizedNode} objects.
32 public final class NormalizedNodes {
33 private static final int STRINGTREE_INDENT = 4;
35 private NormalizedNodes() {
40 * Find duplicate NormalizedNode instances within a subtree. Duplicates are those, which compare
41 * as equal, but do not refer to the same object.
43 * @param node A normalized node subtree, may not be null
44 * @return A Map of NormalizedNode/DuplicateEntry relationships.
46 public static Map<NormalizedNode, DuplicateEntry> findDuplicates(final @NonNull NormalizedNode node) {
47 return Maps.filterValues(DuplicateFinder.findDuplicates(node), input -> !input.getDuplicates().isEmpty());
50 public static Optional<NormalizedNode> findNode(final YangInstanceIdentifier rootPath,
51 final NormalizedNode rootNode, final YangInstanceIdentifier childPath) {
52 final var relativePath = childPath.relativeTo(rootPath);
53 return relativePath.isPresent() ? findNode(rootNode, relativePath.orElseThrow()) : Optional.empty();
56 public static Optional<NormalizedNode> findNode(final Optional<NormalizedNode> parent,
57 final Iterable<PathArgument> relativePath) {
58 final var pathIterator = requireNonNull(relativePath, "Relative path must not be null").iterator();
59 var currentNode = requireNonNull(parent, "Parent must not be null");
60 while (currentNode.isPresent() && pathIterator.hasNext()) {
61 currentNode = getDirectChild(currentNode.orElseThrow(), pathIterator.next());
66 public static Optional<NormalizedNode> findNode(final Optional<NormalizedNode> parent,
67 final PathArgument pathArg) {
68 return parent.flatMap(node -> getDirectChild(node, pathArg));
71 public static Optional<NormalizedNode> findNode(final Optional<NormalizedNode> parent,
72 final PathArgument... relativePath) {
73 return findNode(parent, Arrays.asList(relativePath));
76 public static Optional<NormalizedNode> findNode(final @Nullable NormalizedNode parent,
77 final PathArgument pathArg) {
78 return parent == null ? Optional.empty() : getDirectChild(parent, pathArg);
81 public static Optional<NormalizedNode> findNode(final NormalizedNode parent,
82 final Iterable<PathArgument> relativePath) {
83 return findNode(Optional.ofNullable(parent), relativePath);
86 public static Optional<NormalizedNode> findNode(final NormalizedNode parent, final Descendant path) {
87 return findNode(Optional.ofNullable(parent),
88 Lists.transform(path.getNodeIdentifiers(), NodeIdentifier::new));
91 public static Optional<NormalizedNode> findNode(final NormalizedNode parent,
92 final PathArgument... relativePath) {
93 return findNode(parent, Arrays.asList(relativePath));
96 public static Optional<NormalizedNode> findNode(final NormalizedNode tree,
97 final YangInstanceIdentifier path) {
98 return findNode(Optional.of(requireNonNull(tree, "Tree must not be null")),
99 requireNonNull(path, "Path must not be null").getPathArguments());
102 @SuppressWarnings({ "unchecked", "rawtypes" })
103 public static Optional<NormalizedNode> getDirectChild(final NormalizedNode node,
104 final PathArgument pathArg) {
105 if (node instanceof DataContainerNode dataContainer) {
106 return (Optional) dataContainer.findChildByArg(pathArg);
107 } else if (node instanceof MapNode map && pathArg instanceof NodeIdentifierWithPredicates nip) {
108 return (Optional) map.findChildByArg(nip);
109 } else if (node instanceof LeafSetNode<?> leafSet && pathArg instanceof NodeWithValue<?> nwv) {
110 return (Optional) leafSet.findChildByArg(nwv);
112 // Anything else, including ValueNode
113 return Optional.empty();
117 * Convert a data subtree under a node into a human-readable string format.
119 * @param node Data subtree root
120 * @return String containing a human-readable form of the subtree.
122 public static String toStringTree(final NormalizedNode node) {
123 final StringBuilder sb = new StringBuilder();
124 toStringTree(sb, node, 0);
125 return sb.toString();
128 private static void toStringTree(final StringBuilder sb, final NormalizedNode node, final int offset) {
129 final String prefix = " ".repeat(offset);
130 appendPathArgument(sb.append(prefix), node.getIdentifier());
131 if (node instanceof NormalizedNodeContainer<?> container) {
133 for (var child : container.body()) {
134 toStringTree(sb, child, offset + STRINGTREE_INDENT);
136 sb.append(prefix).append('}');
138 sb.append(' ').append(node.body());
143 private static void appendPathArgument(final StringBuilder sb, final PathArgument arg) {
144 if (arg instanceof NodeIdentifierWithPredicates nip) {
145 sb.append(arg.getNodeType().getLocalName()).append(nip.values());
146 } else if (arg instanceof AugmentationIdentifier) {
147 sb.append("augmentation");
149 sb.append(arg.getNodeType().getLocalName());