00001 /* 00002 * The Apache Software License, Version 1.1 00003 * 00004 * 00005 * Copyright (c) 2002-2003 The Apache Software Foundation. All rights 00006 * reserved. 00007 * 00008 * Redistribution and use in source and binary forms, with or without 00009 * modification, are permitted provided that the following conditions 00010 * are met: 00011 * 00012 * 1. Redistributions of source code must retain the above copyright 00013 * notice, this list of conditions and the following disclaimer. 00014 * 00015 * 2. Redistributions in binary form must reproduce the above copyright 00016 * notice, this list of conditions and the following disclaimer in 00017 * the documentation and/or other materials provided with the 00018 * distribution. 00019 * 00020 * 3. The end-user documentation included with the redistribution, 00021 * if any, must include the following acknowledgment: 00022 * "This product includes software developed by the 00023 * Apache Software Foundation (http://www.apache.org/)." 00024 * Alternately, this acknowledgment may appear in the software itself, 00025 * if and wherever such third-party acknowledgments normally appear. 00026 * 00027 * 4. The names "<WebSig>" and "Apache Software Foundation" must 00028 * not be used to endorse or promote products derived from this 00029 * software without prior written permission. For written 00030 * permission, please contact apache@apache.org. 00031 * 00032 * 5. Products derived from this software may not be called "Apache", 00033 * nor may "Apache" appear in their name, without prior written 00034 * permission of the Apache Software Foundation. 00035 * 00036 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED 00037 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00038 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00039 * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR 00040 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00041 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00042 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF 00043 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 00044 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00045 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 00046 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00047 * SUCH DAMAGE. 00048 * ==================================================================== 00049 * 00050 * This software consists of voluntary contributions made by many 00051 * individuals on behalf of the Apache Software Foundation and was 00052 * originally based on software copyright (c) 2001, Institute for 00053 * Data Communications Systems, <http://www.nue.et-inf.uni-siegen.de/>. 00054 * The development of this software was partly funded by the European 00055 * Commission in the <WebSig> project in the ISIS Programme. 00056 * For more information on the Apache Software Foundation, please see 00057 * <http://www.apache.org/>. 00058 */ 00059 00060 /* 00061 * XSEC 00062 * 00063 * XSECXPathNodeList := A structure to hold node lists from XPath 00064 * evaluations 00065 * 00066 * Author(s): Berin Lautenbach 00067 * 00068 * $Id: XSECXPathNodeList.hpp,v 1.5 2003/07/05 10:30:37 blautenb Exp $ 00069 * 00070 */ 00071 00072 #ifndef XSECXPATHNODELIST_INCLUDE 00073 #define XSECXPATHNODELIST_INCLUDE 00074 00075 // XSEC 00076 #include <xsec/framework/XSECDefs.hpp> 00077 00078 // Xerces 00079 00080 XSEC_DECLARE_XERCES_CLASS(DOMNode); 00081 00082 #define _XSEC_NODELIST_DEFAULT_SIZE 100 00083 00101 class DSIG_EXPORT XSECXPathNodeList { 00102 00103 public: 00104 00107 00108 XSECXPathNodeList(unsigned int initialSize = _XSEC_NODELIST_DEFAULT_SIZE); 00109 00118 XSECXPathNodeList(const XSECXPathNodeList &other); 00119 00120 ~XSECXPathNodeList(); 00121 00134 XSECXPathNodeList & operator= (const XSECXPathNodeList & toCopy); 00135 00136 00138 00139 00142 00152 void addNode(const DOMNode *n); 00153 00162 void removeNode(const DOMNode *n); 00163 00169 void clear(void); 00170 00172 00175 00182 bool hasNode(const DOMNode *n); 00183 00192 const DOMNode * getFirstNode(void); 00193 00202 const DOMNode *getNextNode(void); 00203 00205 00208 00217 void intersect(const XSECXPathNodeList &toIntersect); 00218 00220 00221 private: 00222 00223 // Internal functions 00224 unsigned int findNodeIndex(const DOMNode * n); 00225 00226 const DOMNode ** mp_elts; // The current list of elements 00227 00228 unsigned int m_size; // How big is the current array 00229 unsigned int m_num; // Number of elements in the array 00230 00231 unsigned int m_current; // current point in list for getNextNode 00232 }; 00233 00234 00235 00236 #endif /* XSECXPATHNODELIST_INCLUDE */ 00237