1*cdf0e10cSrcweir /************************************************************************* 2*cdf0e10cSrcweir * 3*cdf0e10cSrcweir * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4*cdf0e10cSrcweir * 5*cdf0e10cSrcweir * Copyright 2000, 2010 Oracle and/or its affiliates. 6*cdf0e10cSrcweir * 7*cdf0e10cSrcweir * OpenOffice.org - a multi-platform office productivity suite 8*cdf0e10cSrcweir * 9*cdf0e10cSrcweir * This file is part of OpenOffice.org. 10*cdf0e10cSrcweir * 11*cdf0e10cSrcweir * OpenOffice.org is free software: you can redistribute it and/or modify 12*cdf0e10cSrcweir * it under the terms of the GNU Lesser General Public License version 3 13*cdf0e10cSrcweir * only, as published by the Free Software Foundation. 14*cdf0e10cSrcweir * 15*cdf0e10cSrcweir * OpenOffice.org is distributed in the hope that it will be useful, 16*cdf0e10cSrcweir * but WITHOUT ANY WARRANTY; without even the implied warranty of 17*cdf0e10cSrcweir * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18*cdf0e10cSrcweir * GNU Lesser General Public License version 3 for more details 19*cdf0e10cSrcweir * (a copy is included in the LICENSE file that accompanied this code). 20*cdf0e10cSrcweir * 21*cdf0e10cSrcweir * You should have received a copy of the GNU Lesser General Public License 22*cdf0e10cSrcweir * version 3 along with OpenOffice.org. If not, see 23*cdf0e10cSrcweir * <http://www.openoffice.org/license.html> 24*cdf0e10cSrcweir * for a copy of the LGPLv3 License. 25*cdf0e10cSrcweir * 26*cdf0e10cSrcweir ************************************************************************/ 27*cdf0e10cSrcweir 28*cdf0e10cSrcweir // MARKER(update_precomp.py): autogen include statement, do not remove 29*cdf0e10cSrcweir #include "precompiled_xmloff.hxx" 30*cdf0e10cSrcweir #include <rtl/ustring.hxx> 31*cdf0e10cSrcweir #include <tools/debug.hxx> 32*cdf0e10cSrcweir #include <svl/svarray.hxx> 33*cdf0e10cSrcweir #include "xmloff/i18nmap.hxx" 34*cdf0e10cSrcweir 35*cdf0e10cSrcweir using namespace rtl; 36*cdf0e10cSrcweir 37*cdf0e10cSrcweir class SvI18NMapEntry_Impl 38*cdf0e10cSrcweir { 39*cdf0e10cSrcweir sal_uInt16 nKind; 40*cdf0e10cSrcweir OUString aName; 41*cdf0e10cSrcweir OUString aNewName; 42*cdf0e10cSrcweir 43*cdf0e10cSrcweir public: 44*cdf0e10cSrcweir 45*cdf0e10cSrcweir const OUString& GetNewName() const { return aNewName; } 46*cdf0e10cSrcweir 47*cdf0e10cSrcweir SvI18NMapEntry_Impl( sal_uInt16 nKnd, const OUString& rName, 48*cdf0e10cSrcweir const OUString& rNewName ) : 49*cdf0e10cSrcweir nKind( nKnd ), 50*cdf0e10cSrcweir aName( rName ), 51*cdf0e10cSrcweir aNewName( rNewName ) 52*cdf0e10cSrcweir {} 53*cdf0e10cSrcweir 54*cdf0e10cSrcweir SvI18NMapEntry_Impl( sal_uInt16 nKnd, const OUString& rName ) : 55*cdf0e10cSrcweir nKind( nKnd ), 56*cdf0e10cSrcweir aName( rName ) 57*cdf0e10cSrcweir {} 58*cdf0e10cSrcweir 59*cdf0e10cSrcweir sal_Bool operator==( const SvI18NMapEntry_Impl& r ) const 60*cdf0e10cSrcweir { 61*cdf0e10cSrcweir return nKind == r.nKind && 62*cdf0e10cSrcweir aName == r.aName; 63*cdf0e10cSrcweir } 64*cdf0e10cSrcweir 65*cdf0e10cSrcweir sal_Bool operator<( const SvI18NMapEntry_Impl& r ) const 66*cdf0e10cSrcweir { 67*cdf0e10cSrcweir return nKind < r.nKind || 68*cdf0e10cSrcweir ( nKind == r.nKind && 69*cdf0e10cSrcweir aName < r.aName); 70*cdf0e10cSrcweir } 71*cdf0e10cSrcweir }; 72*cdf0e10cSrcweir 73*cdf0e10cSrcweir typedef SvI18NMapEntry_Impl *SvI18NMapEntry_ImplPtr; 74*cdf0e10cSrcweir SV_DECL_PTRARR_SORT_DEL( SvI18NMap_Impl, SvI18NMapEntry_ImplPtr, 20, 5 ) 75*cdf0e10cSrcweir SV_IMPL_OP_PTRARR_SORT( SvI18NMap_Impl, SvI18NMapEntry_ImplPtr ) 76*cdf0e10cSrcweir 77*cdf0e10cSrcweir // --------------------------------------------------------------------- 78*cdf0e10cSrcweir 79*cdf0e10cSrcweir SvI18NMapEntry_Impl *SvI18NMap::_Find( sal_uInt16 nKind, 80*cdf0e10cSrcweir const OUString& rName ) const 81*cdf0e10cSrcweir { 82*cdf0e10cSrcweir SvI18NMapEntry_Impl *pRet = 0; 83*cdf0e10cSrcweir SvI18NMapEntry_Impl aTst( nKind, rName ); 84*cdf0e10cSrcweir 85*cdf0e10cSrcweir sal_uInt16 nPos; 86*cdf0e10cSrcweir if( pImpl->Seek_Entry( &aTst, &nPos ) ) 87*cdf0e10cSrcweir { 88*cdf0e10cSrcweir pRet = (*pImpl)[nPos]; 89*cdf0e10cSrcweir } 90*cdf0e10cSrcweir 91*cdf0e10cSrcweir return pRet; 92*cdf0e10cSrcweir } 93*cdf0e10cSrcweir 94*cdf0e10cSrcweir SvI18NMap::SvI18NMap() : 95*cdf0e10cSrcweir pImpl( 0 ) 96*cdf0e10cSrcweir { 97*cdf0e10cSrcweir pImpl = new SvI18NMap_Impl; 98*cdf0e10cSrcweir } 99*cdf0e10cSrcweir 100*cdf0e10cSrcweir SvI18NMap::~SvI18NMap() 101*cdf0e10cSrcweir { 102*cdf0e10cSrcweir delete pImpl; 103*cdf0e10cSrcweir } 104*cdf0e10cSrcweir 105*cdf0e10cSrcweir void SvI18NMap::Add( sal_uInt16 nKind, const OUString& rName, 106*cdf0e10cSrcweir const OUString& rNewName ) 107*cdf0e10cSrcweir { 108*cdf0e10cSrcweir SvI18NMapEntry_Impl *pEntry = _Find( nKind, rName ); 109*cdf0e10cSrcweir DBG_ASSERT( !pEntry, "SvI18NMap::Add: item registered already" ); 110*cdf0e10cSrcweir if( !pEntry ) 111*cdf0e10cSrcweir { 112*cdf0e10cSrcweir pEntry = new SvI18NMapEntry_Impl( nKind, rName, rNewName ); 113*cdf0e10cSrcweir pImpl->Insert( pEntry ); 114*cdf0e10cSrcweir } 115*cdf0e10cSrcweir } 116*cdf0e10cSrcweir 117*cdf0e10cSrcweir const OUString& SvI18NMap::Get( sal_uInt16 nKind, const OUString& rName ) const 118*cdf0e10cSrcweir { 119*cdf0e10cSrcweir SvI18NMapEntry_Impl *pEntry = _Find( nKind, rName ); 120*cdf0e10cSrcweir if( pEntry ) 121*cdf0e10cSrcweir return pEntry->GetNewName(); 122*cdf0e10cSrcweir else 123*cdf0e10cSrcweir return rName; 124*cdf0e10cSrcweir } 125*cdf0e10cSrcweir 126*cdf0e10cSrcweir 127