diff options
Diffstat (limited to 'bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal')
6 files changed, 0 insertions, 649 deletions
diff --git a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/COPYRIGHT.html b/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/COPYRIGHT.html deleted file mode 100644 index 26049b750f..0000000000 --- a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/COPYRIGHT.html +++ /dev/null @@ -1,100 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" - "http://www.w3.org/TR/REC-html40/loose.dtd"> -<html> - <head> - <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> - <title>W3C IPR SOFTWARE NOTICE</title> - </head> - <body bgcolor="#FFFFFF" text="#000000"> - <h1> - W3C IPR SOFTWARE NOTICE - </h1> - <h3> - Copyright © 2000 <loc href="http://www.w3.org/">World Wide Web - Consortium</loc>, (<loc href="http://www.lcs.mit.edu/">Massachusetts - Institute of Technology</loc>, <loc href="http://www.inria.fr/">Institut - National de Recherche en Informatique et en Automatique</loc>, <loc - href="http://www.keio.ac.jp/">Keio University</loc>). All Rights - Reserved. - </h3> - <p> - The DOM bindings are published under the W3C Software Copyright Notice - and License. The software license requires "Notice of any changes or - modifications to the W3C files, including the date changes were made." - Consequently, modified versions of the DOM bindings must document that - they do not conform to the W3C standard; in the case of the IDL binding, - the pragma prefix can no longer be 'w3c.org'; in the case of the Java - binding, the package names can no longer be in the 'org.w3c' package. - </p> - <p> - <b>Note:</b> The original version of the W3C Software Copyright Notice - and License could be found at <a - href='http://www.w3.org/Consortium/Legal/copyright-software-19980720'>http://www.w3.org/Consortium/Legal/copyright-software-19980720</a> - </p> - <h3> - Copyright © 1994-2000 <a href="http://www.w3.org/">World Wide Web - Consortium</a>, (<a href="http://www.lcs.mit.edu/">Massachusetts - Institute of Technology</a>, <a href="http://www.inria.fr/">Institut - National de Recherche en Informatique et en Automatique</a>, <a - href="http://www.keio.ac.jp/">Keio University</a>). All Rights - Reserved. http://www.w3.org/Consortium/Legal/ - </h3> - <p> - This W3C work (including software, documents, or other related items) is - being provided by the copyright holders under the following license. By - obtaining, using and/or copying this work, you (the licensee) agree that - you have read, understood, and will comply with the following terms and - conditions: - </p> - <p> - Permission to use, copy, and modify this software and its documentation, - with or without modification, for any purpose and without fee or - royalty is hereby granted, provided that you include the following on ALL - copies of the software and documentation or portions thereof, including - modifications, that you make: - </p> - <ol> - <li> - The full text of this NOTICE in a location viewable to users of the - redistributed or derivative work. - </li> - <li> - Any pre-existing intellectual property disclaimers, notices, or terms - and conditions. If none exist, a short notice of the following form - (hypertext is preferred, text is permitted) should be used within the - body of any redistributed or derivative code: "Copyright © - [$date-of-software] <a href="http://www.w3.org/">World Wide Web - Consortium</a>, (<a href="http://www.lcs.mit.edu/">Massachusetts - Institute of Technology</a>, <a href="http://www.inria.fr/">Institut - National de Recherche en Informatique et en Automatique</a>, <a - href="http://www.keio.ac.jp/">Keio University</a>). All Rights - Reserved. http://www.w3.org/Consortium/Legal/" - </li> - <li> - Notice of any changes or modifications to the W3C files, including the - date changes were made. (We recommend you provide URIs to the location - from which the code is derived.) - </li> - </ol> - <p> - THIS SOFTWARE AND DOCUMENTATION IS PROVIDED "AS IS," AND COPYRIGHT - HOLDERS MAKE NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, - INCLUDING BUT NOT LIMITED TO, WARRANTIES OF MERCHANTABILITY OR FITNESS - FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE OR - DOCUMENTATION WILL NOT INFRINGE ANY THIRD PARTY PATENTS, COPYRIGHTS, - TRADEMARKS OR OTHER RIGHTS. - </p> - <p> - COPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL OR - CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE OR - DOCUMENTATION. - </p> - <p> - The name and trademarks of copyright holders may NOT be used in - advertising or publicity pertaining to the software without specific, - written prior permission. Title to copyright in this software and any - associated documentation will at all times remain with copyright - holders. - </p> - </body> -</html> diff --git a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/DocumentTraversal.java b/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/DocumentTraversal.java deleted file mode 100644 index b56d0fcfc7..0000000000 --- a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/DocumentTraversal.java +++ /dev/null @@ -1,100 +0,0 @@ -/* - * Copyright (c) 2000 World Wide Web Consortium, - * (Massachusetts Institute of Technology, Institut National de - * Recherche en Informatique et en Automatique, Keio University). All - * Rights Reserved. This program is distributed under the W3C's Software - * Intellectual Property License. This program is distributed in the - * hope that it will be useful, but WITHOUT ANY WARRANTY; without even - * the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR - * PURPOSE. - * See W3C License http://www.w3.org/Consortium/Legal/ for more details. - */ - -package org.w3c.dom.traversal; - -import org.w3c.dom.Node; -import org.w3c.dom.DOMException; - -/** - * <code>DocumentTraversal</code> contains methods that create iterators and - * tree-walkers to traverse a node and its children in document order (depth - * first, pre-order traversal, which is equivalent to the order in which the - * start tags occur in the text representation of the document). In DOMs which - * support the Traversal feature, <code>DocumentTraversal</code> will be - * implemented by the same objects that implement the Document interface. - * <p> - * See also the <a - * href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document - * Object Model (DOM) Level 2 Traversal and Range Specification</a>. - * - * @since DOM Level 2 - */ -public interface DocumentTraversal { - /** - * Create a new <code>NodeIterator</code> over the subtree rooted at the - * specified node. - * - * @param rootThe - * node which will be iterated together with its children. The - * iterator is initially positioned just before this node. The - * <code>whatToShow</code> flags and the filter, if any, are - * not considered when setting this position. The root must not - * be <code>null</code>. - * @param whatToShowThis - * flag specifies which node types may appear in the logical - * view of the tree presented by the iterator. See the - * description of <code>NodeFilter</code> for the set of - * possible <code>SHOW_</code> values.These flags can be - * combined using <code>OR</code>. - * @param filterThe - * <code>NodeFilter</code> to be used with this - * <code>TreeWalker</code>, or <code>null</code> to - * indicate no filter. - * @param entityReferenceExpansionThe - * value of this flag determines whether entity reference nodes - * are expanded. - * @return The newly created <code>NodeIterator</code>. - * @exception DOMException - * NOT_SUPPORTED_ERR: Raised if the specified - * <code>root</code> is <code>null</code>. - */ - public NodeIterator createNodeIterator(Node root, int whatToShow, NodeFilter filter, boolean entityReferenceExpansion) throws DOMException; - - /** - * Create a new <code>TreeWalker</code> over the subtree rooted at the - * specified node. - * - * @param rootThe - * node which will serve as the <code>root</code> for the - * <code>TreeWalker</code>. The <code>whatToShow</code> - * flags and the <code>NodeFilter</code> are not considered - * when setting this value; any node type will be accepted as - * the <code>root</code>. The <code>currentNode</code> of - * the <code>TreeWalker</code> is initialized to this node, - * whether or not it is visible. The <code>root</code> - * functions as a stopping point for traversal methods that - * look upward in the document structure, such as - * <code>parentNode</code> and nextNode. The - * <code>root</code> must not be <code>null</code>. - * @param whatToShowThis - * flag specifies which node types may appear in the logical - * view of the tree presented by the tree-walker. See the - * description of <code>NodeFilter</code> for the set of - * possible SHOW_ values.These flags can be combined using - * <code>OR</code>. - * @param filterThe - * <code>NodeFilter</code> to be used with this - * <code>TreeWalker</code>, or <code>null</code> to - * indicate no filter. - * @param entityReferenceExpansionIf - * this flag is false, the contents of - * <code>EntityReference</code> nodes are not presented in - * the logical view. - * @return The newly created <code>TreeWalker</code>. - * @exception DOMException - * NOT_SUPPORTED_ERR: Raised if the specified - * <code>root</code> is <code>null</code>. - */ - public TreeWalker createTreeWalker(Node root, int whatToShow, NodeFilter filter, boolean entityReferenceExpansion) throws DOMException; - -} diff --git a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/NodeFilter.java b/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/NodeFilter.java deleted file mode 100644 index 5badf1d45d..0000000000 --- a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/NodeFilter.java +++ /dev/null @@ -1,150 +0,0 @@ -/* - * Copyright (c) 2000 World Wide Web Consortium, - * (Massachusetts Institute of Technology, Institut National de - * Recherche en Informatique et en Automatique, Keio University). All - * Rights Reserved. This program is distributed under the W3C's Software - * Intellectual Property License. This program is distributed in the - * hope that it will be useful, but WITHOUT ANY WARRANTY; without even - * the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR - * PURPOSE. - * See W3C License http://www.w3.org/Consortium/Legal/ for more details. - */ - -package org.w3c.dom.traversal; - -import org.w3c.dom.Node; - -/** - * Filters are objects that know how to "filter out" nodes. If a - * <code>NodeIterator</code> or <code>TreeWalker</code> is given a - * <code>NodeFilter</code>, it applies the filter before it returns the - * next node. If the filter says to accept the node, the traversal logic - * returns it; otherwise, traversal looks for the next node and pretends that - * the node that was rejected was not there. - * <p> - * The DOM does not provide any filters. <code>NodeFilter</code> is just an - * interface that users can implement to provide their own filters. - * <p> - * <code>NodeFilters</code> do not need to know how to traverse from node to - * node, nor do they need to know anything about the data structure that is - * being traversed. This makes it very easy to write filters, since the only - * thing they have to know how to do is evaluate a single node. One filter may - * be used with a number of different kinds of traversals, encouraging code - * reuse. - * <p> - * See also the <a - * href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document - * Object Model (DOM) Level 2 Traversal and Range Specification</a>. - * - * @since DOM Level 2 - */ -public interface NodeFilter { - // Constants returned by acceptNode - /** - * Accept the node. Navigation methods defined for - * <code>NodeIterator</code> or <code>TreeWalker</code> will return - * this node. - */ - public static final short FILTER_ACCEPT = 1; - /** - * Reject the node. Navigation methods defined for - * <code>NodeIterator</code> or <code>TreeWalker</code> will not - * return this node. For <code>TreeWalker</code>, the children of this - * node will also be rejected. <code>NodeIterators</code> treat this as - * a synonym for <code>FILTER_SKIP</code>. - */ - public static final short FILTER_REJECT = 2; - /** - * Skip this single node. Navigation methods defined for - * <code>NodeIterator</code> or <code>TreeWalker</code> will not - * return this node. For both <code>NodeIterator</code> and - * <code>TreeWalker</code>, the children of this node will still be - * considered. - */ - public static final short FILTER_SKIP = 3; - - // Constants for whatToShow - /** - * Show all <code>Nodes</code>. - */ - public static final int SHOW_ALL = 0xFFFFFFFF; - /** - * Show <code>Element</code> nodes. - */ - public static final int SHOW_ELEMENT = 0x00000001; - /** - * Show <code>Attr</code> nodes. This is meaningful only when creating - * an iterator or tree-walker with an attribute node as its - * <code>root</code>; in this case, it means that the attribute node - * will appear in the first position of the iteration or traversal. Since - * attributes are never children of other nodes, they do not appear when - * traversing over the document tree. - */ - public static final int SHOW_ATTRIBUTE = 0x00000002; - /** - * Show <code>Text</code> nodes. - */ - public static final int SHOW_TEXT = 0x00000004; - /** - * Show <code>CDATASection</code> nodes. - */ - public static final int SHOW_CDATA_SECTION = 0x00000008; - /** - * Show <code>EntityReference</code> nodes. - */ - public static final int SHOW_ENTITY_REFERENCE = 0x00000010; - /** - * Show <code>Entity</code> nodes. This is meaningful only when creating - * an iterator or tree-walker with an<code> Entity</code> node as its - * <code>root</code>; in this case, it means that the - * <code>Entity</code> node will appear in the first position of the - * traversal. Since entities are not part of the document tree, they do - * not appear when traversing over the document tree. - */ - public static final int SHOW_ENTITY = 0x00000020; - /** - * Show <code>ProcessingInstruction</code> nodes. - */ - public static final int SHOW_PROCESSING_INSTRUCTION = 0x00000040; - /** - * Show <code>Comment</code> nodes. - */ - public static final int SHOW_COMMENT = 0x00000080; - /** - * Show <code>Document</code> nodes. - */ - public static final int SHOW_DOCUMENT = 0x00000100; - /** - * Show <code>DocumentType</code> nodes. - */ - public static final int SHOW_DOCUMENT_TYPE = 0x00000200; - /** - * Show <code>DocumentFragment</code> nodes. - */ - public static final int SHOW_DOCUMENT_FRAGMENT = 0x00000400; - /** - * Show <code>Notation</code> nodes. This is meaningful only when - * creating an iterator or tree-walker with a <code>Notation</code> node - * as its <code>root</code>; in this case, it means that the - * <code>Notation</code> node will appear in the first position of the - * traversal. Since notations are not part of the document tree, they do - * not appear when traversing over the document tree. - */ - public static final int SHOW_NOTATION = 0x00000800; - - /** - * Test whether a specified node is visible in the logical view of a - * <code>TreeWalker</code> or <code>NodeIterator</code>. This - * function will be called by the implementation of - * <code>TreeWalker</code> and <code>NodeIterator</code>; it is not - * normally called directly from user code. (Though you could do so if you - * wanted to use the same filter to guide your own application logic.) - * - * @param nThe - * node to check to see if it passes the filter or not. - * @return a constant to determine whether the node is accepted, rejected, - * or skipped, as defined above. - */ - public short acceptNode(Node n); - -} diff --git a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/NodeIterator.java b/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/NodeIterator.java deleted file mode 100644 index 8616e700b0..0000000000 --- a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/NodeIterator.java +++ /dev/null @@ -1,112 +0,0 @@ -/* - * Copyright (c) 2000 World Wide Web Consortium, - * (Massachusetts Institute of Technology, Institut National de - * Recherche en Informatique et en Automatique, Keio University). All - * Rights Reserved. This program is distributed under the W3C's Software - * Intellectual Property License. This program is distributed in the - * hope that it will be useful, but WITHOUT ANY WARRANTY; without even - * the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR - * PURPOSE. - * See W3C License http://www.w3.org/Consortium/Legal/ for more details. - */ - -package org.w3c.dom.traversal; - -import org.w3c.dom.Node; -import org.w3c.dom.DOMException; - -/** - * <code>Iterators</code> are used to step through a set of nodes, e.g. the - * set of nodes in a <code>NodeList</code>, the document subtree governed - * by a particular <code>Node</code>, the results of a query, or any other - * set of nodes. The set of nodes to be iterated is determined by the - * implementation of the <code>NodeIterator</code>. DOM Level 2 specifies a - * single <code>NodeIterator</code> implementation for document-order - * traversal of a document subtree. Instances of these iterators are created - * by calling <code>DocumentTraversal</code> - * <code>.createNodeIterator()</code>. - * <p> - * See also the <a - * href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document - * Object Model (DOM) Level 2 Traversal and Range Specification</a>. - * - * @since DOM Level 2 - */ -public interface NodeIterator { - /** - * The root node of the <code>NodeIterator</code>, as specified when it - * was created. - */ - public Node getRoot(); - - /** - * This attribute determines which node types are presented via the - * iterator. The available set of constants is defined in the - * <code>NodeFilter</code> interface. Nodes not accepted by - * <code>whatToShow</code> will be skipped, but their children may still - * be considered. Note that this skip takes precedence over the filter, if - * any. - */ - public int getWhatToShow(); - - /** - * The <code>NodeFilter</code> used to screen nodes. - */ - public NodeFilter getFilter(); - - /** - * The value of this flag determines whether the children of entity - * reference nodes are visible to the iterator. If false, they and their - * descendants will be rejected. Note that this rejection takes precedence - * over <code>whatToShow</code> and the filter. Also note that this is - * currently the only situation where <code>NodeIterators</code> may - * reject a complete subtree rather than skipping individual nodes. <br> - * <br> - * To produce a view of the document that has entity references expanded - * and does not expose the entity reference node itself, use the - * <code>whatToShow</code> flags to hide the entity reference node and - * set <code>expandEntityReferences</code> to true when creating the - * iterator. To produce a view of the document that has entity reference - * nodes but no entity expansion, use the <code>whatToShow</code> flags - * to show the entity reference node and set - * <code>expandEntityReferences</code> to false. - */ - public boolean getExpandEntityReferences(); - - /** - * Returns the next node in the set and advances the position of the - * iterator in the set. After a <code>NodeIterator</code> is created, - * the first call to <code>nextNode()</code> returns the first node in - * the set. - * - * @return The next <code>Node</code> in the set being iterated over, or - * <code>null</code> if there are no more members in that set. - * @exception DOMException - * INVALID_STATE_ERR: Raised if this method is called after - * the <code>detach</code> method was invoked. - */ - public Node nextNode() throws DOMException; - - /** - * Returns the previous node in the set and moves the position of the - * <code>NodeIterator</code> backwards in the set. - * - * @return The previous <code>Node</code> in the set being iterated - * over, or <code>null</code> if there are no more members in - * that set. - * @exception DOMException - * INVALID_STATE_ERR: Raised if this method is called after - * the <code>detach</code> method was invoked. - */ - public Node previousNode() throws DOMException; - - /** - * Detaches the <code>NodeIterator</code> from the set which it iterated - * over, releasing any computational resources and placing the iterator in - * the INVALID state. After <code>detach</code> has been invoked, calls - * to <code>nextNode</code> or <code>previousNode</code> will raise - * the exception INVALID_STATE_ERR. - */ - public void detach(); - -} diff --git a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/TreeWalker.java b/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/TreeWalker.java deleted file mode 100644 index 0ec2e62f70..0000000000 --- a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/TreeWalker.java +++ /dev/null @@ -1,184 +0,0 @@ -/* - * Copyright (c) 2000 World Wide Web Consortium, - * (Massachusetts Institute of Technology, Institut National de - * Recherche en Informatique et en Automatique, Keio University). All - * Rights Reserved. This program is distributed under the W3C's Software - * Intellectual Property License. This program is distributed in the - * hope that it will be useful, but WITHOUT ANY WARRANTY; without even - * the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR - * PURPOSE. - * See W3C License http://www.w3.org/Consortium/Legal/ for more details. - */ - -package org.w3c.dom.traversal; - -import org.w3c.dom.Node; -import org.w3c.dom.DOMException; - -/** - * <code>TreeWalker</code> objects are used to navigate a document tree or - * subtree using the view of the document defined by their - * <code>whatToShow</code> flags and filter (if any). Any function which - * performs navigation using a <code>TreeWalker</code> will automatically - * support any view defined by a <code>TreeWalker</code>. - * <p> - * Omitting nodes from the logical view of a subtree can result in a structure - * that is substantially different from the same subtree in the complete, - * unfiltered document. Nodes that are siblings in the <code>TreeWalker</code> - * view may be children of different, widely separated nodes in the original - * view. For instance, consider a <code>NodeFilter</code> that skips all - * nodes except for Text nodes and the root node of a document. In the logical - * view that results, all text nodes will be siblings and appear as direct - * children of the root node, no matter how deeply nested the structure of the - * original document. - * <p> - * See also the <a - * href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>Document - * Object Model (DOM) Level 2 Traversal and Range Specification</a>. - * - * @since DOM Level 2 - */ -public interface TreeWalker { - /** - * The <code>root</code> node of the <code>TreeWalker</code>, as - * specified when it was created. - */ - public Node getRoot(); - - /** - * This attribute determines which node types are presented via the - * <code>TreeWalker</code>. The available set of constants is defined - * in the <code>NodeFilter</code> interface. Nodes not accepted by - * <code>whatToShow</code> will be skipped, but their children may still - * be considered. Note that this skip takes precedence over the filter, if - * any. - */ - public int getWhatToShow(); - - /** - * The filter used to screen nodes. - */ - public NodeFilter getFilter(); - - /** - * The value of this flag determines whether the children of entity - * reference nodes are visible to the <code>TreeWalker</code>. If - * false, they and their descendants will be rejected. Note that this - * rejection takes precedence over <code>whatToShow</code> and the - * filter, if any. <br> - * To produce a view of the document that has entity references expanded - * and does not expose the entity reference node itself, use the - * <code>whatToShow</code> flags to hide the entity reference node and - * set <code>expandEntityReferences</code> to true when creating the - * <code>TreeWalker</code>. To produce a view of the document that has - * entity reference nodes but no entity expansion, use the - * <code>whatToShow</code> flags to show the entity reference node and - * set <code>expandEntityReferences</code> to false. - */ - public boolean getExpandEntityReferences(); - - /** - * The node at which the <code>TreeWalker</code> is currently - * positioned. <br> - * Alterations to the DOM tree may cause the current node to no longer be - * accepted by the <code>TreeWalker</code>'s associated filter. - * <code>currentNode</code> may also be explicitly set to any node, - * whether or not it is within the subtree specified by the - * <code>root</code> node or would be accepted by the filter and - * <code>whatToShow</code> flags. Further traversal occurs relative to - * <code>currentNode</code> even if it is not part of the current view, - * by applying the filters in the requested direction; if no traversal is - * possible, <code>currentNode</code> is not changed. - * - * @exception DOMException - * NOT_SUPPORTED_ERR: Raised if an attempt is made to set - * <code>currentNode</code> to <code>null</code>. - */ - public Node getCurrentNode(); - - public void setCurrentNode(Node currentNode) throws DOMException; - - /** - * Moves to and returns the closest visible ancestor node of the current - * node. If the search for <code>parentNode</code> attempts to step - * upward from the <code>TreeWalker</code>'s <code>root</code> node, - * or if it fails to find a visible ancestor node, this method retains the - * current position and returns <code>null</code>. - * - * @return The new parent node, or <code>null</code> if the current node - * has no parent in the <code>TreeWalker</code>'s logical view. - */ - public Node parentNode(); - - /** - * Moves the <code>TreeWalker</code> to the first visible child of the - * current node, and returns the new node. If the current node has no - * visible children, returns <code>null</code>, and retains the current - * node. - * - * @return The new node, or <code>null</code> if the current node has no - * visible children in the <code>TreeWalker</code>'s logical - * view. - */ - public Node firstChild(); - - /** - * Moves the <code>TreeWalker</code> to the last visible child of the - * current node, and returns the new node. If the current node has no - * visible children, returns <code>null</code>, and retains the current - * node. - * - * @return The new node, or <code>null</code> if the current node has no - * children in the <code>TreeWalker</code>'s logical view. - */ - public Node lastChild(); - - /** - * Moves the <code>TreeWalker</code> to the previous sibling of the - * current node, and returns the new node. If the current node has no - * visible previous sibling, returns <code>null</code>, and retains the - * current node. - * - * @return The new node, or <code>null</code> if the current node has no - * previous sibling. in the <code>TreeWalker</code>'s logical - * view. - */ - public Node previousSibling(); - - /** - * Moves the <code>TreeWalker</code> to the next sibling of the current - * node, and returns the new node. If the current node has no visible next - * sibling, returns <code>null</code>, and retains the current node. - * - * @return The new node, or <code>null</code> if the current node has no - * next sibling. in the <code>TreeWalker</code>'s logical view. - */ - public Node nextSibling(); - - /** - * Moves the <code>TreeWalker</code> to the previous visible node in - * document order relative to the current node, and returns the new node. - * If the current node has no previous node, or if the search for - * <code>previousNode</code> attempts to step upward from the - * <code>TreeWalker</code>'s <code>root</code> node, returns - * <code>null</code>, and retains the current node. - * - * @return The new node, or <code>null</code> if the current node has no - * previous node in the <code>TreeWalker</code>'s logical view. - */ - public Node previousNode(); - - /** - * Moves the <code>TreeWalker</code> to the next visible node in - * document order relative to the current node, and returns the new node. - * If the current node has no next node, or if the search for nextNode - * attempts to step upward from the <code>TreeWalker</code>'s - * <code>root</code> node, returns <code>null</code>, and retains the - * current node. - * - * @return The new node, or <code>null</code> if the current node has no - * next node in the <code>TreeWalker</code>'s logical view. - */ - public Node nextNode(); - -} diff --git a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/package.html b/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/package.html deleted file mode 100644 index d8fbae65d9..0000000000 --- a/bundles/org.eclipse.wst.xml.core/src/org/w3c/dom/traversal/package.html +++ /dev/null @@ -1,3 +0,0 @@ -<html> -This package contains unmodified sources provided by http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113/java-binding.zip -</html>
\ No newline at end of file |