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.impl.schema.tree;
10 import static java.util.Objects.requireNonNull;
12 import java.util.Optional;
13 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
14 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
15 import org.opendaylight.yangtools.yang.data.api.schema.tree.spi.TreeNode;
16 import org.opendaylight.yangtools.yang.data.api.schema.tree.spi.Version;
18 final class OperationWithModification {
19 private final ModificationApplyOperation applyOperation;
20 private final ModifiedNode modification;
22 private OperationWithModification(final ModificationApplyOperation op, final ModifiedNode mod) {
23 this.applyOperation = requireNonNull(op);
24 this.modification = requireNonNull(mod);
27 void write(final NormalizedNode<?, ?> value) {
28 modification.write(value);
30 * Fast validation of structure, full validation on written data will be run during seal.
32 applyOperation.quickVerifyStructure(value);
35 void merge(final NormalizedNode<?, ?> data, final Version version) {
37 * A merge operation will end up overwriting parts of the tree, retaining others. We want to
38 * make sure we do not validate the complete resulting structure, but rather just what was
39 * written. In order to do that, we first pretend the data was written, run verification and
40 * then perform the merge -- with the explicit assumption that adding the newly-validated
41 * data with the previously-validated data will not result in invalid data.
43 * We perform only quick validation here, full validation will be applied as-needed during
44 * preparation, as the merge is reconciled with current state.
46 applyOperation.quickVerifyStructure(data);
47 applyOperation.mergeIntoModifiedNode(modification, data, version);
51 modification.delete();
55 * Read a particular child. If the child has been modified and does not have a stable
56 * view, one will we instantiated with specified version.
58 Optional<NormalizedNode<?, ?>> read(final PathArgument child, final Version version) {
59 final Optional<ModifiedNode> maybeChild = modification.getChild(child);
60 if (maybeChild.isPresent()) {
61 final ModifiedNode childNode = maybeChild.get();
63 Optional<? extends TreeNode> snapshot = childNode.getSnapshot();
64 if (snapshot == null) {
65 // Snapshot is not present, force instantiation
66 snapshot = applyOperation.getChild(child).get().apply(childNode, childNode.getOriginal(), version);
69 return snapshot.map(TreeNode::getData);
72 Optional<? extends TreeNode> snapshot = modification.getSnapshot();
73 if (snapshot == null) {
74 snapshot = apply(modification.getOriginal(), version);
77 if (snapshot.isPresent()) {
78 return snapshot.get().getChild(child).map(TreeNode::getData);
81 return Optional.empty();
84 public ModifiedNode getModification() {
88 public ModificationApplyOperation getApplyOperation() {
89 return applyOperation;
92 public Optional<? extends TreeNode> apply(final Optional<? extends TreeNode> data, final Version version) {
93 return applyOperation.apply(modification, data, version);
96 public static OperationWithModification from(final ModificationApplyOperation operation,
97 final ModifiedNode modification) {
98 return new OperationWithModification(operation, modification);