X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=development%2Flazy_lyxtext.txt;h=fcd838bdf01789b107d706d10012b0593a3c633e;hb=30611541cb7f9bee21fd39b7cf9f4f918970120a;hp=711a1e7f8224e7a209a9831814bc186c15e7de2b;hpb=82fa210ea8d38d51aafb131f10d843e27e056429;p=lyx.git

diff --git a/development/lazy_lyxtext.txt b/development/lazy_lyxtext.txt
index 711a1e7f82..fcd838bdf0 100644
--- a/development/lazy_lyxtext.txt
+++ b/development/lazy_lyxtext.txt
@@ -66,7 +66,7 @@
      this is 16 * 10 * 50 = 8000 bytes, we have however some
      additional overhead: the RowPars one for each paragraph if we
      assume 5 lines per paragraph and 20 bytes for each RowPar we get:
-     10 * 50 / 5 * 20 = 2000. This is a sum of 10000 on the new scheme. 
+     10 * 50 / 5 * 20 = 2000. This is a sum of 10000 on the new scheme.
 
      Speed: some operations will most likely be somewhat faster since
      they now can operate on the number of paragraph instead of the
@@ -80,8 +80,8 @@
      If we want to operate on rows only it is easy to create iterators
      that can handle this. (This means that a way to force the
      evaluation of the rows might be something like:
-		
-		// traverse all the rows and generate the missing ones. 
+
+		// traverse all the rows and generate the missing ones.
 		for_each(rowlist.begin(), rowlist.end(), dummy_func);
 
      Note about the buffer structure in the lyx repository: LyXText
@@ -117,6 +117,3 @@
 from the middle.
 
 ² Number of CPUs f.ex.
-
-
-     
\ No newline at end of file