February 2007 - Boost-users - lists.preview.boost.org

signals newbie
by V12 20 Feb '07

20 Feb '07

hi ppl, i am new to using boost signals lib and have the following doubts: i have an event manager class which has a member function loadmap(). this class also has a signal s_ChangeMap to connect to the above function . now when i tried to do: s_ChangeMap.connect(&LoadMap); i get the following error: error C2276: '&' : illegal operation on bound member function expression the same error also occurs when i try to connect the signal to a function of a different class what should i do to get rid of this. am i missing on some understanding of the working of the signals system or is it something related to the scope of a connection?? please help me , thanx -- View this message in context: http://www.nabble.com/signals-newbie-tf3257471.html#a9056554 Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Re: [Boost-users] [program options] some docs suggestion
by Ovanes Markarian 20 Feb '07

20 Feb '07

On Tue, February 20, 2007 13:18, Vladimir Prus wrote: > Ovanes Markarian wrote: > >> It would be really helpful to know that varaibles map is a derivative of std::map<...>. > > I recall I was going to document this, but don't see it :-( > I'll add this to my TODO. > > - Volodya > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > The varaible_map class has double colons after its name. http://www.boost.org/doc/html/variables_map.html class variables_map : : public boost::program_options::abstract_variables_map { ... }; May be something was stripped off during documentation generation? With Kind Regards, Ovanes Markarian With Kind Regards, Ovanes Markarian

1 0

[multi_array] suggestion
by Николай Широковский 20 Feb '07

20 Feb '07

Hello. I`ve been using Boost.MultiArray for a while and found that next features for MultiArray concept would be usefull. 1. Index permutations, which result is multiarray again. Most encontered in 2d dimential arrays used as matrices, and feature become matrix transposition. 2. This feature is possibly less agreed with Boost.MultiArray concept, nevertheless. It would be useful to have an iterator over all elements, not subcontainers, possibly with custom ordering differ from that used on construction for memory layout. Than i can easily use an STL algorithms on iterators. Having operation of creating subarray and array views i can manage wich part of multi_array object is exposed to algorithm. I hadly see an using of this iterator with stl::adjacent_difference as it interpret iterator as "really sequence", but in my work i will have some code look better using std::transform with such iterator.

1 0

Fwd: [bimap] Review of the Bimap library begins today Feb 15
by Matias Capeletto 20 Feb '07

20 Feb '07

---------- Forwarded message ---------- From: Matias Capeletto <matias.capeletto(a)gmail.com> Date: Feb 18, 2007 2:39 PM Subject: Re: [Boost-users] [bimap] Review of the Bimap library begins today Feb 15 To: boost(a)lists.boost.org On 2/18/07, Gottlob Frege <gottlobfrege(a)gmail.com> wrote: > On 2/15/07, Ion Gaztañaga <igaztanaga(a)gmail.com> wrote: > > Hello everyone, > > > > The review of the proposed Boost Bimap library written by Matias > > Capeletto starts today (February 15th, 2007) and ends after 10 days > > (February 25, 2007). Hi Gottlob, > So far: > A: namespace: > --------------------- > > from the 'One Minute Tutorial': > > That is more or less all that is needed to start using the > bidirectional map. The following two lines must also be added: > > #include <boost/bimap/bimap.hpp> > using namespace bimap; > > 2 points: > - I prefer not to use 'using'. I know I don't have to, but I don't > like that the docs imply that I do. Ok, the "must" in the docs is maybe to strong. I can reword that. > more importantly: > - is it going to be in 'bimap' or in 'boost'? We have to put everything inside a namespace, I do not want to pollute the boost namespace. > B: 'relation' > ---------------- > > I think I understand the philosophical reasoning for preferring > 'left/right' over 'first/second', and thus the impetuous for creating > 'relation'. However... Two issues to talk about here. 1) The new notation left/right used instead of first/second. 2) A new name for 'relation'. We have to introduce the new notation. In the context of maps, the notation first/second is used in places where the first element has different meaning than the second one. left/right is symmetrical and implies that both sides are at the same level, that there is no special side.This is the key point to grasp. This is explained here: http://cablemodem.fibertel.com.ar/mcape/boost/libs/bimap/boost_bimap/the_tu… > - I think 'relation' is too generic a word to abscond. >From the dictionary: "A logical or natural association between two or more things" I like 'relation'. But we can talk about other names. > - how about: > - couple > - duo The thing is that these words are very similar to "pair" and the idea is to mark the difference. > - or probably just 'bipair' That was my original choice. 'relation' sounds better to me but let see what other people think about this. > - or maybe even consider that std::pair, although not perfect, might > make things easier: Using left/right instead of first/second is an important design decision. Here is where things start mixing up. > - it can be used in other algorithms The new notation is used in very different contexts. The algorithms written for first/second has no sense in the contexts where left/right are used. If you want to use algorithms that works with map/pair notation you have to pass one of the side views to it. > - it is already well known That is true and in the context of maps it have a very established meaning different from what we want to express with left/right. This is a point for the new notation. > - the nature of typing code forces order - ie note that bimap<X, Y> > is different than bimap<Y, X> (although philosophically the same). (Side Note: Using tags they are exactly the same.) > Even with 'left/right' you still have order - left corresponds to the > *first* type listed in the bimap, 'right' corresponds to the *second* > type passed in. Or is it bimap<Right, Left>? I don't think so. You still have order. The important thing to understand is that we are not looking to eliminate that order. We want to express that the two things are equally important. > But other than that, so far so good. Looks like something I'd use. > And the docs are snazzy. Thanks! Matias

5 6

[program options] some docs suggestion
by Ovanes Markarian 20 Feb '07

20 Feb '07

It would be really helpful to know that varaibles map is a derivative of std::map<...>. I was wondering where the variables_map::count(...) come from in getting started example... if (vm.count("help")) { cout << desc << "\n"; return 1; } Only after looking into the source of variables_map helped :( With Kind Regards, Ovanes Markarian

2 1

[program_options] unknown options in config files
by Sebastian Weber 20 Feb '07

20 Feb '07

Hello! I'm using program_options to parse command line options and configuration files. I absolutley need the unknown option feature. For the command line options this works fine. However, the configuration file parsing always throws an option unknown exception when I parse cfg-files with non-registered options. Right right I circumvent this by catching the corresponding exception. But this is not very nice and I can as well not be sure that all options have been parsed in the cfg-file, depending upon the first occurence of an unknown option, right? So, is there a possibility to process unknown options in cfg-files? Thanks a lot in advance. Greetings, Sebastian

1 0

Boost in embedded systems
by Peter Poulsen 20 Feb '07

20 Feb '07

I know this sounds insane, but our developers are very happy with boost (who can blame them :-)), and want to have boost available on our embedded systems. We only have 64 mb of flash memory available for the entire system (OS, hardware monitoring and applications) and I simply cannot get boost down to a reasonable size. Am I trying to do an impossible task, or can somebody give me some good advice on how to build boost so it has a more reasonable size? Of course what should be done is removing some of the features, and I can probably negotiate with developers about what features we can provide and which have to go. Which one should I try to get rid of first? /peter -- A: Because it messes up the order in which people normally read text. Q: Why is it such a bad thing? A: Top-posting. Q: What is the most annoying thing on usenet and in e-mail?

5 4

Updated date_time_zonespec.csv for 2007?
by Brendon Oliver 20 Feb '07

20 Feb '07

Does anybody have a date_time_zonespec.csv file updated for the US DST changes this year? I've googled the mailing lists & looked at sourceforge (I see there was a bug raised 5 Feb, but no responses since). I also downloaded a 1.34 alpha tarball but there's no date_time_zonespec.csv file in there :-( . I've looked at updating the file myself (the syntax is pretty straight-forward), I'm just worried about missing particular zones. Cheers, - Brendon. -- Conversation, n.: A vocal competition in which the one who is catching his breath is called the listener. 10:19:19 up 61 days, 19:45, 2 users, load average: 0.34, 0.26, 0.25

2 3

[signals] thread_safe_signals feature-complete
by Frank Mori Hess 20 Feb '07

20 Feb '07

Hi all, I've finished thread_safe_signals. To get thread safety you have to include an additional header file thread_safe_signals/multi_threaded.hpp and set the last template parameter to boost::signals::multi_threaded. I've done a little benchmarking. With thread-safety off and connecting 10 slots, it appears to have about the same overhead as cvs boost.signals (which is much less than the latest release of boost.signals). When 1 slot is connected, it has more overhead, a little less than a factor of 2 when running a single empty slot. Turning thread-safety on increases overhead by about 50% for the 1 slot case and 100% for the 10 slot case. It is able to invoke slots concurrently though, which should be a win if the slot is non-trivial. -- Frank

4 38

any boost library for referring a portion of the container ?
by abir basak 19 Feb '07

19 Feb '07

Hi, I am having a few containers whose some portion I want to refer to another class (sometime I need to refer to a continuous portion, while sometime need a non-continuous portion) . At present I have written all of these myself. But wondering if a few portion can be substituted by some boost library. Just to make the concept clear, I am elaborating the structure and why it is done in that way. In the program it takes the user handwriting (as entered using digital pen etc) and analysis them. as user writes, I register points (x,y coord) and put them in an deque (in actual case I am using boost::circular_buffer_space_optimized ). Now, a second deque (or other container) stores another structure Trace, which has 2 index pointing start & end of that continuous writing until pen up occurs. These have to be 2 index rather than iterator, as iterator may get (and usually gets ) invalidated while more points are added in the point deque. Thus Trace refers deque<Point> Now from the trace structure I return the points for the trace (boost::sub_range ) using the 2 index and the deque (i.e from deque<Point> get iterator, add index as offset , make sub_range and return). Now these are the continues portions , referred by 2 index. Next, some such things can be even not continuous. In that case I store all index to which it points (in a vector ) and return a sub_range kind of structure (named index_range ) which takes these index and a container, and iterates over it jumping by those specific offsets. Example can be a Character class which refers some of those traces , not necessarily continuous (like user writes a dot much later than the i , thus Character i contains index of the vertical stroke of the i & dot ) Similarly more hierarchy are constructed, like Trace => Page, and Character => Word => Line => Paragraph => Page etc. Most of them contains 2 index and with the help of the container returns a boost sub_range , while some contains a vector of index (size_t) and returns index_range (created by me) . So far I found it is the ONLY way to create a level of hierarchy/ view from different set of dynamic data. (The other can be storing everything as a pointer in the container, and creating by new, in that case no problem arises as the objects are not movable, but in C++ it is quite bad solution) A Graphical representation is like, =============== deque<Point> ===================== <=remove old data => add new data | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | =============== deque<Trace> ==================== | 1 | 2 | =============== deque<Page> ===================== These are for continuous data (i.e 2 index struct & boost::sub_range ) ================ deque<Trace> ==================== |1,3,4| 2 | 5,6 | 7,9 | 8 | ... ================== deque<Character> =============== | 1,2,4, 5 | 3 | .... ================== deque<Word> ===================== | 1 | 2 | 3 | .... (assuming past a line user doesn't correct word, they can be made a pair of index ! ) ================== deque<Line> ===================== .... ================== deque<Paragraph> ================ etc... My question , 1) had anyone faced these kind of design , where a class referrers a portion of STL container ? and multiple view from same set of data exists (otherwise I could had Trace contains the points , instead of having index of the portion, if Trace is the only view for the points ) 2) Any boost library / other library is there to help these kind of design ? I had posted a same kind of topic in C++ newsgroup also, but it seems their people are more concerned with answering C++ standard based question . I think, boost may be the better news group to ask this question, as boosters work in a broader area. Thanks to all, esp to those who share their thought on it ... abir -- Abir Basak, Member IEEE B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

2 5

[boost::lexical_cast] problems casting hex numbers
by Ovanes Markarian 19 Feb '07

19 Feb '07

Thanks a lot for lexical_cast it is a very useful function. Currenlty I face a problem with it and I think it would be useful addon ;) Unfortunately it can not be used (or I was unable to figure out how) to cast hex or octal numbers from strings to numeric. If it is not possible, are there some concerns which disallow this? the expression: lexical_cast<size_t>("0x015e") throws a bad_lexical_cast With Kind Regards, Ovanes

1 0

BoostCon 2007 update
by David Abrahams 19 Feb '07

19 Feb '07

A couple of quick items: 1. The conference format has changed. For many practical reasons, the "two 3-day tracks with one day of overlap on Wednesday" format proved unworkable. Among those: * Many (most) sessions don't fall neatly into the library-user/library-developer track distinction. We see this as a good thing, as it means we have more material that's of broad interest. * It made the hotel reservation pattern very difficult; we were afraid many people would be shut out of rooms at the conference hotel and also that the hotel would not be able sell the entire reserved room block, which could cost the (non-profit) conference a lot of money, as we had to agree to be liable for unsold room nights. Instead, we're running two tracks concurrently all week. We thought attendees should be prepared for that change. 2. We expect the new boostcon website will go live and registration for the conference will open in the next couple of days. We're just clearing away a few final details. In the meantime, the existing http://www.boostcon.com has the old information. Regards, and see you at BoostCon, -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Boost::Date_Time -New IO Tutorial
by Steve Johns 19 Feb '07

19 Feb '07

Jeff, Thanks for your answers to my earlier posts. This is a great library, and I'm enjoying learning it. :^) I notice here: http://www.crystalclearsoftware.com/libraries/date_time/release_1_33/date_t… that a tutorial on the new IO is supposed to be found here: libs/date_time/examples/tutorial This dir is not part of my Boost distro. Is there a URL I can use to access this?

2 1

Problem in building boost 1_33_1 on solaris 5.9
by Shobha_Hubballi＠i2.com 19 Feb '07

19 Feb '07

Hi, I am trying to build boost1_33_1 on solaris 2.9 with CC 5.5 compiler. Libraries like filesystem, serialization, program_options are not built. But other libraries like thread are built perfectly. The libraries which I am not able build I am getting following same error for all libraries /data/tdm/boost_1_33_1/boost/iterator/iterator_facade.hpp", line 838: Error: Could not find a match for boost::iterator_core_access::equal<boost::iterator_core_access::Facade1, boost::iterator_core_access::Facade2>(const boost::filesystem::path::iterator, const boost::filesystem::path::iterator, boost::is_convertible<boost::filesystem::path::iterator, boost::filesystem::path::iterator>). "/opt3/SUNWspro/prod/include/CC/Cstd/./algorithm.cc", line 2370: Where: While instantiating "boost::operator!=<boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int, boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>(const boost::iterator_facade<boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>&, const boost::iterator_facade<boost::filesystem::path::iterator, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::bidirectional_traversal_tag, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, int>&)". Please tell me how to solve this problem Thanks

2 3

[Program option] Parsing string to vector<string>
by Seweryn Habdank-Wojewódzki 19 Feb '07

19 Feb '07

Dear all I have question. to the type of object stored in variables_map. In the example multiple_sources.cpp There is line: config.add_options() //... ("include-path,I", po::value< vector<string> >()->composing(), "include path") ; But independently of the case all time result vector has size = 1, so in fact above is equivalent: config.add_options() //... ("include-path,I", po::value< string >()->composing(), "include path") ; And still there is some parsing job to do. How can it be improved? I have tested this example using config file like below: # # Comment out this line to use hard-coded default value of 10 # optimization = 1 include-path = /opt /usr /home/ Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'

1 1

vc8 / 2005 linker problems in program_options
by Andrew Schweitzer 19 Feb '07

19 Feb '07

I'm having problems building programs with program_options and vc8/2005. I'm getting linker errors... any suggestions? I suspect I'm doing something obvious wrong. Linking against 1.33.1, I have $(BOOST_ROOT)\bin\boost\libs in "Additional Library directories". I get "already defined" and "unresolved" errors when I try to use program_options code that builds in vc71. For example: //no problem here... #include <boost/program_options.hpp> using namespace std; using namespace boost; using namespace boost::program_options; void func() { //but with this I get linker errors variables_map l_vm; } //...such as: 1>libboost_program_options-vc80-mt-gd-1_33_1.lib(variables_map.obj) : error LNK2005: "class std::basic_ostream<char,struct std::char_traits<char> > & __cdecl std::operator<<<char,struct std::char_traits<char>,class std::allocator<char> >(class std::basic_ostream<char,struct std::char_traits<char> > &,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (??$?6DU?$char_traits@D@std@@V?$allocator@D@1@@std@@YAAAV?$basic_ostream@DU?$char_traits@D@std@@@0@AAV10@ABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@0@@Z) already defined in msvcprtd.lib(MSVCP80D.dll) //and: 1>libboost_program_options-vc80-mt-gd-1_33_1.lib(options_description.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: class std::reverse_iterator<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::rbegin(void)const " (__imp_?rbegin@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QBE?AV?$reverse_iterator@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@2@XZ) referenced in function "public: bool __thiscall boost::program_options::option_description::match(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &,bool)const " (?match@option_description@program_options@boost@@QBE_NABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@_N@Z) Any suggestions?

1 0

bjam crashes
by Andrew Schweitzer 18 Feb '07

18 Feb '07

Hi there. When I run bjam 3.1.12 or 3.1.13, bjam crashes. Any ideas, suggestions? I wouldn't be surprised if I'm doing something obvious wrong. I'm trying to build on XP Pro, VC7, VC8. 1.33.1 Bjam 3.1.10 vc7 or vc8 Works! 1.33.1 Bjam 3.1.12 vc7 or vc8 kaboom 1.33.1 Bjam 3.1.13 vc7 or vc8 kaboom cvs Bjam 3.1.10 vc7 or vc8 says bjam >= v12 needed. cvs Bjam 3.1.12 vc7 or vc8 kaboom cvs Bjam 3.1.13 vc7 or vc8 kaboom Thanks Andy

2 2

interprocess on fedora core 4
by Jan 18 Feb '07

18 Feb '07

When bjam is run on the examples folder on fedora core 4 it generates linker errors. Such as: ../../../bin/boost/libs/interprocess/example/process_a_example/gcc/release/runtime-link-static/process_a_example.o(.text+0x340): In function `main': process_a_example.cpp: undefined reference to `sem_post' NB: Does this help? [root@localhost example]# gcc -v Using built-in specs. Target: i386-redhat-linux Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-libgcj-multifile --enable-languages=c,c++,objc,java,f95,ada --enable-java-awt=gtk --with-java-home=/usr/lib/jvm/java-1.4.2-gcj-1.4.2.0/jre --host=i386-redhat-linux Thread model: posix gcc version 4.0.2 20051125 (Red Hat 4.0.2-8) Thanks

2 1

Boost compilation error
by Gunjan 18 Feb '07

18 Feb '07

I am not able to compile Boost libraries through command line (gcc compiler on Windows). It is giving the error: fatal error C1083: Cannot open include file: 'boost/config.hpp': No such file or directory I searched on the net and found this is a common problem and should get solved by adding the path for Boost libraries to the include environment variable. But it is not happening. My observation is that its not identifying the path correctly. If I change the path manually (changing it to ‘”config.hpp” instead of <boost/config.hpp>), it proceeds with compilation. But that is not desired and practical. Can someone help me solving this problem? Thanks in advance.

1 0

[Program options] Some questions about composing.
by Seweryn Habdank-Wojewódzki 18 Feb '07

18 Feb '07

Hi all Is that possible to use "unsigned int" type in: config.add_options() ("source-columns,c", po::value< vector<unsigned int> >()->composing(), "List of columns. Can be: 1 2 34 5 2."); If I change "unsigned int" to "std::string" it works good. I mean I can use: -c 1 2 34 5 2 and it works. Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'

1 0

[property map] copying dynamic_properties
by gavinband＠tiscali.co.uk 18 Feb '07

18 Feb '07

Dear all, I have boost 1.33.0. It looks to me like boost::dynamic_properties (in dynamic_property_map.hpp) does not have a supplied copy-constructor, and so it has a default copy-constructor. However, since dynamic_properties allocates dynamic_property_map objects on the heap, and holds them by pointer, this is not sufficient. This is causing a segfault in the code pasted below. Either dynamic_properties should be given a copy constructor and assignment operator (which seems useful to me) or it should be noncopyable. Or perhaps it could use shared_ptrs instead of regular pointers to avoid this problem? Thanks, Gavin. #include <boost/dynamic_property_map.hpp> int main() { std::map<long,long> my_map; boost::associative_property_map<std::map<long,long> > apm(my_map); boost::dynamic_properties dp; dp.property("property",apm); boost::dynamic_properties dp2(dp); // crash occurs when dp is destructed. return 0; } ___________________________________________________________ Tiscali Broadband only 9.99 a month for your first 3 months! http://www.tiscali.co.uk/products/broadband/

1 0

[iterator] make_zip_iterator
by Erik Åldstedt Sund 18 Feb '07

18 Feb '07

Hi, just a short question: Why does not the zip_iterator header have the following (or something along the lines of the following) creator function: template <typename Iter1Type, typename Iter2Type> boost::zip_iterator<boost::tuple<Iter1Type, Iter2Type> > make_zip_iterator(Iter1Type i, Iter2Type j) { return boost::make_zip_iterator(boost::make_tuple(i, j)); } That would make creating a zip_iterator much simpler. Instead of writing the following: std::set<double> s; std::vector<int> v; // populate s and v.... std::for_each(boost::make_zip_iterator(boost::make_tuple(s.begin(), v.begin())), boost::make_zip_iterator(boost::make_tuple(s.end(), v.end())), my_functor_that_does_something_useful()); you could write the following: std::set<double> aSet; std::vector<int> aVector; // populate aSet and aVector.... std::for_each(boost::make_zip_iterator(aSet.begin(), aVector.begin()), boost::make_zip_iterator(aSet.end(), aVector.end())), my_functor_that_does_something_useful()); Regards, Erik Åldstedt Sund

5 5

[bimap] Review of the Bimap library begins today Feb 15
by Ion Gaztañaga 18 Feb '07

18 Feb '07

Hello everyone, The review of the proposed Boost Bimap library written by Matias Capeletto starts today (February 15th, 2007) and ends after 10 days (February 25, 2007). Documentation for the library can be found online here: http://tinyurl.com/e2os3 The library can be downloaded from Boost.Vault/Containers: URL: http://www.boost-consulting.com/vault/index.php?directory=Containers Tiny URL: http://tinyurl.com/ysfclr Online documentation and the documentation package can be found here: http://tinyurl.com/y95qng --------------------------------------------------- Context: The library has been developed by Matias Capeletto with the mentoring of Joaquín M López Muñoz in the context of the Google SoC 2006. You can find more information about SoC projects here: http://code.google.com/soc/boost/about.html You can read an overview of Boost participation in Google Summer of Code 2006 written by Joaquín M López Muñoz here: http://boost.org/more/boost_soc_06_overview.html --------------------------------------------------- About the library: With Boost.Bimap you can create associative containers in which both types can be used as key. A bimap<X,Y> can be thought of as a combination of a std::map<X,Y> and a std::map<Y,X>. The learning curve of bimap is almost flat if you know how to use standard containers. A great deal of effort has been put into mapping the naming scheme of the STL in Boost.Bimap. The library is designed to match the common STL containers. Boost.Bimap offers also advanced features: -> Boost.Bimap offers much more than just a one-to-one ordered unique bidirectional map. It is possible to control the set type of each side of the relationship that the bimap represents, giving one-to-many containers, hashed bidirectional containers and others that may be more suitable to the the task at hand. -> The types of a bimap can be tagged so that each side is accessible by something closer to the problem than left and right. This leads to more readable, self-documenting code. -> The extended mapping framework allows to disable a view of a bimap, including the standard mapping containers as a particular case. Bimap has been tested in the following platforms: GCC 3.4/Linux GCC 4.0/Linux, Mac VS 7.1/Windows VS 8.0/Windows ICC 7.1/Windows ICC 8.0/Windows --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Ion Gaztañaga Review Manager

2 1

Building Universal Boost Libraries on MacOS
by Finley Lee 18 Feb '07

18 Feb '07

Greetings, list! I'm trying to compile the boost libraries on an Intel based Macintosh. On my Intel Mac, I was able to build an Intel based version of bjam, which happily builds libraries for the Intel architecture. I want to link them to a universal app, though. Is there a way to instruct bjam to build universal versions of the libraries instead? I guess I could build the PowerPC libraries on my PowerPC Mac and them lipo them together, but I am hoping there is an easier way! Best regards, Finley

3 2

Re: [Boost-users] [typeof] Typo in Acknowledgements page
by Cromwell Enage 18 Feb '07

18 Feb '07

> In the header, "Acknowledgements" is spelled > as "Acknoledgements" Self-correction: according to most dictionaries, it should actually be "Acknowledgments". Cromwell D. Enage ____________________________________________________________________________________ Food fight? Enjoy some healthy debate in the Yahoo! Answers Food & Drink Q&A. http://answers.yahoo.com/dir/?link=list&sid=396545367

1 0