All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.sf.saxon.tree.linked.AttributeImpl Maven / Gradle / Ivy

There is a newer version: 12.5
Show newest version
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2018-2023 Saxonica Limited
// This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0.
// If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
// This Source Code Form is "Incompatible With Secondary Licenses", as defined by the Mozilla Public License, v. 2.0.
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

package net.sf.saxon.tree.linked;

import net.sf.saxon.event.Receiver;
import net.sf.saxon.event.ReceiverOption;
import net.sf.saxon.om.*;
import net.sf.saxon.s9api.Location;
import net.sf.saxon.str.StringView;
import net.sf.saxon.str.UnicodeString;
import net.sf.saxon.trans.XPathException;

import net.sf.saxon.type.BuiltInAtomicType;
import net.sf.saxon.type.SchemaType;
import net.sf.saxon.type.SimpleType;
import net.sf.saxon.type.Type;

/**
 * A node in the "linked" tree representing an attribute. Note that this is
 * generated only "on demand", when the attribute is selected by a path expression.
 * 

It is possible for multiple AttributeImpl objects to represent the same attribute node. * The identity of an attribute node is determined by the identity of the element, and the index * position of the attribute within the element. Index positions are not reused when an attribute * is deleted, and are retained when an attribute is renamed.

*

This object no longer caches information such as the name code and string value, because * these would become invalid when the element node is modified.

*/ public class AttributeImpl extends NodeImpl { /** * 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 AttributeImpl(ElementImpl element, int index) { setRawParent(element); setSiblingPosition(index); } private AttributeInfo getAttributeInfo() { return getRawParent().attributes().itemAt(getSiblingPosition()); } /** * Get the name of the node. Returns null for an unnamed node * * @return the name of the node */ @Override public NodeName getNodeName() { if (getRawParent() == null || getSiblingPosition() == -1) { // implies this node is deleted return null; } return getAttributeInfo().getNodeName(); } /** * Get the fingerprint of the node. This is used to compare whether two nodes * have equivalent names. Return -1 for a node with no name. */ @Override public int getFingerprint() { if (getRawParent() == null || getSiblingPosition() == -1) { // implies this node is deleted return -1; } return getNodeName().obtainFingerprint(getNamePool()); } /** * Get the type annotation * * @return the type annotation of the node, if any */ @Override public SchemaType getSchemaType() { return getAttributeInfo().getType(); } /** * Determine whether this node has the is-id property * * @return true if the node is an ID */ @Override public boolean isId() { return getAttributeInfo().isId(); } /** * Determine whether this node has the is-idref property * * @return true if the node is an IDREF or IDREFS element or attribute */ @Override public boolean isIdref() { if (ReceiverOption.contains(getAttributeInfo().getProperties(), ReceiverOption.IS_IDREF)) { return true; } return ElementImpl.isIdRefNode(this); } /** * 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 equals(Object other) { if (!(other instanceof AttributeImpl)) { return false; } if (this == other) { return true; } AttributeImpl otherAtt = (AttributeImpl) other; return getRawParent().equals(otherAtt.getRawParent()) && getSiblingPosition() == otherAtt.getSiblingPosition(); } /** * The hashCode() method obeys the contract for hashCode(): that is, if two objects are equal * (represent the same node) then they must have the same hashCode() */ public int hashCode() { return getRawParent().hashCode() ^ (getSiblingPosition() << 16); } /** * 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. */ @Override protected long getSequenceNumber() { long parseq = getRawParent().getSequenceNumber(); return (parseq == -1L ? parseq : parseq + 0x8000 + getSiblingPosition()); // note the 0x8000 is to leave room for namespace nodes } /** * Return the type of node. * * @return Node.ATTRIBUTE */ @Override public final int getNodeKind() { return Type.ATTRIBUTE; } /** * Return the character value of the node. * * @return the attribute value */ @Override public UnicodeString getUnicodeStringValue() { return StringView.tidy(getAttributeInfo().getValue()); } @Override public String getStringValue() { return getAttributeInfo().getValue(); } /** * Get next sibling - not defined for attributes */ /*@Nullable*/ @Override public NodeImpl getNextSibling() { return null; } /** * Get previous sibling - not defined for attributes */ /*@Nullable*/ @Override public NodeImpl getPreviousSibling() { return null; } /** * Get the previous node in document order (skipping attributes) */ /*@NotNull*/ @Override public NodeImpl getPreviousInDocument() { return getParent(); } /** * Get the next node in document order (skipping attributes) */ /*@Nullable*/ @Override public NodeImpl getNextInDocument(NodeImpl anchor) { if (anchor == this) return null; return getParent().getNextInDocument(anchor); } /** * Get sequential key. Returns key of owning element with the attribute index as a suffix * * @param buffer a buffer to which the generated ID will be written */ @Override public void generateId(/*@NotNull*/ StringBuilder buffer) { getParent().generateId(buffer); buffer.append('a'); buffer.append(getSiblingPosition()); } /** * Copy this node to a given outputter. * @throws IllegalArgumentException this method is not supported for attribute nodes */ @Override public void copy(/*@NotNull*/ Receiver out, int copyOptions, Location locationId) throws XPathException { throw new IllegalArgumentException(); } /** * Delete this node (that is, detach it from its parent) */ @Override public void delete() { if (!isDeleted()) { if (getRawParent() != null) { getRawParent().removeAttribute(this); // AttributeMap oldAtts = getRawParent().attributes(); // AttributeMap newAtts = oldAtts.remove(getNodeName()); // getRawParent().setAttributes(newAtts); } setRawParent(null); setSiblingPosition(-1); } } /** * Test whether this MutableNodeInfo object represents a node that has been deleted. * Generally, such a node is unusable, and any attempt to use it will result in an exception * being thrown * * @return true if this node has been deleted */ @Override public boolean isDeleted() { // Note that the attribute node may be represented by more than one object return getRawParent() == null || getAttributeInfo() instanceof AttributeInfo.Deleted || getRawParent().isDeleted(); } /** * Replace this node with a given sequence of nodes * * @param replacement the replacement nodes (which for this version of the method must be attribute * nodes - they may use any implementation of the NodeInfo interface). * The target attribute node is deleted, and the replacement nodes are added to the * parent element; if they have the same names as existing nodes, then the existing nodes will be * overwritten. * @param inherit set to true if new child elements are to inherit the in-scope namespaces * of their new parent. Not used when replacing attribute nodes. * @throws IllegalArgumentException if any of the replacement nodes is not an attribute * @throws IllegalStateException if this node has been deleted or has no parent node * or if two of the replacement nodes have the same name */ @Override public void replace(/*@NotNull*/ NodeInfo[] replacement, boolean inherit) { if (isDeleted()) { throw new IllegalStateException("Cannot replace a deleted node"); } if (getParent() == null) { throw new IllegalStateException("Cannot replace a parentless node"); } ParentNodeImpl element = getRawParent(); delete(); for (NodeInfo n : replacement) { if (n.getNodeKind() != Type.ATTRIBUTE) { throw new IllegalArgumentException("Replacement nodes must be attributes"); } element.addAttribute(NameOfNode.makeName(n), BuiltInAtomicType.UNTYPED_ATOMIC, n.getStringValue(), ReceiverOption.NONE, inherit); } } /** * Rename this node * * @param newNameCode the NamePool code of the new name * @param inherit true if any new namespace binding is to be inherited */ @Override public void rename(NodeName newNameCode, boolean inherit) { // The attribute node itself is transient; we need to update the attribute collection held in the parent ElementImpl owner = (ElementImpl)getRawParent(); if (owner != null && !isDeleted()) { AttributeInfo att = getAttributeInfo(); owner.setAttributeInfo(getSiblingPosition(), new AttributeInfo(newNameCode, BuiltInAtomicType.UNTYPED_ATOMIC, att.getValue(), att.getLocation(), att.getProperties())); NamespaceUri newURI = newNameCode.getNamespaceUri(); if (!newURI.isEmpty()) { // new attribute name is in a namespace String newPrefix = newNameCode.getPrefix(); NamespaceBinding newBinding = new NamespaceBinding(newPrefix, newURI); NamespaceUri oldURI = ((ElementImpl) getRawParent()).getURIForPrefix(newPrefix, false); if (oldURI == null) { owner.addNamespace(newBinding, inherit); } else if (!oldURI.equals(newURI)) { throw new IllegalArgumentException( "Namespace binding of new name conflicts with existing namespace binding"); } } } } @Override public void replaceStringValue(UnicodeString stringValue) { ElementImpl owner = (ElementImpl)getRawParent(); if (owner != null && !isDeleted()) { AttributeInfo att = getAttributeInfo(); owner.setAttributeInfo(getSiblingPosition(), new AttributeInfo(att.getNodeName(), att.getType(), stringValue.toString(), att.getLocation(), att.getProperties())); } } /** * Remove type information from this node (and its ancestors, recursively). * This method implements the upd:removeType() primitive defined in the XQuery Update specification */ @Override public void removeTypeAnnotation() { ElementImpl owner = (ElementImpl) getRawParent(); if (owner != null && !isDeleted()) { AttributeInfo att = getAttributeInfo(); owner.setAttributeInfo(getSiblingPosition(), new AttributeInfo(att.getNodeName(), BuiltInAtomicType.UNTYPED_ATOMIC, att.getValue(), att.getLocation(), att.getProperties())); owner.removeTypeAnnotation(); } } /** * Set the type annotation on a node. This must only be called when the caller has verified (by validation) * that the node is a valid instance of the specified type. The call is ignored if the node is not an element * or attribute node. * * @param type the type annotation (possibly including high bits set to indicate the isID, isIDREF, and * isNilled properties) */ @Override public void setTypeAnnotation(SchemaType type) { if (!(type instanceof SimpleType)) { throw new IllegalArgumentException("Attribute type must be a simple type"); } final ElementImpl owner = (ElementImpl)getRawParent(); if (owner != null && !isDeleted()) { AttributeInfo att = getAttributeInfo(); owner.setAttributeInfo(getSiblingPosition(), new AttributeInfo(att.getNodeName(), (SimpleType)type, att.getValue(), att.getLocation(), att.getProperties())); owner.removeTypeAnnotation(); } } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy