package org.cdlib.xtf.lazyTree; import net.sf.saxon.event.Receiver; import net.sf.saxon.om.DocumentInfo; import net.sf.saxon.om.FastStringBuffer; import net.sf.saxon.om.NamePool; import net.sf.saxon.om.NodeInfo; import net.sf.saxon.trans.XPathException; import net.sf.saxon.type.Type; /** * Represents an attribute node from a persistent XML document. Used by * {@link ProxyElement} to implement lazy attribute loading. * * @author Martin Haye */ class ProxyAttributeImpl extends NodeImpl { ProxyElement element; int index; /** * Construct an Attribute node for the n'th attribute of a given element * @param element The element containing the relevant attribute * @param index The index position of the attribute starting at zero */ public ProxyAttributeImpl(ProxyElement element, int index) { this.element = element; this.index = index; this.document = element.document; } /** * Get the name code, which enables the name to be located in the name pool */ public int getNameCode() { return element.attrNames[index]; } /** * Get the root node of the tree (not necessarily a document node) * @return the NodeInfo representing the root of this tree */ public NodeInfo getRoot() { return element.document.getRoot(); } /** * Get the root (document) node * @return the DocumentInfo representing the containing document */ public DocumentInfo getDocumentRoot() { return element.document.getDocumentRoot(); } /** * Get the NamePool for the tree containing this node * @return the NamePool */ public NamePool getNamePool() { return element.document.getNamePool(); } /** * Determine whether this is the same node as another node * @return true if this Node object and the supplied Node object represent the * same node in the tree. */ public boolean isSameNodeInfo(NodeInfo other) { if (this == other) return true; if (!(other instanceof ProxyAttributeImpl)) return false; ProxyAttributeImpl otherAtt = (ProxyAttributeImpl)other; return (element.isSameNodeInfo(otherAtt.element) && index == otherAtt.index); } /** * Get the node sequence number (in document order). Sequence numbers are monotonic but not * consecutive. In the current implementation, parent nodes (elements and roots) have a zero * least-significant word, while namespaces, attributes, text nodes, comments, and PIs have * the top word the same as their owner and the bottom half reflecting their relative position. */ protected long getSequenceNumber() { return element.getSequenceNumber() + 0x8000 + index; // note the 0x8000 is to leave room for namespace nodes } /** * Return the type of node. * @return Node.ATTRIBUTE */ public final int getNodeKind() { return Type.ATTRIBUTE; } /** * Return the character value of the node. * @return the attribute value */ public String getStringValue() { return element.attrValues[index]; } /** * Get next sibling - not defined for attributes */ public NodeInfo getNextSibling() { return null; } /** * Get previous sibling - not defined for attributes */ public NodeInfo getPreviousSibling() { return null; } /** * Get the previous node in document order (skipping attributes) */ public NodeImpl getPreviousInDocument() { return (NodeImpl)getParent(); } /** * Get sequential key. Returns key of owning element with the attribute name as a suffix */ public void generateId(FastStringBuffer buffer) { getParent().generateId(buffer); buffer.append('a'); buffer.append(Integer.toString(index)); } /** * Obtain the displayable name of this attribute. */ public String getDisplayName() { if (getNameCode() < 0) return ""; return getNamePool().getDisplayName(getNameCode()); } /** * Copy this node to a given outputter */ public void copy(Receiver out, int whichNamespaces, boolean copyAnnotations, int locationId) throws XPathException { int nameCode = getNameCode(); //if ((nameCode>>20 & 0xff) != 0) { // non-null prefix // check there is no conflict of namespaces // nameCode = out.checkAttributePrefix(nameCode); //} out.attribute(nameCode, 0, getStringValue(), locationId, 0); } } // class ProxyAttributeImpl // // The contents of this file are subject to the Mozilla Public License Version 1.0 (the "License"); // you may not use this file except in compliance with the License. You may obtain a copy of the // License at http://www.mozilla.org/MPL/ // // Software distributed under the License is distributed on an "AS IS" basis, // WITHOUT WARRANTY OF ANY KIND, either express or implied. // See the License for the specific language governing rights and limitations under the License. // // The Original Code is: most of this file. // // The Initial Developer of the Original Code is // Michael Kay of International Computers Limited (michael.h.kay@ntlworld.com). // // Portions created by Martin Haye are Copyright (C) Regents of the University // of California. All Rights Reserved. // // Contributor(s): Martin Haye. //