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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* 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_xmloff.hxx"
#include <rtl/ustring.hxx>
#include <tools/debug.hxx>
#include <svl/svarray.hxx>
#include "i18nmap.hxx"
using namespace rtl;
class SvI18NMapEntry_Impl
{
USHORT nKind;
OUString aName;
OUString aNewName;
public:
const OUString& GetNewName() const { return aNewName; }
SvI18NMapEntry_Impl( USHORT nKnd, const OUString& rName,
const OUString& rNewName ) :
nKind( nKnd ),
aName( rName ),
aNewName( rNewName )
{}
SvI18NMapEntry_Impl( USHORT nKnd, const OUString& rName ) :
nKind( nKnd ),
aName( rName )
{}
BOOL operator==( const SvI18NMapEntry_Impl& r ) const
{
return nKind == r.nKind &&
aName == r.aName;
}
BOOL operator<( const SvI18NMapEntry_Impl& r ) const
{
return nKind < r.nKind ||
( nKind == r.nKind &&
aName < r.aName);
}
};
typedef SvI18NMapEntry_Impl *SvI18NMapEntry_ImplPtr;
SV_DECL_PTRARR_SORT_DEL( SvI18NMap_Impl, SvI18NMapEntry_ImplPtr, 20, 5 )
SV_IMPL_OP_PTRARR_SORT( SvI18NMap_Impl, SvI18NMapEntry_ImplPtr )
// ---------------------------------------------------------------------
SvI18NMapEntry_Impl *SvI18NMap::_Find( USHORT nKind,
const OUString& rName ) const
{
SvI18NMapEntry_Impl *pRet = 0;
SvI18NMapEntry_Impl aTst( nKind, rName );
USHORT nPos;
if( pImpl->Seek_Entry( &aTst, &nPos ) )
{
pRet = (*pImpl)[nPos];
}
return pRet;
}
SvI18NMap::SvI18NMap() :
pImpl( 0 )
{
pImpl = new SvI18NMap_Impl;
}
SvI18NMap::~SvI18NMap()
{
delete pImpl;
}
void SvI18NMap::Add( USHORT nKind, const OUString& rName,
const OUString& rNewName )
{
SvI18NMapEntry_Impl *pEntry = _Find( nKind, rName );
DBG_ASSERT( !pEntry, "SvI18NMap::Add: item registered already" );
if( !pEntry )
{
pEntry = new SvI18NMapEntry_Impl( nKind, rName, rNewName );
pImpl->Insert( pEntry );
}
}
const OUString& SvI18NMap::Get( USHORT nKind, const OUString& rName ) const
{
SvI18NMapEntry_Impl *pEntry = _Find( nKind, rName );
if( pEntry )
return pEntry->GetNewName();
else
return rName;
}
|
