Cosmetics, removed obsoleted sections, try-run with yodl 4.00.00 OK

annotations/TODO

@@ -1,8 +1,6 @@
 Structured binding declarations  (cf https://en.wikipedia.org/wiki/C++17 en
 ~/downloads/n4659.pdf
 
-check in multithreading/quicksort whether annotations() has been converted.
-
 Add weak_ptr
 
 

annotations/VERSION

@@ -0,0 +1 @@
+yo/version.yo

annotations/changelog

@@ -1,3 +1,14 @@
+C++-annotations (10.8.0)
+
+  * Added a new section (Introduction: upcoming C++17 features) providing an
+     overview of new language features introduced by the C++17 standard
+
+  * Many typos and suboptimally formulated statements were fixed, many of them
+     very thoroughly compiled by Maurits Silvis.  
+
+  * Coverage of (considered obsolete) binders and negators was discontinued.
+
+
 C++-annotations (10.7.2)
 
   * The section about implementing binary operators was fundamentally

annotations/yo/classtemplates/converting.yo

@@ -248,5 +248,5 @@ tt(Truck) type. The statically polumorphic program will be slightly faster,
 though.
 
     (A compilable example using static polymorphism is found in the
-annotation()'s source distribution's file
+annotations()'s source distribution's file
 tt(yo/classtemplates/examples/staticpolymorphism/polymorph.cc).)

annotations/yo/concrete/polymorphic.yo

@@ -78,5 +78,5 @@ returned by the conversion operators of the different semantic data types;
     it() Finally, de class template tt(Semantic) is defined, allowing us to
 define various semantic value classes, all derived from tt(SemBase)
     )
-    The complete demo program is available in the annotation()'s source
+    The complete demo program is available in the annotations()'s source
 archive under the directory tt(yo/concrete/poly2).

annotations/yo/generic.yo

@@ -224,8 +224,10 @@ COMMENT( removed in C++17 )
 lsect(MEMFUNADAPT)(STL: More function adaptors)
 includefile(generic/morefunctionadaptors)
 
+COMMENT( Removed in 10.8.0 
     subsect(Member function adaptors)
     includefile(generic/memberfunctionadaptors)
+)
 
 
     lsubsect(ADAPTABLEFUN)(Adaptable functions)

annotations/yo/inheritance/multiple.yo

@@ -1,8 +1,9 @@
 Except for the class tt(Randbuf) classes thus far have always been derived
-from a single base class. In addition to i(single inheritance) hi(inheritance:
-multiple) bf(C++) also supports emi(multiple inheritance). In multiple
-inheritance a class is derived from several base classes and hence inherits
-functionality from multiple parent classes at the same time.
+from a single base class. In addition to i(single inheritance) 
+    hi(inheritance: multiple) 
+    bf(C++) also supports emi(multiple inheritance). In multiple inheritance a
+class is derived from several base classes and hence inherits functionality
+from multiple parent classes at the same time.
 
     When using multiple inheritance it should be defensible to consider the
 newly derived class an instantiation of both base classes. Otherwise,

annotations/yo/namespaces.yo

@@ -22,8 +22,10 @@ includefile(namespaces/intro)
     subsect(The standard namespace)
     includefile(namespaces/std)
 
+COMMENT( removed in 10.8.0
         lsubsubsect(PLACEHOLDERS)(The std::placeholders namespace)
         includefile(namespaces/placeholders)
+END)
 
     subsect(Nesting namespaces and namespace aliasing)
     includefile(namespaces/nesting)

annotations/yo/stl.yo

@@ -15,7 +15,7 @@ includefile(stl/predefined)
     lsubsect(FUNADAPT)(Function adaptors)
     includefile(stl/adaptors)
 
-COMMENT(
+COMMENT( removed in 10.8.0
         lsubsubsect(BIND)(The `bind' function template)   removed in C++17
         includefile(stl/binders)
 

annotations/yo/threading/quicksort.yo

@@ -45,7 +45,7 @@ requests on to the next available worker.
 
 The main data structure of the example program developed in this section is a
 queue of tt(std::pairs) containing iterators of the array to be sorted
-(cf. fig(sorting), the sources of the program are found in the annotation()'s
+(cf. fig(sorting), the sources of the program are found in the annotations()'s
 tt(yo/threading/examples/multisort) directory). Two queues are being used: one
 queue is a task-queue, receiving the iterators of sub-arrays to be
 partitioned. Instead of immediately launching new threads (the tt(lhs) and

annotations/yo/threading/ratio.yo

@@ -1,9 +1,9 @@
 Thread execution may have to be suspended until a specific point in time, for
 a specific amount of time, or until some event has occurred. When specifying
 time an appropriate time unit must be selected. Factors that can be used in
-combination with time units are defined in the class template hi(ratio
-template)tt(std::ratio). The time units themselves are defined in the
-namespace tt(chrono). 
+combination with time units are defined in the class template 
+    hi(ratio template)tt(std::ratio). 
+    The time units themselves are defined in the namespace tt(chrono).
 
 Before the class tt(ratio) can be used, the tthi(ratio) header file must be
 included. Usually just the tthi(chrono) header file is included, as tt(chrono)

annotations/yo/version.yo

@@ -1,2 +1,2 @@
-SUBST(DOCVERSION)(10.7.2)
+SUBST(DOCVERSION)(10.8.0)
 SUBST(YEARS)(1994 - 2017)

annotations/yo/whatsnew.yo

@@ -9,8 +9,14 @@ COMMENT(
         standard also adds em(fold expressions)to the language: covered in
         a sub-section of section ref(VARIADIC).
 END)
+    it() Version 10.8.0 contains a new section (ref(CXVII)) providing an
+        overview of new language features introduced by the C++17 standard,
+        and many typos and suboptimally formulated statements were fixed.
+        Also, coverage of (considered obsolete) binders and negators was
+        discontinued. 
     it() Version 10.7.2 contains a complete rewrite and re-implementation of
-        the section on adding binary operators to classes.
+        section ref(OVERLOADBINARY) covering overloading/adding binary
+        operators in classes.
     it() Version 10.7.0 adds various sections about the upcoming new C++17
         standard (cf. section ref(CXVII)). In addition, the sections about
         overloading binary operators and adding binary operators to existing