2 * Copyright (c) 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
8 package org.opendaylight.yangtools.yang.data.impl.schema.tree;
10 import com.google.common.base.Function;
11 import com.google.common.base.Optional;
12 import com.google.common.base.Preconditions;
13 import com.google.common.collect.Collections2;
14 import com.google.common.collect.Maps;
15 import java.util.ArrayList;
16 import java.util.Collection;
18 import javax.annotation.Nullable;
19 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
20 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
21 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNodeContainer;
22 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidateNode;
24 abstract class AbstractDataTreeCandidateNode implements DataTreeCandidateNode {
25 private static final Function<NormalizedNode<?, ?>, DataTreeCandidateNode> TO_DELETED_NODE = new Function<NormalizedNode<?, ?>, DataTreeCandidateNode>() {
27 public DataTreeCandidateNode apply(final NormalizedNode<?, ?> input) {
28 return AbstractRecursiveCandidateNode.deleteNode(input);
31 private static final Function<NormalizedNode<?, ?>, DataTreeCandidateNode> TO_WRITTEN_NODE = new Function<NormalizedNode<?, ?>, DataTreeCandidateNode>() {
33 public DataTreeCandidateNode apply(final NormalizedNode<?, ?> input) {
34 return AbstractRecursiveCandidateNode.writeNode(input);
38 private static Optional<NormalizedNode<?, ?>> getChild(final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> container, final PathArgument identifier) {
39 if (container != null) {
40 return container.getChild(identifier);
42 return Optional.absent();
46 static DataTreeCandidateNode deltaChild(
47 final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> oldData,
48 final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> newData, final PathArgument identifier) {
50 final Optional<NormalizedNode<?, ?>> maybeNewChild = getChild(newData, identifier);
51 final Optional<NormalizedNode<?, ?>> maybeOldChild = getChild(oldData, identifier);
52 if (maybeOldChild.isPresent()) {
53 final NormalizedNode<?, ?> oldChild = maybeOldChild.get();
54 if (maybeNewChild.isPresent()) {
55 return AbstractRecursiveCandidateNode.replaceNode(oldChild, maybeNewChild.get());
57 return TO_DELETED_NODE.apply(oldChild);
60 if (maybeNewChild.isPresent()) {
61 return TO_WRITTEN_NODE.apply(maybeNewChild.get());
68 static Collection<DataTreeCandidateNode> deltaChildren(@Nullable final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> oldData,
69 @Nullable final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> newData) {
70 if (newData == null) {
71 return Collections2.transform(oldData.getValue(), TO_DELETED_NODE);
73 if (oldData == null) {
74 return Collections2.transform(newData.getValue(), TO_WRITTEN_NODE);
77 // Create index for fast cross-references
78 // FIXME: speed this up by exposing maps inside ImmutableMapNode and similar.
79 final Map<PathArgument, NormalizedNode<?, ?>> oldChildren = Maps.newHashMapWithExpectedSize(oldData.getValue().size());
80 for (NormalizedNode<?, ?> child : oldData.getValue()) {
81 oldChildren.put(child.getIdentifier(), child);
84 final Collection<DataTreeCandidateNode> ret = new ArrayList<>(Math.max(oldChildren.size(), newData.getValue().size()));
85 for (NormalizedNode<?, ?> child : newData.getValue()) {
86 // Slight optimization iterator length
87 final NormalizedNode<?, ?> oldChild = oldChildren.remove(child.getIdentifier());
88 final DataTreeCandidateNode node;
89 if (oldChild == null) {
90 node = AbstractRecursiveCandidateNode.writeNode(child);
92 node = AbstractRecursiveCandidateNode.replaceNode(oldChild, child);
98 for (NormalizedNode<?, ?> child : oldChildren.values()) {
99 ret.add(AbstractRecursiveCandidateNode.deleteNode(child));
105 private final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?,?>> data;
107 protected AbstractDataTreeCandidateNode(final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> data) {
108 this.data = Preconditions.checkNotNull(data);
111 protected final Optional<NormalizedNode<?, ?>> dataOptional() {
112 return Optional.<NormalizedNode<?, ?>>of(data);
116 public final PathArgument getIdentifier() {
117 return data.getIdentifier();
120 protected final NormalizedNodeContainer<?, PathArgument, NormalizedNode<?, ?>> getData() {