Further refine complex map examples and link the example presentation to the relevant uses-allocator construction section

Author: igaztanaga

doc/interprocess.qbk

@@ -4688,7 +4688,7 @@ pool is used for each node size. This is not possible if you try to share
 a node allocator between processes. To achieve this sharing
 [classref boost::interprocess::node_allocator node_allocator]
 uses the segment manager's unique type allocation service
-(see [link interprocess.managed_memory_segments.managed_memory_segment_object_construction.unique Unique instance construction] section).
+(see [link interprocess.managed_memory_segment_object_construction.unique Unique instance construction] section).
 
 In the initialization, a
 [classref boost::interprocess::node_allocator node_allocator]
@@ -5226,7 +5226,8 @@ and the mapped type is a class that stores several containers:
 [doc_complex_map]
 
 This example can be simplified if the user designs a type compatible with the
-uses-allocator construction. Simplifies code and allows more efficient
+[link interprocess.managed_memory_segment_object_construction.uses_allocator uses-allocator construction].
+This simplifies code and allows more efficient
 operations like the use of transparent functions for lookups and insertions:
 
 [import ../example/doc_complex_map_uses_allocator.cpp]

example/doc_complex_map.cpp

@@ -46,7 +46,7 @@ class complex_data
    //->
 };
 
-//Definition of the map holding a string as key and complex_data as mapped type
+//Definition of a shared memory map<string_t,complex_data...>
 typedef std::pair<const string_t, complex_data>                map_value_type;
 typedef allocator<map_value_type, seg_mngr_t>                  map_value_type_allocator;
 typedef bc::map< string_t, complex_data, std::less<string_t>

example/doc_complex_map_uses_allocator.cpp

@@ -47,17 +47,21 @@ class complex_data
    //->
 };
 
+//<-
 struct lessthan //A transparent comparison functor
 {
    typedef void is_transparent;
    template<class T, class U> bool operator() (const T &t, const U &u) const { return t < u; }
 };
-
-//Definition of the map holding a string as key and complex_data as mapped type
-typedef std::pair<const string_t, complex_data>                   map_value_type;
-typedef allocator<map_value_type, seg_mngr_t>                     map_value_type_allocator;
-typedef boost::container::map< string_t, complex_data, lessthan
-                             , map_value_type_allocator>          complex_map_type;
+//->
+//Definition of a shared memory map<string_t, complex_data...> with transparent comparison
+typedef std::pair<const string_t, complex_data>          map_value_type;
+typedef allocator<map_value_type, seg_mngr_t>            map_value_type_allocator;
+//=typedef bc::map< string_t, complex_data, std::less<>
+//<-
+typedef bc::map< string_t, complex_data, lessthan
+//->
+               , map_value_type_allocator>               complex_map_type;
 
 int main ()
 {
@@ -75,7 +79,7 @@ int main ()
    //Construct the map calling map(key_compare, allocator_type), the allocator argument is implicit
    complex_map_type *mymap = segment.construct<complex_map_type>("MyMap")();
 
-   //Take advantage of transparent insertion, string_t and complex_data are constructed with implicit allocators
+   //Efficient transparent insertion, string_t and complex_data are constructed in-place with implicit allocators
    mymap->try_emplace("key_str", "default_name");
 
    return 0;