[Libreoffice] [PATCH 1/3] Translate German comments in ure/cppuhelper

[Laurent Charrière]

Signed-off-by: Laurent Charrière <lcharriere at gmail.com>
---
 cppuhelper/source/interfacecontainer.cxx |    4 ++--
 cppuhelper/source/propshlp.cxx           |    6 +++---
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/cppuhelper/source/interfacecontainer.cxx b/cppuhelper/source/interfacecontainer.cxx
index b1f45c6..afd3d09 100644
--- a/cppuhelper/source/interfacecontainer.cxx
+++ b/cppuhelper/source/interfacecontainer.cxx
@@ -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();
diff --git a/cppuhelper/source/propshlp.cxx b/cppuhelper/source/propshlp.cxx
index eb71723..a193623 100644
--- a/cppuhelper/source/propshlp.cxx
+++ b/cppuhelper/source/propshlp.cxx
@@ -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
-- 
1.7.1