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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include "svl/sharedstringpool.hxx"
#include "unotools/charclass.hxx"
namespace svl {
SharedStringPool::SharedStringPool() : mpCharClass(NULL) {}
SharedStringPool::SharedStringPool( const CharClass* pCharClass ) : mpCharClass(pCharClass) {}
SharedString SharedStringPool::intern( const OUString& rStr )
{
InsertResultType aRes = findOrInsert(maStrPool, rStr);
if (aRes.first == maStrPool.end())
// Insertion failed.
return SharedString();
rtl_uString* pOrig = aRes.first->pData;
if (!mpCharClass)
// We don't track case insensitive strings.
return SharedString(pOrig, NULL);
if (!aRes.second)
{
// No new string has been inserted. Return the existing string in the pool.
StrStoreType::iterator it = maStrStore.find(pOrig);
if (it == maStrStore.end())
return SharedString();
rtl_uString* pUpper = it->second.pData;
return SharedString(pOrig, pUpper);
}
// This is a new string insertion. Establish mapping to upper-case variant.
OUString aUpper = mpCharClass->uppercase(rStr);
aRes = findOrInsert(maStrPoolUpper, aUpper);
if (aRes.first == maStrPoolUpper.end())
// Failed to insert or fetch upper-case variant. Should never happen.
return SharedString();
maStrStore.insert(StrStoreType::value_type(pOrig, *aRes.first));
return SharedString(pOrig, aRes.first->pData);
}
namespace {
inline sal_Int32 getRefCount( const rtl_uString* p )
{
return (p->refCount & 0x3FFFFFFF);
}
}
void SharedStringPool::purge()
{
StrHashType aNewStrPool;
StrHashType::iterator it = maStrPool.begin(), itEnd = maStrPool.end();
for (; it != itEnd; ++it)
{
const rtl_uString* p = it->pData;
if (getRefCount(p) == 1)
{
// Remove it from the upper string map. This should unref the
// upper string linked to this original string.
maStrStore.erase(p);
}
else
// Still referenced outside the pool. Keep it.
aNewStrPool.insert(*it);
}
maStrPool.swap(aNewStrPool);
aNewStrPool.clear(); // for re-use.
// Purge the upper string pool as well.
it = maStrPoolUpper.begin();
itEnd = maStrPoolUpper.end();
for (; it != itEnd; ++it)
{
const rtl_uString* p = it->pData;
if (getRefCount(p) > 1)
aNewStrPool.insert(*it);
}
maStrPoolUpper.swap(aNewStrPool);
}
size_t SharedStringPool::getCount() const
{
return maStrPool.size();
}
size_t SharedStringPool::getCountIgnoreCase() const
{
return maStrPoolUpper.size();
}
SharedStringPool::InsertResultType SharedStringPool::findOrInsert( StrHashType& rPool, const OUString& rStr ) const
{
StrHashType::iterator it = rPool.find(rStr);
bool bInserted = false;
if (it == rPool.end())
{
// Not yet in the pool.
std::pair<StrHashType::iterator, bool> r = rPool.insert(rStr);
if (!r.second)
// Insertion failed.
return InsertResultType(rPool.end(), false);
it = r.first;
bInserted = true;
}
return InsertResultType(it, bInserted);
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
