- Boost-users - lists.boost.org

[signals] building sandbox documentation?
by Frank Mori Hess 20 Feb '07

20 Feb '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Timmo, Do you know a bjam command to build the signals documentation in boost-sandbox/libs/signals/doc ? I'd like to update them to reflect the changes we've made for thread safety. Do I have to copy the files over to a real boost source tree to get them to build? I am not very familiar with bjam. - -- Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.1 (GNU/Linux) iD8DBQFF2xd85vihyNWuA4URAkBBAJ43BFzalbQSbzMaKNWuaEPR3tEpUQCdE67i 7ozVU/0NcLWKVW8gNv4KR5E= =WB61 -----END PGP SIGNATURE-----

2 2

Re: [Boost-users] Cannot build boost on MSVS8 per instructions
by DAVID CRAVEY 20 Feb '07

20 Feb '07

Hi All, I am having the same errors as in this post: http://lists.boost.org/boost-users/2006/09/22001.php I have tried downloading the boost-jam both binary: boost-jam-3.1.13-1-ntx86.zip (I get the same error as the above post) And from source: boost-jam-3.1.13.zip I get a "Debug Assertion Failed!" error when I run build.bat Program: C:\Boost\boost-jam-3.1.13\bootstrap\jam0.exe File: dtoxtm64.c Line: 67 Expression: ( ( ( long )( yr - 1990) >= BASE_YEAR) && ( ( long )( yr - 1990 ) <= _MAX_YEAR64 ) ) Running the prebuilt bjam.exe file in the Threads build directory (running from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1\libs\thread\build>bjam "-sTOOLS=vc-8_0" Built three library files. So I think the bjam.exe file probably is not corrupt. If I run (from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1>bjam "-sTOOLS=vc-8_0 --with-threads" I get the same 00012f2a error as before. Other Notes: I have Visual C++ 2003 Standard and Visual Studio 2005 Pro Installed. Starting with the appropriate command prompt, I get the same error on both at Offset 0001f2fa. My machine is an Dell Latitude Centrinio Running Windows XP Pro SP2. Any help would be greatly appreciated! Thanks, David Cravey

3 2

Boost serilaization onexit problem
by gast128 20 Feb '07

20 Feb '07

Dear all, We use (too many) singletons in our program and now the program crashes in Boost Serialization because in an onexit function a static member (oserializer::instantiate) of Boost Serialization is already destroyed. Is there a way to force an intialisation of these static members so that they are destroyed after my singleton destroys? The code can be reproduced by the follwing snippet: // #define BOOST_ALL_DYN_LINK #define BOOST_LIB_DIAGNOSTIC #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/version.hpp> struct Foo { Foo() : m_i(0) {} template <class Archive> void serialize(Archive& ar, const unsigned int /*version*/) { ar & BOOST_SERIALIZATION_NVP(m_i); } int m_i; }; void f (); void test_serialize (); //---------------------------------------------------------------------------- // Function main //---------------------------------------------------------------------------- // Description : main //---------------------------------------------------------------------------- int main() { atexit(&f); test_serialize(); return 0; } void f() { test_serialize(); } void test_serialize() { std::ofstream ofs("test.xml"); boost::archive::xml_oarchive oa(ofs); const Foo foo; oa << BOOST_SERIALIZATION_NVP(foo); } wkr, me

2 2

[Review][Bimap] Reviewers needed for Bimap review
by Ion Gaztañaga 20 Feb '07

20 Feb '07

Hi to all, Bimap review started 5 days ago and we're having some good comments but no thorough reviews. I would like to encourage people to write a Bimap review, because we still have five more days and I would propose extending that if that's necessary. Container and STL experts, we need you! I think that Bimap is a great library and I'm pretty sure you'll be happy to review it once you start reading the docs. Start reading the documentation here: http://tinyurl.com/y95qng And download the library here: http://boost-consulting.com/vault/index.php?&directory=Containers Regards, Ion

1 0

Using Boost string library
by Meryl Silverburgh 20 Feb '07

20 Feb '07

Hi, I need to compare 2 strings in this format (a integer separator by '/': /1/1 /1/1/2 /1/1/3 so "/1/1" is less than "/1/1/2" and "/1/1/2" is less than " "/1/1/3". Is there anything in Boost string library to help me to write such a comparison? Is there a string iterator which literates base on the separator '/'? My idea is to find an iterator to loop thru the string based on separator '/'. Thanks for any idea.

3 14

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