org.opendaylight.yangtools.yang.data.api.StackedYangInstanceIdentifier Maven / Gradle / Ivy
/*
* Copyright (c) 2015 Cisco Systems, Inc. and others. All rights reserved.
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v1.0 which accompanies this distribution,
* and is available at http://www.eclipse.org/legal/epl-v10.html
*/
package org.opendaylight.yangtools.yang.data.api;
import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Verify.verify;
import static com.google.common.base.Verify.verifyNotNull;
import static java.util.Objects.requireNonNull;
import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import java.io.Serial;
import java.util.ArrayList;
import java.util.List;
import org.eclipse.jdt.annotation.NonNull;
import org.opendaylight.yangtools.util.HashCodeBuilder;
final class StackedYangInstanceIdentifier extends YangInstanceIdentifier implements Cloneable {
@Serial
private static final long serialVersionUID = 1L;
private final @NonNull YangInstanceIdentifier parent;
private final @NonNull PathArgument pathArgument;
private transient volatile StackedPathArguments pathArguments;
private transient volatile StackedReversePathArguments reversePathArguments;
StackedYangInstanceIdentifier(final YangInstanceIdentifier parent, final PathArgument pathArgument) {
this.parent = requireNonNull(parent);
this.pathArgument = requireNonNull(pathArgument);
}
@Override
public StackedYangInstanceIdentifier clone() {
try {
return (StackedYangInstanceIdentifier) super.clone();
} catch (CloneNotSupportedException e) {
throw new IllegalStateException("clone() should be supported", e);
}
}
@Override
public @NonNull YangInstanceIdentifier getParent() {
return parent;
}
@Override
public YangInstanceIdentifier coerceParent() {
return parent;
}
@Override
public YangInstanceIdentifier getAncestor(final int depth) {
checkArgument(depth >= 0, "Steps cannot be negative");
// Calculate how far up our FixedYangInstanceIdentifier ancestor is
int stackedDepth = 1;
YangInstanceIdentifier wlk = getParent();
while (wlk instanceof StackedYangInstanceIdentifier) {
wlk = wlk.getParent();
stackedDepth++;
}
// Guaranteed to come from FixedYangInstanceIdentifier
final int fixedDepth = wlk.getPathArguments().size();
if (fixedDepth >= depth) {
return wlk.getAncestor(depth);
}
// Calculate our depth and check argument
final int ourDepth = stackedDepth + fixedDepth;
checkArgument(depth <= ourDepth, "Depth %s exceeds maximum depth %s", depth, ourDepth);
// Requested depth is covered by the stack, traverse up for specified number of steps
final int toWalk = ourDepth - depth;
YangInstanceIdentifier result = this;
for (int i = 0; i < toWalk; ++i) {
result = verifyNotNull(result.getParent());
}
return result;
}
@Override
public boolean isEmpty() {
return false;
}
@Override
public List getPathArguments() {
StackedPathArguments ret = tryPathArguments();
if (ret == null) {
final List stack = new ArrayList<>();
YangInstanceIdentifier current = this;
do {
verify(current instanceof StackedYangInstanceIdentifier);
final StackedYangInstanceIdentifier stacked = (StackedYangInstanceIdentifier) current;
stack.add(stacked.getLastPathArgument());
current = stacked.getParent();
} while (current.tryPathArguments() == null);
pathArguments = ret = new StackedPathArguments(current, Lists.reverse(stack));
}
return ret;
}
@Override
public List getReversePathArguments() {
StackedReversePathArguments ret = tryReversePathArguments();
if (ret == null) {
ret = new StackedReversePathArguments(this);
reversePathArguments = ret;
}
return ret;
}
@Override
public PathArgument getLastPathArgument() {
return pathArgument;
}
@Override
StackedPathArguments tryPathArguments() {
return pathArguments;
}
@Override
StackedReversePathArguments tryReversePathArguments() {
return reversePathArguments;
}
@Override
YangInstanceIdentifier createRelativeIdentifier(final int skipFromRoot) {
// TODO: can we optimize this one?
return YangInstanceIdentifier.of(Iterables.skip(getPathArguments(), skipFromRoot));
}
@Override
int computeHashCode() {
return HashCodeBuilder.nextHashCode(parent.hashCode(), pathArgument);
}
@Override
boolean pathArgumentsEqual(final YangInstanceIdentifier other) {
if (other instanceof StackedYangInstanceIdentifier stacked) {
return pathArgument.equals(stacked.pathArgument) && parent.equals(stacked.parent);
}
return super.pathArgumentsEqual(other);
}
@Override
public YangInstanceIdentifier toOptimized() {
return FixedYangInstanceIdentifier.of(getPathArguments());
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy