import com.google.common.base.Optional;
import com.google.common.base.Preconditions;
+
+import java.util.Map.Entry;
+
+import javax.annotation.concurrent.GuardedBy;
+
import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier;
import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier.PathArgument;
import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
-import javax.annotation.concurrent.GuardedBy;
-import java.util.Map.Entry;
-
final class InMemoryDataTreeModification implements DataTreeModification {
private static final Logger LOG = LoggerFactory.getLogger(InMemoryDataTreeModification.class);
private final ModificationApplyOperation strategyTree;
ModifiedNode modification = rootNode;
// We ensure strategy is present.
ModificationApplyOperation operation = resolveModificationStrategy(path);
- for (PathArgument pathArg : path.getPath()) {
+ for (PathArgument pathArg : path.getPathArguments()) {
modification = modification.modifyChild(pathArg);
}
return OperationWithModification.from(operation, modification);
*/
package org.opendaylight.yangtools.yang.data.impl.schema.tree;
+import com.google.common.base.Optional;
+import com.google.common.base.Preconditions;
+import com.google.common.base.Predicate;
+import com.google.common.base.Predicates;
+
import java.util.AbstractMap.SimpleEntry;
import java.util.ArrayList;
import java.util.Iterator;
import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier;
import org.opendaylight.yangtools.yang.data.api.InstanceIdentifier.PathArgument;
-
-import com.google.common.base.Optional;
-import com.google.common.base.Preconditions;
-import com.google.common.base.Predicate;
-import com.google.common.base.Predicates;
import org.opendaylight.yangtools.yang.data.api.schema.tree.StoreTreeNode;
/**
*/
public static <T extends StoreTreeNode<T>> Optional<T> findNode(final T tree, final InstanceIdentifier path) {
Optional<T> current = Optional.<T> of(tree);
- Iterator<PathArgument> pathIter = path.getPath().iterator();
+ Iterator<PathArgument> pathIter = path.getPathArguments().iterator();
while (current.isPresent() && pathIter.hasNext()) {
current = current.get().getChild(pathIter.next());
}
public static <T extends StoreTreeNode<T>> T findNodeChecked(final T tree, final InstanceIdentifier path) {
T current = tree;
List<PathArgument> nested = new ArrayList<>(path.getPath().size());
- for(PathArgument pathArg : path.getPath()) {
+ for(PathArgument pathArg : path.getPathArguments()) {
Optional<T> potential = current.getChild(pathArg);
nested.add(pathArg);
Preconditions.checkArgument(potential.isPresent(),"Child %s is not present in tree.",nested);
Optional<T> current = Optional.<T> of(tree);
int nesting = 0;
- Iterator<PathArgument> pathIter = path.getPath().iterator();
+ Iterator<PathArgument> pathIter = path.getPathArguments().iterator();
while (current.isPresent() && pathIter.hasNext() && !predicate.apply(current.get())) {
parent = current;
current = current.get().getChild(pathIter.next());