00001 /* -*- C++ -*- */ 00002 00003 /* 00004 * The Apache Software License, Version 1.1 00005 * 00006 * 00007 * Copyright (c) 2002 The Apache Software Foundation. All rights 00008 * reserved. 00009 * 00010 * Redistribution and use in source and binary forms, with or without 00011 * modification, are permitted provided that the following conditions 00012 * are met: 00013 * 00014 * 1. Redistributions of source code must retain the above copyright 00015 * notice, this list of conditions and the following disclaimer. 00016 * 00017 * 2. Redistributions in binary form must reproduce the above copyright 00018 * notice, this list of conditions and the following disclaimer in 00019 * the documentation and/or other materials provided with the 00020 * distribution. 00021 * 00022 * 3. The end-user documentation included with the redistribution, 00023 * if any, must include the following acknowledgment: 00024 * "This product includes software developed by the 00025 * Apache Software Foundation (http://www.apache.org/)." 00026 * Alternately, this acknowledgment may appear in the software itself, 00027 * if and wherever such third-party acknowledgments normally appear. 00028 * 00029 * 4. The names "SOAP" and "Apache Software Foundation" must 00030 * not be used to endorse or promote products derived from this 00031 * software without prior written permission. For written 00032 * permission, please contact apache@apache.org. 00033 * 00034 * 5. Products derived from this software may not be called "Apache", 00035 * nor may "Apache" appear in their name, without prior written 00036 * permission of the Apache Software Foundation. 00037 * 00038 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED 00039 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 00040 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00041 * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR 00042 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 00043 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 00044 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF 00045 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 00046 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00047 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 00048 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00049 * SUCH DAMAGE. 00050 * ==================================================================== 00051 * 00052 * This software consists of voluntary contributions made by many 00053 * individuals on behalf of the Apache Software Foundation. For more 00054 * information on the Apache Software Foundation, please see 00055 * <http://www.apache.org/>. 00056 */ 00057 00058 /* 00059 * 00060 * 00061 * @author Lilantha Darshana (lilantha@erunway.com) 00062 * 00063 */ 00064 00065 #include "Platform.hpp" 00066 #include "NsStack.hpp" 00067 00068 00072 const std::string NsMap::findURI(const std::string& uri) 00073 { 00074 NsMap_t::iterator itr; 00075 for(itr=begin();itr!=end();++itr) 00076 { 00077 if(itr->first == uri) return itr->second; 00078 } 00079 return std::string(""); 00080 } 00081 00082 00086 const std::string NsMap::findPrefix(const std::string& prefex) 00087 { 00088 NsMap_t::iterator itr; 00089 for(itr=begin();itr!=end();++itr) 00090 { 00091 if(itr->second == prefex) return itr->first; 00092 } 00093 return std::string(""); 00094 } 00095 00099 void NsStack::Add(const std::string& uri, const std::string& prefix) 00100 { 00101 if(!Ns.empty()) 00102 { 00103 NsMap *tmpMap = Peek(); 00104 tmpMap->insert(std::make_pair(uri, prefix)); 00105 } 00106 else 00107 { 00108 NsMap tmpMap; 00109 tmpMap.insert(std::make_pair(uri, prefix)); 00110 Ns.push_back(tmpMap); 00111 Indx++; 00112 } 00113 } 00114 00118 void NsStack::Push() 00119 { 00120 NsMap tmpMap; 00121 tmpMap.insert(std::make_pair(std::string(""), std::string(""))); 00122 Ns.push_back(tmpMap); 00123 Indx++; 00124 } 00125 00129 00130 NsMap* NsStack::Peek() 00131 { 00132 if(Ns.empty()) return NULL; 00133 return &Ns[Indx]; 00134 } 00135 00139 void NsStack::Pop() 00140 { 00141 if(Indx>=0) 00142 { 00143 Ns.pop_back(); 00144 Indx--; 00145 } 00146 } 00147 00152 00153 const std::string NsStack::GetPrefix(const std::string& uri) 00154 { 00155 std::vector<NsMap>::iterator itr; 00156 00157 for(itr = Ns.begin(); itr != Ns.end(); ++itr) 00158 { 00159 std::string prefix = itr->findURI(uri); 00160 if(!prefix.empty()) return prefix; 00161 } 00162 return std::string(""); 00163 } 00164 00169 const std::string NsStack::GetNamespaceURI(const std::string& prefix) 00170 { 00171 std::vector<NsMap>::iterator itr; 00172 00173 for(itr = Ns.begin(); itr != Ns.end(); ++itr) 00174 { 00175 std::string uri = itr->findPrefix(prefix); 00176 if(!uri.empty()) return uri; 00177 } 00178 return std::string(""); 00179 } 00180
Copyright © 2001 SL_OpenSource XML Project. All Rights Reserved