/** Returns the last child of the given node. */ public int getLastChild(int nodeIndex) { return getLastChild(nodeIndex, true); }
int child = getLastChild(nodeIndex, false); if (child !=-1) {
int node = fDeferredDocumentImpl.getLastChild (fDocumentTypeIndex, false); while (node != -1) { short nodeType = fDeferredDocumentImpl.getNodeType (node, false);
int nodeIndex = fDeferredDocumentImpl.getLastChild (fDocumentTypeIndex, false); while (nodeIndex != -1) { short nodeType = fDeferredDocumentImpl.getNodeType (nodeIndex, false);
/** Synchronizes the data (name and value) for fast nodes. */ protected void synchronizeData() { // no need to sync in the future needsSyncData(false); // fluff data DeferredDocumentImpl ownerDocument = (DeferredDocumentImpl) ownerDocument(); name = ownerDocument.getNodeName(fNodeIndex); // extract prefix and local part from QName int index = name.indexOf(':'); if (index < 0) { localName = name; } else { localName = name.substring(index + 1); } int extra = ownerDocument.getNodeExtra(fNodeIndex); isSpecified((extra & SPECIFIED) != 0); isIdAttribute((extra & ID) != 0); namespaceURI = ownerDocument.getNodeURI(fNodeIndex); int extraNode = ownerDocument.getLastChild(fNodeIndex); type = ownerDocument.getTypeInfo(extraNode); } // synchronizeData()
int nodeIndex = fDeferredDocumentImpl.getLastChild (fDocumentTypeIndex, false); while (nodeIndex != -1) { short nodeType = fDeferredDocumentImpl.getNodeType (nodeIndex, false);
int nodeIndex = fDeferredDocumentImpl.getLastChild (fDocumentTypeIndex, false); while (nodeIndex != -1) { short nodeType = fDeferredDocumentImpl.getNodeType (nodeIndex, false);
int node = fDeferredDocumentImpl.getLastChild (fDocumentTypeIndex, false); while (node != -1) { short nodeType = fDeferredDocumentImpl.getNodeType (node, false); fDeferredDocumentImpl.getLastChild (fDeferredEntityDecl, false) == -1) { int childIndex = fDeferredDocumentImpl.getLastChild (fCurrentNodeIndex, false); while (childIndex != -1) { int cloneIndex = fDeferredDocumentImpl.cloneNode (childIndex, true); int childIndex = fDeferredDocumentImpl.getLastChild (fCurrentNodeIndex, false); int parentIndex = fDeferredDocumentImpl.getParentNode (fCurrentNodeIndex,
/** Synchronizes the data (name and value) for fast nodes. */ protected void synchronizeData() { // no need to sync in the future needsSyncData(false); // fluff data DeferredDocumentImpl ownerDocument = (DeferredDocumentImpl) ownerDocument(); name = ownerDocument.getNodeName(fNodeIndex); int extra = ownerDocument.getNodeExtra(fNodeIndex); isSpecified((extra & SPECIFIED) != 0); isIdAttribute((extra & ID) != 0); int extraNode = ownerDocument.getLastChild(fNodeIndex); type = ownerDocument.getTypeInfo(extraNode); } // synchronizeData()
/** Synchronizes the default attribute values. */ protected void synchronizeChildren() { // we don't want to generate any event for this so turn them off boolean orig = ownerDocument.getMutationEvents(); ownerDocument.setMutationEvents(false); // attributes are now synced needsSyncChildren(false); // create attributes node map DeferredDocumentImpl ownerDocument = (DeferredDocumentImpl)this.ownerDocument; attributes = new NamedNodeMapImpl(ownerDocument); // Default attributes dangle as children of the element // definition "node" in the internal fast table. for (int nodeIndex = ownerDocument.getLastChild(fNodeIndex); nodeIndex != -1; nodeIndex = ownerDocument.getPrevSibling(nodeIndex)) { Node attr = ownerDocument.getNodeObject(nodeIndex); attributes.setNamedItem(attr); } // set mutation events flag back to its original value ownerDocument.setMutationEvents(orig); } // synchronizeChildren()
if (fDocumentTypeIndex != -1) { int node = fDeferredDocumentImpl.getLastChild (fDocumentTypeIndex, false); while (node != -1) { short nodeType = fDeferredDocumentImpl.getNodeType (node, false);
int childIndex = getLastChild(nodeIndex, false); while (childIndex != -1) { int clonedChildIndex = cloneNode(childIndex, deep);
for (int index = getLastChild(nodeIndex); index != -1; index = getPrevSibling(index)) {
for (int index = ownerDocument.getLastChild(fNodeIndex); index != -1; index = ownerDocument.getPrevSibling(index)) {
for (int index = getLastChild(0); index != -1; index = getPrevSibling(index)) {
int last = getLastChild(nodeIndex); int prev = getPrevSibling(last); if (prev == -1) {