AttrImplpublic class AttrImpl extends NodeImpl implements AttrAttribute represents an XML-style attribute of an
Element. Typically, the allowable values are controlled by its
declaration in the Document Type Definition (DTD) governing this
kind of document.
If the attribute has not been explicitly assigned a value, but has
been declared in the DTD, it will exist and have that default. Only
if neither the document nor the DTD specifies a value will the
Attribute really be considered absent and have no value; in that
case, querying the attribute will return null.
Attributes may have multiple children that contain their data. (XML
allows attributes to contain entity references, and tokenized
attribute types such as NMTOKENS may have a child for each token.)
For convenience, the Attribute object's getValue() method returns
the string version of the attribute's value.
Attributes are not children of the Elements they belong to, in the
usual sense, and have no valid Parent reference. However, the spec
says they _do_ belong to a specific Element, and an INUSE exception
is to be thrown if the user attempts to explicitly share them
between elements.
Note that Elements do not permit attributes to appear to be shared
(see the INUSE exception), so this object's mutability is
officially not an issue.
Note: The ownerNode attribute is used to store the Element the Attr
node is associated with. Attr nodes do not have parent nodes.
Besides, the getOwnerElement() method can be used to get the element node
this attribute is associated with.
AttrImpl does not support Namespaces. AttrNSImpl, which inherits from
it, does.
AttrImpl used to inherit from ParentNode. It now directly inherits from
NodeImpl and provide its own implementation of the ParentNode's behavior.
The reason is that we now try and avoid to always create a Text node to
hold the value of an attribute. The DOM spec requires it, so we still have
to do it in case getFirstChild() is called for instance. The reason
attribute values are stored as a list of nodes is so that they can carry
more than a simple string. They can also contain EntityReference nodes.
However, most of the times people only have a single string that they only
set and get through Element.set/getAttribute or Attr.set/getValue. In this
new version, the Attr node has a value pointer which can either be the
String directly or a pointer to the first ChildNode. A flag tells which one
it currently is. Note that while we try to stick with the direct String as
much as possible once we've switched to a node there is no going back. This
is because we have no way to know whether the application keeps referring to
the node we once returned.
The gain in memory varies on the density of attributes in the document.
But in the tests I've run I've seen up to 12% of memory gain. And the good
thing is that it also leads to a slight gain in speed because we allocate
fewer objects! I mean, that's until we have to actually create the node...
To avoid too much duplicated code, I got rid of ParentNode and renamed
ChildAndParentNode, which I never really liked, to ParentNode for
simplicity, this doesn't make much of a difference in memory usage because
there are only very few objects that are only a Parent. This is only true
now because AttrImpl now inherits directly from NodeImpl and has its own
implementation of the ParentNode's node behavior. So there is still some
duplicated code there.
This class doesn't directly support mutation events, however, it notifies
the document when mutations are performed so that the document class do so.
WARNING: Some of the code here is partially duplicated in
ParentNode, be careful to keep these two classes in sync! |
Fields Summary |
---|
static final long | serialVersionUIDSerialization version. | static final String | DTD_URIDTD namespace. | protected Object | valueThis can either be a String or the first child node. | protected String | nameAttribute name. | transient TypeInfo | typeType information | protected static TextImpl | textNode |
Constructors Summary |
---|
protected AttrImpl(CoreDocumentImpl ownerDocument, String name)Attribute has no public constructor. Please use the factory
method in the Document class.
//
// Constructors
//
super(ownerDocument);
this.name = name;
/** False for default attributes. */
isSpecified(true);
hasStringValue(true);
| protected AttrImpl()
|
Methods Summary |
---|
void | checkNormalizationAfterInsert(com.sun.org.apache.xerces.internal.dom.ChildNode insertedChild)Checks the normalized state of this node after inserting a child.
If the inserted child causes this node to be unnormalized, then this
node is flagged accordingly.
The conditions for changing the normalized state are:
- The inserted child is a text node and one of its adjacent siblings
is also a text node.
- The inserted child is is itself unnormalized.
// See if insertion caused this node to be unnormalized.
if (insertedChild.getNodeType() == Node.TEXT_NODE) {
ChildNode prev = insertedChild.previousSibling();
ChildNode next = insertedChild.nextSibling;
// If an adjacent sibling of the new child is a text node,
// flag this node as unnormalized.
if ((prev != null && prev.getNodeType() == Node.TEXT_NODE) ||
(next != null && next.getNodeType() == Node.TEXT_NODE)) {
isNormalized(false);
}
}
else {
// If the new child is not normalized,
// then this node is inherently not normalized.
if (!insertedChild.isNormalized()) {
isNormalized(false);
}
}
| void | checkNormalizationAfterRemove(com.sun.org.apache.xerces.internal.dom.ChildNode previousSibling)Checks the normalized of this node after removing a child.
If the removed child causes this node to be unnormalized, then this
node is flagged accordingly.
The conditions for changing the normalized state are:
- The removed child had two adjacent siblings that were text nodes.
// See if removal caused this node to be unnormalized.
// If the adjacent siblings of the removed child were both text nodes,
// flag this node as unnormalized.
if (previousSibling != null &&
previousSibling.getNodeType() == Node.TEXT_NODE) {
ChildNode next = previousSibling.nextSibling;
if (next != null && next.getNodeType() == Node.TEXT_NODE) {
isNormalized(false);
}
}
| public org.w3c.dom.Node | cloneNode(boolean deep)
if (needsSyncChildren()) {
synchronizeChildren();
}
AttrImpl clone = (AttrImpl) super.cloneNode(deep);
// take care of case where there are kids
if (!clone.hasStringValue()) {
// Need to break the association w/ original kids
clone.value = null;
// Cloning an Attribute always clones its children,
// since they represent its value, no matter whether this
// is a deep clone or not
for (Node child = (Node) value; child != null;
child = child.getNextSibling()) {
clone.appendChild(child.cloneNode(true));
}
}
clone.isSpecified(true);
return clone;
| public org.w3c.dom.NodeList | getChildNodes()Obtain a NodeList enumerating all children of this node. If there
are none, an (initially) empty NodeList is returned.
NodeLists are "live"; as children are added/removed the NodeList
will immediately reflect those changes. Also, the NodeList refers
to the actual nodes, so changes to those nodes made via the DOM tree
will be reflected in the NodeList and vice versa.
In this implementation, Nodes implement the NodeList interface and
provide their own getChildNodes() support. Other DOMs may solve this
differently.
// JKESS: KNOWN ISSUE HERE
if (needsSyncChildren()) {
synchronizeChildren();
}
return this;
| public org.w3c.dom.Element | getElement()Returns the element node that this attribute is associated with,
or null if the attribute has not been added to an element.
// if we have an owner, ownerNode is our ownerElement, otherwise it's
// our ownerDocument and we don't have an ownerElement
return (Element) (isOwned() ? ownerNode : null);
| public org.w3c.dom.Node | getFirstChild()The first child of this Node, or null if none.
if (needsSyncChildren()) {
synchronizeChildren();
}
makeChildNode();
return (Node) value;
| public org.w3c.dom.Node | getLastChild()The last child of this Node, or null if none.
if (needsSyncChildren()) {
synchronizeChildren();
}
return lastChild();
| public int | getLength()NodeList method: Count the immediate children of this node
if (hasStringValue()) {
return 1;
}
ChildNode node = (ChildNode) value;
int length = 0;
for (; node != null; node = node.nextSibling) {
length++;
}
return length;
| public java.lang.String | getName()In Attributes, NodeName is considered a synonym for the
attribute's Name
if (needsSyncData()) {
synchronizeData();
}
return name;
| public java.lang.String | getNodeName()Returns the attribute name
if (needsSyncData()) {
synchronizeData();
}
return name;
| public short | getNodeType()A short integer indicating what type of node this is. The named
constants for this value are defined in the org.w3c.dom.Node interface.
return Node.ATTRIBUTE_NODE;
| public java.lang.String | getNodeValue()In Attribute objects, NodeValue is considered a synonym for
Value.
return getValue();
| public org.w3c.dom.Element | getOwnerElement()Returns the element node that this attribute is associated with,
or null if the attribute has not been added to an element.
// if we have an owner, ownerNode is our ownerElement, otherwise it's
// our ownerDocument and we don't have an ownerElement
return (Element) (isOwned() ? ownerNode : null);
| public org.w3c.dom.TypeInfo | getSchemaTypeInfo()Method getSchemaTypeInfo.
if (needsSyncData()) {
synchronizeData();
}
return type;
| public boolean | getSpecified()The "specified" flag is true if and only if this attribute's
value was explicitly specified in the original document. Note that
the implementation, not the user, is in charge of this
property. If the user asserts an Attribute value (even if it ends
up having the same value as the default), it is considered a
specified attribute. If you really want to revert to the default,
delete the attribute from the Element, and the Implementation will
re-assert the default (if any) in its place, with the appropriate
specified=false setting.
if (needsSyncData()) {
synchronizeData();
}
return isSpecified();
| public java.lang.String | getTypeName()
if(type != null)
return type.getTypeName();
return null;
| public java.lang.String | getTypeNamespace()
if (type != null) {
return DTD_URI;
}
return null;
| public java.lang.String | getValue()The "string value" of an Attribute is its text representation,
which in turn is a concatenation of the string values of its children.
if (needsSyncData()) {
synchronizeData();
}
if (needsSyncChildren()) {
synchronizeChildren();
}
if (value == null) {
return "";
}
if (hasStringValue()) {
return (String) value;
}
ChildNode firstChild = ((ChildNode) value);
String data = null;
if (firstChild.getNodeType() == Node.ENTITY_REFERENCE_NODE){
data = ((EntityReferenceImpl)firstChild).getEntityRefValue();
}
else {
data = firstChild.getNodeValue();
}
ChildNode node = firstChild.nextSibling;
if (node == null || data == null) return (data == null)?"":data;
StringBuffer value = new StringBuffer(data);
while (node != null) {
if (node.getNodeType() == Node.ENTITY_REFERENCE_NODE){
data = ((EntityReferenceImpl)node).getEntityRefValue();
if (data == null) return "";
value.append(data);
}
else {
value.append(node.getNodeValue());
}
node = node.nextSibling;
}
return value.toString();
| public boolean | hasChildNodes()Test whether this node has any children. Convenience shorthand
for (Node.getFirstChild()!=null)
if (needsSyncChildren()) {
synchronizeChildren();
}
return value != null;
| public org.w3c.dom.Node | insertBefore(org.w3c.dom.Node newChild, org.w3c.dom.Node refChild)Move one or more node(s) to our list of children. Note that this
implicitly removes them from their previous parent.
// Tail-call; optimizer should be able to do good things with.
return internalInsertBefore(newChild, refChild, false);
| org.w3c.dom.Node | internalInsertBefore(org.w3c.dom.Node newChild, org.w3c.dom.Node refChild, boolean replace)NON-DOM INTERNAL: Within DOM actions,we sometimes need to be able
to control which mutation events are spawned. This version of the
insertBefore operation allows us to do so. It is not intended
for use by application programs.
CoreDocumentImpl ownerDocument = ownerDocument();
boolean errorChecking = ownerDocument.errorChecking;
if (newChild.getNodeType() == Node.DOCUMENT_FRAGMENT_NODE) {
// SLOW BUT SAFE: We could insert the whole subtree without
// juggling so many next/previous pointers. (Wipe out the
// parent's child-list, patch the parent pointers, set the
// ends of the list.) But we know some subclasses have special-
// case behavior they add to insertBefore(), so we don't risk it.
// This approch also takes fewer bytecodes.
// NOTE: If one of the children is not a legal child of this
// node, throw HIERARCHY_REQUEST_ERR before _any_ of the children
// have been transferred. (Alternative behaviors would be to
// reparent up to the first failure point or reparent all those
// which are acceptable to the target node, neither of which is
// as robust. PR-DOM-0818 isn't entirely clear on which it
// recommends?????
// No need to check kids for right-document; if they weren't,
// they wouldn't be kids of that DocFrag.
if (errorChecking) {
for (Node kid = newChild.getFirstChild(); // Prescan
kid != null; kid = kid.getNextSibling()) {
if (!ownerDocument.isKidOK(this, kid)) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "HIERARCHY_REQUEST_ERR", null);
throw new DOMException(DOMException.HIERARCHY_REQUEST_ERR, msg);
}
}
}
while (newChild.hasChildNodes()) {
insertBefore(newChild.getFirstChild(), refChild);
}
return newChild;
}
if (newChild == refChild) {
// stupid case that must be handled as a no-op triggering events...
refChild = refChild.getNextSibling();
removeChild(newChild);
insertBefore(newChild, refChild);
return newChild;
}
if (needsSyncChildren()) {
synchronizeChildren();
}
if (errorChecking) {
if (isReadOnly()) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "NO_MODIFICATION_ALLOWED_ERR", null);
throw new DOMException(DOMException.NO_MODIFICATION_ALLOWED_ERR, msg);
}
if (newChild.getOwnerDocument() != ownerDocument) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "WRONG_DOCUMENT_ERR", null);
throw new DOMException(DOMException.WRONG_DOCUMENT_ERR, msg);
}
if (!ownerDocument.isKidOK(this, newChild)) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "HIERARCHY_REQUEST_ERR", null);
throw new DOMException(DOMException.HIERARCHY_REQUEST_ERR, msg);
}
// refChild must be a child of this node (or null)
if (refChild != null && refChild.getParentNode() != this) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "NOT_FOUND_ERR", null);
throw new DOMException(DOMException.NOT_FOUND_ERR, msg);
}
// Prevent cycles in the tree
// newChild cannot be ancestor of this Node,
// and actually cannot be this
boolean treeSafe = true;
for (NodeImpl a = this; treeSafe && a != null; a = a.parentNode())
{
treeSafe = newChild != a;
}
if (!treeSafe) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "HIERARCHY_REQUEST_ERR", null);
throw new DOMException(DOMException.HIERARCHY_REQUEST_ERR, msg);
}
}
makeChildNode(); // make sure we have a node and not a string
// notify document
ownerDocument.insertingNode(this, replace);
// Convert to internal type, to avoid repeated casting
ChildNode newInternal = (ChildNode)newChild;
Node oldparent = newInternal.parentNode();
if (oldparent != null) {
oldparent.removeChild(newInternal);
}
// Convert to internal type, to avoid repeated casting
ChildNode refInternal = (ChildNode) refChild;
// Attach up
newInternal.ownerNode = this;
newInternal.isOwned(true);
// Attach before and after
// Note: firstChild.previousSibling == lastChild!!
ChildNode firstChild = (ChildNode) value;
if (firstChild == null) {
// this our first and only child
value = newInternal; // firstchild = newInternal;
newInternal.isFirstChild(true);
newInternal.previousSibling = newInternal;
}
else {
if (refInternal == null) {
// this is an append
ChildNode lastChild = firstChild.previousSibling;
lastChild.nextSibling = newInternal;
newInternal.previousSibling = lastChild;
firstChild.previousSibling = newInternal;
}
else {
// this is an insert
if (refChild == firstChild) {
// at the head of the list
firstChild.isFirstChild(false);
newInternal.nextSibling = firstChild;
newInternal.previousSibling = firstChild.previousSibling;
firstChild.previousSibling = newInternal;
value = newInternal; // firstChild = newInternal;
newInternal.isFirstChild(true);
}
else {
// somewhere in the middle
ChildNode prev = refInternal.previousSibling;
newInternal.nextSibling = refInternal;
prev.nextSibling = newInternal;
refInternal.previousSibling = newInternal;
newInternal.previousSibling = prev;
}
}
}
changed();
// notify document
ownerDocument.insertedNode(this, newInternal, replace);
checkNormalizationAfterInsert(newInternal);
return newChild;
| org.w3c.dom.Node | internalRemoveChild(org.w3c.dom.Node oldChild, boolean replace)NON-DOM INTERNAL: Within DOM actions,we sometimes need to be able
to control which mutation events are spawned. This version of the
removeChild operation allows us to do so. It is not intended
for use by application programs.
CoreDocumentImpl ownerDocument = ownerDocument();
if (ownerDocument.errorChecking) {
if (isReadOnly()) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "NO_MODIFICATION_ALLOWED_ERR", null);
throw new DOMException(DOMException.NO_MODIFICATION_ALLOWED_ERR, msg);
}
if (oldChild != null && oldChild.getParentNode() != this) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "NOT_FOUND_ERR", null);
throw new DOMException(DOMException.NOT_FOUND_ERR, msg);
}
}
ChildNode oldInternal = (ChildNode) oldChild;
// notify document
ownerDocument.removingNode(this, oldInternal, replace);
// Patch linked list around oldChild
// Note: lastChild == firstChild.previousSibling
if (oldInternal == value) { // oldInternal == firstChild
// removing first child
oldInternal.isFirstChild(false);
// next line is: firstChild = oldInternal.nextSibling
value = oldInternal.nextSibling;
ChildNode firstChild = (ChildNode) value;
if (firstChild != null) {
firstChild.isFirstChild(true);
firstChild.previousSibling = oldInternal.previousSibling;
}
} else {
ChildNode prev = oldInternal.previousSibling;
ChildNode next = oldInternal.nextSibling;
prev.nextSibling = next;
if (next == null) {
// removing last child
ChildNode firstChild = (ChildNode) value;
firstChild.previousSibling = prev;
} else {
// removing some other child in the middle
next.previousSibling = prev;
}
}
// Save previous sibling for normalization checking.
ChildNode oldPreviousSibling = oldInternal.previousSibling();
// Remove oldInternal's references to tree
oldInternal.ownerNode = ownerDocument;
oldInternal.isOwned(false);
oldInternal.nextSibling = null;
oldInternal.previousSibling = null;
changed();
// notify document
ownerDocument.removedNode(this, replace);
checkNormalizationAfterRemove(oldPreviousSibling);
return oldInternal;
| public boolean | isDerivedFrom(java.lang.String typeNamespaceArg, java.lang.String typeNameArg, int derivationMethod)DOM Level 3 WD- Experimental.
return false;
| public boolean | isEqualNode(org.w3c.dom.Node arg)DOM Level 3 WD- Experimental.
Override inherited behavior from ParentNode to support deep equal.
isEqualNode is always deep on Attr nodes.
return super.isEqualNode(arg);
| public boolean | isId()DOM Level 3: isId
// REVISIT: should an attribute that is not in the tree return
// isID true?
return isIdAttribute();
| public org.w3c.dom.Node | item(int index)NodeList method: Return the Nth immediate child of this node, or
null if the index is out of bounds.
if (hasStringValue()) {
if (index != 0 || value == null) {
return null;
}
else {
makeChildNode();
return (Node) value;
}
}
ChildNode node = (ChildNode) value;
for (int i = 0; i < index && node != null; i++) {
node = node.nextSibling;
}
return node;
| final com.sun.org.apache.xerces.internal.dom.ChildNode | lastChild()
// last child is stored as the previous sibling of first child
makeChildNode();
return value != null ? ((ChildNode) value).previousSibling : null;
| final void | lastChild(com.sun.org.apache.xerces.internal.dom.ChildNode node)
// store lastChild as previous sibling of first child
if (value != null) {
((ChildNode) value).previousSibling = node;
}
| protected void | makeChildNode()
if (hasStringValue()) {
if (value != null) {
TextImpl text =
(TextImpl) ownerDocument().createTextNode((String) value);
value = text;
text.isFirstChild(true);
text.previousSibling = text;
text.ownerNode = this;
text.isOwned(true);
}
hasStringValue(false);
}
| public void | normalize()
// No need to normalize if already normalized or
// if value is kept as a String.
if (isNormalized() || hasStringValue())
return;
Node kid, next;
ChildNode firstChild = (ChildNode)value;
for (kid = firstChild; kid != null; kid = next) {
next = kid.getNextSibling();
// If kid is a text node, we need to check for one of two
// conditions:
// 1) There is an adjacent text node
// 2) There is no adjacent text node, but kid is
// an empty text node.
if ( kid.getNodeType() == Node.TEXT_NODE )
{
// If an adjacent text node, merge it with kid
if ( next!=null && next.getNodeType() == Node.TEXT_NODE )
{
((Text)kid).appendData(next.getNodeValue());
removeChild( next );
next = kid; // Don't advance; there might be another.
}
else
{
// If kid is empty, remove it
if ( kid.getNodeValue().length()==0 )
removeChild( kid );
}
}
}
isNormalized(true);
| private void | readObject(java.io.ObjectInputStream ois)Deserialize object.
// perform default deseralization
ois.defaultReadObject();
// hardset synchildren - so we don't try to sync -
// it does not make any sense to try to synchildren when we just
// deserialize object.
needsSyncChildren(false);
| public org.w3c.dom.Node | removeChild(org.w3c.dom.Node oldChild)Remove a child from this Node. The removed child's subtree
remains intact so it may be re-inserted elsewhere.
// Tail-call, should be optimizable
if (hasStringValue()) {
// we don't have any child per say so it can't be one of them!
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "NOT_FOUND_ERR", null);
throw new DOMException(DOMException.NOT_FOUND_ERR, msg);
}
return internalRemoveChild(oldChild, false);
| void | rename(java.lang.String name)
if (needsSyncData()) {
synchronizeData();
}
this.name = name;
| public org.w3c.dom.Node | replaceChild(org.w3c.dom.Node newChild, org.w3c.dom.Node oldChild)Make newChild occupy the location that oldChild used to
have. Note that newChild will first be removed from its previous
parent, if any. Equivalent to inserting newChild before oldChild,
then removing oldChild.
makeChildNode();
// If Mutation Events are being generated, this operation might
// throw aggregate events twice when modifying an Attr -- once
// on insertion and once on removal. DOM Level 2 does not specify
// this as either desirable or undesirable, but hints that
// aggregations should be issued only once per user request.
// notify document
CoreDocumentImpl ownerDocument = ownerDocument();
ownerDocument.replacingNode(this);
internalInsertBefore(newChild, oldChild, true);
if (newChild != oldChild) {
internalRemoveChild(oldChild, true);
}
// notify document
ownerDocument.replacedNode(this);
return oldChild;
| public void | setIdAttribute(boolean id)NON-DOM: set the type of this attribute to be ID type.
if (needsSyncData()) {
synchronizeData();
}
isIdAttribute(id);
| public void | setNodeValue(java.lang.String value)Implicit in the rerouting of getNodeValue to getValue is the
need to redefine setNodeValue, for symmetry's sake. Note that
since we're explicitly providing a value, Specified should be set
true.... even if that value equals the default.
setValue(value);
| void | setOwnerDocument(com.sun.org.apache.xerces.internal.dom.CoreDocumentImpl doc)NON-DOM
set the ownerDocument of this node and its children
if (needsSyncChildren()) {
synchronizeChildren();
}
super.setOwnerDocument(doc);
if (!hasStringValue()) {
for (ChildNode child = (ChildNode) value;
child != null; child = child.nextSibling) {
child.setOwnerDocument(doc);
}
}
| public void | setReadOnly(boolean readOnly, boolean deep)Override default behavior so that if deep is true, children are also
toggled.
super.setReadOnly(readOnly, deep);
if (deep) {
if (needsSyncChildren()) {
synchronizeChildren();
}
if (hasStringValue()) {
return;
}
// Recursively set kids
for (ChildNode mykid = (ChildNode) value;
mykid != null;
mykid = mykid.nextSibling) {
if (mykid.getNodeType() != Node.ENTITY_REFERENCE_NODE) {
mykid.setReadOnly(readOnly,true);
}
}
}
| public void | setSpecified(boolean arg)NON-DOM, for use by parser
if (needsSyncData()) {
synchronizeData();
}
isSpecified(arg);
| public void | setType(org.w3c.dom.TypeInfo type)NON-DOM: used by the parser
this.type = type;
| public void | setValue(java.lang.String newvalue)The DOM doesn't clearly define what setValue(null) means. I've taken it
as "remove all children", which from outside should appear
similar to setting it to the empty string.
if (isReadOnly()) {
String msg = DOMMessageFormatter.formatMessage(DOMMessageFormatter.DOM_DOMAIN, "NO_MODIFICATION_ALLOWED_ERR", null);
throw new DOMException(DOMException.NO_MODIFICATION_ALLOWED_ERR, msg);
}
CoreDocumentImpl ownerDocument = ownerDocument();
Element ownerElement = getOwnerElement();
String oldvalue = "";
if (needsSyncData()) {
synchronizeData();
}
if (needsSyncChildren()) {
synchronizeChildren();
}
if (value != null) {
if (ownerDocument.getMutationEvents()) {
// Can no longer just discard the kids; they may have
// event listeners waiting for them to disconnect.
if (hasStringValue()) {
oldvalue = (String) value;
// create an actual text node as our child so
// that we can use it in the event
if (textNode == null) {
textNode = (TextImpl)
ownerDocument.createTextNode((String) value);
}
else {
textNode.data = (String) value;
}
value = textNode;
textNode.isFirstChild(true);
textNode.previousSibling = textNode;
textNode.ownerNode = this;
textNode.isOwned(true);
hasStringValue(false);
internalRemoveChild(textNode, true);
}
else {
oldvalue = getValue();
while (value != null) {
internalRemoveChild((Node) value, true);
}
}
}
else {
if (hasStringValue()) {
oldvalue = (String) value;
}
else {
// simply discard children if any
oldvalue = getValue();
// remove ref from first child to last child
ChildNode firstChild = (ChildNode) value;
firstChild.previousSibling = null;
firstChild.isFirstChild(false);
firstChild.ownerNode = ownerDocument;
}
// then remove ref to current value
value = null;
needsSyncChildren(false);
}
if (isIdAttribute() && ownerElement != null) {
ownerDocument.removeIdentifier(oldvalue);
}
}
// Create and add the new one, generating only non-aggregate events
// (There are no listeners on the new Text, but there may be
// capture/bubble listeners on the Attr.
// Note that aggregate events are NOT dispatched here,
// since we need to combine the remove and insert.
isSpecified(true);
if (ownerDocument.getMutationEvents()) {
// if there are any event handlers create a real node
internalInsertBefore(ownerDocument.createTextNode(newvalue),
null, true);
hasStringValue(false);
// notify document
ownerDocument.modifiedAttrValue(this, oldvalue);
} else {
// directly store the string
value = newvalue;
hasStringValue(true);
changed();
}
if (isIdAttribute() && ownerElement != null) {
ownerDocument.putIdentifier(newvalue, ownerElement);
}
| protected void | synchronizeChildren()Override this method in subclass to hook in efficient
internal data structure.
// By default just change the flag to avoid calling this method again
needsSyncChildren(false);
| public java.lang.String | toString()NON-DOM method for debugging convenience
return getName() + "=" + "\"" + getValue() + "\"";
| private void | writeObject(java.io.ObjectOutputStream out)Serialize object.
// synchronize chilren
if (needsSyncChildren()) {
synchronizeChildren();
}
// write object
out.defaultWriteObject();
|
|