* nodes. This process goes in recursive manner, where each NodeTypes object signifies the start of the object, except
* END_NODE. If a node can have children, then that node's end is calculated based on appearance of END_NODE.
*/
-public class NormalizedNodeInputStreamReader extends ForwardingDataInput implements NormalizedNodeDataInput {
+class LithiumNormalizedNodeInputStreamReader extends ForwardingDataInput implements NormalizedNodeDataInput {
- private static final Logger LOG = LoggerFactory.getLogger(NormalizedNodeInputStreamReader.class);
+ private static final Logger LOG = LoggerFactory.getLogger(LithiumNormalizedNodeInputStreamReader.class);
private final @NonNull DataInput input;
@SuppressWarnings("rawtypes")
private NormalizedNodeBuilder<NodeWithValue, Object, LeafSetEntryNode<Object>> leafSetEntryBuilder;
- NormalizedNodeInputStreamReader(final DataInput input) {
+ LithiumNormalizedNodeInputStreamReader(final DataInput input) {
this.input = requireNonNull(input);
}
return input;
}
+ @Override
+ public NormalizedNodeStreamVersion getVersion() throws IOException {
+ return NormalizedNodeStreamVersion.LITHIUM;
+ }
+
@Override
public NormalizedNode<?, ?> readNormalizedNode() throws IOException {
return readNormalizedNodeInternal();
}
}
- private QName readQName() throws IOException {
+ QName readQName() throws IOException {
// Read in the same sequence of writing
String localName = readCodedString();
String namespace = readCodedString();
return children;
}
- private AugmentationIdentifier readAugmentationIdentifier() throws IOException {
- // FIXME: we should have a cache for these, too
+ AugmentationIdentifier readAugmentationIdentifier() throws IOException {
return new AugmentationIdentifier(readQNameSet());
}