00001 /* 00002 * The Apache Software License, Version 1.1 00003 * 00004 * Copyright (c) 2001-2002 The Apache Software Foundation. All rights 00005 * reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions 00009 * are met: 00010 * 00011 * 1. Redistributions of source code must retain the above copyright 00012 * notice, this list of conditions and the following disclaimer. 00013 * 00014 * 2. Redistributions in binary form must reproduce the above copyright 00015 * notice, this list of conditions and the following disclaimer in 00016 * the documentation and/or other materials provided with the 00017 * distribution. 00018 * 00019 * 3. The end-user documentation included with the redistribution, 00020 * if any, must include the following acknowledgment: 00021 * "This product includes software developed by the 00022 * Apache Software Foundation (http://www.apache.org/)." 00023 * Alternately, this acknowledgment may appear in the software itself, 00024 * if and wherever such third-party acknowledgments normally appear. 00025 * 00026 * 4. The names "Xerces" and "Apache Software Foundation" must 00027 * not be used to endorse or promote products derived from this 00028 * software without prior written permission. For written 00029 * permission, please contact apache\@apache.org. 00030 * 00031 * 5. Products derived from this software may not be called "Apache", 00032 * nor may "Apache" appear in their name, without prior written 00033 * permission of the Apache Software Foundation. 00034 * 00035 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED 00036 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00037 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00038 * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR 00039 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00040 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00041 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF 00042 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 00043 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00044 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 00045 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00046 * SUCH DAMAGE. 00047 * ==================================================================== 00048 * 00049 * This software consists of voluntary contributions made by many 00050 * individuals on behalf of the Apache Software Foundation, and was 00051 * originally based on software copyright (c) 2001, International 00052 * Business Machines, Inc., http://www.ibm.com . For more information 00053 * on the Apache Software Foundation, please see 00054 * <http://www.apache.org/>. 00055 */ 00056 00057 /* 00058 * $Log: IDNodeIteratorImpl.hpp,v $ 00059 * Revision 1.1 2002/05/11 20:10:42 bhavani 00060 * CR#CR062582# adding xercesc 1.7 file 00061 * 00062 * Revision 1.2 2002/02/04 21:20:59 tng 00063 * Add DOM 2 Level missing functions: 00064 * 1. NodeIterator::getRoot 00065 * 2. TreeWalker::getRoot 00066 * 3. Element::hasAttribute 00067 * 4. Element::hasAttributeNS 00068 * 5. Node::hasAttributes 00069 * 6. Node::isSupported 00070 * 00071 * Revision 1.1.1.1 2002/02/01 22:21:55 peiyongz 00072 * sane_include 00073 * 00074 * Revision 1.3 2001/06/04 20:11:52 tng 00075 * IDOM: Complete IDNodeIterator, IDTreeWalker, IDNodeFilter. 00076 * 00077 * Revision 1.2 2001/05/11 13:25:45 tng 00078 * Copyright update. 00079 * 00080 * Revision 1.1.1.1 2001/04/03 00:14:25 andyh 00081 * IDOM 00082 * 00083 */ 00084 00085 #ifndef IDNodeIteratorImpl_HEADER_GUARD_ 00086 #define IDNodeIteratorImpl_HEADER_GUARD_ 00087 00088 00089 // IDNodeIteratorImpl.hpp: interface for the IDNodeIteratorImpl class. 00090 // 00092 00093 #include "IDOM_Node.hpp" 00094 #include "IDOM_NodeIterator.hpp" 00095 00096 00097 class CDOM_EXPORT IDNodeIteratorImpl : public IDOM_NodeIterator { 00098 private: 00099 // 00100 // Data 00101 // 00102 // The root. 00103 IDOM_Node* fRoot; 00104 00105 // The whatToShow mask. 00106 unsigned long fWhatToShow; 00107 00108 // The NodeFilter reference. 00109 IDOM_NodeFilter* fNodeFilter; 00110 00111 00112 // The expandEntity reference flag. 00113 bool fExpandEntityReferences; 00114 bool fDetached; 00115 00116 00117 // 00118 // Iterator state - current node and direction. 00119 // 00120 // Note: The current node and direction are sufficient to implement 00121 // the desired behaviour of the current pointer being _between_ 00122 // two nodes. The fCurrentNode is actually the last node returned, 00123 // and the 00124 // direction is whether the pointer is in front or behind this node. 00125 // (usually akin to whether the node was returned via nextNode()) 00126 // (eg fForward = true) or previousNode() (eg fForward = false). 00127 // The last Node returned. 00128 IDOM_Node* fCurrentNode; 00129 00130 // The direction of the iterator on the fCurrentNode. 00131 // <pre> 00132 // nextNode() == fForward = true; 00133 // previousNode() == fForward = false; 00134 // </pre> 00135 bool fForward; 00136 00137 protected: 00138 IDNodeIteratorImpl (); 00139 00140 public: 00141 virtual ~IDNodeIteratorImpl (); 00142 IDNodeIteratorImpl ( 00143 IDOM_Node* root, 00144 unsigned long whatToShow, 00145 IDOM_NodeFilter* nodeFilter, 00146 bool expandEntityRef); 00147 00148 IDNodeIteratorImpl ( const IDNodeIteratorImpl& toCopy); 00149 IDNodeIteratorImpl& operator= (const IDNodeIteratorImpl& other); 00150 00151 virtual IDOM_Node* getRoot (); 00152 virtual unsigned long getWhatToShow (); 00153 virtual IDOM_NodeFilter* getFilter (); 00154 // Get the expandEntity reference flag. 00155 virtual bool getExpandEntityReferences(); 00156 00157 virtual IDOM_Node* nextNode (); 00158 virtual IDOM_Node* previousNode (); 00159 virtual void detach (); 00160 00161 private: 00162 IDOM_Node* matchNodeOrParent (IDOM_Node* node); 00163 IDOM_Node* nextNode (IDOM_Node* node, bool visitChildren); 00164 IDOM_Node* previousNode (IDOM_Node* node); 00165 void removeNode (IDOM_Node* node); 00166 bool acceptNode (IDOM_Node* node); 00167 00168 }; 00169 00170 #endif