Examples of org.w3c.dom.Node.normalize()

org.w3c.dom.Node.normalize()
Puts all Text nodes in the full depth of the sub-tree underneath this Node , including attribute nodes, into a "normal" form where only markup (e.g., tags, comments, processing instructions, CDATA sections, and entity references) separates Text nodes, i.e., there are neither adjacent Text nodes nor empty Text nodes. This can be used to ensure that the DOM view of a document is the same as if it were saved and re-loaded, and is useful when operations (such as XPointer lookups) that depend on a particular document tree structure are to be used. In cases where the document contains CDATASections , the normalize operation alone may not be sufficient, since XPointers do not differentiate between Text nodes and CDATASection nodes. @since DOM Level 2

                                              currentProfile);
                    } else {
                        // do we have elements as children or text?
                        if (currentDelta.hasChildNodes() == true) {
                            currentDelta.normalize();
                            currentProfile.normalize();
                            // do a recursive call for sub elements
                            this.importNode((Element)currentProfile, (Element)currentDelta, preserve);
                            // and now the text nodes: Remove all from the profile and add all
                            // of the delta
                            NodeList childs = currentProfile.getChildNodes();

View Full Code Here

                        }
                    }


                    // now the last check: ID must have a TEXT child
                    if (found == true) {
                        child.normalize(); // join text nodes
                        if (child.hasChildNodes() == true &&
                            child.getChildNodes().getLength() == 1 &&
                            child.getChildNodes().item(0).getNodeType() == Node.TEXT_NODE) {
                            String value = child.getChildNodes().item(0).getNodeValue().trim();
                            if (value.length() > 0) isValid = true;

View Full Code Here

                for(int i = 0; i < childs.getLength(); i++) {
                    current = childs.item(i);


                    // only element nodes
                    if (current.getNodeType() == Node.ELEMENT_NODE) {
                        current.normalize();
                        NodeList valueChilds = current.getChildNodes();
                        String   key;
                        StringBuffer   valueBuffer;
                        String         value;

View Full Code Here

                for(int i = 0; i < childs.getLength(); i++) {
                    current = childs.item(i);


                    // only element nodes
                    if (current.getNodeType() == Node.ELEMENT_NODE) {
                        current.normalize();
                        NodeList valueChilds = current.getChildNodes();
                        String   key;
                        StringBuffer   valueBuffer;
                        String         value;

View Full Code Here

                        }
                    }


                    // now the last check: ID must have a TEXT child
                    if (found == true) {
                        child.normalize(); // join text nodes
                        if (child.hasChildNodes() == true &&
                            child.getChildNodes().getLength() == 1 &&
                            child.getChildNodes().item(0).getNodeType() == Node.TEXT_NODE) {
                            String value = child.getChildNodes().item(0).getNodeValue().trim();
                            if (value.length() > 0) isValid = true;

View Full Code Here

     * <b>DOM</b>: Implements {@link org.w3c.dom.Node#normalize()}.
     */
    public void normalize() {
  Node p = getFirstChild();
  if (p != null) {
      p.normalize();
      Node n = p.getNextSibling();
      while (n != null) {
    if (p.getNodeType() == TEXT_NODE &&
                    n.getNodeType() == TEXT_NODE) {
        String s = p.getNodeValue() + n.getNodeValue();

View Full Code Here

        AbstractText at = (AbstractText)p;
        at.setNodeValue(s);
        removeChild(n);
        n = p.getNextSibling();
    } else {
        n.normalize();
        p = n;
        n = n.getNextSibling();
    }
      }
  }

View Full Code Here


        // Create Document Fragment
        final Document doc = builder.getDocument();
        final DocumentFragment recordedDocFrag = doc.createDocumentFragment();
        final Node root = doc.getDocumentElement();
        root.normalize();
        Node child;
        boolean appendedNode = false;
        while (root.hasChildNodes() == true) {
            child = root.getFirstChild();
            root.removeChild(child);

View Full Code Here

                    // this is not new


                    // do we have elements as children or text?
                    if (currentDelta.hasChildNodes() == true) {
                        currentDelta.normalize();
                        currentProfile.normalize();
                        // do a recursive call for sub elements
                        this.importNode((Element)currentProfile, (Element)currentDelta);
                        // and now the text nodes: Remove all from the profile and add all
                        // of the delta
                        NodeList childs = currentProfile.getChildNodes();

View Full Code Here

     * <b>DOM</b>: Implements {@link org.w3c.dom.Node#normalize()}.
     */
    public void normalize() {
  Node p = getFirstChild();
  if (p != null) {
      p.normalize();
      Node n = p.getNextSibling();
      while (n != null) {
    if (p.getNodeType() == TEXT_NODE &&
                    n.getNodeType() == TEXT_NODE) {
        String s = p.getNodeValue() + n.getNodeValue();

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.