1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: hash.hxx,v $
*
* $Revision: 1.3 $
*
* last change: $Author: rt $ $Date: 2005-09-07 17:46:02 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#ifndef _HASH_HXX
#define _HASH_HXX
#ifndef _REF_HXX //autogen
#include <tools/ref.hxx>
#endif
#ifndef _STRING_HXX //autogen
#include <tools/string.hxx>
#endif
/****************** H a s h - T a b l e **********************************/
class SvHashTable
{
UINT32 nMax; // size of hash-tabel
UINT32 nFill; // elements in hash-tabel
UINT32 lAsk; // Anzahl der Anfragen
UINT32 lTry; // Anzahl der Versuche
protected:
BOOL Test_Insert( const void *, BOOL bInsert, UINT32 * pInsertPos );
// compare element with entry
virtual StringCompare Compare( const void * , UINT32 ) const = 0;
// get hash value from subclass
virtual UINT32 HashFunc( const void * ) const = 0;
public:
SvHashTable( UINT32 nMaxEntries );
~SvHashTable();
UINT32 GetMax() const { return nMax; }
virtual BOOL IsEntry( UINT32 ) const = 0;
};
/************** S t r i n g H a s h T a b l e E n t r y ******************/
class SvStringHashTable;
class SvStringHashEntry : public SvRefBase
{
friend class SvStringHashTable;
ByteString aName;
UINT32 nHashId;
ULONG nValue;
BOOL bHasId;
public:
SvStringHashEntry() : bHasId( FALSE ) {;}
SvStringHashEntry( const ByteString & rName, UINT32 nIdx )
: aName( rName )
, nHashId( nIdx )
, bHasId( TRUE )
, nValue( 0 ) {}
~SvStringHashEntry();
const ByteString & GetName() const { return aName; }
BOOL HasId() const { return bHasId; }
UINT32 GetId() const { return nHashId; }
void SetValue( ULONG n ) { nValue = n; }
ULONG GetValue() const { return nValue; }
BOOL operator == ( const SvStringHashEntry & rRef )
{ return nHashId == rRef.nHashId; }
BOOL operator != ( const SvStringHashEntry & rRef )
{ return ! operator == ( rRef ); }
SvStringHashEntry & operator = ( const SvStringHashEntry & rRef )
{ SvRefBase::operator=( rRef );
aName = rRef.aName;
nHashId = rRef.nHashId;
nValue = rRef.nValue;
bHasId = rRef.bHasId;
return *this;
}
};
SV_DECL_IMPL_REF(SvStringHashEntry)
/****************** S t r i n g H a s h T a b l e ************************/
DECLARE_LIST(SvStringHashList,SvStringHashEntry *)
class SvStringHashTable : public SvHashTable
{
SvStringHashEntry * pEntries;
protected:
virtual UINT32 HashFunc( const void * pElement ) const;
virtual StringCompare Compare( const void * pElement, UINT32 nIndex ) const;
public:
SvStringHashTable( UINT32 nMaxEntries ); // max size of hash-tabel
~SvStringHashTable();
ByteString GetNearString( const ByteString & rName ) const;
virtual BOOL IsEntry( UINT32 nIndex ) const;
BOOL Insert( const ByteString & rStr, UINT32 * pHash ); // insert string
BOOL Test( const ByteString & rStr, UINT32 * pHash ) const; // test of insert string
SvStringHashEntry * Get ( UINT32 nIndex ) const; // return pointer to string
SvStringHashEntry & operator []( UINT32 nPos ) const
{ return pEntries[ nPos ]; }
void FillHashList( SvStringHashList * rList ) const;
};
#endif // _RSCHASH_HXX
|
