Translate German comments in ure/cppuhelper

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

View File

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

View File

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