Examples of mf.org.w3c.dom.Node

mf.org.w3c.dom.Node
3.org/TR/2004/REC-DOM-Level-3-Core-20040407'>Document Object Model (DOM) Level 3 Core Specification.

        traverseCommonEndContainer( Node startAncestor, int how )
    {
        DocumentFragment frag = null;
        if ( how!=DELETE_CONTENTS)
            frag = fDocument.createDocumentFragment();
        Node n = traverseLeftBoundary( startAncestor, how );
        if ( frag!=null )
            frag.appendChild( n );
        int startIdx = indexOf( startAncestor, fEndContainer );
        ++startIdx;  // Because we already traversed it....


        int cnt = fEndOffset - startIdx;
        n = startAncestor.getNextSibling();
        while( cnt > 0 )
        {
            Node sibling = n.getNextSibling();
            Node xferNode = traverseFullySelected( n, how );
            if ( frag!=null )
                frag.appendChild( xferNode );
            --cnt;
            n = sibling;
        }

View Full Code Here

    {
        DocumentFragment frag = null;
        if ( how!=DELETE_CONTENTS)
            frag = fDocument.createDocumentFragment();


        Node n = traverseLeftBoundary( startAncestor, how );
        if ( frag!=null )
            frag.appendChild( n );


        Node commonParent = startAncestor.getParentNode();
        int startOffset = indexOf( startAncestor, commonParent );
        int endOffset = indexOf( endAncestor, commonParent );
        ++startOffset;


        int cnt = endOffset - startOffset;
        Node sibling = startAncestor.getNextSibling();


        while( cnt > 0 )
        {
            Node nextSibling = sibling.getNextSibling();
            n = traverseFullySelected( sibling, how );
            if ( frag!=null )
                frag.appendChild( n );
            sibling = nextSibling;
            --cnt;

View Full Code Here

     *         If the traversal operation is
     *         <code>DELETE_CONTENTS</code> the return value is null.
     */
    private Node traverseRightBoundary( Node root, int how )
    {
        Node next = getSelectedNode( fEndContainer, fEndOffset-1 );
        boolean isFullySelected = ( next!=fEndContainer );


        if ( next==root )
            return traverseNode( next, isFullySelected, false, how );


        Node parent = next.getParentNode();
        Node clonedParent = traverseNode( parent, false, false, how );


        while( parent!=null )
        {
            while( next!=null )
            {
                Node prevSibling = next.getPreviousSibling();
                Node clonedChild = 
                    traverseNode( next, isFullySelected, false, how );
                if ( how!=DELETE_CONTENTS )
                {
                    clonedParent.insertBefore( 
                        clonedChild, 
                        clonedParent.getFirstChild() 
                    );
                }
                isFullySelected = true;
                next = prevSibling;
            }
            if ( parent==root )
                return clonedParent;


            next = parent.getPreviousSibling();
            parent = parent.getParentNode();
            Node clonedGrandParent = traverseNode( parent, false, false, how );
            if ( how!=DELETE_CONTENTS )
                clonedGrandParent.appendChild( clonedParent );
            clonedParent = clonedGrandParent;


        } 


        // should never occur

View Full Code Here

     *         If the traversal operation is
     *         <code>DELETE_CONTENTS</code> the return value is null.
     */
    private Node traverseLeftBoundary( Node root, int how )
    {
        Node next = getSelectedNode( getStartContainer(), getStartOffset() );
        boolean isFullySelected = ( next!=getStartContainer() );


        if ( next==root )
            return traverseNode( next, isFullySelected, true, how );


        Node parent = next.getParentNode();
        Node clonedParent = traverseNode( parent, false, true, how );


        while( parent!=null )
        {
            while( next!=null )
            {
                Node nextSibling = next.getNextSibling();
                Node clonedChild = 
                    traverseNode( next, isFullySelected, true, how );
                if ( how!=DELETE_CONTENTS )
                    clonedParent.appendChild(clonedChild);
                isFullySelected = true;
                next = nextSibling;
            }
            if ( parent==root )
                return clonedParent;


            next = parent.getNextSibling();
            parent = parent.getParentNode();
            Node clonedGrandParent = traverseNode( parent, false, true, how );
            if ( how!=DELETE_CONTENTS )
                clonedGrandParent.appendChild( clonedParent );
            clonedParent = clonedGrandParent;


        } 


        // should never occur

View Full Code Here


        if ( how != CLONE_CONTENTS )
            n.setNodeValue( oldNodeValue );
        if ( how==DELETE_CONTENTS )
            return null;
        Node newNode = n.cloneNode( false );
        newNode.setNodeValue( newNodeValue );
        return newNode;
    }

View Full Code Here

  private boolean hasLegalRootContainer( Node node )
  {
    if ( node==null )
      return false;


    Node rootContainer = getRootContainer( node );
    switch( rootContainer.getNodeType() )
    {
    case Node.ATTRIBUTE_NODE:
    case Node.DOCUMENT_NODE:
    case Node.DOCUMENT_FRAGMENT_NODE:
      return true;

View Full Code Here


    Node nextNode(Node node, boolean visitChildren) {
            
        if (node == null) return null;


        Node result;
        if (visitChildren) {
            result = node.getFirstChild();
            if (result != null) {
                return result;
            }
        }
            
        // if hasSibling, return sibling
        result = node.getNextSibling();
        if (result != null) {
            return result;
        }
        
                
        // return parent's 1st sibling.
        Node parent = node.getParentNode();
        while (parent != null
               && parent != fDocument
                ) {
            result = parent.getNextSibling();
            if (result != null) {
                return result;
            } else {
                parent = parent.getParentNode();
            }
                            
        } // while (parent != null && parent != fRoot) {
        
        // end of list, return null

View Full Code Here

        // This case is an important convenience for 
        // traverseRightBoundary()
        if ( offset<0 )
            return container;


        Node child = container.getFirstChild();
        while( child!=null && offset > 0 )
        {
            --offset;
            child = child.getNextSibling();
        }
        if ( child!=null )
            return child;
        return container;
    }

View Full Code Here

                xmlInputSources[i] = new SAXInputSource(saxSource.getXMLReader(), inputSource);
            }
            else if (source instanceof DOMSource) {
                DOMSource domSource = (DOMSource) source;
                //MF
                Node node = (Node) domSource.getNode();
                String systemID = domSource.getSystemId();          
                xmlInputSources[i] = new DOMInputSource(node, systemID);
            }
            else if (source instanceof StAXSource) {
                StAXSource staxSource = (StAXSource) source;

View Full Code Here

        if (entities != null && argEntities != null) {
            if (entities.getLength() != argEntities.getLength())
                return false;


            for (int index = 0; entities.item(index) != null; index++) {
                Node entNode1 = entities.item(index);
                Node entNode2 =
                    argEntities.getNamedItem(entNode1.getNodeName());


                if (!((NodeImpl) entNode1).isEqualNode(entNode2))
                    return false;
            }
        }


        NamedNodeMapImpl argNotations = argDocType.notations;


        if ((notations == null && argNotations != null)
            || (notations != null && argNotations == null))
            return false;


        if (notations != null && argNotations != null) {
            if (notations.getLength() != argNotations.getLength())
                return false;


            for (int index = 0; notations.item(index) != null; index++) {
                Node noteNode1 = notations.item(index);
                Node noteNode2 =
                    argNotations.getNamedItem(noteNode1.getNodeName());


                if (!((NodeImpl) noteNode1).isEqualNode(noteNode2))
                    return false;
            }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of mf.org.w3c.dom.Node

mf.org.apache.html.dom.HTMLCollectionImpl

mf.org.apache.html.dom.HTMLDocumentImpl

mf.org.apache.html.dom.HTMLElementImpl

mf.org.apache.html.dom.HTMLOptionElementImpl

mf.org.apache.html.dom.HTMLScriptElementImpl

mf.org.apache.html.dom.HTMLSelectElementImpl

mf.org.apache.html.dom.HTMLTableCellElementImpl

mf.org.apache.html.dom.HTMLTableElementImpl

mf.org.apache.html.dom.HTMLTableRowElementImpl

mf.org.apache.html.dom.HTMLTableSectionElementImpl

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.