mir/libreoffice
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Translate German comments in ure/cppuhelper

Browse Source 
Signed-off-by: Laurent Charrière <lcharriere@gmail.com>
This commit is contained in:
Laurent Charrière 2010-10-13 22:28:39 -07:00 committed by Michael Meeks
parent 731f89afd3
commit a22e62641a
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
cppuhelper/source/interfacecontainer.cxx
View File

@ -326,7 +326,7 @@ void OInterfaceContainerHelper::disposeAndClear( const EventObject & rEvt ) SAL_
{
ClearableMutexGuard aGuard( rMutex );
OInterfaceIteratorHelper aIt( *this );
// Container freigeben, falls im disposing neue Einträge kommen
// Release container, in case new entries come while disposing
OSL_ENSURE( !bIsList || bInUse, "OInterfaceContainerHelper not in use" );
if( !bIsList && pData )
((XInterface *)pData)->release();
@ -356,7 +356,7 @@ void OInterfaceContainerHelper::clear() SAL_THROW( () )
{
ClearableMutexGuard aGuard( rMutex );
OInterfaceIteratorHelper aIt( *this );
// Container freigeben, falls im disposing neue Einträge kommen
// Release container, in case new entries come while disposing
OSL_ENSURE( !bIsList || bInUse, "OInterfaceContainerHelper not in use" );
if( !bIsList && pData )
((XInterface *)pData)->release();

6
cppuhelper/source/propshlp.cxx
View File

@ -1168,7 +1168,7 @@ sal_Int32 OPropertyArrayHelper::fillHandles( sal_Int32 * pHandles, const Sequenc
for( sal_Int32 i = 0; i < nReqLen; i++ )
{
// Logarithmus ermitteln
// Calculate logarithm
sal_Int32 n = (sal_Int32)(pEnd - pCur);
sal_Int32 nLog = 0;
while( n )
@ -1177,8 +1177,8 @@ sal_Int32 OPropertyArrayHelper::fillHandles( sal_Int32 * pHandles, const Sequenc
n = n >> 1;
}
// Anzahl der noch zu suchenden Properties * dem Log2 der verbleibenden
// zu dursuchenden Properties.
// Number of properties to search for * Log2 of the number of remaining
// properties to search in.
if( (nReqLen - i) * nLog >= pEnd - pCur )
{
// linear search is better