com.tailf.jnc.Leaf Maven / Gradle / Ivy
package com.tailf.jnc;
/**
* This class represents leaves in data model aware Element trees.
*
* YangElement classes generated from the JNC pyang plugin may instantiate this
* class for leaf values.
*
* @see YangElement
*/
public class Leaf extends Element {
private static final long serialVersionUID = 1L;
public Leaf(String ns, String name) {
super(ns, name);
}
// cache the Tagpath and the SchemaNode
private Tagpath tp = null;
private SchemaNode n = null;
@Override
protected void encode(Transport out, boolean newline_at_end,
Capabilities capas) throws JNCException {
if (RevisionInfo.olderRevisionSupportEnabled && capas != null) {
if (tp == null) {
tp = tagpath();
}
if (n == null) {
n = SchemaTree.lookup(namespace, tp);
}
final String rev = capas.getRevision(namespace);
if (n != null && n.revInfo != null) {
for (final RevisionInfo r : n.revInfo) {
if (r.introduced.compareTo(rev) > 0) {
// This node was somehow modified
switch (r.type) {
case RevisionInfo.R_NODE_ADDED:
// NODE_ADDED Skipping
return;
case RevisionInfo.R_ENUM_ADDED:
// Need to check if the added enum is the one we
// we wish to send
if (r.data.equals(getValue().toString())) {
throw new JNCException(
JNCException.REVISION_ERROR,
tp + " bad enum value for rev (" + rev
+ ") " + r.data);
}
break;
case RevisionInfo.R_BITS_ADDED:
// Same thing - check for too new bit strings
if (r.data.equals(getValue().toString())) {
throw new JNCException(
JNCException.REVISION_ERROR,
tp + " bad bits value for rev (" + rev
+ ") " + r.data);
}
break;
case RevisionInfo.R_MANDATORY_TRUE_TO_FALSE:
// nothing to do
break;
default:
;
}
}
}
}
}
super.encode(out, newline_at_end, capas);
}
@Override
public Leaf clone() {
final Leaf copy = new Leaf(namespace, name);
cloneAttrs(copy);
cloneValue(copy);
return copy;
}
/*
* returns true if this Leaf is a key leaf
*/
public boolean isKey() {
final YangElement p = (YangElement) getParent();
final String[] keys = p.keyNames();
if (keys == null) {
return false;
}
for (int i = 0; i < keys.length; i++) {
if (name.equals(keys[i])) {
return true;
}
}
return false;
}
}