Date: prev next · Thread: first prev next last
2010 Archives by date, by thread · List index


Hi,

I worked again on the translation of the comments into English. I finished the 
translation of further four files (in basic/source/sbx).

Regards,
Andreas
-- 
## Content Developer OpenOffice.org: lang/DE
## Freie Office-Suite für Linux, Mac, Windows, Solaris
## http://de.openoffice.org
## OpenOffice.org Portable: http://oooportable.org
## OOoPDFConverter: http://ooopdfconverter.sourceforge.net
## Meine Seite: http://www.amantke.de 
From 6ca5e8a50bec1b3ed123455d1914128a9ad33450 Mon Sep 17 00:00:00 2001
From: Andreas Mantke <maand@gmx.de>
Date: Thu, 7 Oct 2010 20:49:11 +0200
Subject: [PATCH] translation into English

---
 basic/source/sbx/sbxarray.cxx |   57 ++++++++++++++++++++---------------------
 basic/source/sbx/sbxbase.cxx  |   26 +++++++++---------
 basic/source/sbx/sbxbyte.cxx  |    2 +-
 basic/source/sbx/sbxchar.cxx  |    6 ++--
 4 files changed, 45 insertions(+), 46 deletions(-)

diff --git a/basic/source/sbx/sbxarray.cxx b/basic/source/sbx/sbxarray.cxx
index cbcd5d9..741a17b 100644
--- a/basic/source/sbx/sbxarray.cxx
+++ b/basic/source/sbx/sbxarray.cxx
@@ -33,10 +33,10 @@
 #include <vector>
 using namespace std;
 
-struct SbxDim {                 // eine Array-Dimension:
+struct SbxDim {                 // an array-dimension:
     SbxDim* pNext;              // Link
-    INT32 nLbound, nUbound;     // Begrenzungen
-    INT32 nSize;                // Anzahl Elemente
+    INT32 nLbound, nUbound;     // Limitations
+    INT32 nSize;                // Number of elements
 };
 
 class SbxVarEntry : public SbxVariableRef {
@@ -99,7 +99,7 @@ SbxArray& SbxArray::operator=( const SbxArray& rArray )
             if( pSrcRef->pAlias )
                 pDstRef->pAlias = new XubString( *pSrcRef->pAlias );
             if( eType != SbxVARIANT )
-                // Keine Objekte konvertieren
+                // Convert no objects
                 if( eType != SbxOBJECT || pSrc_->GetClass() != SbxCLASS_OBJECT )
                     ((SbxVariable*) pSrc_)->Convert( eType );
             pData->push_back( pDstRef );
@@ -149,7 +149,7 @@ USHORT SbxArray::Count() const
 
 SbxVariableRef& SbxArray::GetRef32( UINT32 nIdx )
 {
-    // Array ggf. vergroessern
+    // If necessary extend the array
     DBG_ASSERT( nIdx <= SBX_MAXINDEX32, "SBX: Array-Index > SBX_MAXINDEX32" );
     // Very Hot Fix
     if( nIdx > SBX_MAXINDEX32 )
@@ -167,7 +167,7 @@ SbxVariableRef& SbxArray::GetRef32( UINT32 nIdx )
 
 SbxVariableRef& SbxArray::GetRef( USHORT nIdx )
 {
-    // Array ggf. vergroessern
+    // If necessary extend the array
     DBG_ASSERT( nIdx <= SBX_MAXINDEX, "SBX: Array-Index > SBX_MAXINDEX" );
     // Very Hot Fix
     if( nIdx > SBX_MAXINDEX )
@@ -229,7 +229,7 @@ void SbxArray::Put32( SbxVariable* pVar, UINT32 nIdx )
     {
         if( pVar )
             if( eType != SbxVARIANT )
-                // Keine Objekte konvertieren
+                // Convert no objects
                 if( eType != SbxOBJECT || pVar->GetClass() != SbxCLASS_OBJECT )
                     pVar->Convert( eType );
         SbxVariableRef& rRef = GetRef32( nIdx );
@@ -249,7 +249,7 @@ void SbxArray::Put( SbxVariable* pVar, USHORT nIdx )
     {
         if( pVar )
             if( eType != SbxVARIANT )
-                // Keine Objekte konvertieren
+                // Convert no objects
                 if( eType != SbxOBJECT || pVar->GetClass() != SbxCLASS_OBJECT )
                     pVar->Convert( eType );
         SbxVariableRef& rRef = GetRef( nIdx );
@@ -363,8 +363,8 @@ void SbxArray::Remove( SbxVariable* pVar )
     }
 }
 
-// Uebernahme der Daten aus dem uebergebenen Array, wobei
-// gleichnamige Variable ueberschrieben werden.
+// Taking over of the data from the passed array, at which
+// the variable of the same name will be overwritten.
 
 void SbxArray::Merge( SbxArray* p )
 {
@@ -374,8 +374,8 @@ void SbxArray::Merge( SbxArray* p )
         for( UINT32 i = 0; i < nSize; i++ )
         {
             SbxVarEntryPtr pRef1 = (*(p->pData))[i];
-            // Ist das Element by name schon drin?
-            // Dann ueberschreiben!
+            // Is the element by name already inside?
+            // Then overwrite!
             SbxVariable* pVar = *pRef1;
             if( pVar )
             {
@@ -405,8 +405,8 @@ void SbxArray::Merge( SbxArray* p )
     }
 }
 
-// Suchen eines Elements ueber die Userdaten. Falls ein Element
-// ein Objekt ist, wird dieses ebenfalls durchsucht.
+// Search of an element via the user data. If the element is
+// object, it will also be scanned.
 
 SbxVariable* SbxArray::FindUserData( UINT32 nData )
 {
@@ -421,16 +421,16 @@ SbxVariable* SbxArray::FindUserData( UINT32 nData )
             {
                 p = pVar;
                 p->ResetFlag( SBX_EXTFOUND );
-                break; // JSM 06.10.95
+                break; // JSM 1995-10-06
             }
-            // Haben wir ein Array/Objekt mit Extended Search?
+            // Did we have an array/object with extended search?
             else if( pVar->IsSet( SBX_EXTSEARCH ) )
             {
                 switch( pVar->GetClass() )
                 {
                     case SbxCLASS_OBJECT:
                     {
-                        // Objekte duerfen ihren Parent nicht durchsuchen
+                        // Objects are not allowed to scan their parent.
                         USHORT nOld = pVar->GetFlags();
                         pVar->ResetFlag( SBX_GBLSEARCH );
                         p = ((SbxObject*) pVar)->FindUserData( nData );
@@ -453,8 +453,8 @@ SbxVariable* SbxArray::FindUserData( UINT32 nData )
     return p;
 }
 
-// Suchen eines Elements ueber den Namen und den Typ. Falls ein Element
-// ein Objekt ist, wird dieses ebenfalls durchsucht.
+// Search of an element by his name and type. If an element is an object,
+// it will also be scanned..
 
 SbxVariable* SbxArray::Find( const XubString& rName, SbxClassType t )
 {
@@ -470,8 +470,7 @@ SbxVariable* SbxArray::Find( const XubString& rName, SbxClassType t )
         SbxVariable* pVar = *pRef;
         if( pVar && pVar->IsVisible() )
         {
-            // Die ganz sichere Suche klappt auch, wenn es
-            // keinen Hascode gibt!
+            // The very secure search works as well, if there is no hashcode!
             USHORT nVarHash = pVar->GetHashCode();
             if( ( !nVarHash || nVarHash == nHash )
                 && ( t == SbxCLASS_DONTCARE || pVar->GetClass() == t )
@@ -481,14 +480,14 @@ SbxVariable* SbxArray::Find( const XubString& rName, SbxClassType t )
                 p->ResetFlag( SBX_EXTFOUND );
                 break;
             }
-            // Haben wir ein Array/Objekt mit Extended Search?
+            // Did we have an array/object with extended search?
             else if( bExtSearch && pVar->IsSet( SBX_EXTSEARCH ) )
             {
                 switch( pVar->GetClass() )
                 {
                     case SbxCLASS_OBJECT:
                     {
-                        // Objekte duerfen ihren Parent nicht durchsuchen
+                        // Objects are not allowed to scan their parent.
                         USHORT nOld = pVar->GetFlags();
                         pVar->ResetFlag( SBX_GBLSEARCH );
                         p = ((SbxObject*) pVar)->Find( rName, t );
@@ -545,7 +544,7 @@ BOOL SbxArray::StoreData( SvStream& rStrm ) const
 {
     UINT32 nElem = 0;
     UINT32 n;
-    // Welche Elemente sind ueberhaupt definiert?
+    // Which elements are even defined?
     for( n = 0; n < pData->size(); n++ )
     {
         SbxVariableRef* pRef = (*pData)[n];
@@ -630,7 +629,7 @@ void SbxDimArray::Clear()
     nDim   = 0;
 }
 
-// Dimension hinzufuegen
+// Add a dimension
 
 void SbxDimArray::AddDimImpl32( INT32 lb, INT32 ub, BOOL bAllowSize0 )
 {
@@ -675,7 +674,7 @@ void SbxDimArray::unoAddDim32( INT32 lb, INT32 ub )
 }
 
 
-// Dimensionsdaten auslesen
+// Readout dimension data
 
 BOOL SbxDimArray::GetDim32( INT32 n, INT32& rlb, INT32& rub ) const
 {
@@ -708,7 +707,7 @@ BOOL SbxDimArray::GetDim( short n, short& rlb, short& rub ) const
     return bRet;
 }
 
-// Element-Ptr anhand einer Index-Liste
+// Element-Ptr with the help of an index list
 
 UINT32 SbxDimArray::Offset32( const INT32* pIdx )
 {
@@ -779,7 +778,7 @@ void SbxDimArray::Put32( SbxVariable* p, const INT32* pIdx  )
 }
 
 
-// Element-Nr anhand eines Parameter-Arrays
+// Element-Number with the help of Parameter-Array
 
 UINT32 SbxDimArray::Offset32( SbxArray* pPar )
 {
@@ -788,7 +787,7 @@ UINT32 SbxDimArray::Offset32( SbxArray* pPar )
         SetError( SbxERR_BOUNDS ); return 0;
     }
     UINT32 nPos = 0;
-    USHORT nOff = 1;   // Nicht Element 0!
+    USHORT nOff = 1;   // Non element 0!
     for( SbxDim* p = pFirst; p && !IsError(); p = p->pNext )
     {
         INT32 nIdx = pPar->Get( nOff++ )->GetLong();
diff --git a/basic/source/sbx/sbxbase.cxx b/basic/source/sbx/sbxbase.cxx
index 2a7849c..437bf36 100644
--- a/basic/source/sbx/sbxbase.cxx
+++ b/basic/source/sbx/sbxbase.cxx
@@ -36,15 +36,15 @@
 #include <basic/sbxfac.hxx>
 #include <basic/sbxbase.hxx>
 
-// AppData-Struktur fuer SBX:
+// AppData-Structure for SBX:
 
 SV_IMPL_PTRARR(SbxParams,SbxParamInfo*);
 SV_IMPL_PTRARR(SbxFacs,SbxFactory*);
 
 TYPEINIT0(SbxBase)
 
-// SBX-Daten anfordern oder ggf. anlegen
-// wir legen den Bereich einfach an und verzichten auf die Freigabe!
+// Request SBX-Data or if necessary create them
+// we just create the area and waive the release!
 
 SbxAppData* GetSbxData_Impl()
 {
@@ -159,11 +159,11 @@ void SbxBase::AddFactory( SbxFactory* pFac )
     SbxAppData* p = GetSbxData_Impl();
     const SbxFactory* pTemp = pFac;
 
-    // AB, 6.3.96: HandleLast-Flag beruecksichtigen
-    USHORT nPos = p->aFacs.Count();            // Einfuege-Position
-    if( !pFac->IsHandleLast() )                        // Nur, wenn nicht selbst HandleLast
+    // From 1996-03-06: take the HandleLast-Flag into account
+    USHORT nPos = p->aFacs.Count();            // Insert-Position
+    if( !pFac->IsHandleLast() )                        // Only if not self HandleLast
     {
-        // Neue Factory vor Factories mit HandleLast einordnen
+        // Rank new factory in front of factories with HandleLast
         while( nPos > 0 &&
                 (static_cast<SbxFactory*>(p->aFacs.GetObject( nPos-1 )))->IsHandleLast() )
             nPos--;
@@ -207,7 +207,7 @@ SbxBase* SbxBase::Create( UINT16 nSbxId, UINT32 nCreator )
         case SBXID_METHOD:             return new SbxMethod( aEmptyStr, SbxEMPTY );
         case SBXID_PROPERTY:   return new SbxProperty( aEmptyStr, SbxEMPTY );
     }
-    // Unbekanter Typ: �ber die Factories gehen!
+    // Unknown type: go over the factories!
     SbxAppData* p = GetSbxData_Impl();
     SbxBase* pNew = NULL;
     for( USHORT i = 0; i < p->aFacs.Count(); i++ )
@@ -252,7 +252,7 @@ SbxObject* SbxBase::CreateObject( const XubString& rClass )
 
 static BOOL bStaticEnableBroadcasting = TRUE;
 
-// Sbx-Loesung als Ersatz fuer SfxBroadcaster::Enable()
+// Sbx-Solution in exchange for SfxBroadcaster::Enable()
 void SbxBase::StaticEnableBroadcasting( BOOL bEnable )
 {
     bStaticEnableBroadcasting = bEnable;
@@ -270,7 +270,7 @@ SbxBase* SbxBase::Load( SvStream& rStrm )
     UINT32 nCreator, nSize;
     rStrm >> nCreator >> nSbxId >> nFlags >> nVer;
 
-    // Eine Dummheit meinerseits korrigieren:
+    // Correcting a foolishness of mine:
     if( nFlags & SBX_RESERVED )
         nFlags = ( nFlags & ~SBX_RESERVED ) | SBX_GBLSEARCH;
 
@@ -289,7 +289,7 @@ SbxBase* SbxBase::Load( SvStream& rStrm )
                 rStrm.Seek( nOldPos );
             if( !p->LoadCompleted() )
             {
-                // Loeschen des Objekts
+                // Deleting of the object
                 SbxBaseRef aRef( p );
                 p = NULL;
             }
@@ -297,7 +297,7 @@ SbxBase* SbxBase::Load( SvStream& rStrm )
         else
         {
             rStrm.SetError( SVSTREAM_FILEFORMAT_ERROR );
-            // Loeschen des Objekts
+            // Deleting of the object
             SbxBaseRef aRef( p );
             p = NULL;
         }
@@ -307,7 +307,7 @@ SbxBase* SbxBase::Load( SvStream& rStrm )
     return p;
 }
 
-// Sbx-Objekt im Stream ueberspringen
+// Skip the Sbx-Object inside the stream
 void SbxBase::Skip( SvStream& rStrm )
 {
     UINT16 nSbxId, nFlags, nVer;
diff --git a/basic/source/sbx/sbxbyte.cxx b/basic/source/sbx/sbxbyte.cxx
index b70b826..6ba6140 100644
--- a/basic/source/sbx/sbxbyte.cxx
+++ b/basic/source/sbx/sbxbyte.cxx
@@ -200,7 +200,7 @@ start:
         case SbxBYREF | SbxBYTE:
             nRes = p->nByte; break;
 
-        // ab hier wird getestet
+        // from here on will be tested
         case SbxBYREF | SbxCHAR:
             aTmp.nChar = *p->pChar; goto ref;
         case SbxBYREF | SbxINTEGER:
diff --git a/basic/source/sbx/sbxchar.cxx b/basic/source/sbx/sbxchar.cxx
index ca52057..3db8d9f 100644
--- a/basic/source/sbx/sbxchar.cxx
+++ b/basic/source/sbx/sbxchar.cxx
@@ -31,7 +31,7 @@
 #include <basic/sbx.hxx>
 #include "sbxconv.hxx"
 
-// AB 29.10.99 Unicode
+// From 1999-10-29 Unicode
 #ifndef _USE_NO_NAMESPACE
 using namespace rtl;
 #endif
@@ -188,7 +188,7 @@ start:
 
         case SbxBYREF | SbxCHAR:
             nRes = *p->pChar; break;
-        // ab hier wird getestet
+        // from here on will be tested
         case SbxBYREF | SbxBYTE:
             aTmp.nByte = *p->pByte; goto ref;
         case SbxBYREF | SbxINTEGER:
@@ -257,7 +257,7 @@ start:
             ImpCreateDecimal( p )->setChar( n );
             break;
 
-        // ab hier wird getestet
+        // from here on will be tested
         case SbxBYTE:
             aTmp.pByte = &p->nByte; goto direct;
         case SbxULONG:
-- 
1.7.1


Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.