Re: [Boost-bugs] [Boost C++ Libraries] #6710: Boost Containers Using interprocess Basic_strings Need external temporaries

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #6710: Boost Containers Using interprocess Basic_strings Need external temporaries
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2012-03-21 20:50:16

#6710: Boost Containers Using interprocess Basic_strings Need external temporaries
----------------------------------+-----------------------------------------
  Reporter:  jdy@…                |       Owner:  igaztanaga                                           
      Type:  Feature Requests     |      Status:  new                                                  
 Milestone:  To Be Determined     |   Component:  container                                            
   Version:  Boost 1.49.0         |    Severity:  Problem                                              
Resolution:                       |    Keywords:  interprocess, container, map, flat_map, unordered_map
----------------------------------+-----------------------------------------

Comment (by jdy@…):

 Feature request:

 Modify the container such that code such as:

 {{{
 mymap_in_shared_memory[key_val = mystring.c_str()] = junk;
 }}}

 could instead be written as

 {{{
 mymap_in_shared_memory[mystring] = junk;
 }}}

 while avoiding the creation of a temporary as discussed above.  Ion
 mentioned that techniques used here:

 [http://www.boost.org/doc/libs/1_49_0/libs/multi_index/doc/reference/ord_indices.html#set_operations]

 and

 [http://www.boost.org/doc/libs/1_49_0/doc/html/intrusive/advanced_lookups_insertions.html#intrusive.advanced_lookups_insertions.advanced_lookups]

 can facilitate this.


 The fix in 58405 doesn't seem to address this as the code above doesn't
 compile.  Furthermore, the docs for unordered do not discuss
 CompatibleTypes.

 Joel

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/6710#comment:2>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.