Add endsect ids, enable quickbook strict mode

doc/Jamfile.v2

@@ -10,7 +10,7 @@ project doc/mp11 ;
 import boostbook ;
 import quickbook ;
 
-xml mp11_ : mp11.qbk ;
+xml mp11_ : mp11.qbk : <quickbook-strict-mode>on ;
 boostbook standalone_mp11
     :
         mp11_

doc/html/mp11.html

@@ -1866,7 +1866,7 @@
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: May 12, 2017 at 16:42:29 GMT</small></p></td>
+<td align="left"><p><small>Last revised: May 12, 2017 at 16:48:16 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>

doc/mp11/algorithm.qbk

@@ -244,4 +244,4 @@ for the elements of `L<U1...>` and `mp_false` for the elements of `L<U2...>`. Re
 `mp_any_of<L, P>` is `mp_true` when `P` holds for at least one element of `L`, `mp_false` otherwise. When `L` is empty, the result is `mp_false`.
 [endsect]
 
-[endsect]
+[endsect:algorithm]

doc/mp11/bind.qbk

@@ -68,4 +68,4 @@ As `mp_bind_front`, but takes a quoted metafunction.
 As `mp_bind_back`, but takes a quoted metafunction.
 [endsect]
 
-[endsect]
+[endsect:bind]

doc/mp11/definitions.qbk

@@ -6,7 +6,7 @@
  / http://www.boost.org/LICENSE_1_0.txt)
  /]
 
-[section Definitions]
+[section:definitions Definitions]
 
 A /list/ is a '''—''' usually but not necessarily variadic '''—''' template class whose parameters are all types,
 for example `mp_list<char[], void>`, `mp_list<>`, `std::tuple<int, float, char>`, `std::pair<int, float>`, `std::shared_ptr<X>`.
@@ -36,4 +36,4 @@ A /map/ is a list of lists, the inner lists having at least one element (the key
   using M1 = std::tuple<std::pair<int, int*>, std::pair<float, float*>, std::pair<void, void*>>;
   using M2 = mp_list<mp_list<int, int*>, mp_list<float>, mp_list<char, char[1], char[2]>>;
 
-[endsect]
+[endsect:definitions]

doc/mp11/examples.qbk

@@ -6,7 +6,7 @@
  / http://www.boost.org/LICENSE_1_0.txt)
  /]
 
-[section Examples]
+[section:examples Examples]
 
 [section Generating Test Cases]
 
@@ -173,4 +173,4 @@ and we're done:
 
 [endsect]
 
-[endsect]
+[endsect:examples]

doc/mp11/function.qbk

@@ -37,4 +37,4 @@ If no such type exists, the last one is returned. `mp_or<>` is `mp_false`. Simil
 `mp_or`, but does not perform short-circuit evaluation.
 [endsect]
 
-[endsect]
+[endsect:function]

doc/mp11/integer_sequence.qbk

@@ -42,4 +42,4 @@ The contents of this header are defined in namespace `boost`.
 `index_sequence_for<N>` is `make_index_sequence<sizeof...(T)>`. Same as C++14's `std::index_sequence_for`.
 [endsect]
 
-[endsect]
+[endsect:integer_sequence]

doc/mp11/integral.qbk

@@ -38,4 +38,4 @@ For an Mp11 integral constant type `T`, `T::value` is an integral constant in th
     template<std::size_t N> using mp_size_t = std::integral_constant<std::size_t, N>;
 [endsect]
 
-[endsect]
+[endsect:integral]

doc/mp11/list.qbk

@@ -132,4 +132,4 @@ is an alias for `L<U1, T, U...>`.
 is an alias for `L<U1, U2, T, U...>`.
 [endsect]
 
-[endsect]
+[endsect:list]

doc/mp11/map.qbk

@@ -48,4 +48,4 @@ replaces the existing element `L<X, Y...>` with `L<X, F<X, Y...>>`.
 If the map `M` contains an element with a key `K`, removes it.
 [endsect]
 
-[endsect]
+[endsect:map]

doc/mp11/overview.qbk

@@ -6,7 +6,7 @@
  / http://www.boost.org/LICENSE_1_0.txt)
  /]
 
-[section Overview]
+[section:overview Overview]
 
 Mp11 is a C++11 metaprogramming library based on template aliases and variadic templates.
 It implements the approach outlined in the article
@@ -31,4 +31,4 @@ gives us `std::tuple<int*, float*>`, but we can also apply `mp_list` to the same
 
 and get `std::tuple<mp_list<int>, mp_list<float>>`.
 
-[endsect]
+[endsect:overview]

doc/mp11/set.qbk

@@ -28,4 +28,4 @@ For each `T1` in `T...`, `mp_set_push_back<S, T...>` appends `T1` to the end of
 `mp_set_push_front<S, T...>` inserts at the front of `S` those elements of `T...` for which `S` does not already contain the same type.
 [endsect]
 
-[endsect]
+[endsect:set]

doc/mp11/tuple_for_each.qbk

@@ -19,4 +19,4 @@ expression `f(std::get<J>(std::forward<Tp>(tp)))` for `J` in 0..`N-1`, where `N`
 Returns `std::forward<F>(f)`.
 [endsect]
 
-[endsect]
+[endsect:tuple_for_each]

doc/mp11/utility.qbk

@@ -76,4 +76,4 @@ When `mp_valid<F, T...>` is `mp_true`, `mp_defer<F, T...>` is a struct with a ne
 `mp_invoke<Q, T...>` evaluates the nested template `fn` of a quoted metafunction. `mp_invoke<mp_quote<F>, T...>` returns `F<T...>`.
 [endsect]
 
-[endsect]
+[endsect:utility]