00001 /* 00002 * The Apache Software License, Version 1.1 00003 * 00004 * Copyright (c) 1999-2001 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) 1999, 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: KVStringPair.hpp,v $ 00059 * Revision 1.1 2002/05/11 20:32:50 bhavani 00060 * CR#CR062582# adding xercesc 1.7 file 00061 * 00062 * Revision 1.1.1.1 2002/02/01 22:22:11 peiyongz 00063 * sane_include 00064 * 00065 * Revision 1.6 2001/05/11 13:26:27 tng 00066 * Copyright update. 00067 * 00068 * Revision 1.5 2001/01/15 21:26:34 tng 00069 * Performance Patches by David Bertoni. 00070 * 00071 * Details: (see xerces-c-dev mailing Jan 14) 00072 * XMLRecognizer.cpp: the internal encoding string XMLUni::fgXMLChEncodingString 00073 * was going through this function numerous times. As a result, the top hot-spot 00074 * for the parse was _wcsicmp(). The real problem is that the Microsofts wide string 00075 * functions are unbelievably slow. For things like encodings, it might be 00076 * better to use a special comparison function that only considers a-z and 00077 * A-Z as characters with case. This works since the character set for 00078 * encodings is limit to printable ASCII characters. 00079 * 00080 * XMLScanner2.cpp: This also has some case-sensitive vs. insensitive compares. 00081 * They are also much faster. The other tweak is to only make a copy of an attribute 00082 * string if it needs to be split. And then, the strategy is to try to use a 00083 * stack-based buffer, rather than a dynamically-allocated one. 00084 * 00085 * SAX2XMLReaderImpl.cpp: Again, more case-sensitive vs. insensitive comparisons. 00086 * 00087 * KVStringPair.cpp & hpp: By storing the size of the allocation, the storage can 00088 * likely be re-used many times, cutting down on dynamic memory allocations. 00089 * 00090 * XMLString.hpp: a more efficient implementation of stringLen(). 00091 * 00092 * DTDValidator.cpp: another case of using a stack-based buffer when possible 00093 * 00094 * These patches made a big difference in parse time in some of our test 00095 * files, especially the ones are very attribute-heavy. 00096 * 00097 * Revision 1.4 2000/03/02 19:54:40 roddey 00098 * This checkin includes many changes done while waiting for the 00099 * 1.1.0 code to be finished. I can't list them all here, but a list is 00100 * available elsewhere. 00101 * 00102 * Revision 1.3 2000/02/24 20:05:24 abagchi 00103 * Swat for removing Log from API docs 00104 * 00105 * Revision 1.2 2000/02/06 07:48:02 rahulj 00106 * Year 2K copyright swat. 00107 * 00108 * Revision 1.1.1.1 1999/11/09 01:04:37 twl 00109 * Initial checkin 00110 * 00111 * Revision 1.2 1999/11/08 20:45:08 rahul 00112 * Swat for adding in Product name and CVS comment log variable. 00113 * 00114 */ 00115 00116 #if !defined(KVSTRINGPAIR_HPP) 00117 #define KVSTRINGPAIR_HPP 00118 00119 #include <xercesc/util/XercesDefs.hpp> 00120 00121 00122 // 00123 // This class provides a commonly used data structure, which is that of 00124 // a pair of strings which represent a 'key=value' type mapping. It works 00125 // only in terms of XMLCh type raw strings. 00126 // 00127 class XMLUTIL_EXPORT KVStringPair 00128 { 00129 public: 00130 // ----------------------------------------------------------------------- 00131 // Constructors and Destructor 00132 // ----------------------------------------------------------------------- 00133 KVStringPair(); 00134 KVStringPair(const XMLCh* const key, const XMLCh* const value); 00135 KVStringPair(const KVStringPair& toCopy); 00136 ~KVStringPair(); 00137 00138 00139 // ----------------------------------------------------------------------- 00140 // Getters 00141 // 00142 // We support the 00143 // ----------------------------------------------------------------------- 00144 const XMLCh* getKey() const; 00145 XMLCh* getKey(); 00146 const XMLCh* getValue() const; 00147 XMLCh* getValue(); 00148 00149 00150 // ----------------------------------------------------------------------- 00151 // Setters 00152 // ----------------------------------------------------------------------- 00153 void setKey(const XMLCh* const newKey); 00154 void setValue(const XMLCh* const newValue); 00155 void set 00156 ( 00157 const XMLCh* const newKey 00158 , const XMLCh* const newValue 00159 ); 00160 00161 00162 private : 00163 // ----------------------------------------------------------------------- 00164 // Private data members 00165 // 00166 // fKey 00167 // The string that represents the key field of this object. 00168 // 00169 // fKeyAllocSize 00170 // The amount of memory allocated for fKey. 00171 // 00172 // fValue 00173 // The string that represents the value of this pair object. 00174 // 00175 // fValueAllocSize 00176 // The amount of memory allocated for fValue. 00177 // 00178 // ----------------------------------------------------------------------- 00179 XMLCh* fKey; 00180 unsigned long fKeyAllocSize; 00181 XMLCh* fValue; 00182 unsigned long fValueAllocSize; 00183 }; 00184 00185 #endif