[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-commits
Subject:    koffice/libs/kformula (silent)
From:       Ariya Hidayat <ariya () kde ! org>
Date:       2007-01-01 23:46:50
Message-ID: 1167695210.791349.7232.nullmailer () svn ! kde ! org
[Download RAW message or body]

SVN commit 618654 by ariya:

SVN_SILENT typo


 M  +5 -5      DESIGN  


--- trunk/koffice/libs/kformula/DESIGN #618653:618654
@@ -2,7 +2,7 @@
                           (as we imagine it)
 
 The core of KFormula is a tree of element objects that make up the
-formula which is beeing edited.
+formula which is being edited.
 
 Size calculation
 Calling the method calculateSize() of each BasicElement derived class invokes
@@ -180,7 +180,7 @@
 simple text.
 
 They can you pixamps inestead of fonts, the use of pixmaps is needed only 
-to give the user the possibilty of introduce its strange operator that we 
+to give the user the possibility of introduce its strange operator that we 
 do not provide as a font. There problems with the scalability but we will
 include as fonts (or vectorial images) in kformula all TeX operators so we
 hope there is no need to use pixamps for a standard use of KFormula
@@ -194,7 +194,7 @@
 position inside the formula structure. Each kformula view needs to
 have its own object of this class.
 
-The Cursor class uses the elements facility to travel throught the
+The Cursor class uses the elements facility to travel through the
 structure. (It gives the key to the current element and asks for the
 new position.)
 
@@ -269,7 +269,7 @@
 be normalized.
 
 - If you remove something from a element it might become
-senseless. This means you must replace it with its main childs
+senseless. This means you must replace it with its main child's
 content.
 
 
@@ -278,7 +278,7 @@
 ###################
 
 Everytime a sequence is edited it builds a new syntax tree. (The old
-one gets recycled :) ) The parser goes throught the sequence and
+one gets recycled :) ) The parser goes through the sequence and
 builds a type object for every token is finds. A token consists of
 one or more elements.
 
[prev in list] [next in list] [prev in thread] [next in thread]