+++ /dev/null
-/*\r
- * Copyright (c) 2000 World Wide Web Consortium,\r
- * (Massachusetts Institute of Technology, Institut National de\r
- * Recherche en Informatique et en Automatique, Keio University). All\r
- * Rights Reserved. This program is distributed under the W3C's Software\r
- * Intellectual Property License. This program is distributed in the\r
- * hope that it will be useful, but WITHOUT ANY WARRANTY; without even\r
- * the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\r
- * PURPOSE.\r
- * See W3C License http://www.w3.org/Consortium/Legal/ for more details.\r
- */\r
-\r
-package org.w3c.dom.traversal;\r
-\r
-import org.w3c.dom.Node;\r
-\r
-/**\r
- * Filters are objects that know how to "filter out" nodes. If a \r
- * <code>NodeIterator</code> or <code>TreeWalker</code> is given a \r
- * <code>NodeFilter</code>, it applies the filter before it returns the next \r
- * node. If the filter says to accept the node, the traversal logic returns \r
- * it; otherwise, traversal looks for the next node and pretends that the \r
- * node that was rejected was not there.\r
- * <p>The DOM does not provide any filters. <code>NodeFilter</code> is just an \r
- * interface that users can implement to provide their own filters. \r
- * <p><code>NodeFilters</code> do not need to know how to traverse from node \r
- * to node, nor do they need to know anything about the data structure that \r
- * is being traversed. This makes it very easy to write filters, since the \r
- * only thing they have to know how to do is evaluate a single node. One \r
- * filter may be used with a number of different kinds of traversals, \r
- * encouraging code reuse.\r
- * <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>.\r
- * @since DOM Level 2\r
- */\r
-public interface NodeFilter {\r
- // Constants returned by acceptNode\r
- /**\r
- * Accept the node. Navigation methods defined for \r
- * <code>NodeIterator</code> or <code>TreeWalker</code> will return this \r
- * node.\r
- */\r
- public static final short FILTER_ACCEPT = 1;\r
- /**\r
- * Reject the node. Navigation methods defined for \r
- * <code>NodeIterator</code> or <code>TreeWalker</code> will not return \r
- * this node. For <code>TreeWalker</code>, the children of this node \r
- * will also be rejected. <code>NodeIterators</code> treat this as a \r
- * synonym for <code>FILTER_SKIP</code>.\r
- */\r
- public static final short FILTER_REJECT = 2;\r
- /**\r
- * Skip this single node. Navigation methods defined for \r
- * <code>NodeIterator</code> or <code>TreeWalker</code> will not return \r
- * this node. For both <code>NodeIterator</code> and \r
- * <code>TreeWalker</code>, the children of this node will still be \r
- * considered. \r
- */\r
- public static final short FILTER_SKIP = 3;\r
-\r
- // Constants for whatToShow\r
- /**\r
- * Show all <code>Nodes</code>.\r
- */\r
- public static final int SHOW_ALL = 0xFFFFFFFF;\r
- /**\r
- * Show <code>Element</code> nodes.\r
- */\r
- public static final int SHOW_ELEMENT = 0x00000001;\r
- /**\r
- * Show <code>Attr</code> nodes. This is meaningful only when creating an \r
- * iterator or tree-walker with an attribute node as its \r
- * <code>root</code>; in this case, it means that the attribute node \r
- * will appear in the first position of the iteration or traversal. \r
- * Since attributes are never children of other nodes, they do not \r
- * appear when traversing over the document tree.\r
- */\r
- public static final int SHOW_ATTRIBUTE = 0x00000002;\r
- /**\r
- * Show <code>Text</code> nodes.\r
- */\r
- public static final int SHOW_TEXT = 0x00000004;\r
- /**\r
- * Show <code>CDATASection</code> nodes.\r
- */\r
- public static final int SHOW_CDATA_SECTION = 0x00000008;\r
- /**\r
- * Show <code>EntityReference</code> nodes.\r
- */\r
- public static final int SHOW_ENTITY_REFERENCE = 0x00000010;\r
- /**\r
- * Show <code>Entity</code> nodes. This is meaningful only when creating \r
- * an iterator or tree-walker with an<code> Entity</code> node as its \r
- * <code>root</code>; in this case, it means that the <code>Entity</code>\r
- * node will appear in the first position of the traversal. Since \r
- * entities are not part of the document tree, they do not appear when \r
- * traversing over the document tree.\r
- */\r
- public static final int SHOW_ENTITY = 0x00000020;\r
- /**\r
- * Show <code>ProcessingInstruction</code> nodes.\r
- */\r
- public static final int SHOW_PROCESSING_INSTRUCTION = 0x00000040;\r
- /**\r
- * Show <code>Comment</code> nodes.\r
- */\r
- public static final int SHOW_COMMENT = 0x00000080;\r
- /**\r
- * Show <code>Document</code> nodes.\r
- */\r
- public static final int SHOW_DOCUMENT = 0x00000100;\r
- /**\r
- * Show <code>DocumentType</code> nodes.\r
- */\r
- public static final int SHOW_DOCUMENT_TYPE = 0x00000200;\r
- /**\r
- * Show <code>DocumentFragment</code> nodes.\r
- */\r
- public static final int SHOW_DOCUMENT_FRAGMENT = 0x00000400;\r
- /**\r
- * Show <code>Notation</code> nodes. This is meaningful only when creating \r
- * an iterator or tree-walker with a <code>Notation</code> node as its \r
- * <code>root</code>; in this case, it means that the \r
- * <code>Notation</code> node will appear in the first position of the \r
- * traversal. Since notations are not part of the document tree, they do \r
- * not appear when traversing over the document tree.\r
- */\r
- public static final int SHOW_NOTATION = 0x00000800;\r
-\r
- /**\r
- * Test whether a specified node is visible in the logical view of a \r
- * <code>TreeWalker</code> or <code>NodeIterator</code>. This function \r
- * will be called by the implementation of <code>TreeWalker</code> and \r
- * <code>NodeIterator</code>; it is not normally called directly from \r
- * user code. (Though you could do so if you wanted to use the same \r
- * filter to guide your own application logic.)\r
- * @param nThe node to check to see if it passes the filter or not.\r
- * @return a constant to determine whether the node is accepted, \r
- * rejected, or skipped, as defined above.\r
- */\r
- public short acceptNode(Node n);\r
-\r
-}\r
projects / msp430-gcc.git / blobdiff