Merge pull request #470 from der-gabe/very-minor-doc-improvements

Very minor doc improvements

Author: mlschroe

doc/libsolv-bindings.txt

@@ -12,10 +12,10 @@ libsolv-bindings - access libsolv from perl/python/ruby
 Description
 -----------
 Libsolv's language bindings offer an abstract, object orientated interface
-to the library. The supported languages are currently perl, python, and ruby.
-All example code (except in the specifics sections, of course) lists first
-the ``C-ish'' interface, then the syntax for perl, python, and ruby (in that
-order).
+to the library. The supported languages are currently perl, python, ruby and
+tcl. All example code (except in the specifics sections, of course) lists
+first the ``C-ish'' interface, then the syntax for perl, python, and ruby
+(in that order).
 
 
 Perl Specifics

doc/libsolv-constantids.txt

@@ -15,9 +15,9 @@ Constant Ids are Ids of strings that are often needed. They are defined
 to ease programming and reduce the number of pool_str2id calls. The
 constant Ids are part of the binary ABI of libsolv, a minor version 
 update will only add new constants and not change existing Ids to
-maintain compatible. The on-disk solv format works does not use the
-fixed Ids, but instead references the strings, so solv files can still
-be read when the ABI is broken.
+maintain compatibility. The on-disk solv format does not use the fixed
+Ids, but instead references the strings, so solv files can still be
+read when the ABI is broken.
 
 
 Special Strings
@@ -31,7 +31,7 @@ Special Strings
 
 Solvable Attributes
 -------------------
-These are Ids for keyname of attributes. They can be used in the
+These are Ids for keynames of attributes. They can be used in the
 lookup and storage functions to select the correct attribute in the
 solvable. The descriptions below describe the intended semantics
 of the values stored in the attribute with the keyname.

doc/libsolv-history.txt

@@ -53,12 +53,12 @@ solving on Debian. Looking at the SAT entry in Wikipedia, it was easy
 to see that this indeed was the missing piece: SAT algorithms are well
 researched and there are quite some open source implementations.
 I decided to look at the minisat code, as it is one of the fastest
-solvers while consisting of too many lines of code.
+solvers while consisting of not too many lines of code.
 
 Of course, directly using minisat would not work, as a package solver
 does not need to find just one correct solution, but it also has to
 optimize some metrics, i.e. keep as many packages installed as possible.
-Thus, I needed to write my own solver incorporation the ideas and
+Thus, I needed to write my own solver, incorporating the ideas and
 algorithms used in minisat. This wasn't very hard, and at the end of
 the hack week the solver calculated the first right solutions.
 

doc/libsolv.txt

@@ -28,7 +28,7 @@ The libsolv documentation is split into multiple parts:
 Pointer Validity
 ----------------
 Note that all pointers to objects that have an Id have only a limited
-validity period, with the exception of Repo pointers. There are only
+validity period, with the exception of Repo pointers. They are only
 guaranteed to be valid until a new object of that type is added or an
 object of that type is removed. Thus pointers to Solvable objects are only 
 valid until another solvable is created, because adding a Solvable may