1*b1cdbd2cSJim Jagielski /************************************************************** 2*b1cdbd2cSJim Jagielski * 3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one 4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file 5*b1cdbd2cSJim Jagielski * distributed with this work for additional information 6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file 7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the 8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance 9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at 10*b1cdbd2cSJim Jagielski * 11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0 12*b1cdbd2cSJim Jagielski * 13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing, 14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an 15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the 17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations 18*b1cdbd2cSJim Jagielski * under the License. 19*b1cdbd2cSJim Jagielski * 20*b1cdbd2cSJim Jagielski *************************************************************/ 21*b1cdbd2cSJim Jagielski 22*b1cdbd2cSJim Jagielski 23*b1cdbd2cSJim Jagielski 24*b1cdbd2cSJim Jagielski #ifndef _HASH_HXX 25*b1cdbd2cSJim Jagielski #define _HASH_HXX 26*b1cdbd2cSJim Jagielski 27*b1cdbd2cSJim Jagielski 28*b1cdbd2cSJim Jagielski 29*b1cdbd2cSJim Jagielski #include <tools/ref.hxx> 30*b1cdbd2cSJim Jagielski #include <tools/string.hxx> 31*b1cdbd2cSJim Jagielski 32*b1cdbd2cSJim Jagielski /****************** H a s h - T a b l e **********************************/ 33*b1cdbd2cSJim Jagielski class SvHashTable 34*b1cdbd2cSJim Jagielski { 35*b1cdbd2cSJim Jagielski sal_uInt32 nMax; // size of hash-tabel 36*b1cdbd2cSJim Jagielski sal_uInt32 nFill; // elements in hash-tabel 37*b1cdbd2cSJim Jagielski sal_uInt32 lAsk; // Anzahl der Anfragen 38*b1cdbd2cSJim Jagielski sal_uInt32 lTry; // Anzahl der Versuche 39*b1cdbd2cSJim Jagielski protected: 40*b1cdbd2cSJim Jagielski sal_Bool Test_Insert( const void *, sal_Bool bInsert, sal_uInt32 * pInsertPos ); 41*b1cdbd2cSJim Jagielski 42*b1cdbd2cSJim Jagielski // compare element with entry 43*b1cdbd2cSJim Jagielski virtual StringCompare Compare( const void * , sal_uInt32 ) const = 0; 44*b1cdbd2cSJim Jagielski // get hash value from subclass 45*b1cdbd2cSJim Jagielski virtual sal_uInt32 HashFunc( const void * ) const = 0; 46*b1cdbd2cSJim Jagielski public: 47*b1cdbd2cSJim Jagielski SvHashTable( sal_uInt32 nMaxEntries ); 48*b1cdbd2cSJim Jagielski virtual ~SvHashTable(); 49*b1cdbd2cSJim Jagielski GetMax() const50*b1cdbd2cSJim Jagielski sal_uInt32 GetMax() const { return nMax; } 51*b1cdbd2cSJim Jagielski 52*b1cdbd2cSJim Jagielski virtual sal_Bool IsEntry( sal_uInt32 ) const = 0; 53*b1cdbd2cSJim Jagielski }; 54*b1cdbd2cSJim Jagielski 55*b1cdbd2cSJim Jagielski /************** S t r i n g H a s h T a b l e E n t r y ******************/ 56*b1cdbd2cSJim Jagielski class SvStringHashTable; 57*b1cdbd2cSJim Jagielski class SvStringHashEntry : public SvRefBase 58*b1cdbd2cSJim Jagielski { 59*b1cdbd2cSJim Jagielski friend class SvStringHashTable; 60*b1cdbd2cSJim Jagielski ByteString aName; 61*b1cdbd2cSJim Jagielski sal_uInt32 nHashId; 62*b1cdbd2cSJim Jagielski sal_uLong nValue; 63*b1cdbd2cSJim Jagielski sal_Bool bHasId; 64*b1cdbd2cSJim Jagielski public: SvStringHashEntry()65*b1cdbd2cSJim Jagielski SvStringHashEntry() : bHasId( sal_False ) {;} SvStringHashEntry(const ByteString & rName,sal_uInt32 nIdx)66*b1cdbd2cSJim Jagielski SvStringHashEntry( const ByteString & rName, sal_uInt32 nIdx ) 67*b1cdbd2cSJim Jagielski : aName( rName ) 68*b1cdbd2cSJim Jagielski , nHashId( nIdx ) 69*b1cdbd2cSJim Jagielski , nValue( 0 ) 70*b1cdbd2cSJim Jagielski , bHasId( sal_True ) {} 71*b1cdbd2cSJim Jagielski ~SvStringHashEntry(); 72*b1cdbd2cSJim Jagielski GetName() const73*b1cdbd2cSJim Jagielski const ByteString & GetName() const { return aName; } HasId() const74*b1cdbd2cSJim Jagielski sal_Bool HasId() const { return bHasId; } GetId() const75*b1cdbd2cSJim Jagielski sal_uInt32 GetId() const { return nHashId; } 76*b1cdbd2cSJim Jagielski SetValue(sal_uLong n)77*b1cdbd2cSJim Jagielski void SetValue( sal_uLong n ) { nValue = n; } GetValue() const78*b1cdbd2cSJim Jagielski sal_uLong GetValue() const { return nValue; } 79*b1cdbd2cSJim Jagielski operator ==(const SvStringHashEntry & rRef)80*b1cdbd2cSJim Jagielski sal_Bool operator == ( const SvStringHashEntry & rRef ) 81*b1cdbd2cSJim Jagielski { return nHashId == rRef.nHashId; } operator !=(const SvStringHashEntry & rRef)82*b1cdbd2cSJim Jagielski sal_Bool operator != ( const SvStringHashEntry & rRef ) 83*b1cdbd2cSJim Jagielski { return ! operator == ( rRef ); } operator =(const SvStringHashEntry & rRef)84*b1cdbd2cSJim Jagielski SvStringHashEntry & operator = ( const SvStringHashEntry & rRef ) 85*b1cdbd2cSJim Jagielski { SvRefBase::operator=( rRef ); 86*b1cdbd2cSJim Jagielski aName = rRef.aName; 87*b1cdbd2cSJim Jagielski nHashId = rRef.nHashId; 88*b1cdbd2cSJim Jagielski nValue = rRef.nValue; 89*b1cdbd2cSJim Jagielski bHasId = rRef.bHasId; 90*b1cdbd2cSJim Jagielski return *this; 91*b1cdbd2cSJim Jagielski } 92*b1cdbd2cSJim Jagielski }; 93*b1cdbd2cSJim Jagielski 94*b1cdbd2cSJim Jagielski SV_DECL_IMPL_REF(SvStringHashEntry) 95*b1cdbd2cSJim Jagielski 96*b1cdbd2cSJim Jagielski /****************** S t r i n g H a s h T a b l e ************************/ 97*b1cdbd2cSJim Jagielski DECLARE_LIST(SvStringHashList,SvStringHashEntry *) 98*b1cdbd2cSJim Jagielski 99*b1cdbd2cSJim Jagielski class SvStringHashTable : public SvHashTable 100*b1cdbd2cSJim Jagielski { 101*b1cdbd2cSJim Jagielski SvStringHashEntry * pEntries; 102*b1cdbd2cSJim Jagielski protected: 103*b1cdbd2cSJim Jagielski virtual sal_uInt32 HashFunc( const void * pElement ) const; 104*b1cdbd2cSJim Jagielski virtual StringCompare Compare( const void * pElement, sal_uInt32 nIndex ) const; 105*b1cdbd2cSJim Jagielski public: 106*b1cdbd2cSJim Jagielski SvStringHashTable( sal_uInt32 nMaxEntries ); // max size of hash-tabel 107*b1cdbd2cSJim Jagielski virtual ~SvStringHashTable(); 108*b1cdbd2cSJim Jagielski 109*b1cdbd2cSJim Jagielski ByteString GetNearString( const ByteString & rName ) const; 110*b1cdbd2cSJim Jagielski virtual sal_Bool IsEntry( sal_uInt32 nIndex ) const; 111*b1cdbd2cSJim Jagielski 112*b1cdbd2cSJim Jagielski sal_Bool Insert( const ByteString & rStr, sal_uInt32 * pHash ); // insert string 113*b1cdbd2cSJim Jagielski sal_Bool Test( const ByteString & rStr, sal_uInt32 * pHash ) const; // test of insert string 114*b1cdbd2cSJim Jagielski SvStringHashEntry * Get ( sal_uInt32 nIndex ) const; // return pointer to string operator [](sal_uInt32 nPos) const115*b1cdbd2cSJim Jagielski SvStringHashEntry & operator []( sal_uInt32 nPos ) const 116*b1cdbd2cSJim Jagielski { return pEntries[ nPos ]; } 117*b1cdbd2cSJim Jagielski 118*b1cdbd2cSJim Jagielski void FillHashList( SvStringHashList * rList ) const; 119*b1cdbd2cSJim Jagielski }; 120*b1cdbd2cSJim Jagielski 121*b1cdbd2cSJim Jagielski #endif // _RSCHASH_HXX 122