cosmetics, html construction OK

annotations/yo/generic/count.yo

@@ -15,9 +15,9 @@
 occurs in the elements reached from the iterator range rangett(first, last).
 Uses tt(Type::operator==) to determine whether tt(value) is equal to an
 element in the iterator range.
-            it() The second prototype: returns the number of times i(unary
-predicate) `tt(predicate)' returns tt(true) when applied to the elements
-reached from the iterator range rangett(first, last).
+            it() The second prototype: returns the number of times
+    i(unary predicate) `tt(predicate)' returns tt(true) when applied to the
+elements reached from the iterator range rangett(first, last).
         )
         it() Example:
         verbinclude(-a examples/count.cc)

annotations/yo/generic/max.yo

@@ -1,4 +1,4 @@
-    hi(max) hi(mix)
+    hi(max) hi(min)
     itemization(
         it() Header file: tt(<algorithm>)
         it() Function prototypes:

annotations/yo/generic/nextpermutation.yo

@@ -1,4 +1,4 @@
-    hi(next_permutation) hi(prv_permutation)
+    hi(next_permutation) hi(prev_permutation)
     itemization(
         it() Header file: tt(<algorithm>)
         it() Function prototypes:

annotations/yo/generic/partialsum.yo

@@ -1,4 +1,4 @@
-    hi(partial_sum)
+    hi(partial_sum) hi(inclusive_scan) hi(exclusive_scan)
     itemization(
         it() Header file: tt(<numeric>)
         it() Function prototypes:

annotations/yo/generic/sample.yo

@@ -1,4 +1,4 @@
-    hi(sample)
+    hi(sample) hi(shuffle)
     itemization(
         it() Header file: tt(<algorithm>)
         it() Function prototype:

annotations/yo/generic/uninitialized.yo

@@ -1,3 +1,4 @@
+hi(placement new: generic algorithms)hi(uninitialized... algorithms)
 Section ref(PLACEMENT) covers the placement new operator. The placement new
 operator is used to install values or objects in 'raw memory', i.e., memory
 that is already available, but hasn't yet been initialized for the intended
@@ -25,7 +26,6 @@ Several generic algorithms, all supporting execution policies, are available
 simplifying the use of tt(placement new). To use these algorithm the
 tthi(memory) header file must be included. 
 
-hi(placement new: generic algorithms)hi(uninitialized... algorithms)
 Facilities are available to copy, fill, initialize, and move objects to/in
 uninitialized (raw) memory, as well as facilities to delete the objects stored
 in raw memory. Here is an overvieuw of the available facilities (cf.