Fix errors in the manual (most of them found by Ivan Zuboff)

Signed-off-by: Mattias Andrée <maandree@kth.se>

1 files changed, 21 insertions, 21 deletions

diff --git a/doc/not-implemented.tex b/doc/not-implemented.tex
index 59b3efb..9688189 100644
--- a/doc/not-implemented.tex
+++ b/doc/not-implemented.tex
@@ -3,25 +3,25 @@
 
 In this chapter we maintain a list of
 features we have chosen not to implement,
-but would fit into libzahl had we not have
+but would fit into libzahl, had we not have
 our priorities straight. Functions listed
 herein will only be implemented if it is
 shown that it would be overwhelmingly
 advantageous. For each feature, a sample
 implementation or a mathematical expression
-on which you can base your implemention
-is included. The sample implementations create
-temporary integer references, this is to
-simplify the examples. You should try to
-use dedicated variables; in case of recursion,
-a robust program should store temporary
-variables on a stack, so they can be
-clean up if something happens.
+on which you can base your implementation is
+included. The sample implementations create
+temporary integer references to simplify the
+examples. You should try to use dedicated
+variables; in case of recursion, a robust
+program should store temporary variables on
+a stack, so they can be cleaned up if
+something happens.
 
-Research problems, like prime-factorisation
-and discrete logarithms do not fit in the
-scope of bignum libraries. % Unless they are extraordinarily bloated with vague mission-scope, like systemd.
-And therefore do not fit into libzahl,
+Research problems, like prime factorisation
+and discrete logarithms, do not fit in the
+scope of bignum libraries % Unless they are extraordinarily bloated with vague mission-scope, like systemd.
+and therefore do not fit into libzahl,
 and will not be included in this chapter.
 Operators and functions that grow so
 ridiculously fast that a tiny lookup table
@@ -330,7 +330,7 @@ method can be derived from the observation
 \vspace{1em}
 
 \noindent
-The resulting algorithm can be expressed
+The resulting algorithm can be expressed as
 
 \begin{alltt}
    void
@@ -690,10 +690,10 @@ in an integer, counting the sign bit:
 \end{alltt}
 
 \noindent
-It requires a compiler extension, if missing,
-there are other ways to computer the population
-count for a word: manually bit-by-bit, or with
-a fully unrolled
+It requires a compiler extension; if it's not
+available, there are other ways to computer the
+population count for a word: manually bit-by-bit,
+or with a fully unrolled
 
 \begin{alltt}
    int s;
@@ -706,7 +706,7 @@ a fully unrolled
 \label{sec:Hamming distance}
 
 A simple way to compute the Hamming distance,
-the number of differing bits, between two
+the number of differing bits between two
 numbers is with the function
 
 \begin{alltt}
@@ -767,13 +767,13 @@ side-effects.
 \label{sec:Reference duplication}
 
 This could be useful for creating duplicates
-with modified sign. But only if neither
+with modified sign, but only if neither
 {\tt r} nor {\tt a} will be modified whilst
 both are in use. Because it is unsafe,
 fairly simple to create an implementation
 with acceptable performance — {\tt *r = *a},
 — and probably seldom useful, this has not
-be implemented.
+been implemented.
 
 \begin{alltt}
    void