source: NonGTP/Xerces/xercesc/dom/deprecated/NodeIteratorImpl.hpp @ 188

Revision 188, 5.3 KB checked in by mattausch, 19 years ago (diff)

added xercesc to support

Line 
1/*
2 * The Apache Software License, Version 1.1
3 *
4 * Copyright (c) 1999-2002 The Apache Software Foundation.  All rights
5 * reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 *
14 * 2. Redistributions in binary form must reproduce the above copyright
15 *    notice, this list of conditions and the following disclaimer in
16 *    the documentation and/or other materials provided with the
17 *    distribution.
18 *
19 * 3. The end-user documentation included with the redistribution,
20 *    if any, must include the following acknowledgment:
21 *       "This product includes software developed by the
22 *        Apache Software Foundation (http://www.apache.org/)."
23 *    Alternately, this acknowledgment may appear in the software itself,
24 *    if and wherever such third-party acknowledgments normally appear.
25 *
26 * 4. The names "Xerces" and "Apache Software Foundation" must
27 *    not be used to endorse or promote products derived from this
28 *    software without prior written permission. For written
29 *    permission, please contact apache\@apache.org.
30 *
31 * 5. Products derived from this software may not be called "Apache",
32 *    nor may "Apache" appear in their name, without prior written
33 *    permission of the Apache Software Foundation.
34 *
35 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
36 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
37 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
38 * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
39 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
41 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
42 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
43 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
44 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
45 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46 * SUCH DAMAGE.
47 * ====================================================================
48 *
49 * This software consists of voluntary contributions made by many
50 * individuals on behalf of the Apache Software Foundation, and was
51 * originally based on software copyright (c) 1999, International
52 * Business Machines, Inc., http://www.ibm.com .  For more information
53 * on the Apache Software Foundation, please see
54 * <http://www.apache.org/>.
55 */
56
57/*
58 * $Id: NodeIteratorImpl.hpp,v 1.5 2003/05/22 02:26:51 knoaman Exp $
59 */
60
61#ifndef NodeIteratorImpl_HEADER_GUARD_
62#define NodeIteratorImpl_HEADER_GUARD_
63
64//
65//  This file is part of the internal implementation of the C++ XML DOM.
66//  It should NOT be included or used directly by application programs.
67//
68//  Applications should include the file <xercesc/dom/deprecated/DOM.hpp> for the entire
69//  DOM API, or DOM_*.hpp for individual DOM classes, where the class
70//  name is substituded for the *.
71//
72
73#include "DOM_Node.hpp"
74#include "DOM_NodeIterator.hpp"
75#include "RefCountedImpl.hpp"
76
77XERCES_CPP_NAMESPACE_BEGIN
78
79
80class CDOM_EXPORT NodeIteratorImpl : public RefCountedImpl {
81        protected:
82                NodeIteratorImpl ();
83
84        public:
85                virtual ~NodeIteratorImpl ();
86                NodeIteratorImpl (
87            DOM_Node root,
88            unsigned long whatToShow,
89            DOM_NodeFilter* nodeFilter,
90            bool expandEntityRef);
91
92        NodeIteratorImpl ( const NodeIteratorImpl& toCopy);
93               
94        NodeIteratorImpl& operator= (const NodeIteratorImpl& other);
95               
96                DOM_Node getRoot ();
97        unsigned long getWhatToShow ();
98                DOM_NodeFilter* getFilter ();
99
100                DOM_Node nextNode ();
101                DOM_Node previousNode ();
102                bool acceptNode (DOM_Node node);
103                DOM_Node matchNodeOrParent (DOM_Node node);
104                DOM_Node nextNode (DOM_Node node, bool visitChildren);
105                DOM_Node previousNode (DOM_Node node);
106                void removeNode (DOM_Node node);
107
108                void unreferenced();
109
110                void detach ();
111
112        // Get the expandEntity reference flag.
113        bool getExpandEntityReferences();
114
115
116        private:
117                //
118                // Data
119                //
120                // The root.
121                DOM_Node fRoot;
122
123                // The whatToShow mask.
124                unsigned long fWhatToShow;
125
126                // The NodeFilter reference.
127                DOM_NodeFilter* fNodeFilter;
128
129        // The expandEntity reference flag.
130        bool  fExpandEntityReferences;
131
132                bool fDetached;
133
134                //
135                // Iterator state - current node and direction.
136                //
137                // Note: The current node and direction are sufficient to implement
138                // the desired behaviour of the current pointer being _between_
139                // two nodes. The fCurrentNode is actually the last node returned,
140                // and the
141                // direction is whether the pointer is in front or behind this node.
142                // (usually akin to whether the node was returned via nextNode())
143                // (eg fForward = true) or previousNode() (eg fForward = false).
144
145                // The last Node returned.
146                DOM_Node fCurrentNode;
147
148                // The direction of the iterator on the fCurrentNode.
149                //  <pre>
150                //  nextNode()  ==      fForward = true;
151                //  previousNode() ==   fForward = false;
152                //  </pre>
153                bool fForward;
154
155
156};
157
158XERCES_CPP_NAMESPACE_END
159
160#endif
Note: See TracBrowser for help on using the repository browser.