Fix broken brief descriptions, unlink a word.

STL_Extension/doc/STL_Extension/CGAL/Compact_container.h

@@ -612,20 +612,17 @@ void clear();
 /// The following functions are mostly helpful for efficient debugging, since 
 /// their complexity is \f$ O(\sqrt{c.capacity()})\f$. 
 /// @{ 
-/*! 
-returns whether `pos` is in the range [`c`.`begin()`, `c`.`end()`] 
-(`c`.`end()` included). 
-*/ 
+
+/*!
+ * returns whether `pos` is in the range [`c`.\ `begin()`, `c`.\ `end()`] \(`c`.\ `end()` included\).
+ */ 
 bool owns(const_iterator pos); 
 
-/*! 
-returns whether `pos` is in the range [`c`.`begin()`, `c`.`end()`) 
-(`c`.`end()` excluded). 
-*/ 
+/*!
+ * returns whether `pos` is in the range [`c`.\ `begin()`, `c`.\ `end()`) \(`c`.\ `end()` excluded\). 
+ */ 
 bool owns_dereferencable(const_iterator pos); 
 
-
-
 /// @} 
 
 

STL_Extension/doc/STL_Extension/STL_Extension.txt

@@ -39,7 +39,7 @@ This used to simplify mutually pointed data structures like a halfedge
 data structure for planar maps or polyhedral surfaces (the current design
 does not need this anymore). The usual iterators are also available.
 
-# Compact Container #
+# %Compact Container #
 
 The class `Compact_container<T, Allocator>` is an \stl like container
 which provides a very compact storage for its elements. It achieves this goal