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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: hash.cxx,v $
* $Revision: 1.5 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_sal.hxx"
#include "rtl/allocator.hxx"
#include "hash.h"
#include "strimp.h"
#include <hash_set>
namespace {
struct UStringHash
{
size_t operator()(rtl_uString * const &rString) const
{ return (size_t)rtl_ustr_hashCode_WithLength( rString->buffer, rString->length ); }
};
struct UStringEqual
{
sal_Bool operator() ( rtl_uString * const &pStringA,
rtl_uString * const &pStringB) const
{
if (pStringA == pStringB)
return true;
if (pStringA->length != pStringB->length)
return false;
return !rtl_ustr_compare_WithLength( pStringA->buffer, pStringA->length,
pStringB->buffer, pStringB->length);
}
};
}
typedef std::hash_set< rtl_uString *, UStringHash, UStringEqual,
rtl::Allocator<rtl_uString *> > UniqueHash;
struct StringHashTableImpl : public UniqueHash
{
StringHashTableImpl(sal_uInt32 nSize) : UniqueHash( nSize ) {}
};
StringHashTable *
rtl_str_hash_new (sal_uInt32 nSize)
{
return new StringHashTableImpl (nSize);
}
void
rtl_str_hash_free (StringHashTable *pHash)
{
delete pHash;
}
rtl_uString *
rtl_str_hash_intern (StringHashTable *pHash,
rtl_uString *pString,
int can_return)
{
UniqueHash::iterator aIter;
aIter = pHash->find(pString);
if (aIter != pHash->end())
{
rtl_uString *pHashStr = *aIter;
rtl_uString_acquire (pHashStr);
return pHashStr;
}
if (!can_return)
{
rtl_uString *pCopy = NULL;
rtl_uString_newFromString( &pCopy, pString );
pString = pCopy;
if (!pString)
return NULL;
}
if (!SAL_STRING_IS_STATIC (pString))
pString->refCount |= SAL_STRING_INTERN_FLAG;
pHash->insert(pString);
return pString;
}
void
rtl_str_hash_remove (StringHashTable *pHash,
rtl_uString *pString)
{
pHash->erase(pString);
}
|
