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;
10 import static com.google.common.base.Preconditions.checkArgument;
11 import static com.google.common.base.Verify.verify;
12 import static java.util.Objects.requireNonNull;
14 import com.google.common.annotations.Beta;
15 import com.google.common.base.VerifyException;
16 import com.google.common.cache.CacheBuilder;
17 import com.google.common.cache.CacheLoader;
18 import com.google.common.cache.LoadingCache;
19 import com.google.common.collect.ImmutableList;
20 import com.google.common.collect.ImmutableMap;
21 import com.google.common.collect.ImmutableSet;
22 import com.google.common.collect.Iterables;
23 import com.google.common.collect.Sets;
24 import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
25 import java.io.Serializable;
26 import java.lang.reflect.Array;
27 import java.util.AbstractMap.SimpleImmutableEntry;
28 import java.util.ArrayList;
29 import java.util.Arrays;
30 import java.util.Collection;
31 import java.util.Deque;
32 import java.util.Iterator;
33 import java.util.List;
35 import java.util.Map.Entry;
36 import java.util.Objects;
37 import java.util.Optional;
39 import java.util.concurrent.atomic.AtomicReferenceFieldUpdater;
40 import java.util.function.Function;
41 import org.eclipse.jdt.annotation.NonNull;
42 import org.eclipse.jdt.annotation.Nullable;
43 import org.opendaylight.yangtools.concepts.Builder;
44 import org.opendaylight.yangtools.concepts.Immutable;
45 import org.opendaylight.yangtools.concepts.Path;
46 import org.opendaylight.yangtools.util.HashCodeBuilder;
47 import org.opendaylight.yangtools.util.ImmutableOffsetMap;
48 import org.opendaylight.yangtools.util.SharedSingletonMap;
49 import org.opendaylight.yangtools.util.SingletonSet;
50 import org.opendaylight.yangtools.yang.common.QName;
51 import org.opendaylight.yangtools.yang.common.QNameModule;
52 import org.opendaylight.yangtools.yang.data.api.schema.LeafSetEntryNode;
55 * Unique identifier of a particular node instance in the data tree.
58 * Java representation of YANG Built-in type <code>instance-identifier</code>,
59 * which conceptually is XPath expression minimized to uniquely identify element
60 * in data tree which conforms to constraints maintained by YANG Model,
61 * effectively this makes Instance Identifier a path to element in data tree.
64 * Constraints put in YANG specification on instance-identifier allowed it to be
65 * effectively represented in Java and it's evaluation does not require
66 * full-blown XPath processor.
69 * <h3>Path Arguments</h3>
70 * Path to the node represented in instance identifier consists of
71 * {@link PathArgument} which carries necessary information to uniquely identify
72 * node on particular level in the subtree.
75 * <li>{@link NodeIdentifier} - Identifier of node, which has cardinality
76 * <code>0..1</code> in particular subtree in data tree.</li>
77 * <li>{@link NodeIdentifierWithPredicates} - Identifier of node (list item),
78 * which has cardinality <code>0..n</code>.</li>
79 * <li>{@link NodeWithValue} - Identifier of instance <code>leaf</code> node or
80 * <code>leaf-list</code> node.</li>
81 * <li>{@link AugmentationIdentifier} - Identifier of instance of
82 * <code>augmentation</code> node.</li>
85 * @see <a href="http://tools.ietf.org/html/rfc6020#section-9.13">RFC6020</a>
87 // FIXME: 6.0.0: this concept needs to be moved to yang-common, as parser components need the ability to refer
88 // to data nodes -- most notably XPath expressions and {@code default} statement arguments need to be able
89 // to represent these.
90 public abstract class YangInstanceIdentifier implements Path<YangInstanceIdentifier>, Immutable, Serializable {
91 private static final AtomicReferenceFieldUpdater<YangInstanceIdentifier, String> TOSTRINGCACHE_UPDATER =
92 AtomicReferenceFieldUpdater.newUpdater(YangInstanceIdentifier.class, String.class, "toStringCache");
93 private static final long serialVersionUID = 4L;
95 private final int hash;
96 private transient volatile String toStringCache = null;
98 // Package-private to prevent outside subclassing
99 YangInstanceIdentifier(final int hash) {
104 * Return An empty {@link YangInstanceIdentifier}. It corresponds to the path of the conceptual root of the YANG
107 * @return An empty YangInstanceIdentifier
109 public static @NonNull YangInstanceIdentifier empty() {
110 return FixedYangInstanceIdentifier.EMPTY_INSTANCE;
113 abstract @NonNull YangInstanceIdentifier createRelativeIdentifier(int skipFromRoot);
115 abstract @Nullable Collection<PathArgument> tryPathArguments();
117 abstract @Nullable Collection<PathArgument> tryReversePathArguments();
120 * Check if this instance identifier has empty path arguments, e.g. it is
121 * empty and corresponds to {@link #empty()}.
123 * @return True if this instance identifier is empty, false otherwise.
125 public abstract boolean isEmpty();
128 * Return an optimized version of this identifier, useful when the identifier
129 * will be used very frequently.
131 * @return A optimized equivalent instance.
134 public abstract @NonNull YangInstanceIdentifier toOptimized();
137 * Return the conceptual parent {@link YangInstanceIdentifier}, which has
138 * one item less in {@link #getPathArguments()}.
140 * @return Parent {@link YangInstanceIdentifier}, or null if this object is {@link #empty()}.
142 public abstract @Nullable YangInstanceIdentifier getParent();
145 * Return the conceptual parent {@link YangInstanceIdentifier}, which has one item less in
146 * {@link #getPathArguments()}.
148 * @return Parent {@link YangInstanceIdentifier}
149 * @throws VerifyException if this object is {@link #empty()}.
151 public abstract @NonNull YangInstanceIdentifier coerceParent();
154 * Return the ancestor {@link YangInstanceIdentifier} with a particular depth, e.g. number of path arguments.
156 * @param depth Ancestor depth
157 * @return Ancestor {@link YangInstanceIdentifier}
158 * @throws IllegalArgumentException if the specified depth is negative or is greater than the depth of this object.
160 public abstract @NonNull YangInstanceIdentifier getAncestor(int depth);
163 * Returns an ordered iteration of path arguments.
165 * @return Immutable iteration of path arguments.
167 public abstract @NonNull List<PathArgument> getPathArguments();
170 * Returns an iterable of path arguments in reverse order. This is useful
171 * when walking up a tree organized this way.
173 * @return Immutable iterable of path arguments in reverse order.
175 public abstract @NonNull List<PathArgument> getReversePathArguments();
178 * Returns the last PathArgument. This is equivalent of iterating
179 * to the last element of the iterable returned by {@link #getPathArguments()}.
181 * @return The last past argument, or null if there are no PathArguments.
183 public abstract PathArgument getLastPathArgument();
185 public static @NonNull YangInstanceIdentifier create(final Iterable<? extends PathArgument> path) {
186 if (Iterables.isEmpty(path)) {
190 final HashCodeBuilder<PathArgument> hash = new HashCodeBuilder<>();
191 for (PathArgument a : path) {
195 return FixedYangInstanceIdentifier.create(path, hash.build());
198 public static @NonNull YangInstanceIdentifier create(final PathArgument... path) {
199 // We are forcing a copy, since we cannot trust the user
200 return create(Arrays.asList(path));
204 * Create a {@link YangInstanceIdentifier} by taking a snapshot of provided path and iterating it backwards.
206 * @param pathTowardsRoot Path towards root
207 * @return A {@link YangInstanceIdentifier} instance
208 * @throws NullPointerException if {@code pathTowardsRoot} or any of its members is null
210 public static @NonNull YangInstanceIdentifier createReverse(final Deque<PathArgument> pathTowardsRoot) {
211 final ImmutableList.Builder<PathArgument> builder = ImmutableList.builderWithExpectedSize(
212 pathTowardsRoot.size());
213 pathTowardsRoot.descendingIterator().forEachRemaining(builder::add);
214 return YangInstanceIdentifier.create(builder.build());
218 * Create a {@link YangInstanceIdentifier} by walking specified stack backwards and extracting path components
221 * @param stackTowardsRoot Stack towards root,
222 * @return A {@link YangInstanceIdentifier} instance
223 * @throws NullPointerException if {@code pathTowardsRoot} is null
225 public static <T> @NonNull YangInstanceIdentifier createReverse(final Deque<? extends T> stackTowardsRoot,
226 final Function<T, PathArgument> function) {
227 final ImmutableList.Builder<PathArgument> builder = ImmutableList.builderWithExpectedSize(
228 stackTowardsRoot.size());
229 final Iterator<? extends T> it = stackTowardsRoot.descendingIterator();
230 while (it.hasNext()) {
231 builder.add(function.apply(it.next()));
233 return YangInstanceIdentifier.create(builder.build());
236 boolean pathArgumentsEqual(final YangInstanceIdentifier other) {
237 return Iterables.elementsEqual(getPathArguments(), other.getPathArguments());
241 public boolean equals(final Object obj) {
245 if (!(obj instanceof YangInstanceIdentifier)) {
248 YangInstanceIdentifier other = (YangInstanceIdentifier) obj;
249 if (this.hashCode() != obj.hashCode()) {
253 return pathArgumentsEqual(other);
257 * Constructs a new Instance Identifier with new {@link NodeIdentifier} added to the end of path arguments.
259 * @param name QName of {@link NodeIdentifier}
260 * @return Instance Identifier with additional path argument added to the end.
262 public final @NonNull YangInstanceIdentifier node(final QName name) {
263 return node(new NodeIdentifier(name));
267 * Constructs a new Instance Identifier with new {@link PathArgument} added to the end of path arguments.
269 * @param arg Path argument which should be added to the end
270 * @return Instance Identifier with additional path argument added to the end.
272 public final @NonNull YangInstanceIdentifier node(final PathArgument arg) {
273 return new StackedYangInstanceIdentifier(this, arg, HashCodeBuilder.nextHashCode(hash, arg));
277 * Get the relative path from an ancestor. This method attempts to perform
278 * the reverse of concatenating a base (ancestor) and a path.
281 * Ancestor against which the relative path should be calculated
282 * @return This object's relative path from parent, or Optional.absent() if
283 * the specified parent is not in fact an ancestor of this object.
285 public Optional<YangInstanceIdentifier> relativeTo(final YangInstanceIdentifier ancestor) {
286 if (this == ancestor) {
287 return Optional.of(empty());
289 if (ancestor.isEmpty()) {
290 return Optional.of(this);
293 final Iterator<PathArgument> lit = getPathArguments().iterator();
294 final Iterator<PathArgument> oit = ancestor.getPathArguments().iterator();
297 while (oit.hasNext()) {
298 // Ancestor is not really an ancestor
299 if (!lit.hasNext() || !lit.next().equals(oit.next())) {
300 return Optional.empty();
307 return Optional.of(this);
309 if (!lit.hasNext()) {
310 return Optional.of(empty());
313 return Optional.of(createRelativeIdentifier(common));
317 public final boolean contains(final YangInstanceIdentifier other) {
322 checkArgument(other != null, "other should not be null");
323 final Iterator<PathArgument> lit = getPathArguments().iterator();
324 final Iterator<PathArgument> oit = other.getPathArguments().iterator();
326 while (lit.hasNext()) {
327 if (!oit.hasNext()) {
331 if (!lit.next().equals(oit.next())) {
340 public final String toString() {
342 * The toStringCache is safe, since the object contract requires
343 * immutability of the object and all objects referenced from this
345 * Used lists, maps are immutable. Path Arguments (elements) are also
346 * immutable, since the PathArgument contract requires immutability.
347 * The cache is thread-safe - if multiple computations occurs at the
348 * same time, cache will be overwritten with same result.
350 String ret = toStringCache;
352 final StringBuilder builder = new StringBuilder("/");
353 PathArgument prev = null;
354 for (PathArgument argument : getPathArguments()) {
358 builder.append(argument.toRelativeString(prev));
362 ret = builder.toString();
363 TOSTRINGCACHE_UPDATER.lazySet(this, ret);
369 public final int hashCode() {
371 * The caching is safe, since the object contract requires
372 * immutability of the object and all objects referenced from this
374 * Used lists, maps are immutable. Path Arguments (elements) are also
375 * immutable, since the PathArgument contract requires immutability.
380 @SuppressFBWarnings(value = "UPM_UNCALLED_PRIVATE_METHOD",
381 justification = "https://github.com/spotbugs/spotbugs/issues/811")
382 private static int hashCode(final Object value) {
387 if (byte[].class.equals(value.getClass())) {
388 return Arrays.hashCode((byte[]) value);
391 if (value.getClass().isArray()) {
393 int length = Array.getLength(value);
394 for (int i = 0; i < length; i++) {
395 hash += Objects.hashCode(Array.get(value, i));
401 return Objects.hashCode(value);
404 final Object writeReplace() {
405 return new YIDv1(this);
408 // Static factories & helpers
411 * Returns a new InstanceIdentifier with only one path argument of type {@link NodeIdentifier} with supplied
414 * @param name QName of first node identifier
415 * @return Instance Identifier with only one path argument of type {@link NodeIdentifier}
417 public static @NonNull YangInstanceIdentifier of(final QName name) {
418 return create(new NodeIdentifier(name));
422 * Returns new builder for InstanceIdentifier with empty path arguments.
424 * @return new builder for InstanceIdentifier with empty path arguments.
426 public static @NonNull InstanceIdentifierBuilder builder() {
427 return new YangInstanceIdentifierBuilder();
431 * Returns new builder for InstanceIdentifier with path arguments copied from original instance identifier.
433 * @param origin InstanceIdentifier from which path arguments are copied.
434 * @return new builder for InstanceIdentifier with path arguments copied from original instance identifier.
436 public static @NonNull InstanceIdentifierBuilder builder(final YangInstanceIdentifier origin) {
437 return new YangInstanceIdentifierBuilder(origin.getPathArguments(), origin.hashCode());
441 * Path argument / component of InstanceIdentifier.
442 * Path argument uniquely identifies node in data tree on particular
446 * This interface itself is used as common parent for actual
447 * path arguments types and should not be implemented by user code.
450 * Path arguments SHOULD contain only minimum of information
451 * required to uniquely identify node on particular subtree level.
454 * For actual path arguments types see:
456 * <li>{@link NodeIdentifier} - Identifier of container or leaf
457 * <li>{@link NodeIdentifierWithPredicates} - Identifier of list entries, which have key defined
458 * <li>{@link AugmentationIdentifier} - Identifier of augmentation
459 * <li>{@link NodeWithValue} - Identifier of leaf-list entry
462 public interface PathArgument extends Comparable<PathArgument>, Immutable, Serializable {
464 * Returns unique QName of data node as defined in YANG Schema, if available.
467 * @throws UnsupportedOperationException if node type is not applicable, for example in case of an augmentation.
469 @NonNull QName getNodeType();
472 * Return the string representation of this object for use in context
473 * provided by a previous object. This method can be implemented in
474 * terms of {@link #toString()}, but implementations are encourage to
475 * reuse any context already emitted by the previous object.
477 * @param previous Previous path argument
478 * @return String representation
480 @NonNull String toRelativeString(PathArgument previous);
483 private abstract static class AbstractPathArgument implements PathArgument {
484 private static final long serialVersionUID = -4546547994250849340L;
485 private final @NonNull QName nodeType;
486 private transient volatile int hashValue;
488 protected AbstractPathArgument(final QName nodeType) {
489 this.nodeType = requireNonNull(nodeType);
493 public final QName getNodeType() {
498 @SuppressWarnings("checkstyle:parameterName")
499 public int compareTo(final PathArgument o) {
500 return nodeType.compareTo(o.getNodeType());
503 protected int hashCodeImpl() {
504 return nodeType.hashCode();
508 public final int hashCode() {
510 return (local = hashValue) != 0 ? local : (hashValue = hashCodeImpl());
514 public boolean equals(final Object obj) {
518 if (obj == null || this.getClass() != obj.getClass()) {
522 return getNodeType().equals(((AbstractPathArgument)obj).getNodeType());
526 public String toString() {
527 return getNodeType().toString();
531 public String toRelativeString(final PathArgument previous) {
532 if (previous instanceof AbstractPathArgument) {
533 final QNameModule mod = previous.getNodeType().getModule();
534 if (getNodeType().getModule().equals(mod)) {
535 return getNodeType().getLocalName();
539 return getNodeType().toString();
542 abstract Object writeReplace();
546 * Simple path argument identifying a {@link org.opendaylight.yangtools.yang.data.api.schema.ContainerNode} or
547 * {@link org.opendaylight.yangtools.yang.data.api.schema.LeafNode} leaf in particular subtree.
549 public static final class NodeIdentifier extends AbstractPathArgument {
550 private static final long serialVersionUID = -2255888212390871347L;
551 private static final LoadingCache<QName, NodeIdentifier> CACHE = CacheBuilder.newBuilder().weakValues()
552 .build(new CacheLoader<QName, NodeIdentifier>() {
554 public NodeIdentifier load(final QName key) {
555 return new NodeIdentifier(key);
559 public NodeIdentifier(final QName node) {
564 * Return a NodeIdentifier for a particular QName. Unlike the constructor, this factory method uses a global
565 * instance cache, resulting in object reuse for equal inputs.
567 * @param node Node's QName
568 * @return A {@link NodeIdentifier}
570 public static @NonNull NodeIdentifier create(final QName node) {
571 return CACHE.getUnchecked(node);
575 Object writeReplace() {
576 return new NIv1(this);
581 * Composite path argument identifying a {@link org.opendaylight.yangtools.yang.data.api.schema.MapEntryNode} leaf
584 public abstract static class NodeIdentifierWithPredicates extends AbstractPathArgument {
586 public static final class Singleton extends NodeIdentifierWithPredicates {
587 private static final long serialVersionUID = 1L;
589 private final @NonNull QName key;
590 private final @NonNull Object value;
592 Singleton(final QName node, final QName key, final Object value) {
594 this.key = requireNonNull(key);
595 this.value = requireNonNull(value);
599 public SingletonSet<Entry<QName, Object>> entrySet() {
600 return SingletonSet.of(singleEntry());
604 public SingletonSet<QName> keySet() {
605 return SingletonSet.of(key);
609 public boolean containsKey(final QName qname) {
610 return key.equals(requireNonNull(qname));
614 public SingletonSet<Object> values() {
615 return SingletonSet.of(value);
624 public ImmutableMap<QName, Object> asMap() {
625 return ImmutableMap.of(key, value);
629 * Return the single entry contained in this object. This is equivalent to
630 * {@code entrySet().iterator().next()}.
632 * @return A single entry.
634 public @NonNull Entry<QName, Object> singleEntry() {
635 return new SimpleImmutableEntry<>(key, value);
639 boolean equalMapping(final NodeIdentifierWithPredicates other) {
640 final Singleton single = (Singleton) other;
641 return key.equals(single.key) && Objects.deepEquals(value, single.value);
645 Object keyValue(final QName qname) {
646 return key.equals(qname) ? value : null;
650 private static final class Regular extends NodeIdentifierWithPredicates {
651 private static final long serialVersionUID = 1L;
653 private final @NonNull Map<QName, Object> keyValues;
655 Regular(final QName node, final Map<QName, Object> keyValues) {
657 this.keyValues = requireNonNull(keyValues);
661 public Set<Entry<QName, Object>> entrySet() {
662 return keyValues.entrySet();
666 public Set<QName> keySet() {
667 return keyValues.keySet();
671 public boolean containsKey(final QName qname) {
672 return keyValues.containsKey(requireNonNull(qname));
676 public Collection<Object> values() {
677 return keyValues.values();
682 return keyValues.size();
686 public Map<QName, Object> asMap() {
691 Object keyValue(final QName qname) {
692 return keyValues.get(qname);
696 boolean equalMapping(final NodeIdentifierWithPredicates other) {
697 final Map<QName, Object> otherKeyValues = ((Regular) other).keyValues;
698 // TODO: benchmark to see if just calling equals() on the two maps is not faster
699 if (keyValues == otherKeyValues) {
702 if (keyValues.size() != otherKeyValues.size()) {
706 for (Entry<QName, Object> entry : entrySet()) {
707 final Object otherValue = otherKeyValues.get(entry.getKey());
708 if (otherValue == null || !Objects.deepEquals(entry.getValue(), otherValue)) {
717 private static final long serialVersionUID = -4787195606494761540L;
719 NodeIdentifierWithPredicates(final QName node) {
723 public static @NonNull NodeIdentifierWithPredicates of(final QName node) {
724 return new Regular(node, ImmutableMap.of());
727 public static @NonNull NodeIdentifierWithPredicates of(final QName node, final QName key, final Object value) {
728 return new Singleton(node, key, value);
731 public static @NonNull NodeIdentifierWithPredicates of(final QName node, final Entry<QName, Object> entry) {
732 return of(node, entry.getKey(), entry.getValue());
735 public static @NonNull NodeIdentifierWithPredicates of(final QName node, final Map<QName, Object> keyValues) {
736 return keyValues.size() == 1 ? of(keyValues, node)
737 // Retains ImmutableMap for empty maps. For larger sizes uses a shared key set.
738 : new Regular(node, ImmutableOffsetMap.unorderedCopyOf(keyValues));
741 public static @NonNull NodeIdentifierWithPredicates of(final QName node,
742 final ImmutableOffsetMap<QName, Object> keyValues) {
743 return keyValues.size() == 1 ? of(keyValues, node) : new Regular(node, keyValues);
747 public static @NonNull NodeIdentifierWithPredicates of(final QName node,
748 final SharedSingletonMap<QName, Object> keyValues) {
749 return of(node, keyValues.getEntry());
752 private static @NonNull NodeIdentifierWithPredicates of(final Map<QName, Object> keyValues, final QName node) {
753 return of(node, keyValues.entrySet().iterator().next());
757 * Return the set of predicates keys and values. Keys are guaranteeed to be unique.
759 * @return Predicate set.
762 public abstract @NonNull Set<Entry<QName, Object>> entrySet();
765 * Return the predicate key in the iteration order of {@link #entrySet()}.
767 * @return Predicate values.
770 public abstract @NonNull Set<QName> keySet();
773 * Determine whether a particular predicate key is present.
775 * @param key Predicate key
776 * @return True if the predicate is present, false otherwise
777 * @throws NullPointerException if {@code key} is null
780 public abstract boolean containsKey(QName key);
783 * Return the predicate values in the iteration order of {@link #entrySet()}.
785 * @return Predicate values.
788 public abstract @NonNull Collection<Object> values();
791 public final @Nullable Object getValue(final QName key) {
792 return keyValue(requireNonNull(key));
796 public final <T> @Nullable T getValue(final QName key, final Class<T> valueClass) {
797 return valueClass.cast(getValue(key));
801 * Return the number of predicates present.
803 * @return The number of predicates present.
806 public abstract int size();
809 * A Map-like view of this identifier's predicates. The view is expected to be stable and effectively-immutable.
811 * @return Map of predicates.
812 * @deprecated This method in a provisional one. It can be used in the code base, but users requiring it should
813 * contact <a href="mailto:yangtools-dev@lists.opendaylight.org">yangtools-dev</a> for migration
814 * guidelines. Callers are strongly encouraged to explore {@link #entrySet()}, {@link #size()},
815 * {@link #values()} and {@link #keySet()} as an alternative.
819 // FIXME: 6.0.0: evaluate the real usefulness of this. The problem here is Map.hashCode() and Map.equals(),
820 // which limits our options.
821 public abstract @NonNull Map<QName, Object> asMap();
824 protected final int hashCodeImpl() {
825 int result = 31 * super.hashCodeImpl();
826 for (Entry<QName, Object> entry : entrySet()) {
827 result += entry.getKey().hashCode() + YangInstanceIdentifier.hashCode(entry.getValue());
833 @SuppressWarnings("checkstyle:equalsHashCode")
834 public final boolean equals(final Object obj) {
835 return super.equals(obj) && equalMapping((NodeIdentifierWithPredicates) obj);
838 abstract boolean equalMapping(NodeIdentifierWithPredicates other);
840 abstract @Nullable Object keyValue(@NonNull QName qname);
843 public final String toString() {
844 return super.toString() + '[' + asMap() + ']';
848 public final String toRelativeString(final PathArgument previous) {
849 return super.toRelativeString(previous) + '[' + asMap() + ']';
853 final Object writeReplace() {
854 return new NIPv2(this);
859 * Simple path argument identifying a {@link LeafSetEntryNode} leaf
862 public static final class NodeWithValue<T> extends AbstractPathArgument {
863 private static final long serialVersionUID = -3637456085341738431L;
865 private final T value;
867 public NodeWithValue(final QName node, final T value) {
872 public T getValue() {
877 protected int hashCodeImpl() {
878 return 31 * super.hashCodeImpl() + YangInstanceIdentifier.hashCode(value);
882 @SuppressWarnings("checkstyle:equalsHashCode")
883 public boolean equals(final Object obj) {
884 if (!super.equals(obj)) {
887 final NodeWithValue<?> other = (NodeWithValue<?>) obj;
888 return Objects.deepEquals(value, other.value);
892 public String toString() {
893 return super.toString() + '[' + value + ']';
897 public String toRelativeString(final PathArgument previous) {
898 return super.toRelativeString(previous) + '[' + value + ']';
902 Object writeReplace() {
903 return new NIVv1(this);
908 * Composite path argument identifying a {@link org.opendaylight.yangtools.yang.data.api.schema.AugmentationNode}
909 * node in particular subtree.
912 * Augmentation is uniquely identified by set of all possible child nodes.
914 * to identify instance of augmentation,
915 * since RFC6020 states that <code>augment</code> that augment
916 * statement must not add multiple nodes from same namespace
917 * / module to the target node.
919 * @see <a href="http://tools.ietf.org/html/rfc6020#section-7.15">RFC6020</a>
921 public static final class AugmentationIdentifier implements PathArgument {
922 private static final long serialVersionUID = -8122335594681936939L;
924 private static final LoadingCache<ImmutableSet<QName>, AugmentationIdentifier> CACHE = CacheBuilder.newBuilder()
925 .weakValues().build(new CacheLoader<ImmutableSet<QName>, AugmentationIdentifier>() {
927 public AugmentationIdentifier load(final ImmutableSet<QName> key) {
928 return new AugmentationIdentifier(key);
932 private final @NonNull ImmutableSet<QName> childNames;
935 public QName getNodeType() {
936 // This should rather throw exception than return always null
937 throw new UnsupportedOperationException("Augmentation node has no QName");
941 * Construct new augmentation identifier using supplied set of possible
945 * Set of possible child nodes.
947 public AugmentationIdentifier(final ImmutableSet<QName> childNames) {
948 this.childNames = requireNonNull(childNames);
952 * Construct new augmentation identifier using supplied set of possible
956 * Set of possible child nodes.
958 public AugmentationIdentifier(final Set<QName> childNames) {
959 this.childNames = ImmutableSet.copyOf(childNames);
963 * Return an AugmentationIdentifier for a particular set of QNames. Unlike the constructor, this factory method
964 * uses a global instance cache, resulting in object reuse for equal inputs.
966 * @param childNames Set of possible child nodes
967 * @return An {@link AugmentationIdentifier}
969 public static @NonNull AugmentationIdentifier create(final ImmutableSet<QName> childNames) {
970 return CACHE.getUnchecked(childNames);
974 * Return an AugmentationIdentifier for a particular set of QNames. Unlike the constructor, this factory method
975 * uses a global instance cache, resulting in object reuse for equal inputs.
977 * @param childNames Set of possible child nodes
978 * @return An {@link AugmentationIdentifier}
980 public static @NonNull AugmentationIdentifier create(final Set<QName> childNames) {
981 final AugmentationIdentifier existing = CACHE.getIfPresent(childNames);
982 return existing != null ? existing : create(ImmutableSet.copyOf(childNames));
986 * Returns set of all possible child nodes.
988 * @return set of all possible child nodes.
990 public @NonNull Set<QName> getPossibleChildNames() {
995 public String toString() {
996 return "AugmentationIdentifier{" + "childNames=" + childNames + '}';
1000 public String toRelativeString(final PathArgument previous) {
1005 public boolean equals(final Object obj) {
1009 if (!(obj instanceof AugmentationIdentifier)) {
1013 AugmentationIdentifier that = (AugmentationIdentifier) obj;
1014 return childNames.equals(that.childNames);
1018 public int hashCode() {
1019 return childNames.hashCode();
1023 @SuppressWarnings("checkstyle:parameterName")
1024 public int compareTo(final PathArgument o) {
1025 if (!(o instanceof AugmentationIdentifier)) {
1028 AugmentationIdentifier other = (AugmentationIdentifier) o;
1029 Set<QName> otherChildNames = other.getPossibleChildNames();
1030 int thisSize = childNames.size();
1031 int otherSize = otherChildNames.size();
1032 if (thisSize == otherSize) {
1033 // Quick Set-based comparison
1034 if (childNames.equals(otherChildNames)) {
1038 // We already know the sets are not equal, but have equal size, hence the sets differ in their elements,
1039 // but potentially share a common set of elements. The most consistent way of comparing them is using
1040 // total ordering defined by QName's compareTo. Hence convert both sets to lists ordered
1041 // by QName.compareTo() and decide on the first differing element.
1042 final List<QName> diff = new ArrayList<>(Sets.symmetricDifference(childNames, otherChildNames));
1043 verify(!diff.isEmpty(), "Augmentation identifiers %s and %s report no difference", this, o);
1044 diff.sort(QName::compareTo);
1045 return childNames.contains(diff.get(0)) ? -1 : 1;
1046 } else if (thisSize < otherSize) {
1053 private Object writeReplace() {
1054 return new AIv1(this);
1059 * Fluent Builder of Instance Identifier instances.
1061 public interface InstanceIdentifierBuilder extends Builder<YangInstanceIdentifier> {
1063 * Adds a {@link PathArgument} to path arguments of resulting instance identifier.
1065 * @param arg A {@link PathArgument} to be added
1066 * @return this builder
1068 @NonNull InstanceIdentifierBuilder node(PathArgument arg);
1071 * Adds {@link NodeIdentifier} with supplied QName to path arguments of resulting instance identifier.
1073 * @param nodeType QName of {@link NodeIdentifier} which will be added
1074 * @return this builder
1076 @NonNull InstanceIdentifierBuilder node(QName nodeType);
1079 * Adds {@link NodeIdentifierWithPredicates} with supplied QName and key values to path arguments of resulting
1080 * instance identifier.
1082 * @param nodeType QName of {@link NodeIdentifierWithPredicates} which will be added
1083 * @param keyValues Map of key components and their respective values for {@link NodeIdentifierWithPredicates}
1084 * @return this builder
1086 @NonNull InstanceIdentifierBuilder nodeWithKey(QName nodeType, Map<QName, Object> keyValues);
1089 * Adds {@link NodeIdentifierWithPredicates} with supplied QName and key, value.
1091 * @param nodeType QName of {@link NodeIdentifierWithPredicates} which will be added
1092 * @param key QName of key which will be added
1093 * @param value value of key which will be added
1094 * @return this builder
1096 @NonNull InstanceIdentifierBuilder nodeWithKey(QName nodeType, QName key, Object value);
1099 * Adds a collection of {@link PathArgument}s to path arguments of resulting instance identifier.
1101 * @param args {@link PathArgument}s to be added
1102 * @return this builder
1103 * @throws NullPointerException if any of the arguments is null
1106 @NonNull InstanceIdentifierBuilder append(Collection<? extends PathArgument> args);
1109 * Adds a collection of {@link PathArgument}s to path arguments of resulting instance identifier.
1111 * @param args {@link PathArgument}s to be added
1112 * @return this builder
1113 * @throws NullPointerException if any of the arguments is null
1116 default @NonNull InstanceIdentifierBuilder append(final PathArgument... args) {
1117 return append(Arrays.asList(args));
1121 * Builds an {@link YangInstanceIdentifier} with path arguments from this builder.
1123 * @return {@link YangInstanceIdentifier}
1126 YangInstanceIdentifier build();