translated some comments from german -> english

1 files changed, 23 insertions, 23 deletions

diff --git a/sw/inc/bparr.hxx b/sw/inc/bparr.hxx
index 88f0c247f619..32f4e751b5e3 100644
--- a/sw/inc/bparr.hxx
+++ b/sw/inc/bparr.hxx
@@ -58,37 +58,37 @@ typedef BOOL (*FnForEach)( const ElementPtr&, void* pArgs );
 #define MAXENTRY 1000
 
 
-// Anzahl Eintraege, die bei der Kompression frei bleiben duerfen
-// dieser Wert ist fuer den Worst Case, da wir MAXBLOCK mit ca 25%
-// Overhead definiert haben, reichen 80% = 800 Eintraege vollkommen aus
-// Will mann voellige Kompression haben, muss eben 100 angegeben werden.
-
+// number of entries that may remain free during compression
+// this value is for the worst case; because we defined MAXBLOCK with ca 25%
+// overhead, 80% = 800 entries are enough
+// if complete compression is desired, 100 has to be specified
 #define COMPRESSLVL 80
 
-struct BlockInfo {                  // Block-Info:
-    BigPtrArray* pBigArr;           // in diesem Array steht der Block
-    ElementPtr* pData;              // Datenblock
-    ULONG nStart, nEnd;             // Start- und EndIndex
-    USHORT nElem;                   // Anzahl Elemente
+struct BlockInfo {                  // block info:
+    BigPtrArray* pBigArr;           // in this array the block is located
+    ElementPtr* pData;              // data block
+    ULONG nStart, nEnd;             // start- and end index
+    USHORT nElem;                   // number of elements
 };
 
 class SW_DLLPUBLIC BigPtrArray
 {
-    BlockInfo** ppInf;              // Block-Infos
-    ULONG       nSize;              // Anzahl Elemente
-    USHORT      nMaxBlock;          // akt. max Anzahl Bloecke
-    USHORT      nBlock;             // Anzahl Bloecke
-    USHORT      nCur;               // letzter Block
+    BlockInfo** ppInf;              // block info
+    ULONG       nSize;              // number of elements
+    USHORT      nMaxBlock;          // current max. number of blocks
+    USHORT      nBlock;             // number of blocks
+    USHORT      nCur;               // last block
 
-    USHORT      Index2Block( ULONG ) const; // Blocksuche
-    BlockInfo*  InsBlock( USHORT );         // Block einfuegen
-    void        BlockDel( USHORT );         // es wurden Bloecke geloescht
-    void        UpdIndex( USHORT );         // Indexe neu berechnen
+    USHORT      Index2Block( ULONG ) const; // block search
+    BlockInfo*  InsBlock( USHORT );         // insert block
+    void        BlockDel( USHORT );         // some blocks were deleted
+    void        UpdIndex( USHORT );         // recalculate indices
 
 protected:
-    // fuelle alle Bloecke auf.
-    // Der short gibt in Prozent an, wie voll die Bloecke werden sollen.
-    // Der ReturnWert besagt, das irgendetwas "getan" wurde
+    // fill all blocks
+    // the short parameter specifies in percent, how full the blocks should be
+    // made
+    // the return value specifies that something was done
     USHORT Compress( short = COMPRESSLVL );
 
 public:
@@ -114,7 +114,7 @@ public:
 
 inline ULONG BigPtrEntry::GetPos() const
 {
-    DBG_ASSERT( this == pBlock->pData[ nOffset ], "Element nicht im Block" );
+    DBG_ASSERT( this == pBlock->pData[ nOffset ], "element not in the block" );
     return pBlock->nStart + nOffset;
 }