boost::bimap [was Re: Do really property_tree and program_options overlap? ]
----- Mensaje original ----- De: Thorsten Ottosen <thorsten.ottosen@dezide.com> Fecha: Domingo, Abril 23, 2006 9:28 am Asunto: Re: [boost] Do really property_tree and program_options overlap?
Pavel Vozenilek wrote:
"Thorsten Ottosen"wrote:
Well, I think we need both. Boost.MultiIndex is a great library and can do all kinds of wonderful things. But I would still like to see a bidirectiobal map (boost::bimap) written as a wrapper around it to get an easy and specialized interface.
bimap is available in libs/multi-index/examples/bimap.cpp.
Right, but the real value comes when somebody designs a nice STL-like interface and write docs etc, at least that was my point.
Hello Thorsten, we have talked about this privately in the past, but I feel like bringing it to the list in the hope of getting the attention of potential contributors: There are some data structures buildable with B.MI which are regarded as particularly useful or common, like for instance the bidirectional map or bimap. A lean and mean implementation is provided in the aforementioned example, but certainly a much carefully crafted interface can be provided keeping B.MI as the implementation core: operator[], selection of 1-1/1-N/N-1/N-N variants, hashing/ordering, etc. I'm afraid I don't have the time to pursue this, as the current roadmap for core features of B.MI is taking all the spare time I can dedicate to the library. For this reason, I would love to see some volunteer jumping in who can develop this and other singular containers using B.MI (a cache container comes to mind) and then propose the results here either as a stand alone library of as part of B.MI --I'd prefer the former so as to keep the size of B.MI bounded. If there's such a volunteer I can provide her with some help/mentoring. I also wonder whether this is a task suitable to be proposed for Google Summer of Code. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo
JOAQUIN LOPEZ MU?Z wrote:
----- Mensaje original -----
"Thorsten Ottosen"wrote:
Right, but the real value comes when somebody designs a nice STL-like interface and write docs etc, at least that was my point.
If there's such a volunteer I can provide her with some help/mentoring. I also wonder whether this is a task suitable to be proposed for Google Summer of Code.
I think it would be good for SOC. All the really hard things are taken care of by B.MI, and so it seems reasonable for a student to be able to fill in the details. -Thorsten
On Sun, 23 Apr 2006 15:28:08 +0200, Thorsten Ottosen wrote
JOAQUIN LOPEZ MU?Z wrote:
----- Mensaje original -----
"Thorsten Ottosen"wrote:
Right, but the real value comes when somebody designs a nice STL-like interface and write docs etc, at least that was my point.
If there's such a volunteer I can provide her with some help/mentoring. I also wonder whether this is a task suitable to be proposed for Google Summer of Code.
I think it would be good for SOC. All the really hard things are taken care of by B.MI, and so it seems reasonable for a student to be able to fill in the details.
Please write a proposal :-) http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summer... Jeff
Jeff Garland wrote:
On Sun, 23 Apr 2006 15:28:08 +0200, Thorsten Ottosen wrote
I think it would be good for SOC. All the really hard things are taken care of by B.MI, and so it seems reasonable for a student to be able to fill in the details.
Please write a proposal :-)
http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summer...
Well, can I just write ideas here, I do I have to be able to be a mentor? FWIW, of the top of my head - boost::bimap - other datastructures that can be derived from Boost.MultiIndex - boost::vector_set, boost::vector_map (like sorted vector, that is super-efficient map,set for small objects) - boost::auto_buffer, auto_ptr_buffer (like the one in STL-Soft) that uses the stack until a certain size and then go for the heap) - boost::forrest (conversion/enhancement of adope library) - SQL library with full embedded sql-syntax using expression templates could be useful -Thorsten
On Sun, 23 Apr 2006 17:54:50 +0200, Thorsten Ottosen wrote
Jeff Garland wrote:
Please write a proposal :-)
http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summer...
Well, can I just write ideas here, I do I have to be able to be a mentor?
FWIW, of the top of my head
- boost::bimap
- other datastructures that can be derived from Boost.MultiIndex
- boost::vector_set, boost::vector_map (like sorted vector, that is super-efficient map,set for small objects)
- boost::auto_buffer, auto_ptr_buffer (like the one in STL-Soft) that uses the stack until a certain size and then go for the heap)
- boost::forrest (conversion/enhancement of adope library)
- SQL library with full embedded sql-syntax using expression templates
could be useful
I think we'll be more than happy to have the ideas even if you aren't the mentor :-) Jeff
"JOAQUIN LOPEZ MU?Z" <joaquin@tid.es> writes:
I'm afraid I don't have the time to pursue this, as the current roadmap for core features of B.MI is taking all the spare time I can dedicate to the library. For this reason, I would love to see some volunteer jumping in who can develop this and other singular containers using B.MI (a cache container comes to mind) and then propose the results here either as a stand alone library of as part of B.MI --I'd prefer the former so as to keep the size of B.MI bounded.
If there's such a volunteer I can provide her with some help/mentoring. I also wonder whether this is a task suitable to be proposed for Google Summer of Code.
Great! Do you have time to add it to the Wiki page? ;-) -- Dave Abrahams Boost Consulting www.boost-consulting.com
participants (4)
-
David Abrahams -
Jeff Garland -
JOAQUIN LOPEZ MU?Z -
Thorsten Ottosen