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

Access violation on win64
by Nicholas Bastin 30 Sep '07

30 Sep '07

I know I'm probably not going to include enough information in this email, so please let me know whatever else you need to know. My Template-Fu is not strong. :-) I'm having a problem on win64 with boost.signals where I'm getting an access violation after the first slot in a signal is called (it happens even if there is only one slot, but also if there are multiple slots), deep in the bowels of an iterator over std::list. My code works fine on win32, linux32/64, and solaris32. So, first off, is anyone using signals on win64, and thus I should reasonably be expecting them to work? I'm using ICL 9.1p037 with .NET 2003. The stack trace (lots of info elided from each row, but I can probably supply it upon request if someone can tell me how to get at it - the MSVC debugger works in mysterious ways) looks something like this (builds down): Context::setup_run (my method) function_traits_helper<boost::add_pointer... last_value<void>::operator()() boost::operator++() iterator_core_access::increment() named_slot_map_iterator::increment() named_slot_map_iterator::init_next_group() detail::connection_slot_pair, std::allocator<boost::signals::detail::connection_slot_pair> >::begin() (yes, several of them appear to be cut off at the front of the symbol, I have no idea why). The last begin() is in <list>. Any ideas on how I can debug this? I'm not expecting someone to magically say "yes, I've seen this, and do this to fix it", but that'd be nice too.. :-) -- Nick

1 0

serializing binary data
by Ravi Chemudugunta 30 Sep '07

30 Sep '07

hi, I hope I am not asking something that has already been covered. does any one know if it is possible to serialize binary data ? for example taking an unsigned char * pointer with a length field ? I know it is possible to storing arrays but there does not seem to be an argument for size when using the & operator on archives. if not then would it be possible to load my array up into a vector and then store that vector into an archive object ? cheers, ravi

2 1

Boost.Test (1.34.0) - expected failures with BOOST_AUTO_TEST_SUITE()
by Lars J. Aas 30 Sep '07

30 Sep '07

Hello, I am trying to use BOOST_AUTO_TEST_SUITE() + BOOST_AUTO_TEST_CASE() and mark a test case for having expected failures. I am not able to use the BOOST_AUTO_TEST_CASE_EXPECTED_FAILURES() macro inbetween the BOOST_AUTO_TEST_SUITE() and BOOST_AUTO_TEST_SUITE_END() macros, and I haven't found a way to be able to tag a test-suite-bound auto-test-case from outside that scope. Does anybody know if this is possible at all? Could it be possible, programmatically, from within the test-case? Lars J

2 5

Win CE Win32 Regex Project question
by Ken Perry 30 Sep '07

30 Sep '07

As the subject indicates I am creating a Win32 Windows CE project and need the Regex library. I have used boost for a long time on both Windows and Linux so I was surprised when I tried to find a way to build it with Visual studio 2005 for the platform Win CE I could not find the options or they did not exist. Has anyone compiled for the Regex library for Win ce and if so what options did you use or is there binaries out their that I can just download. Ken

1 0

libkdtree moved to git.debian.org
by martin f krafft 29 Sep '07

29 Sep '07

Hello, You previously contacted me regarding my C++ kdtree library. I am writing to you just to let you know that after 2 years of rotting, the project is now resurrected and moved to git.debian.org. Please see http://libkdtree.alioth.debian.org for more info. If you are still working with libkdtree, then please sign up to the mailing list: http://lists.alioth.debian.org/mailman/listinfo/libkdtree-devel Also, if at any point you sent me patches and they are *not* in the current code, please let me know (and possibly remake the patch). Thanks, and sorry for the mass email. -- martin; (greetings from the heart of the sun.) \____ echo mailto: !#^."<*>"|tr "<*> mailto:" net@madduck "if i am occasionally a little overdressed, i make up for it by being always immensely over-educated." -- oscar wilde spamtraps: madduck.bogus(a)madduck.net

1 0

[Boost.Bind] and [Boost.Lambda] problem with partial application and curry
by Kirit Sælensminde 29 Sep '07

29 Sep '07

I've been working on implementing some functional idioms in C++ in order to help me learn the Boost.Bind, Boost.Lambda and Boost.Function libraries. I have this (which uses Boost.Bind) #include <boost/function.hpp> #include <boost/bind.hpp> #include <boost/bind/placeholders.hpp> #include <cmath> #include <iostream> template< typename R, typename V1, typename V2 > boost::function< R ( V2 ) > papply( boost::function< R ( V1, V2 ) > f, V1 v ) { return boost::bind( f, v, _1 ); } template< typename R, typename V1, typename V2 > boost::function< boost::function< R ( V1 ) > ( V2 ) > curry( boost::function< R ( V1, V2 ) > f ) { return boost::bind( papply< R, V1, V2 >, f, _1 ); } int add( int a, int b ) { return a + b; } int main() { boost::function< int ( int, int ) > fadd( add ); boost::function< boost::function< int ( int ) > ( boost::function< int ( int, int ) >, int ) > fpapply( papply< int, int, int > ); boost::function< int ( int ) > inc1( papply( fadd, 1 ) ); std::cout << inc1( 6 ) << " " << inc1( 10 ) << std::endl; boost::function< int ( int ) > inc2( fpapply( fadd, 1 ) ); std::cout << inc2( 6 ) << " " << inc2( 10 ) << std::endl; boost::function< boost::function< int ( int ) > ( int ) > curried_add( curry( fadd ) ); boost::function< int ( int ) > inc3( curried_add( 1 ) ); std::cout << inc3( 6 ) << " " << inc3( 10 ) << std::endl; //curry( fpapply ); } Compiling this on MSVC 8.1 SP1 from Boost 1.34.0 RC. I get a nearly 130-line error message, the last part of which is this: 1>e:\dev\boost\install\basic\include\boost-1_34\boost\bind.hpp(278) : error C2664: 'boost::function<Signature> (boost::function<boost::function<int (int)> (boost::function<int (int,int)>,int)>,V1)' : cannot convert parameter 1 from 'int' to 'boost::function<Signature>' 1> with 1> [ 1> Signature=boost::function<int (int)> (int), 1> V1=boost::function<int (int,int)> 1> ] 1> and 1> [ 1> Signature=boost::function<int (int)> (boost::function<int (int,int)>,int) 1> ] 1> No constructor could take the source type, or constructor overload resolution was ambiguous On my web site is the same program (at least the same papply and curry functions), but using Boost.Lambda (there's also a bit of an explanation about what they do). http://www.kirit.com/Blog:/2007-09-10/What%20do%20you%20get%20when%20you%20… The Boost.Lambda error is even longer at nearly 200 lines. As both libraries give errors I'm inclined to think that I've done something stupid, but both papply() and curry() appear to work. Have I hit a limit on what these two libraries can do, or was there a fix for this between the 1.34.0 RC and 1.34.1 versions? K

3 5

boost::variant - limit on the number of types
by Aaron Rocha 29 Sep '07

29 Sep '07

Hi there, I am using MSVC 8.0 and Boost 1.34.0 . I am trying to create a variant that can hold an object of one of 50 different classes but it has not worked. I keep getting a compile error indicating that the template contains too many arguments. I have played with preprocessor variables like BOOST_MPL_LIMIT_LIST_SIZE, BOOST_VARIANT_LIMIT_TYPES, and BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS w/o success. I have also attempted to use boost::make_variant_over< > but it doesn't work past the type #20. Has anyone been able to do something similar? Thanks Be smarter than spam. See how smart SpamGuard is at giving junk email the boot with the All-new Yahoo! Mail at http://mrd.mail.yahoo.com/try_beta?.intl=ca

1 0

[bind] MSVC 8.0 compiles _1 but not _2
by Mark Ruzon 29 Sep '07

29 Sep '07

Suppose you want to compute 3 - x for a vector of floats: using namespace std; vector<float> v; transform(v.begin(), v.end(), v.begin(), boost::bind(minus<float>(), _1, 3.0f)); This compiles fine on the MSVC 8.0 compiler. But I want to compute x - 3, and replacing _1 with _2 in the above expression yields a mess of errors, starting with: c:\program files\boost\boost_1_34_1\boost\bind.hpp(278) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'overloaded-function' (or there is no acceptable conversion) c:\program files\boost\boost_1_34_1\boost\bind.hpp(205): could be 'float boost::_bi::list1<A1>::operator [](boost::arg<I>) const' with [ A1=float &, I=1 ] Anybody have any thoughts on this one? Thanks, Mark

2 1

Boost test manual can not be accessed
by Peng Yu 28 Sep '07

28 Sep '07

Hi, The following webpage can not be accessed. Can somebody fix it. http://www.boost.org/libs/test/doc/components/utf/getting_started/index.html Thanks Peng

3 4

dynamic_pointer_cast doesn't work as expected
by Diego Bernini 28 Sep '07

28 Sep '07

Hi, see these lines: boost::shared_ptr<Executor> executor(&(createExecutor(subclass,name))); if(!executor) { throw LoadingClassException("createExecutor function of\""+subclass+"\" return null."); } //executor points to an object of class ExecDebugger that IS A Executor //(it's a plugin loaded at run time via Qt) boost::shared_ptr<Nameable> a=executor; boost::shared_ptr<Executor> sp; sp=boost::dynamic_pointer_cast<Executor>(a); --------------------------------------------------------------------------------------------------------------------- a is a Nameable, it points to a ExecDebugger object. ExecDebugger IS A Executor, Executor IS A Nameable...but sp is always ==0! Why?! Thanks, Diego Bernini

4 4

Re: [Boost-users] fast_pool_allocator won't compile with VS 2005 SP1 using map
by Scott 28 Sep '07

28 Sep '07

I'm sorry, but I failed to mention I'm using boost 1.33.1 Scott

1 0

fast_pool_allocator won't compile with VS 2005 SP1 using map
by Scott 28 Sep '07

28 Sep '07

I have a std::map that I'd like to use the fast_pool_allocator with. But when I declare it, I get errors with rebind. typedef std::pair<IndexVariant, Hints> IndexMapType; typedef boost::fast_pool_allocator<IndexMapType> IndexPoolAllocator; typedef std::map<IndexVariant, Hints, std::less< IndexVariant >, IndexPoolAllocator> ValueHints; 1>C:\Program Files\Microsoft Visual Studio 8\VC\include\map(28) : error C2903: 'rebind' : symbol is neither a class template nor a function template 1> C:\Program Files\Microsoft Visual Studio 8\VC\include\xtree(26) : see reference to class template instantiation 'std::_Tmap_traits<_Kty,_Ty,_Pr,_Alloc,_Mfl>' being compiled 1> with 1> [ 1> _Kty=nw::IndexVariant, 1> _Ty=nw::Hints, 1> _Pr=std::less<nw::IndexVariant>, 1> _Alloc=nw::IndexPoolAllocator, 1> _Mfl=false 1> ] However, if I substitute: typedef std::allocator<IndexMapType> IndexPoolAllocator; it all compiles fine. I'd appreciate any help with my problem! :) Thanks, Scott

1 0

boost::result_of and gcc
by Martin Ecker 28 Sep '07

28 Sep '07

Hello, I'm running into a problem when using boost::result_of with gcc 3.4.2 and 4.2.1 (with MingW). The following program compiles fine with Visual C++ 8.0, but not with gcc: ------------------------------- #include <boost/utility/result_of.hpp> struct test_function1 { template <typename SignatureT> struct result; template <typename T> struct result<test_function1 (T)> { typedef T type; }; template <typename T> T operator () (T t) const { return t; } }; template <typename ArgT> struct test_function2 { template <typename SignatureT> struct result; template <typename T> struct result<test_function2 (T)> { typedef T type; }; template <typename T> T operator () (T t) const { return t; } }; int main(int argc, char *argv[]) { typedef boost::result_of< test_function1(int)>::type result_type; typedef boost::result_of< test_function2<float>(int)>::type result_type; return 0; } ------------------------------- The error message I get is for the second typedef using test_function2: E:/Projects/Third Party/boost/boost/utility/result_of.hpp: In instantiation of `boost::detail::result_of_nested_result<test_function2<float>, test_function2<float> ()(int)>': E:/Projects/Third Party/boost/boost/utility/result_of.hpp:75: instantiated from `boost::detail::result_of_impl<test_function2<float>, test_function2<float> ()(int), false>' E:/Projects/Third Party/boost/boost/utility/detail/result_of_iterate.hpp:24: instantiated from `boost::result_of<test_function2<float> ()(int)>' main.cpp:43: instantiated from here E:/Projects/Third Party/boost/boost/utility/result_of.hpp:68: error: invalid use of undefined type `struct test_function2<float>::result<test_function2<float> ()(int)>' I get the same error if I simply wrap test_function1 in another template class as nested struct and then use it instead of test_function2. Am I attempting to do something fundamentally wrong here, or is it a bug in gcc? Thanks, Martin

2 1

1.33.1 read_graphviz possible parser issue
by Brian Stadler 28 Sep '07

28 Sep '07

Hi all, I'm reading in thousands of files in the graphviz language into a program using read_graphviz(), library version 1.33.1. I noticed a problem with some of my results and discovered that read_graphviz doesn't appear to be interpreting the files correctly. The structure of the graphs is preserved (no edges gone astray). However, the labeling of the nodes is changed. I confirmed this by reading in a file and immediately writing it back out using write_graphviz(). Below is the code used to read in the files. It's very simple as I have nothing special being reprsented. Could someone else check this and confirm this is a problem. I've checked the bugs list and 1.34.x release notes and found nothing addressing the particular issue. thanks all. My read_graphviz code: bool file; ifstream in(openfile.c_str(), ios::in); dynamic_properties dp; dp.property("node_id", get(&ed_node::vertex_name, ug)); <--simple adjacency list with bundled properties being used file = read_graphviz(in, ug, dp, "node_id"); Source graphviz file: strict graph { 0 -- 3; 0 -- 4; 1 -- 3; 1 -- 4; 2 -- 3; 2 -- 4; 3 -- 4; } Output graphviz file: graph G { 0; 1; 2; 3; 4; 0--1 ; 0--2 ; 3--1 ; 3--2 ; 4--1 ; 4--2 ; 1--2 ; }

3 8

[gil] questions about usage
by Chris Weed 28 Sep '07

28 Sep '07

Hi, I have had great success using gil, and I have some questions and feedback. I didn't see a way to create an image of floating point values. I use my own typedef as follows, but I would think this should be in gil: typedef boost::gil::pixel<float,gray_layout_t> value32f_pixel_t; It is quite common to use square filters in image processing, and I think it would be useful to overload subimage_view with a fixed offset from all 4 sides. template <typename View> inline View subimage_view(const View& src, int border) { return View(src.width()-border*2,src.height()-border*2,src.xy_at(border,border)); } I also had a need for an "image" constructor that would take a size and allocator, but not initialize the values: image(const point_t& dimensions, std::size_t alignment, const Alloc alloc_in = Alloc()) : _memory(0), _align(alignment), _alloc(alloc_in) { allocate_and_default_construct(dimensions); } The biggest change I would suggest is adding the ability to take a view of a view, a const_view of a const_view, and a const_view of a view. This would make writing functions much easier. Thanks, Chris

1 0

custom allocators for shared_ptr
by Cory Nelson 28 Sep '07

28 Sep '07

It would be useful if shared_ptr and family provided a way to give a custom allocator. For instance, to replace the quick allocator with a lock-free one. -- Cory Nelson

6 10

[boost::thread] Function doesn't work out of the main thread
by Gabriel Weilenmann 28 Sep '07

28 Sep '07

Hi Everyone I have a problem with threads which I don't understand. Well, it might be also connected to OpenCV, because it only occured while calling certain OpenCV functions so far: void callCvShowImage() { // OpenCV function to display an image in a window. cvShowImage("WindowName", image); } void callCvQueryFrame() { // OpenCV function to grab an image from a camera. frame = cvQueryFrame( capture ); } In a single thread program they work as expected: ... callCvShowImage(); //Works well callCvQueryFrame(); //Works well ... In the multithreaded version they don't work. In my oppinion, exactly the same thing should happen as above. But surprisingly the functions suddenly don't execute anymore. thrdXX.join() block the program forever... ... boost::thread thrdSI(&callCvShowImage()); thrdSI.join(); // the program never gets to this point ... ... boost::thread thrdQF(&callCvQueryFrame()); thrdQF.join(); // the program never gets till here ... Is there a way to fix this? I could also use the thread library from Microsoft if you think this would help... Obviously, I'm not much into threads. So please try to give me some examples together with your answer Thanks to you people once more Gabriel -- GMX FreeMail: 1 GB Postfach, 5 E-Mail-Adressen, 10 Free SMS. Alle Infos und kostenlose Anmeldung: http://www.gmx.net/de/go/freemail

2 1

Static linking problem on Solaris/SunForte/sparc64.
by Kamil Shakirov 28 Sep '07

28 Sep '07

Hi. I have a problem with static linking on Solaris/sparc64 (Sun Studio 11). This project can be compiled on win32 and Linux. root@sun-ivr: #uname -a SunOS sun-ivr 5.10 Generic_120011-14 sun4u sparc SUNW,UltraSPARCengine_CP-40 /opt/SUNWspro/bin/CC -mt -library=stlport4 -xarch=generic64 -DBOOST_FILESYSTEM_STATIC_LINK -o bin/IPGateway bin/XMLParser.o bin/Utility.o bin/Logger.o bin/Configuration.o bin/Board.o bin/ResourceManager.o bin/main.o -Ltools/lib/solaris-sparc64 -L/opt/nms/lib -lexpat -lboost_date_time-sw-mt -lboost_filesystem-sw-mt -lboost_regex-sw-mt -lboost_log-sw-mt -lboost_system-sw-mt -lboost_thread-sw-mt -lboost_program_options-sw-mt -lcta -ladiapi -lnccapi -lvceapi -ladidtm -lmccsdp -lmspapi -lswiapi -lnsl -lsocket -lresolv -ldl -lthread -lpthread -lrt ld: fatal: symbol `const char*boost::filesystem::basic_filesystem_error<boost::filesystem::basic_path<std::string,boost::filesystem::path_traits> >::what()const' is multiply-defined: (file bin/Logger.o type=FUNC; file tools/lib/solaris-sparc64/libboost_filesystem-sw-mt.a(operations.o) type=FUNC); ld: fatal: File processing errors. No output written to bin/IPGateway scons: *** [bin/IPGateway] Error 1 scons: building terminated because of errors.

1 0

Can I walk the slot list in a signal?
by Nicholas Bastin 28 Sep '07

28 Sep '07

I'm having a problem on 64-bit windows (no other platform, 32 or 64-bit), where only the first slot in a signal is being called. No exception is being thrown, which is usually how this kind of thing happens. Is there any way for me to walk the list of connected slots right before I invoke the signal? It would be helpful if I knew if somehow the slot had become disconnected, or if boost::signal just wasn't invoking for some other reason. -- Nick

2 1

Unhandled exception when call dynamic_bitset's append.
by Wang, Ronnie 28 Sep '07

28 Sep '07

Hi all, My first time use dynamic_bitset like the following way: int index = m_pData->Size(); U8* pData = m_pData->DataBuffer(); boost::dynamic_bitset<>temp(8,pData[index - 1]); int i = 0; for (i = index - 2; i >= 0; i--) { temp.append(pData[i]); temp.resize((index -i)*8); } m_RowBitTag = temp; Here the U8 is unsigned char. When run to temp.append(pData[i]); it will get an unhandled exception. My environment is VC++ 6 Best Regards, -Ronnie

1 0

How is asio::error supposed to work? Tutorial is generating compiler errors
by console shark 28 Sep '07

28 Sep '07

I am trying to compile the tutorial for boost asio, specifically the daytime client (http://asio.sourceforge.net/asio-0.3.7/doc/tutorial/tutdaytime1.html) The following line generates a compile time error. Compiler is VC8. Maybe I'm missing something but is this tutorial out of date? Because I also don't see any implementation of assign_error method which is also liberally used throughout the explanations on that page. boost::asio::error error = boost::asio::error::host_not_found; error C2440: 'initializing' : cannot convert from 'const boost::system::error_code' to 'boost::asio::error' 1> No constructor could take the source type, or constructor overload resolution was ambiguous ____________________________________________________________________________________ Got a little couch potato? Check out fun summer activities for kids. http://search.yahoo.com/search?fr=oni_on_mail&p=summer+activities+for+kids&…

2 2

[review] Review of Exception begins today
by Tobias Schwinger 27 Sep '07

27 Sep '07

The formal review of the Exception library, proposed by Emil Dotchevski, begins today. The library provides an exception class that can transport arbitrary values, thus freeing the user from designing custom exception classes. The library can be downloaded at http://tinyurl.com/24wtwu and its documentation can be read online at http://tinyurl.com/2bkojl . What to include in Review Comments ================================== Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * 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? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. We're looking forward to your evaluation of this Boost candidate! Tobias Schwinger - Review Manager -

1 0

Boost Test manual in pdf
by Peng Yu 27 Sep '07

27 Sep '07

Hi, I would like the manual http://www.boost.org/libs/test/doc/index.html in pdf format. Can somebody let me know how to generate one if one is not available? Or is there one available? Thanks, Peng

1 0

Problems building boost on 10.3.9
by Amit Bhatia 27 Sep '07

27 Sep '07

Hi, I am trying to use darwinports to install boost 1.34.0, Revision 1, on OS X 10.3.9 with gcc version 3.3 20030304 (Apple Computer, Inc. build 1671) and there seems to be some problem. After issuing "sudo port install boost", I get the message: Staging boost into destroot and then from there on it takes on forever. At the same time there is a process running cc1plus that seems to be eating away all the RAM, and the virtual memory being used by it increases to almost 2 Gb and my computer slows down. So my question is: is there some known problem with this version of boost on this version of gcc/OS? If not, then is there a very simple way of installing boost 1.34 on this OS? The last time I used bjam for some other version, I had lots of problems, but the installation went smoothly using darwinports. thanks, --a. --------------------------------- Shape Yahoo! in your own image. Join our Network Research Panel today!

1 0

[borland] Which version of bcc32 and of Boost do you use?
by Nicola Musatti 27 Sep '07

27 Sep '07

[Sorry for the repost from boost.develop . This message belonged here in the first place] Hallo, I'd be interested in knowing which version of Boost do people use with which version of the Borland/CodeGear compilers. The reason I'm asking relates to the state of Boost regression tests for the version currently being developed, as can be seen here: http://beta.boost.org/development/tests/trunk/developer/summary.html As you can see the situation is not very good. Moreover, while I still have to apply the latest bcbboost patches for 5.9.2, 5.6.4 and 5.8.2 should already have the same level of support they had in Boost 1.34 . Unless there's a substantial demand it looks highly likely that support for at least BCB6 will have to be dropped or, more precisely, be left to rot. Contributions are an even more effective way to avoid it :-) Cheers, Nicola -- Nicola.Musatti <at> gmail <dot> com Home: http://nicola.musatti.googlepages.com/home Blog: http://wthwdik.wordpress.com/

1 0

Re: [Boost-users] Kamada kawai spring layout algorithm
by Meththa 27 Sep '07

27 Sep '07

>>Meththa wrote: >> I want to use the Kamada Kawai spring layout algorithm and I do not >> know what to pass for the final parameter when calling the function. >> the template of the function is given below. >> >> *template*<*typename* Graph, *typename* PositionMap, *typename* >> WeightMap, *typename* T, *bool* EdgeOrSideLength> >> *bool* kamada_kawai_spring_layout(*const* Graph & g, PositionMap >> position, WeightMap weight, /unspecified/ edge_or_side_length); >> I do not understand what value needs to be given and what type for >> /unspecified edge_or_side_length./ >> // > >Can someone please point me in the right direction with regards to this. >If you want the side of the bounding box to be of length "s", pass >boost::side_length(s) >If you want the "normal" edge length to be e, pass boost::edge_length(e). > > - Doug Is the bouding box the placement area? I tried both ways you have suggested above and i can't seem to get rid of the compiler errors. If I leave boost::side_length(s) as it is, the compiler complains 's' is not instantiated. If I give a value instead of 's', it complains as follows. C:/boost_1_34_1/boost/graph/kamada_kawai_spring_layout.hpp: In function `bool boost::kamada_kawai_spring_layout(const Graph&, PositionMap, WeightMap, boost::detail::graph::edge_or_side<EdgeOrSideLength, T>) [with Graph = Graph, PositionMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::simple_point<double>*, std::vector<boost::simple_point<double>, std::allocator<boost::simple_point<double> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, size_t>, boost::simple_point<double>, boost::simple_point<double>&>, WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::no_property, boost::edge_weight_t>, T = int, bool EdgeOrSideLength = false]': main2.cpp:57: instantiated from here C:/boost_1_34_1/boost/graph/kamada_kawai_spring_layout.hpp:535: no matching function for call to `boost::detail::error_property_not_found:: error_property_not_found(double)' Can you shed some light on this please. Thanks - Meththa ____________________________________________________________________________________ Be a better Globetrotter. Get better travel answers from someone who knows. Yahoo! Answers - Check it out. http://answers.yahoo.com/dir/?link=list&sid=396545469

1 0

Selecting #include "" files using the boost preprocessor lib
by Peter Soetens 27 Sep '07

27 Sep '07

Hi, Is it possible to include a different file based on the contents of a macro using the preprocessor library ? For example: #define MY_HEADER_NAME "thename" // ... #define THE_HEADER_PATH SOME_PP_MACRO("subdir/", MY_HEADER_NAME, ".h") #include THE_HEADER_PATH // expands to "subdir/thename.h" Thanks in advance ! Peter -- Peter Soetens -- FMTC -- <http://www.fmtc.be>

1 0

Graph, Bayesian networks.
by Yann Golanski 27 Sep '07

27 Sep '07

Is there any support for Bayesian networks within the Boost graph library? Any third party library anyone knows about? Thanks. -- yann(a)kierun.org -= H+ =- www.kierun.org PGP: 009D 7287 C4A7 FD4F 1680 06E4 F751 7006 9DE2 6318

2 1

problem with serialization library
by calogero bennici 27 Sep '07

27 Sep '07

Hi all, just to example, I tried to execute the code in the "simple example": // create and open a character archive for output std::ofstream ofs("genetic_parameters.txt"); // create class instance const gps_position g(35, 59, 24.567f); // save data to archive { boost::archive::text_oarchive oa(ofs); // write class instance to archive oa << g; // archive and stream closed when destructors are called } // ... some time later restore the class instance to its orginal state gps_position newg; { // create and open an archive for input std::ifstream ifs("filename", std::ios::binary); boost::archive::text_iarchive ia(ifs); // read class state from archive ia >> newg; // archive and stream closed when destructors are called } but at line oa << g; the program break in Kernell32.dll. Any suggestions? Regards, Calogero _________________________________________________________________ The next generation of MSN Hotmail has arrived - Windows Live Hotmail http://www.newhotmail.co.uk

2 2

Iostreams and Network
by JD 27 Sep '07

27 Sep '07

Hi, Iostreams documentation states: "For example, Boost.Iostreams can be used to create streams to access TCP connections". Is there any such attempt to create a TCP/IP communicating Source/Sink couple? I know asio is doing this, but I was looking for an pure Iostreams solution. Regards, JD

4 7

program_options configuration file - unknown options
by Marty Fried 26 Sep '07

26 Sep '07

I'd like to use program options in my program, but we have one section of data which consists of aliases plus a definition for each alias, neither of which is known to us. The Boost program_options expects that we specify each possible option, and throws an exception for any that are not listed. Is there a good way to have it ignore those options it doesn't know about? It would be OK if we had to use a different parser for the aliases, but changing the format would make it hard to use, I think. Thanks to anyone who can give me a hint as to how to best handle this, if possible. -- Marty Fried Left Coast, USA

1 0

[parameter] requirement const char*
by Jean-Christophe Roux 26 Sep '07

26 Sep '07

Hello, Thank you for the parameter library; it is making my library much nicer to use. Two questions: 1. I am assuming there is no runtime penalty to use the BOOST_PARAMETER version of a function. Is that right? 2. My code looks like that: namespace keywords { BOOST_PARAMETER_NAME(id) BOOST_PARAMETER_NAME(test) } BOOST_PARAMETER_FUNCTION ( (void),foo,keywords::tag, (optional (id, *, "") (test, (const char*), "") ) ) { ... } Here the parameters must be converted, if necessary, to const char* in order to be used later. What would be the best way to write the requirement that the type must be const char* or must be convertible to const char*? thanks for your help

2 1

[boost-users] msvc operator error.
by chun ping wang 26 Sep '07

26 Sep '07

k lets say i have the following snippet of code typedef boost::operators<T> operatorsT; template <class T> void myFunc(const T&) { typedef boost::operators<T> operatorT; BOOST_STATIC_ASSERT((is_base_of<operatorT, T>::value)); // bunch of code after... } on my compiler it generates this error. :/boost_msvc/include\boost/operators.hpp(283) : error C2803: 'operator --' must have at least one formal parameter of class type C:/boost_msvc/include\boost/operators.hpp(268) : see reference to class template instantiation 'boost::decrementable<T,B>' being compiled with [ T=int, B=boost::detail::empty_base<int> ] C:/boost_msvc/include\boost/operators.hpp(284) : error C2146: syntax error : missing ';' before identifier 'nrv' C:/boost_msvc/include\boost/operators.hpp(284) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int C:/boost_msvc/include\boost/operators.hpp(284) : error C2061: syntax error : identifier 'x' C:/boost_msvc/include\boost/operators.hpp(284) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int C:/boost_msvc/include\boost/operators.hpp(284) : fatal error C1903: unable to recover from previous error(s); stopping compilation

3 4

big integer library
by Peng Yu 26 Sep '07

26 Sep '07

Hi, I found some discussion on big integer in boost mailing list. But I couldn't find the library in boost website. Can you let me know where it is? Thanks, Peng

2 2

Problem in cal diameter and girth using BGL
by tonyaim83 26 Sep '07

26 Sep '07

Hi... I want to calculate diameter and girth of a graph using BGL so i m taking http://www.cs.ualberta.ca/~ghali/courses/texts/BGL/html/girth.cpp.html#pred… as a reference. I have already created graph using adjacency_list Now i m not able to understand how to use :- typedef boost::v_property<long> dist_t; boost::property_map<Graph*, dist_t>::type d_map; typedef boost::u_property<vertex_descriptor> pred_t; boost::property_map<Graph*, pred_t>::type p_map; And for what it stands for ... Here i m not using #include <boost/graph/stanford_graph.hpp> Also let me know where it is being defined.. Is there any alternative to calculate diameter and girth -- View this message in context: http://www.nabble.com/Problem-in-cal-diameter-and-girth-using-BGL-tf4486815… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Problem in calculating radius and girth of a graph
by abhishek.v＠tcs.com 26 Sep '07

26 Sep '07

Hi I m able to calculate the diameter of a graph using BFS visitor. I got all the distances and then i m finding out the maximum using the following to get the diameter .. template <class Distance>class calc_distance_visitor : public boost::bfs_visitor<> { public: calc_distance_visitor(Distance d,std::size_t& girth) : distance(d),Girth(girth) { } template <class Graph> void tree_edge(typename boost::graph_traits<Graph>::edge_descriptor e,Graph& g) { Vertex u, v; u = boost::source(e, g); v = boost::target(e, g); distance[v] = distance[u] + 1; } }; and then typedef std::vector<size_type> IntVector; /// Create N x N matrix for storing the shortest distances //// between each vertex. Initialize all distances to zero. std::vector<IntVector> d_matrix(num_vertices(g),IntVector(num_vertices(g), 0)); size_type i; std::size_t girth = std::numeric_limits<std::size_t>::max(); for (i = 0; i < num_vertices(g); ++i) { calc_distance_visitor<size_type*> vis(&d_matrix[i][0],girth); Vertex src = vertices(g).first[i]; breadth_first_search(g, src, boost::visitor(vis)); } for (i = 0; i < num_vertices(g); ++i) { diameter = std::max(diameter, *std::max_element(d_matrix[i].begin(), d_matrix[i].end())); } Now what is required is the radius which means minimum distance so i used the following code :- for (i = 0; i < num_vertices(g); ++i) { radius = std::min(radius, *std::min_element(d_matrix[i].begin(), d_matrix[i].end())); } What is wrong with the above code . As i m getting incorrect values in case of radius and i cross checked all values are correct... Secondly i m facing problem in calculating girth of a graph :- For this what is needed is to first identify if cycle exist and then find the maximum distance for calculating circumfrence and minimum distance for calculating girth of a graph.. For identifying the cycles i used the following code. :- struct cycle_detector : public dfs_visitor<> { cycle_detector( bool& has_cycle):_has_cycle(has_cycle) { } template <class Edge, class Graph> void back_edge(Edge, Graph&) { file_op<<"It's inside back_edge "; Vertex u, v; u = boost::source(e, g); // I m not able to understand what vertex values it is giving in this case.. v = boost::target(e, g); _has_cycle = true; } protected: bool& _has_cycle; }; bool has_cycle = false; typedef Traits::vertices_size_type size_type; cycle_detector vis(has_cycle); boost::depth_first_search(g, visitor(vis)); The above code is same as given on http://www.boost.org/libs/graph/doc/file_dependency_example.html Now what i want is to record the vertex on which cycle is present and then calculate the distance. So how should i record the vertex name/Index. Kindly help Thanks Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v(a)tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

1 0

Unit testing Questions
by Thomas Thorp 25 Sep '07

25 Sep '07

I'm a newbie with boost and have some questions about unit testing- 1 - In looking for documentation, I see that most of the sample links on the boost.org site for unit testing examples are dead. Is there another place I can see them. 2 - Is there a good tutorial on all of the features of boost testing? It looks really good, but it seems to be really hard to follow. 3 - Is there a way to test for 1.#QNAN in a floating point value? This is part of my initialization sequence. "BOOST_CHECK_EQUAL" results a failure. Thanks in advance. Thomas Thorp Senior Software C++ Engineer Advanced Composite Software - Production

5 4

Re: [Boost-users] Question about pool.
by 蹬三轮的 25 Sep '07

25 Sep '07

> We use boost pool in our project and we found boost's pool may occupy > too much memory. Say, if we need a block of memory which size is > 1317B, boost's pool will allocate a truck of memory 5268B on a 32bits > platform, leave 3951 bytes unused (it get worse on 64bits platform). I > don't think it is necessary to allocate 5268B, for the sake of > performance, only 1320B is enough for align. It should be resovled > because pool is so important to many large application. pool allocates several blocks of memory at once, then divvies them out. Nothing is wasted. Or did you have something else in mind? -- Cory Nelson Hi Nelson, thanks for your reply. According to the description of pool, it should be working like you said. But actually it is not the same. Hereby, there are two cases provided. I think you will find two totally different results between them. 1. blocksize = 1316 Everything is ok. . 2. blocksize =1317 Disaster! You can notice the waste allocated memory. I just want case 2 to run like case 1. Following is the code, you can check it. 1. i: 0 need: 41(KB) alloc: 41(KB) waste: 8(B) i: 32 need: 82(KB) alloc: 82(KB) waste: 8(B) i: 96 need: 164(KB) alloc: 164(KB) waste: 8(B) i: 224 need: 329(KB) alloc: 329(KB) waste: 8(B) i: 480 need: 658(KB) alloc: 658(KB) waste: 8(B) i: 992 need: 1(MB) alloc: 1(MB) waste: 8(B) i:2016 need: 2(MB) alloc: 2(MB) waste: 8(B) i:4064 need: 5(MB) alloc: 5(MB) waste: 8(B) i:8160 need: 10(MB) alloc: 10(MB) waste: 8(B) 2. i: 0 need: 41(KB) alloc: 164(KB) waste: 123(KB) i: 32 need: 82(KB) alloc: 329(KB) waste: 246(KB) i: 96 need: 164(KB) alloc: 658(KB) waste: 493(KB) i: 224 need: 329(KB) alloc: 1(MB) waste: 987(KB) i: 480 need: 658(KB) alloc: 2(MB) waste: 1(MB) i: 992 need: 1(MB) alloc: 5(MB) waste: 3(MB) i:2016 need: 2(MB) alloc: 10(MB) waste: 7(MB) i:4064 need: 5(MB) alloc: 20(MB) waste: 15(MB) i:8160 need: 10(MB) alloc: 41(MB) waste: 30(MB) here is the sample code: #include <iostream> #include <boost/pool/pool.hpp> #include <iomanip> #include <boost/lexical_cast.hpp> using namespace std; int i = 0; int nextSize = 0; int blockSize = 1317; string sizeFormat(int n) { if (n < 1024) { return boost::lexical_cast <string> (n) + "(B)"; } else if (n < 1048576) { return boost::lexical_cast <string> (n / 1024) + "(KB)"; } else { return boost::lexical_cast <string> (n / 1048576) + "(MB)"; } } struct MyAllocator { typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; static char * malloc(const size_type bytes) { int need = nextSize * blockSize; int waste = bytes - need; cout << "i:" << setw(4) << i << " need:" << setw(10) << sizeFormat(nextSize * blockSize) << " alloc:" << setw(10) << sizeFormat(bytes) << " waste:" << setw(10) << sizeFormat(waste) << endl; return new (std::nothrow) char[bytes]; } static void free(char * const block) { delete [] block; } }; int main() { //typedef std::vector <int, MA <int> > MYVector; boost::pool <MyAllocator> intPool(blockSize); for (i = 0; i < 10000; ++i) { nextSize = intPool.get_next_size(); intPool.malloc(); } }

3 2

problem with boost::any, boost::lambda
by Fei Liu 25 Sep '07

25 Sep '07

The following small code snippet does not compile with boost 1.33.1. What did I do wrong or the library is limited in what it can do? g++ -fstrict-aliasing -fomit-frame-pointer -Wall -pedantic -ansi -g -O2 anytest.cpp -o anytest anytest.cpp: In function ‘int main()’: anytest.cpp:22: error: ‘const struct boost::lambda::lambda_functor<boost::lambda::placeholder<1> >’ has no member named ‘type’ gcc version 4.1.1 20060525 (Red Hat 4.1.1-1) #include <iostream> #include <string> #include <vector> #include <algorithm> #include <boost/any.hpp> #include <boost/lambda/lambda.hpp> #include <boost/lambda/if.hpp> using namespace std; using namespace boost::lambda; using namespace boost; using boost::any_cast; int main(){ vector<any> a; any val = 3; a.push_back(val); val = string("456"); a.push_back(val); std::for_each(a.begin, a.end(), if_then(_1.type() == typeid(int))[cout << _1 << ' ']); }

2 2

boost lambda document example does not compile
by Fei Liu 25 Sep '07

25 Sep '07

Hello, group I am trying out the code snippet in http://www.boost.org/doc/html/lambda/le_in_details.html 'Naming delayed constants and variables'. I got some compile errors complaining about synthesized method error with the following code: #include <iostream> #include <boost/lambda/lambda.hpp> #include <boost/ref.hpp> #include <vector> #include <iterator> #include <algorithm> using namespace std; using namespace boost::lambda; using namespace boost; int main(){ int i = 1; (_1 += 2)(i); // i is now 3 (++_1, cout << _1 << '\n')(i); // i is now 4, outputs 4 int j = 40; _1 = j; var(i) = _1 = j; cout << i << '\n'; vector<int> a; a.reserve(10); a.resize(10); //for_each(a.begin(), a.end(), istream_iterator<int>(cin)); // for_each(a.begin(), a.end(), cin >> _1); i = 0; for_each(a.begin(), a.end(), (_1 = var(i)++)); // delayed evaluation through 'var' for_each(a.begin(), a.end(), cout << _1 << ' '); cout << '\n'; for_each(a.begin(), a.end(), cout << ' ' << _1); cout << '\n'; for_each(a.begin(), a.end(), (var(j) = _1, _1 = var(i), var(i) = var(j))); //<------------ Error for_each(a.begin(), a.end(), cout << _1 << ' '); cout << '\n'; }

1 0

[multi_index] modify problem with composite_key
by Jeffrey Holle 24 Sep '07

24 Sep '07

I am having problems using the modify method with my composite_key. Here is my multi_index container definition: typedef multi_index_container< entry, indexed_by< ordered_unique<member<entry,DataVertex,&entry::m_vertex> >, ordered_non_unique< composite_key< entry, member<entry,int,&entry::m_y>, member<entry,int,&entry::m_x> > > > > C; C m_c; namespace ll=boost::lambda; typedef nth_index<C,1>::type XYINDEX; I have a XYINDEX::iterator that is defined using the equal_range method of an XYINDEX order. Now I wish to modify the m_x attribute that this iterator points to so I attempt to write: inline void Positioner::updateX(XYIterator iter,int x) { m_c.modify(iter,(&ll::_1)->*&Positioner::entry::m_x=x); } I get this compiler error: positioner.h:77: error: no matching function for call to 'boost::multi_index::multi_index_container<Positioner::entry, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::member<Positioner::entry, unsigned int, &Positioner::entry::m_vertex>, mpl_::na, mpl_::na>, boost::multi_index::ordered_non_unique<boost::multi_index::composite_key<Positioner::entry, boost::multi_index::member<Positioner::entry, int, &Positioner::entry::m_y>, boost::multi_index::member<Positioner::entry, int, &Positioner::entry::m_x>, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Positioner::entry> >::modify(boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<Positioner::entry> >, mpl_::na>&, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::assignment_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2, boost::lambda::other_action<boost::lambda::member_pointer_action> >, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::addressof_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >, int Positioner::entry::* const, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >, const int, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >)' I have also tried: m_c.modify_key(iter,ll::_1=x); But this gives me this error: positioner.h:78: error: no matching function for call to 'boost::multi_index::multi_index_container<Positioner::entry, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::member<Positioner::entry, unsigned int, &Positioner::entry::m_vertex>, mpl_::na, mpl_::na>, boost::multi_index::ordered_non_unique<boost::multi_index::composite_key<Positioner::entry, boost::multi_index::member<Positioner::entry, int, &Positioner::entry::m_y>, boost::multi_index::member<Positioner::entry, int, &Positioner::entry::m_x>, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>, mpl_::na, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<Positioner::entry> >::modify_key(boost::multi_index::detail::bidir_node_iterator<boost::multi_index::detail::ordered_index_node<boost::multi_index::detail::index_node_base<Positioner::entry> >, mpl_::na>&, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::assignment_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, const int, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >)' While a method like this compiles and works, I would like to be more efficent: inline void Positioner::updateX(DataVertex vertex,int x) { C::iterator iter=m_c.find(vertex); assert(iter!=m_c.end()); m_c.modify(iter,(&ll::_1)->*&Positioner::entry::m_x=x); } Can somebody tell me if what I'm trying to do is possible? If so, how?

2 2

[continued][boost::fusion v2 and xpressive] versioning conflicts...
by Ovanes Markarian 24 Sep '07

24 Sep '07

Eric, sorry for the delay. I only now found some time to work on that issue: http://lists.boost.org/boost-users/2007/08/30120.php After analysing your post and investigation what's going on, I would like to write my opinion: changing xpressive_fwd.hpp or proto_fwd.will not help. I grepped where fusion includes are used and need to enclose these in some conditional statements: #ifdef BOOST_XPRESSIVE_FUSION_V2 # include ... //fusion 2 headers #else # include ... // fusion 1 headers #endif Actually this can be done using some kind of a macro function like: #include BOOST_XPRESSIVE_FUSION_ROOT(sequence/cons.hpp) ... The macro function will deliver the root dependent on the predefined macros like: 1. if !defined XPRESSIVE_FUSION_ROOT and use V2 => choose the root for V2 else => choose the root for V1 As I found out the following files need to be changed: linker.hpp alternate_matcher.hpp alt_compilers.hpp any.hpp cons.hpp arg_traits.hpp op_base.hpp proto_fwd.hpp If you give me your green light I will do it and submit a patch. With Kind Regards, Ovanes

1 0

boost lambda document example does not compile
by Fei Liu 24 Sep '07

24 Sep '07

Hello, group I am trying out the code snippet in http://www.boost.org/doc/html/lambda/le_in_details.html 'Naming delayed constants and variables'. I got some compile errors complaining about synthesized method error with the following code: #include <iostream> #include <boost/lambda/lambda.hpp> #include <boost/ref.hpp> #include <vector> #include <iterator> #include <algorithm> using namespace std; using namespace boost::lambda; using namespace boost; int main(){ int i = 1; (_1 += 2)(i); // i is now 3 (++_1, cout << _1 << '\n')(i); // i is now 4, outputs 4 int j = 40; _1 = j; var(i) = _1 = j; cout << i << '\n'; vector<int> a; a.reserve(10); a.resize(10); //for_each(a.begin(), a.end(), istream_iterator<int>(cin)); // for_each(a.begin(), a.end(), cin >> _1); i = 0; for_each(a.begin(), a.end(), (_1 = var(i)++)); // delayed evaluation through 'var' for_each(a.begin(), a.end(), cout << _1 << ' '); cout << '\n'; for_each(a.begin(), a.end(), cout << ' ' << _1); cout << '\n'; for_each(a.begin(), a.end(), (var(j) = _1, _1 = var(i), var(i) = var(j))); <------------ Error for_each(a.begin(), a.end(), cout << _1 << ' '); cout << '\n'; }

1 0

[ptr_container] Does ptr_map delete objects if inserting fails?
by Boris 24 Sep '07

24 Sep '07

struct foo { }; boost::ptr_map<int, foo> bar; bar.insert(1, new foo()); bar.insert(1, new foo()); Does this code leak? Or does bar delete the second instance of foo? Boris

2 4

Thread, communicate data from main program to thread(s) and back
by Torsten Mohr 24 Sep '07

24 Sep '07

Hi, i've set up an example of a main program that starts two threads and then sends some data to those thread(s). When the thread(s) have processed the data they should notify the main program/thread and wait for new data. I'd like to make sure that what i write is also portable and does not just by chance work on the platform i use. boost::condition seems to be the right thing to look at, is that right? Is there some example for data communication between threads available? Best regards, Torsten.

3 2

[ptr_container] Why is the key passed to ptr_map by non-const reference?
by Boris 24 Sep '07

24 Sep '07

Before anyone refers me to the FAQ at http://www.boost.org/libs/ptr_container/doc/faq.html#why-does-ptr-map-t-ins… - I read it. While it's clear why a reference is used I don't understand why it is a *non-const* reference. Any reason why it's not const? Boris

2 1

scheming with spirit
by jono 24 Sep '07

24 Sep '07

hello all, i'm building a scheme interpreter with spirit and boost. it needs to be simple and robust enuf for a demanding production environment. i've looked for evidence of somebody else having built a scheme or lisp with spirit and boost, and have been surprised to find nothing. it seems like something that almost falls out of the existing classes (variant, shared_ptr, spirit..). it amazes me how few people understand the simplicity of power of lisp and the interpreter pattern in general. the first paper on lisp was published in 1958, and you only have to look at xml to see how relevant list processing is today. an optimal lisp implementation built with spirit & boost could be extremely concise and elegant, but i'm pretty new to spirit and i'm not sure i have the time to find it. my efforts so far are pure kludgery. i think a lisp interpreter included in the boost example code, or even a full boost class, would be very useful. with traits specialization it could be very flexible, and it would introduce an interesting tool for prototyping and testing other boostified code. does anybody know of an existing spirit/lisp implimentation, and is there any interest in developing such a project in open source? cheers jono poff Day One Digital Media Ltd. Auckland, NZ

1 0

[type_traits] Interesting problem with is_base_of.
by Seweryn Habdank-Wojewódzki 23 Sep '07

23 Sep '07

Dears There are two codes. The first is workig as it is specified in the documentation, but the second not. Why there are problems with the second code? Regards. // This code works perfectly #include <boost/type_traits.hpp> #include <boost/static_assert.hpp> #include <boost/utility.hpp> template <typename B, typename R> class test { public: test () { BOOST_STATIC_ASSERT((boost::is_base_of<B, R>::value)); } }; int main() { test <int, int> t (); } // The code belo is not working #include <boost/type_traits.hpp> #include <boost/static_assert.hpp> #include <boost/utility.hpp> template <typename B> class test { public: template <typename R> test (R const &) { BOOST_STATIC_ASSERT((boost::is_base_of<B, R>::value)); } }; int main() { test <int> t (static_cast<int>(0)); } -- |\/\/| Seweryn Habdank-Wojewódzki \/\/

1 0

[serialization]Is it ok to use the trunk version?
by Sean Huang 23 Sep '07

23 Sep '07

We really want to get the improvements (header order and threading issue) made on the trunk over 1.34.1 but the regression results make us very nervous. We only intend to use it with Intel 10 and MSVC8 and do not generate any dlls so I assume majority of the test failures do not really matter to us. Still many tests fail on Intel C++ v10. Could somebody explain to me what these errors mean and their impact on product code? I noticed there are still a branch created for the next release so I assume some work is being done. Regards, Sean

1 0

dijkstra_shortest_paths usage problem
by Juho Eskeli 23 Sep '07

23 Sep '07

Hi, I've got a following problem: is it possible to add extra cost to edge weight if changing direction? What I mean is I have created a map of vertexes with weights and each vertex has edges to general cardinal points (n,ne,e,se,s,sw,w,nw). Now that the algorithm has found a shortest distance from origin to, let's say southeast. Now all the other edges than the one going southeast are penalized. Figure of the situation: | -o- <- starting point | Least distance > o-o <- Penalized | o <- Not penalized, moving to south o denotes a vertex, - and | are edges I presume dijkstra visitor should be used for this, but I'm too much of a newbie. Any help appreciated.

1 0

math_toolkit bindings/rr.hpp
by Jordan Kyriakidis 23 Sep '07

23 Sep '07

The function template <class V> void assign_large_int(V a) inside boost::math::ntl::RR contains the lines t = static_cast<double>(a & 0xffff); m_value += ldexp(RR(t), exp).value(); My compiler (powerpc-apple-darwin8-g++-4.0.1) complains about the second line: error: cannot convert 'boost::math::ntl::RR' to 'double' for argument '1' to 'double ldexp(double, int)' I assume this is because it cannot see the function definition for RR ldexp(RR r, int exp) defined further down in RR.hpp. This trivial patch fixes the error for me: math_toolkit/boost/math/bindings$ svn diff rr.hpp Index: rr.hpp =================================================================== --- rr.hpp (revision 39435) +++ rr.hpp (working copy) @@ -25,6 +25,9 @@ namespace ntl { +class RR; +RR ldexp(RR r, int exp); + class RR { public: math_toolkit/boost/math/bindings$ but there may (probably?) be similar errors for the other functions. Cheers, Jordan

2 4

A need for a COOKBOOK
by dhruva 23 Sep '07

23 Sep '07

Hi, I am trying to get more into BOOST than what I am using currently (which is quite minimal compared to what BOOST has to offer these days) and which does not include a whole lot of new things that have got into BOOST. Are there any BOOST professionals willing to come up with a COOKBOOK for using BOOST libraries? The book "Beyond the C++ Standard Library: An Introduction to Boost" has a decent coverage but is quite dated compared to the leap BOOST library suite has seen in the recent days. As a user of BOOST, I request someone with good knowledge to come up with a COOKBOOK (like the PERL/PYTHON cookbook) for the benefit for BOOST users. It could be modeled along the PYTHON COOKBOOK. Activestate has a site to submit recipes and those are taken up, polished and edited into a nice book. with best regards, dhruva -- Dhruva Krishnamurthy Contents reflect my personal views only!

5 9

[iterator_facade] problem with dereference method
by Jeffrey Holle 23 Sep '07

23 Sep '07

I'm attempting to write a simple iterator, but am having problems with it. The following code snippet shows the datum that is used to feed the iterator, the beginning of the iterator class, the method that is producing a compiler error, and the error. typedef std::vector<DataEdge> Edges; struct NeighboringEdgeInfo { NeighboringEdgeInfo() : size(0),current_pos(0) {} NeighboringEdgeInfo(size_t size_,size_t current_pos_) : size(size_),current_pos(current_pos_) {} Edges::const_iterator start; size_t size; size_t current_pos; }; class AdjacentEdgeIter : public boost::iterator_facade<AdjacentEdgeIter,DataEdge,boost::forward_traversal_tag> { .... inline const DataEdge& AdjacentEdgeIter::dereference() const { return *(node.start+node.current_pos); <<< produces the error } The error: iterator_facade.hpp:517: error: invalid initialization of reference of type 'boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>&' from expression of type 'const boost::detail::edge_desc_impl<boost::bidirectional_tag, unsigned int>' Note that I have tried to make the NeighboringEdgeInfo::start iterator mutable to avoid this error, but it didn't help. Can somebody explain what is going on??

1 1

Iteration with cycling and clamping.
by Michael Marcin 22 Sep '07

22 Sep '07

I have some code which cycles through items in a list as the user presses buttons. I need to be able to move forward and backwards through this list and apply a filtering predicate. For lists that cycle through the available items when operator++ is called on the last iterator before end that satisfies the predicate it the iterator should point to the first element that satisfies the predicate. When operator-- is called on that iterator it should point to the last iterator before end again. For lists that traverse the available items without cycling when operator++ is called on the last iterator before end that satisfies the predicate the iterator should point to the same element. When operator-- is called on the first iterator that satisfies the predicate the iterator should point to the same element. The logic isn't very hard but I'd rather not duplicate it. Are there any available iterator adaptors that perform these operations at the range limits? Thanks, Michael Marcin

2 1

container performance on 64 bit systems
by Bruce Adams 22 Sep '07

22 Sep '07

Hi, This may seem slightly off topic initially but bear with me. I have recently been having fun with the ordinary STL containers on a 64bit linux system. In particular the sorted associative containers set and map bloat the memory usage to an unacceptable level. Part of this is down to 64 bit pointers versus 32 bit pointers. In a standard Red-Black tree implementation each node has 3 pointers, these double in size as do any pointers in the containers themselves. There are also issues with allocating on 8byte and 16byte boundaries. I measured and discovered that an otherwise highly efficient structure took *10* times as much memory on a 64bit machine vs. the 32bit one. I can half the memory usage for a std::set by replacing it with a std::vector and sorting it manually. Nothing too out of the ordinary there. To solve my problem I have replaced a large number of 64bit pointers with indices and manipulate std::vector's of these instead of using associative containers. Are there any 'better' implementations of std::set etc. (preferably open source GNU/Linux compatible) out there? Are any planned? Does boost contain any suitable replacements? Does boost itself suffer from or tackle this 64bit bloat problem? Regards, Bruce. ____________________________________________________________________________________ Boardwalk for $500? In 2007? Ha! Play Monopoly Here and Now (it's updated for today's economy) at Yahoo! Games. http://get.games.yahoo.com/proddesc?gamekey=monopolyherenow

3 2

Re: [Boost-users] [multi-index] possible extension
by Ovanes Markarian 21 Sep '07

21 Sep '07

Joaquin, to be honest I did it also the way deriving from the boost::noncopyable and multi_index_container class. The only problem is the need of initializing constructors, which are either not available or must be explicitly overridden in the derived class. If standard containers are lacking this functionality it is not a reason to avoid it in a lib which stands for technology or ideas after standard containers. On the other hand I would like to point out that it is possible to specify a default policy of being copyable for a container. Only if someone wishes the container to be noncopyable she/he can/should specify it. There would be no change in the external interface for usage if the user is not aware of this feature. Best Regards, Ovanes. > On 9/21/07, Joaquin M Lopez Munoz <joaquin(a)tid.es> wrote: > > > > Hello Ovanes, > > > > Ovanes Markarian <om_boost <at> keywallet.com> writes: > > > > > > > > Hello Joaquín,I would like to make a proposal for additional feature > > of > > > optionaly making multi-index container non-copyable (via copying > > policy > > > class). The same way as a user can decide which indicies to use she/he > > > could specify whether the new data-structure should be copyable or > > not. > > > In my case I was assuming to pass container by reference, but it was > > > copied by some function object. Which produced despite the performane > > > issue wrong results. Using the non-copyable policy I would simply get > > a > > > compiler error. > > > > With all due respect, I don't think this is a feature > > worth including into the lib because: > > > > 1. All standard containers are copyable, I don't see > > any compelling reason to deviate from that. > > 2. The overlook you mention could have happened with almost > > any other kind of object, having this particular type patched > > makes little difference In the grand scheme of things. > > > > Anyway, you can have your own noncopyable_multi_index_container > > by simply deriving from multi_index_container and providing > > the necessary forwading constructors (save copy, of course). > > Maybe this is sufficient for your needs. > > > > Best, > > > > Joaquín M López Muñoz > > Telefónica, Investigación y Desarrollo > > > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > >

1 0

[boost-users] boost-python linker error problem.
by chun ping wang 21 Sep '07

21 Sep '07

building a simple Dfa library, i get some linker problem. Its trying to open a file that does not exist. I attach two files.. what is inside my boost_msvc\lib folder. and the diagonsis of errors and warnings. Mainly the problem is that its trying to find "boost_python-vc80-mt-1_34_1.lib" which does not exist since i build boost with layout=system

2 1

[multi-index] possible extension
by Ovanes Markarian 21 Sep '07

21 Sep '07

Hello Joaquín, I would like to make a proposal for additional feature of optionaly making multi-index container non-copyable (via copying policy class). The same way as a user can decide which indicies to use she/he could specify whether the new data-structure should be copyable or not. In my case I was assuming to pass container by reference, but it was copied by some function object. Which produced despite the performane issue wrong results. Using the non-copyable policy I would simply get a compiler error. With Kind Regards, Ovanes

2 1

[python]
by Gennadiy Rozental 21 Sep '07

21 Sep '07

Hi, In my new company we are using Boost.Python. Boost version is 1.33.1. It's my first steps with the library, so please bare with me if this is something trivial. I've got this noncopyable class Foo class Foo : boost::noncopyable { /*...*/ }; and shift operator defined: Foo& operator<<( Foo& foo, int ) { ... return foo; } Here is my export statement (FooSP is smart pointer on Foo using namespace boost::python; class_<Foo, FooSP, bases<FooBase>, boost::noncopyable>( "Foo", no_init ) .def( self << int() ) ; Here is my Python script extract that is being executed from C++ "foo << 2 << 4" I never got to the second shift call. Instead I an getting exception from Boost.Python: TypeError: No to_python (by-value) converter found for C++ type: class A I kinda found couple ways to deal with it: 1. define operator<< to return FooSP, which I do not like for assymetry and other reasons 2. avoid using self << int() and define explicit function: Foo& shift_op( Foo& foo, int ) { ... return foo; } ... .def( "__lshift__", &shift_op, return_internal_reference<1>() ) What is the proper way to deal with it? And why original error is reported? Gennadiy

2 1

[mpl] Instantiating a vector of factory functions
by Dan Posluns 21 Sep '07

21 Sep '07

Okay, I'm a lot closer to my goal of having an automated factory of objects that are dynamically polymorphic but have their inheritance set up through static means. What I have now is something like this: // My factory template template<class Base, class Derived> struct Factory { Base *create() { return new Derived(); } }; // My vector of factories for the different Derived types typedef mpl::vector< Factory<Base, Derived1>, Factory<Base, Derived2>, Factory<Base, Derived3> > MyFactories; (I actually use MPL to automatically cross and combine different classes, which is pretty cool.) Now I could create a vector of the same length with every type as a pointer to a Factory function, and with Fusion I could probably instantiate it (although I haven't got that working yet). But that still wouldn't get me what I want, which is a table of those factory functions that I can index into at run-time. Can anyone suggest a technique for doing this? Thanks, Dan. -- Dan Posluns, B. Eng. & Scty. (Software Engineering and Society) dan(a)danposluns.com - ICQ: 35758902 http://www.danposluns.com "The great thing about being the only species on the planet that makes a distinction between right and wrong is that we get to make the rules up for ourselves as we go." - Douglas Adams, Last Chance to See

2 1

[date_time/general] license question
by Olaf Krzikalla 21 Sep '07

21 Sep '07

Hi all, In the date_time library there is the libs\date_time\xmldoc\license.xml covering the date_time library. It states that the copyright notice of the date_time library has to "appear in supporting documentation". Does this includes manuals for commercial binaries? I m'wondering because IMHO this wouldn't comply with point 4 of the boost license requirments as written at www.boost.org/more/license_info.html#requirements OTOH I'm neither a lawyer nor a native english speaker so I'm sure I misinterpret something. Can anyone shed some light on this? Thanks Olaf Krzikalla

2 1

Some errors in Boost.Log
by Jens Seidel 21 Sep '07

21 Sep '07

Hi, I know that Boost.Log is not an official Boost library but I hope that this is the right place to collect infos and errors of this library (especially as the author does not respond). I always missed the fact Boost.Log is not able to redirect messages of a special priority (say err) to a file. Redirection is only based on the logger name (e.g. "project.file_accesses"). It is possible to match all priorities higher than a choosen one but if you collect many debug outputs you will miss a few errors in the large log. Now I noticed that I can just create separate loggers such as logger_err and output an err message to the specified logger and additionally to logger_err. Now I'm able to redirect err-level outputs via logger_err *only*, great! I missed a solution like this in the library (yep, it's not difficult, but ...) and it may be useful for others too. Nevertheless the documentation manipulating_logs.html or the library contains errors: <quote> Here are the predefined levels: info (1000) warn (1200) dbg (1400) err (1600) fatal (2000) disable_all ( std::numeric_limits<unsigned>::max() ) default_level (1000) enable_all (0) </quote> First of all dbg should have a much lower priority than info, not a higher one! Also it should be disable_all (0) enable_all ( std::numeric_limits<unsigned>::max() ) In the past I noticed (and reported to the author who ignored my mail) also trivial compile errors with latest g++ compiler (missing ";", ...). I will continue reporting issues to this list, just in case another person wants to maintain Boost.Log or the author will continue his work (which I hope) ... What logger framework do Boost users use? I do not remember reading much about Boost.Log on this list ... Jens

1 0

Re: [Boost-users] Getting errors while compiling a project
by Vitali Gontsharuk 21 Sep '07

21 Sep '07

It seems that the moderator didn't want a message that long to be published, so I had to delete the full log from the message, but it is still available from the first message in this thread. You just have to download it and open it from the disk. Ok, i saw that the log file is not viewable directly (wrong MIME-type > specified by server). > So i copied it as text to the end of this message. > > The uppermost error appears in the the "fusion/support/detail/access.hpp" > file in the 23. line, here a couple of the relevant code lines: > > namespace boost { namespace fusion { namespace detail > { > template <typename T> > struct ref_result > { > typedef typename add_reference<typename T::type>::type type; // > <----- THE ERROR IS THROWN HERE > }; > ... > } > > Here the correspoding error messages from the log: > 1>D:\boost\include\boost/fusion/support/detail/access.hpp(23) : error > C2143: syntax error : missing ';' before '<' > 1> D:\boost\include\boost/fusion/support/detail/access.hpp(24) : > see reference to class template instantiation > 'fus_v2::boost::fusion::detail::ref_result<T>' being compiled > 1>D:\boost\include\boost/fusion/support/detail/access.hpp(23) : error > C4430: missing type specifier - int assumed. Note: C++ does not support > default-int > 1>D:\boost\include\boost/fusion/support/detail/access.hpp(23) : error > C2039: 'type' : is not a member of '`global namespace'' > 1>D:\boost\include\boost/fusion/support/detail/access.hpp(23) : error > C2238: unexpected token(s) preceding ';' > > > But originally, the error comes from the following definition in our > "cmd_processor.hpp" file: > /// anonymous namespace for internal linking > namespace > { > /// iterator through message definition files > /// this class is designed to iterate sequentially through > directories containing message definition files > /// and through single file specifications additionaly defined, so it > implements the iterator pattern and treats > /// directory content and additional single file specification as one > iterable sequence > struct msgdef_file_iterator > : boost::iterator_facade > < > msgdef_file_iterator > , fs::path > , boost::forward_traversal_tag > > > { > ... > private: > /// type definition for a variant containing either nothing > (empty_type) or directory_range or file_range > typedef boost::variant<empty_type, directory_range, file_range> > range_holder; // <----- range_holder DEFINITION IS HERE > > ... > private: > /// configuration settings > cmdproc::config const* conf_; > /// current range holder > range_holder holder_; // <----- THE ERROR > IS THROWN HERE > /// current path which is used from the range > mutable fs::path curr_path_; > }; > ... > } > > Here the corresponding error messages: > 1> D:\boost\include\boost/variant/variant.hpp(1055) : see reference > to class template instantiation > 'boost::detail::variant::find_fallback_type<Types>' being compiled > 1> with > 1> [ > 1> > Types=boost::mpl::l_item<boost::mpl::long_<3>,fus_v2::boost::fusion::pair<`anonymous-namespace'::msgdef_file_iterator::tag_empty,`anonymous-namespace'::msgdef_file_iterator::tag_empty>,boost::mpl::l_item<boost::mpl::long_<2>,fus_v2::boost::fusion::pair<`anonymous-namespace'::msgdef_file_iterator::tag_directory,`anonymous-namespace'::msgdef_file_iterator::msgdef_dirs>,boost::mpl::l_item<boost::mpl::long_<1>,fus_v2::boost::fusion::pair<`anonymous-namespace'::msgdef_file_iterator::tag_file,`anonymous-namespace'::msgdef_file_iterator::string_iterator_range>,boost::mpl::l_end>>> > > 1> ] > 1> ..\..\..\conf\cmd_processor.cpp(400) : see reference to class > template instantiation 'boost::variant<T0_,T1,T2>' being compiled > 1> with > 1> [ > 1> T0_=`anonymous-namespace'::msgdef_file_iterator::empty_type, > 1> > T1=`anonymous-namespace'::msgdef_file_iterator::directory_range, > 1> T2=`anonymous-namespace'::msgdef_file_iterator::file_range > 1> ] > > I hope, this can help you to be able to help me :) > I really need your help!!! > If you need any further information, please, let me know! > > Thanks in advance! > > Vitali Gontsharuk >

1 0

Upgrading to 1.34.1
by Hughes, James 21 Sep '07

21 Sep '07

Hi All, I am having trouble getting bjam to run on my Ubuntu 6.06 system - its complaining about a missing GLIBC_2.4. I'm downloading this from gnu (fingers crossed), but wondered if there is a quick 'Ubuntu' way of installing the latest bjam and associated glibc dependencies that anyone is aware of? James This message (including any attachments) contains confidential and/or proprietary information intended only for the addressee. Any unauthorized disclosure, copying, distribution or reliance on the contents of this information is strictly prohibited and may constitute a violation of law. If you are not the intended recipient, please notify the sender immediately by responding to this e-mail, and delete the message from your system. If you have any questions about this e-mail please notify the sender immediately.

2 2

Re: [Boost-users] Using multi-index as container type in templated class
by Joaquín Mª López Muñoz 21 Sep '07

21 Sep '07

Hi Paul, Paul.VanHagen(a)shell.com ha escrito: > Hello, > > I am having trouble using a boost::multi_index_container type in a template class where the > multi-index value type is depending on the template arg type of the class. > > In particular, I'm getting compiler errors when trying to define the iterator and index types > using the "type" typedefs in the multi_index container. Apparently, at compile time the > index and iterator types cannot be deduced resulting in errors like "cannot convert to > typename, etc.". > > I'm using GCC 3.3.1 and Boost 1.34.1. Well, seems like the compiler is having a hard time with dependent nested types. Probably newer versions of GCC will pose less problems. Fortunately, you can use global variants for nth_index etc., which happen to be easier for the compiler. So, instead of typedef typename mi::nth_index<0>::type mi_by_value; you can write typedef typename nth_index<mi,0>::type mi_by_value; Besides, you write in several places: m_c.get<...>() but as the calls are in dependent contexts you have to write them like this instead: m_c.template get<...>() or like this, as you're alreading doing in MultiIndex::MultiIndex(): get<...>(m_c) The attached code includes all the corrections above and have been verified to compile and run OK with GCC 3.2. Hope this helps, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 2

[boost-users] Library names with mingw-g++ onm windows
by John Femiani 21 Sep '07

21 Sep '07

How does one invoke bjam on the version of boost in SVN-Trunk so that mingw-g++ libraries use '.a' as a suffix instead of '.lib' ? When I use the mingw g++ compiler on Windows I expect it to produce libraries ending with '.a' since that is what the compiler typically looks for when linking with something like: -lboost_filesystem-mt-d Granted I could just put the whole library name -llibboost_filesystem_mt-d.lib but is there a way to make bjam produce .a as a suffix instead? Shouldn't this be the default behavior if I am using a gcc based toolset? -- John

2 1

Re: [Boost-users] [multi-index]/shared_ptr template issue -compiles on MSVC8 but not gcc (solved)
by Mark Schlegel 21 Sep '07

21 Sep '07

>> // this AGE_INDEX does not on gcc but DOES compile on MSVC8 >> typedef AgedMap<T>::AGEDMAPTYPE::index<agetag>::type AGE_INDEX; >The correct syntax is >typedef typename AgedMap<T>::AGEDMAPTYPE::template > index<agetag>::type AGE_INDEX; >(note the intervening template keyword) which, just for >succintness, in your particular ought to be the same, I think, as > ..... The above works (combo change of typename and ::template) so I've settled on using for brevity: typedef typename MIContainer::template index<agetag>::type AGE_INDEX; typedef typename AGE_INDEX::iterator AGE_ITER; thanks, Mark

1 0

[multi-index]/shared_ptr template issue - compiles on MSVC8 but not gcc
by Mark Schlegel 20 Sep '07

20 Sep '07

Hi, I'm using boost versions 1.33.1 and 1.34.1 with gcc 4.1.2 (Linux) and boost 1.33.1 with gcc 3.3.2 on solaris and MSVC8 I'm trying to use multi_index as a container indexed by two integers in a class called MapEntry. The two indices represent a unique key number "key" and a possibly non-unique timestamp "age". To make it generic I have the data in a shared_ptr<T> in the MapEntry class because I wanted to use the aged map functionality with many classes in the shared_ptr: // the tags struct keytag { }; struct agetag { }; template <typename T> struct MapEntry { .... stripped out all constructors and methods ... int key; int age; private: boost::shared_ptr<T> payload; }; and the multi_index_container setup as a wrapper class since C++ doesn't have typedef templates because I figured I needed that to get the "T" into the MapEntry<T> .... template<typename T> class AgedMap { typedef T map_type; public: typedef multi_index_container< MapEntry<T>, indexed_by< ordered_unique< tag<keytag>, BOOST_MULTI_INDEX_MEMBER(MapEntry<T>, int, key) >, ordered_non_unique< tag<agetag>, BOOST_MULTI_INDEX_MEMBER(MapEntry<T>, int, age) > > > AGEDMAPTYPE; }; and in main() I declare the container as: AgedMap<AH_ENTRY>::AGEDMAPTYPE am; and do insert, finds and erases into it. My problem is that it seems that if I use the T template to call my flush_by_age template function : template <typename T, typename MIContainer> void flush_by_age(MIContainer& mic, int timeout) { ..... which is called from main() as (note AH_ENTRY is a very simple struct with just a single int in it and cctor/ctor/dtor for testing) flush_by_age<AH_ENTRY, AHS_MAP>(am, AGELIMIT); and use that T to define what AGE_INDEX is inside it: // this hard coded one compiles and runs on all my platforms // but loses the whole point of genericness //typedef AgedMap<AH_ENTRY>::AGEDMAPTYPE::index<agetag>::type AGE_INDEX; // this AGE_INDEX does not on gcc but DOES compile on MSVC8 typedef AgedMap<T>::AGEDMAPTYPE::index<agetag>::type AGE_INDEX; I get a compiler error at the AGE_INDEX typedef in gcc 3.3.2 (solaris 10): aged_map.cc: In function `void flush_by_age(MIContainer&, int)': aged_map.cc:159: warning: `boost::multi_index::multi_index_container<Value1, IndexSpecifierList1, Allocator1>::index<agetag>::type' is implicitly a typename and a more verbose one on gcc 4.1.2 (Fedora 6 Linux): aged_map.cc: In function ÃÂ¢void flush_by_age(MIContainer&, int)ÃÂ¢: aged_map.cc:159: error: non-template 'index' used as template aged_map.cc:159: note: use ÃÂ¢boost::multi_index::multi_index_container<MapEntry<T>, boost::multi_index::indexed_by<boost::multi_index::ordered_unique< boost::multi_index::tag<keytag, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::member<MapEntry<T>, int, (& MapEntry<T>::key)>, mpl_::na>, boost::multi_index::ordered_non_unique< boost::multi_index::tag<agetag, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::member<MapEntry<T>, int, (& MapEntry<T>::age)>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<MapEntry<T> > >::template index' to indicate that it is a template aged_map.cc:159: error: too few template-parameter-lists But MSVC 8 compiles it fine and it runs. But if I hard code the class in my AGE_INDEX typedef to "<AH_ENTRY>" to replace the <T> in the flush_by_age() it compiles fine on ALL those compilers and they all run ok. I'm wanting to find out what I can possibly do because this would be a very useful class for since I currently have to put the aging information in another container where this let's me do it in one. I use unix and Windows and on Windows the compiler must be MSVC and on unix gcc. I tried making the typename explicit by adding "typename" using the hint from the solaris error but that didn't help. I'm guessing I've got some syntax typo like a missing & or const somewhere ? thanks, Mark

3 2

(no subject)
by Mark Schlegel 20 Sep '07

20 Sep '07

>> // this hard coded one compiles and runs on all my platforms >> // but loses the whole point of genericness >> //typedef AgedMap<AH_ENTRY>::AGEDMAPTYPE::index<agetag>::type AGE_INDEX; >> >> // this AGE_INDEX does not on gcc but DOES compile on MSVC8 >> typedef AgedMap<T>::AGEDMAPTYPE::index<agetag>::type AGE_INDEX; > Try adding 'typename' after 'typedef'. Yes, that was one of the things I tried before posting, it didn't help (but I didn't leave that in the posted code example) Mark

1 0

Boost unit test fails to compile with Visual Studio 8 SP1
by Sebastian Hauer 20 Sep '07

20 Sep '07

Hi, I just upgrade my visual studio 8 install to SP1 and now I am unable to compile a simple unit test. The compilation error I am getting is: cl /EHsc /W3 /Wp64 /RTCsu /Gm /Ob0 /Od /MTd /TP /DFUSE_DB_WITH_MFC /DWIN32 /D_DEBUG /D_MBCS /IY:\sys\lib\boost_1_34_1\include /Idb\src /c db\test\fuse_db-tests.cpp /Fobuild-db-vc80-mt-sgd\test\fuse_db-tests.obj /Zi /Fdbuild-db-vc80-mt-sgd\test\fuse_db-tests.obj.pdb Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 14.00.50727.762 for 80x86 Copyright (C) Microsoft Corporation. All rights reserved. fuse_db-tests.cpp In fuse_db_tests.cpp C:\Program Files\Microsoft Visual Studio 8\VC\INCLUDE\iterator(730) : error C2953: 'stdext::checked_array_iterator' : class template has already been defined C:\Program Files\Microsoft Visual Studio 8\VC\INCLUDE\xutility(3220) : see declaration of 'stdext::checked_array_iterator' When I compile with /showIncludes I see that the xutility header is included by: Note: including file: Y:\sys\lib\boost_1_34_1\include\boost/shared_ptr.hpp Note: including file: Y:\sys\lib\boost_1_34_1\include\boost/config.hpp Note: including file: C:\Program Files\Microsoft Visual Studio 8\VC\INCLUDE\memory Note: including file: C:\Program Files\Microsoft Visual Studio 8\VC\INCLUDE\iterator Has anyone else run into this problem? Regards, Sebastian

4 4

sp_counted_base.hpp and VxWorks
by Daniel P Furlani 20 Sep '07

20 Sep '07

The file sp_counted_base.hpp checks a bunch of macros to determine which architecture-specific include file to use. One of those checks is: #elif defined( __GNUC__ ) && ( defined( __powerpc__ ) || defined( __ppc__ ) ) I'm using VxWorks 6.5. Their version of gcc defines __ppc but not __ppc__. This is some of the output from "ccppc -dD -E emptyfile.cpp": #define __GNUC__ 3 #define _ARCH_PPC 1 #define __ppc 1 #define CPU_FAMILY PPC #define CPU PPC604 #define __vxworks 1 #define __VXWORKS__ 1 If the sp_counted_base.hpp check was written like this: #elif defined( __GNUC__ ) && ( defined( __powerpc__ ) || defined( __ppc__ ) || defined( __ppc ) ) Then I would see the correct file get included. Is this a change that should be made to the boost source or do you feel it is a problem with my compiler? Regards, -Dan

2 1

[Serialization] Getting link errors in gcc 4.1.2 with boost serialization library 1.3.4
by Reusser, Edward 20 Sep '07

20 Sep '07

I am using the boost serialization library version 1.3.4. This compiles fine. However, when I link it into my code, I am getting the following link errors: /home1/ken/main_gcc41/bld/sdpm/linobj/libsdpm.so: undefined reference to `boost::archive::basic_binary_oprimitive<boost::archive::binary_oarchive , _Dinkum_std::basic_ostream<char, _Dinkum_std::char_traits<char> > >::~basic_binary_oprimitive()' /home1/ken/main_gcc41/bld/sdpm/linobj/libsdpm.so: undefined reference to `boost::archive::basic_binary_oprimitive<boost::archive::binary_oarchive , _Dinkum_std::basic_ostream<char, _Dinkum_std::char_traits<char> > >::basic_binary_oprimitive(_Dinkum_std::basic_ostream<char, _Dinkum_std::char_traits<char> >&, bool)' /home1/ken/main_gcc41/bld/sdpm/linobj/libsdpm.so: undefined reference to `boost::archive::basic_binary_iprimitive<boost::archive::binary_iarchive , _Dinkum_std::basic_istream<char, _Dinkum_std::char_traits<char> > >::load(_Dinkum_std::basic_string<char, _Dinkum_std::char_traits<char>, _Dinkum_std::allocator<char> >&)' /home1/ken/main_gcc41/bld/sdpm/linobj/libsdpm.so: undefined reference to `boost::archive::basic_binary_oprimitive<boost::archive::binary_oarchive , _Dinkum_std::basic_ostream<char, _Dinkum_std::char_traits<char> > >::save(_Dinkum_std::basic_string<char, _Dinkum_std::char_traits<char>, _Dinkum_std::allocator<char> > const&)' /home1/ken/main_gcc41/bld/sdpm/linobj/libsdpm.so: undefined reference to `boost::archive::basic_binary_iprimitive<boost::archive::binary_iarchive , _Dinkum_std::basic_istream<char, _Dinkum_std::char_traits<char> > >::~basic_binary_iprimitive()' /home1/ken/main_gcc41/bld/sdpm/linobj/libsdpm.so: undefined reference to `boost::archive::basic_binary_iprimitive<boost::archive::binary_iarchive , _Dinkum_std::basic_istream<char, _Dinkum_std::char_traits<char> > >::basic_binary_iprimitive(_Dinkum_std::basic_istream<char, _Dinkum_std::char_traits<char> >&, bool)' I am not seeing these using previous versions of the compiler. Ed The information contained in or attached to this email may be subject to the Export Administration Regulations (EAR), administered by the U.S. Department of Commerce, or the International Traffic in Arms Regulations (ITAR), administered by the U.S. Department of State, and may require an export license from the Commerce or State Department prior to its export. An export can include a release or disclosure to a foreign national inside or outside the United States. Include this notice with any reproduced portion of this information.

1 0

[multi_index] composite_key question
by Jeffrey Holle 20 Sep '07

20 Sep '07

I've a multi_index container that has a composite_key index which is used to express a "checker board" like concept. I need to iterator over all rows, from 0 to n. I know how to employ equal_range(make_tuple(y)) to get the elements within a specific row, but how do I determine n? The only way I can think of doing this is doing a linear search using another index. Is there a better way?

3 2

how to use map_list
by swapna 20 Sep '07

20 Sep '07

hi, Does anone know how to use map_list_of and the BOOST_foreach with the created map. Thanks Swapna --------------------------------- Forgot the famous last words? Access your message archive online. Click here.

2 1

Re: [Boost-users] polymorphism and boost::shared_ptr
by Daniel P Furlani 20 Sep '07

20 Sep '07

On 9/7/07, Brad Ryder <bradryder67_at_[hidden]> wrote: > typedef boost::shared_ptr<A> shPtrA; > typedef boost::shared_ptr<B> shPtrB; > typedef boost::shared_ptr<C> shPtrC; > > class A > { > > void AddChild(shPtrA& child); > private: > std::vector<shPtrA> m_children; > } > > class B : public A > { > > } > > class C: public B > { > > } > > main() > { > A base; > shPtrB spB(new B()); > shPtrC spC(new C()); > > // I dont want to typecast spB or spC > > A.AddChild( (shPtrA) spB); > A.AddChild( (shPtrA) spC); > } Hello, I am also new to the list, and saw your question in the archives. You don't need to use static_pointer_cast<> or limit yourself to using base class shared_ptr<>s, as has been suggested. The solution is to pass by value instead of by reference. Then the compiler has a chance to perform an implicit conversion from one shared_ptr type to another. In other words, just remove the "&" from the signature of AddChild(). void AddChild(shPtrA child); The conversion won't occur when you pass by reference because shPtrB does not inherit from shPtrA. HTH -Dan

1 0

[serialization] Error with bitfields under PathScale EKO compiler
by Bill Lear 20 Sep '07

20 Sep '07

I have a standard serialize method, working under various flavors of gcc and the Intel C++ compilers: struct ElementEnum { enum Origin { Standard, Base, Custom }; }; class Foo { ... ElementEnum::Origin origin : 4; template<...> void serialize(...) { ar & BOOST_SERIALIZATION_NVP(origin); } }; However, under the PathScale EKO compiler (pathCC), I get an error: "error: invalid initialization of reference of type Origin& from expression of type const unsigned char:4." Apparently make_nvp takes as its second argument a non-const reference. It appears that non-const references are illegal under this compiler, and, who knows, perhaps the latest C++ standard?? I was able to create a test case that caused this same error. However, the test case also failed under gcc and the Intel compiler, so the test case (appended below after my sig) is not narrow enough, apparently. If I rewrite the serialization method to not use the BOOST_SERIALIZATION_NVP macro at all, the code works. Any help on working around this (aside from tearing out BOOST_SERIALIAZATION_NVP() calls altogether) would be appreciated. Bill // test case to provoke the same error that I got compiling // serialization code under PathScale EKO compiler. #include <iostream> using namespace std; template <class T> void print(T& t) { cout << "t is now: " << t << endl; } struct Foo { int itsie : 4; }; int main() { Foo f; print(f.itsie); }

2 3

boost::ptr_vector null check bloat
by Miles Bader 20 Sep '07

20 Sep '07

I tried changing some of my code that used std::vector<foo *> to using boost::ptr_vector<foo> (to get automatic deallocation and the slightly nicer syntax), but the resulting compiled code seems oddly bloated compared to the original code using std::vector. My intuition is that the two should generally compile to largely equivalent object code, except where there's a necessary functional difference. Some of the problem seems to be that it does null-pointer checking at _access_ time, instead of when adding new entries. The result is that (for instance) calls to operator[] end up with an "unnecessary" null check, which drags in tons of stuff related to the accompanying assertion failure, some of which is apparently unshared across object files, like the long __PRETTY_FUNCTION__ strings passed to the assertion failure call. What's the general impression people have of boost::ptr_vector and related classes? Do people use it? Does it have a "bloat" reputation? Thanks, -Miles -- "Suppose we've chosen the wrong god. Every time we go to church we're just making him madder and madder." -- Homer Simpson

4 8

Getting errors while compiling a project
by Vitali Gontsharuk 20 Sep '07

20 Sep '07

Hello! I'm getting a strange problem trying to build a project of my colleague with exactly the same source, project and lib-files. I'm using Visual Studio C++ 2005 Express Edition German version with Service Pack 1. He has the same version, but in English, maybe this could be relevant. He has programmed a transforming tool which makes heavy usage of different boost features. Actually, his project used to compile on my PC previously, but then I made a Windows Update and simultaneously added some changes (included Xerces, Xalan and also changed something in my project, but didn't change anything in his project). After that I can't compile his project. I know that we use the same resource files because I downloaded them from our local svn server. I'm not sure whether I can make even parts of the code public. But maybe the full error report could be sufficient to make some hints where the problem could lie in. I would really appreciate your help, because I have already lost so much time figuring out what the problem can be. But as I'm only a novice to all the BOOST libraries, I don't have an overview of it and the typical errors and how to interpret them (or the combination of errors), which is vital in programming using templates etc. I send the full error report as an attachment! I thank all the answerers in advance! Best wishes, Vitali Gontsharuk

1 0

Problem in finding diameter and girth
by abhishek.v＠tcs.com 20 Sep '07

20 Sep '07

Hi... I want to calculate diameter and girth of a graph using BGL so i m taking http://www.cs.ualberta.ca/~ghali/courses/texts/BGL/html/girth.cpp.html#pred… as a reference. I have already created graph using adjacency_list Now i m not able to understand how to use :- typedef boost::v_property<long> dist_t; boost::property_map<Graph*, dist_t>::type d_map; typedef boost::u_property<vertex_descriptor> pred_t; boost::property_map<Graph*, pred_t>::type p_map; And for what it stands for ... Here i m not using #include <boost/graph/stanford_graph.hpp> Also let me know where it is being defined.. Is there any alternative to calculate diameter and girth Thanks Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v(a)tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

1 0

Boost 1_34 and Math Toolkit
by Jon Scott Pendergrass 20 Sep '07

20 Sep '07

2 1

Reference CHM
by Daniel Önnerby 20 Sep '07

20 Sep '07

Hi! Has anyone tried to generate a CHM-file of the documentation? I tried searching the net for one without any luck. I know this is a M$ format, but it's actually a great format for a reference manual and is fully integrated in many editors. Best regards Daniel

2 1

Error building boost1.33.1 on mac OS X 10.4.9
by Ashima Atul 19 Sep '07

19 Sep '07

Hi, I am facing problems building boost 1.33.1 on my MacBook Pro mac OS X 10.4.9. I have attached the errors below. Any help regarding this would be highly appreciated. Thanks, Ashima ./tools/build/jam_src/bin.macosxx86/bjam -sPYTHON_ROOT=/System/Library/Frameworks/Python.framework/Versions/2.3 -sPYTHON_VERSION=2.3 -sTOOLS=darwin Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). ...found 9834 targets... ...updating 6 targets... darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_33_1.dylib ld: Undefined symbols: __Z8cpp_mainiPPc /usr/bin/libtool: internal link edit command failed DYLD_LIBRARY_PATH=bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_33_1.lo" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/cpp_main.o" \ && \ c++ -g -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_33_1.dylib" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_33_1.lo" \ \ -dynamiclib -install_name "libboost_prg_exec_monitor-d-1_33_1.dylib" \ && \ rm -f "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_33_1.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_prg_exec_monitor-d-1_33_1.dylib... darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_prg_exec_monitor-1_33_1.dylib ld: Undefined symbols: __Z8cpp_mainiPPc /usr/bin/libtool: internal link edit command failed DYLD_LIBRARY_PATH=bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_prg_exec_monitor-1_33_1.lo" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/cpp_main.o" \ && \ c++ -Wl,-x -o "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_prg_exec_monitor-1_33_1.dylib" "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_prg_exec_monitor-1_33_1.lo" \ \ -dynamiclib -install_name "libboost_prg_exec_monitor-1_33_1.dylib" \ && \ rm -f "bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_prg_exec_monitor-1_33_1.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_prg_exec_monitor-1_33_1.dylib... darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_test_exec_monitor-d-1_33_1.dylib ld: Undefined symbols: __Z9test_mainiPPc /usr/bin/libtool: internal link edit command failed DYLD_LIBRARY_PATH=bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_test_exec_monitor-d-1_33_1.lo" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/compiler_log_formatter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/framework.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/plain_report_formatter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/progress_monitor.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/results_collector.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/results_reporter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/test_main.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/test_tools.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/unit_test_log.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/unit_test_main.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/unit_test_monitor.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/unit_test_parameters.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/unit_test_suite.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/xml_log_formatter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/xml_report_formatter.o" \ && \ c++ -g -o "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_test_exec_monitor-d-1_33_1.dylib" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_test_exec_monitor-d-1_33_1.lo" \ \ -dynamiclib -install_name "libboost_test_exec_monitor-d-1_33_1.dylib" \ && \ rm -f "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_test_exec_monitor-d-1_33_1.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/debug/shared-linkable-true/libboost_test_exec_monitor-d-1_33_1.dylib... darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_test_exec_monitor-1_33_1.dylib ld: Undefined symbols: __Z9test_mainiPPc /usr/bin/libtool: internal link edit command failed DYLD_LIBRARY_PATH=bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_test_exec_monitor-1_33_1.lo" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/compiler_log_formatter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/framework.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/plain_report_formatter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/progress_monitor.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/results_collector.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/results_reporter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/test_main.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/test_tools.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/unit_test_log.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/unit_test_main.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/unit_test_monitor.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/unit_test_parameters.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/unit_test_suite.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/xml_log_formatter.o" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/xml_report_formatter.o" \ && \ c++ -Wl,-x -o "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_test_exec_monitor-1_33_1.dylib" "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_test_exec_monitor-1_33_1.lo" \ \ -dynamiclib -install_name "libboost_test_exec_monitor-1_33_1.dylib" \ && \ rm -f "bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_test_exec_monitor-1_33_1.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_test_exec_monitor.dylib/darwin/release/shared-linkable-true/libboost_test_exec_monitor-1_33_1.dylib... darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/libboost_unit_test_framework-d-1_33_1.dylib ld: Undefined symbols: __Z20init_unit_test_suiteiPPc /usr/bin/libtool: internal link edit command failed DYLD_LIBRARY_PATH=bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/libboost_unit_test_framework-d-1_33_1.lo" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/compiler_log_formatter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/framework.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/plain_report_formatter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/progress_monitor.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/results_collector.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/results_reporter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/test_tools.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/unit_test_log.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/unit_test_main.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/unit_test_monitor.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/unit_test_parameters.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/unit_test_suite.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/xml_log_formatter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/xml_report_formatter.o" \ && \ c++ -g -o "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/libboost_unit_test_framework-d-1_33_1.dylib" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/libboost_unit_test_framework-d-1_33_1.lo" \ \ -dynamiclib -install_name "libboost_unit_test_framework-d-1_33_1.dylib" \ && \ rm -f "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/libboost_unit_test_framework-d-1_33_1.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/debug/shared-linkable-true/libboost_unit_test_framework-d-1_33_1.dylib... darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/libboost_unit_test_framework-1_33_1.dylib ld: Undefined symbols: __Z20init_unit_test_suiteiPPc /usr/bin/libtool: internal link edit command failed DYLD_LIBRARY_PATH=bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true export DYLD_LIBRARY_PATH ld -dynamic -m -r -d -o "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/libboost_unit_test_framework-1_33_1.lo" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/compiler_log_formatter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/execution_monitor.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/framework.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/plain_report_formatter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/progress_monitor.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/results_collector.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/results_reporter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/test_tools.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/unit_test_log.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/unit_test_main.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/unit_test_monitor.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/unit_test_parameters.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/unit_test_suite.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/xml_log_formatter.o" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/xml_report_formatter.o" \ && \ c++ -Wl,-x -o "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/libboost_unit_test_framework-1_33_1.dylib" "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/libboost_unit_test_framework-1_33_1.lo" \ \ -dynamiclib -install_name "libboost_unit_test_framework-1_33_1.dylib" \ && \ rm -f "bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/libboost_unit_test_framework-1_33_1.lo" ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/libboost_unit_test_framework.dylib/darwin/release/shared-linkable-true/libboost_unit_test_framework-1_33_1.dylib... ...failed updating 6 targets... Not all Boost libraries built properly.

1 0

Re: [Boost-users] Using multi-index as container type intemplated class
by Joaquín Mª López Muñoz 19 Sep '07

19 Sep '07

Paul.VanHagen(a)shell.com ha escrito: > Fantastic!! > > Many thanks. > > I have scanned through the boost documentation for this library several times to find > some clues. Did I miss anything there? I would like to know where I can find the > section where this is documented for future reference. Well, you're right this global nth_index<...> and similar metafunctions are not much publicized: they are only documented in the reference, and in a little noticeable way: look for "// multi_index_container associated global class templates:" at http://www.boost.org/libs/multi_index/doc/reference/multi_index_container.h… I haven't given these global metafunctions more publicity so as to not confuse readers, given that the nested versions ought to be enough in most cases --except for broken compilers like MSVC 6.0 and, seemingly, low versions of GCC. > Again thanks alot. You've been of great help. > > Paul You're welcome. Thanks for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

asio supporting a C++ distributed hash table
by Damien Hocking 19 Sep '07

19 Sep '07

Hi all, I've been idly wondering if this might be worth a look. Has someone tried this already? Damien

2 2

Link errors using Boost & STLPort with VC8
by Yongwei Wu 19 Sep '07

19 Sep '07

Hi all, I read about the following discussion when I encountered a similar issue (using -MTd -D_STLP_DEBUG=1 on the command line) and googled: John Maddock wrote: > Jason Ivey wrote: > > 1>LINK : fatal error LNK1104: cannot open file > > 'stlportstld_x.5.1.lib' > > > > The problem is that all of the stlport libraries are named > > stlportstld.5.1.lib or similar. I did try to just rename the > > library to make it match but, of course, I got a boat load of > > unresolved external linker errors pointing to names such as > > "stlpdx_std::basic_string." Looking at a dumpbin output of the > > actual regex library it is linking against, > > libboost_regex-vc80-mt-sgdp-1_34_1.lib, I found linker directives of > > the form: > > Not sure, but I believe the debug versions of Boost lib's built against > STLPort are built with __STL_DEBUG defined, so you will need to do likewise > when building your application. Also don't forget that Boost.Regex is "Just > a bunch of sources" so you could turn auto-linking off (define > BOOST_REGEX_NO_LIB or BOOST_ALL_NO_LIB) and link against your own build of > the regex sources (just build all of libs/regex/src/*.cpp into a static > lib). It seems to me the reason for the failure is that there are some DLL-related conflicts. In _detect_dll_or_lib.h: # if defined (_STLP_RUNTIME_DLL) # if !defined (_STLP_USE_STATIC_LIB) # if !defined (_STLP_USE_DYNAMIC_LIB) # define _STLP_USE_DYNAMIC_LIB # endif # else /* The user is forcing use of STLport as a dynamic library. We signal * it so that the STLport namespace will be modify to report such a * combination and force the user to link with the rebuilt STLport * library. */ # define _STLP_USING_CROSS_NATIVE_RUNTIME_LIB # endif # else # if !defined(_STLP_USE_DYNAMIC_LIB) # if !defined (_STLP_USE_STATIC_LIB) # define _STLP_USE_STATIC_LIB # endif # else /* Idem previous remark but the user forces use of the static native * runtime. */ # define _STLP_USING_CROSS_NATIVE_RUNTIME_LIB # endif # endif Is it possible that such a conflict exists when libboost_regex-vc71-mt-sgdp-1_34_1.lib (my case) or libboost_regex-vc80-mt-sgdp-1_34_1.lib (OP's case) is being built? And, according to your suggestion, if I manually build libboost_regex-vc71-mt-sgdp-1_34_1.lib with cl /MTd /D_STLP_DEBUG=1 *.cpp followed by lib /out:libboost_regex-vc71-mt-sgdp-1_34_1.lib *.obj Everything is fine. Another thing to notice here is that unlike the case of STLport 4.6.2, files like boost*p-1_34_1.lib and boost*p-1_34_1.dll are NOT created. Is it related? BTW, without -D__STL_DEBUG=1 or -D_STLP_DEBUG=1 Boost will complain "STLPort debug versions are built with /D_STLP_DEBUG=1" and "Build options aren't compatible with pre-built libraries", so this should not be an issue. Comments? Best regards, Yongwei -- Wu Yongwei URL: http://wyw.dcweb.cn/

2 3

Using multi-index as container type in templated class
by Paul.VanHagen＠shell.com 19 Sep '07

19 Sep '07

Hello, I am having trouble using a boost::multi_index_container type in a template class where the multi-index value type is depending on the template arg type of the class. In particular, I'm getting compiler errors when trying to define the iterator and index types using the "type" typedefs in the multi_index container. Apparently, at compile time the index and iterator types cannot be deduced resulting in errors like "cannot convert to typename, etc.". I'm using GCC 3.3.1 and Boost 1.34.1. Following code demonstrates the problem: // std includes #include <iostream> // boost includes #include "boost/multi_index_container.hpp" #include "boost/multi_index/ordered_index.hpp" #include "boost/multi_index/sequenced_index.hpp" using namespace std; using namespace boost; using namespace boost::multi_index; // try also class keyword here template<typename T> class MultiIndex { public: typedef T value_type; typedef mpl::vector< ordered_non_unique<identity<value_type> >, sequenced<> > index_list_t; // multi-index typedef typedef multi_index_container< value_type, index_list_t > mi; // typedefs for index types typedef typename mi::nth_index<0>::type mi_by_value; typedef typename mi::nth_index<1>::type mi_as_seq; // typedefs for index iterators typedef typename mi::nth_index_iterator<0>::type mi_it; typedef typename mi::nth_index_iterator<1>::type mi_seq_it; MultiIndex() { // add pair to multi-index container mi_as_seq& seq = get<1>(m_c); seq.push_back(9); seq.push_back(8); seq.push_back(7); seq.push_back(6); seq.push_back(5); seq.push_back(4); seq.push_back(3); seq.push_back(2); seq.push_back(1); seq.push_back(0); } void exec() { // access as sequence cout << "\nAccessing as sequence:" << endl; copy(m_c.get<1>().begin(), m_c.get<1>().end(), ostream_iterator<int>(cout, " ")); cout << endl; // access by value cout << "\nAccessing ordered:" << endl; copy(m_c.get<0>().begin(), m_c.get<0>().end(), ostream_iterator<int>(cout, " ")); cout << endl; } private: mi m_c; }; int main(int argc, char** argv) { MultiIndex<int> mi; mi.exec(); } It's probably obvious what is wrong with this code but I just don't see it. I tried a non-templated version and that compiles (and works) fine. Thanks, Paul

1 0

Threads, FunctionPtr and stepping through code
by Jaime Rios 19 Sep '07

19 Sep '07

Hi, I'm working on a project that uses the Boost thread library. The code is pretty simple and creates one thread to a function. To test out the code I created, I create a console app and tested the code on 2 platforms: Mac OS X for Intel and Mac OS X for PowerPC. The code worked fine in the console app so I incorporated the code into my main project, which is a dylib. The code worked fine on the Intel Mac, but when I debugged the dylib on the PowerPC Mac, I get a EXC_BAD_ACCESS error. After spending many hours trying to find out what the cause of the problem is, the only thing I could derive was that the address that Boost was using to access my function was wrong. Before the error, I have the following address to my function: (gdb) print f $1 = (void (*)(void)) 0x33658e4 <MyWorkerThread()> When I get the EXC_BAD_ACCESS error, the debugger stops at the following line: On line 95 of file function_template.hpp struct BOOST_FUNCTION_VOID_FUNCTION_INVOKER { static BOOST_FUNCTION_VOID_RETURN_TYPE invoke(any_pointer function_ptr BOOST_FUNCTION_COMMA BOOST_FUNCTION_PARMS) { HERE--> FunctionPtr f = reinterpret_cast<FunctionPtr>(function_ptr.func_ptr); BOOST_FUNCTION_RETURN(f(BOOST_FUNCTION_ARGS)); } }; The address at this point is the following: (gdb) print f $2 = (void (*)(void)) 0xf0798dd0 I went over the code over and over again but I cannot figure out what is causing the original function address to be changed. Now for the question! How can I debug this better? The problem that I am finding is that my debugger jumps to different parts of the project, but I cannot pinpoint the actual code that is causing this problem. Any suggestions? Thanks in advance! -Jaime

3 5

boost::function & Copying efficiency
by Michael Bradley Jr 18 Sep '07

18 Sep '07

Hi, I'm looking for a way to let the function object wrapper be stored by reference instead of by cloning/copying. It's said in [1] that someone can achieve this through the use of references, but i don't know how to apply it in this particular case. <code> class A { bool operator()(void) {return false;} }; typedef boost::function<bool (void)> TEST; class B { void invoke(TEST obj); }; When i pass an instance of A as a parameter to the invoke method of B then the whole object is copied. I just want it to be use </code> I've also use boost::ref without success class C { void invoke(TEST & obj); }; doesn't work either! Thanks for any help or hint Michael [1] http://www.boost.org/doc/html/function/misc.html#id1215718

2 1

Re: [Boost-users] Support __int64 and usigned __int64 in concept check interger type
by Chris Newbold 18 Sep '07

18 Sep '07

On Mon, 17 Sep 2007 14:33:53 -0400, Doug Gregor wrote: > On Sep 17, 2007, at 10:25 AM, thomas free wrote: >> ************************************ //Change here >> >> #ifdef _WIN64 >> >> template <> struct IntegerConcept<__int64> { void constraints() >> {} }; >> >> template <> struct IntegerConcept<unsigned __int64> { void >> constraints() {} }; >> >> #endif >> >> ************************************ >> >> #endif >> >> >> >> When I put this two lines, the code compile and link has well has on >> Win32 platform > > Those look fine; I've updated the Boost trunk accordingly. That's not going to help other 64-bit platforms like Linux, or for the use of 64-bit types like 'long long' on 32-bit systems. We've been bitten in the past by large discrepancies between IntegerConcept and is_integral in the type_traits library. Is there a reason why IntegerConcept doesn't just use is_integral? At the very least, it would be nice if the two had consistent answers for all types. -Chris

4 3

creating graph dynamically..
by abhishek.v＠tcs.com 18 Sep '07

18 Sep '07

Hi m facing the similar problem posted on http://lists.boost.org/Archives/boost/2006/11/113553.php for creating graph dynamically. Also it's being said that adapter need to be made for this. Anyone have any idea if such adapter exist now .,, Thanks Abhishek Vyas Tata Consultancy Services Mailto: abhishek.v(a)tcs.com Website: http://www.tcs.com ____________________________________________ Experience certainty. IT Services Business Solutions Outsourcing ____________________________________________ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

1 0

[Boost.Build] actions definition - filename
by Manuel Jung 18 Sep '07

18 Sep '07

Hi, I'm registring a new type to boost.build - "wsdl". It all works, but for my "actions" definition, i need the filename of the converted/compiled .wsdl file. e.g. the file is called "test.wsdl", i need the "test" from it. How can i access it? Kind Regards Manuel Jung

1 0

question about global message queue
by nuaafantasy nuaafantasy 18 Sep '07

18 Sep '07

Dear All: when I create a message queue named with "Global\\abc",there is a interprocess exception,said that "The system cannot find the path specified." but if I named it "abc",it can be created My Os is Windows XP,because I want to use message queue between service and applicaiton,I must create a global shared memory. is there somebody can help me tackle with the problem? thanks a lot. is it an error of naming rule? Bruce

1 0

serialization cross post
by Dan Schuman 18 Sep '07

18 Sep '07

Any comment here on this thread?http://tinyurl.com/3cjwxs Dan Schuman -- We've Got Your Name @ www.mail.com!!! Get a FREE E-mail Account Today - Choose From 100+ Domains

1 0

Support __int64 and usigned __int64 in concept check interger type
by thomas free 17 Sep '07

17 Sep '07

Hi, I currently use Visual 2005 and boost 1.34.1 revision On Win32 already is fine but when I migrate to Win64 Somewhere in my code (the location it’s not important) I have an assert compilation error due to definition of long int/unisgned (64 bits) windows i.e. see concept_check.hpp (ligne 149): template <class T> struct IntegerConcept { //// }; #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION //// template <> struct IntegerConcept<unsigned long> { void constraints() {} }; // etc. <----- Pbs here ************************************ //Change here #ifdef _WIN64 template <> struct IntegerConcept<__int64> { void constraints() {} }; template <> struct IntegerConcept<unsigned __int64> { void constraints() {} }; #endif ************************************ #endif When I put this two lines, the code compile and link has well has on Win32 platform May I misunderstood something Or a better solution exist Thanks

2 1

Get defines from a "dependency"
by Derek Gaston 17 Sep '07

17 Sep '07

Hello all, I'm trying to figure out how I can get the full set of defines from a dependency (and it's dependencies)... without actually depending on it. Any ideas? Thanks, Derek

1 1

Newbie MultiIndex shared_ptr non-trivial class question
by T. Allison 17 Sep '07

17 Sep '07

I am attempting to use the Boost libraries for my first time. I am trying to create a MultiIndex container of shared_ptrs to fairly complicated objects. I've spent several days trying to figure this out, and I'm just spinning my wheels, and I'd really appreciate some help. I'm afraid this message is somewhat lengthy as I''ve tried to include appropriate detail. I have a class of observations which I wish to sort by 9 elements. I have overloaded operator< for this class, like so: class Observation { private: int x1; int x2; double x3; ... double x9; //other elements public: //Get Methods int GetX1(); int GetX2(); double GetX3(); ... double GetX9; //Overloaded operator<, == etc. bool operator<(const Observation &rhs); //appropriate nontrivial logic } The code will dynamically create thousands of these things to be used in many ways, so I've opted to use shared_ptr: typedef boost::shared_ptr<Observation> SharedObservation; I wish to view my collection of these various sorting criteria, or as linked lists, so I'm trying to use multi_index_container. If I write: typedef boost::multi_index_container<SharedObservation> ObservationCollection; and void AnotherClass::functionUsingCollection(data) { SharedObservation temp(new Observation(data) ); //Check and see if I've got one already, before I do anything master_collection.find(temp); //master collection is an object of type ObservationCollection } However, there is no point to using multi_index_container if I sort by only one index, so I've tried to expand out the index explicitly with an eye towards adding more indexes as I develop the code, like so: typedef boost::multi_index_container<SharedObservation,indexed_by<ordered_unique<identity<Observation> > > > ObservationCollection; //Add more indexing criteria later This does not compile on my Linux g++ (4. something bigger than 0) compiler. After a truly horrendous spewage, the crux of the messages seem to be lines like usr/include/boost/multi_index/detail/ord_index_ops.hpp:65: error: no match for call to ‘(const std::less<fuser::Observation>) (fuser::Observation&, const boost::shared_ptr<fuser::tr<fuser::Observation>&)' and /usr/include/boost/multi_index/detail/ord_index_ops.hpp:72: error: no match for call to ‘(const std::less<fuser::Observation>) (const boost::shared_ptr<fuser::Observation>&, fuserObservation>&)' usr/include/c++/4.1.2/bits/stl_function.h:226: note: candidates are: bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = fuser::Observation] I tried adding a function less(shared_ptr &, Obervation &), but it didn't help. The command used to compile is g++ -Wno-deprecated -Wnon-non-template-friend -frepo -m32 Thanks, Getting Desperate T Allison -- View this message in context: http://www.nabble.com/Newbie-MultiIndex-shared_ptr-non-trivial-class-questi… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

problems with libboost_python.so on SunOS
by desai3＠cooper.edu 17 Sep '07

17 Sep '07

Hi all: I have successfully worked with Boost.Python on windows. However I am having some trouble using it on SunOS 5.8. I will appreciate if someone can help me out with this problem. Everytime I try to import a module in Python it gives me: ImportError: ld.so.1 python: fatal relocation error: ............ :referenced symbol not found. So, I tried following command. ldd -r libboost_python.so I have put part of the output of "ldd" command below. libstdc++.so.4 => /dq/local/gcc-3.1.1/lib/libstdc++.so.4 libm.so.1 => /usr/lib/libm.so.1 libgcc_s.so.1 => /dq/local/gcc-3.1.1/lib/libgcc_s.so.1 libc.so.1 => /usr/lib/libc.so.1 libdl.so.1 => /usr/lib/libdl.so.1 symbol not found: PyComplex_Type (./libboost_python.so) symbol not found: PyFloat_Type (./libboost_python.so) symbol not found: PyExc_StopIteration (./libboost_python.so) symbol not found: PyMethod_Type (./libboost_python.so) symbol not found: PyExc_IndexError (./libboost_python.so) symbol not found: PyExc_OverflowError (./libboost_python.so) symbol not found: PyInt_Type (./libboost_python.so) symbol not found: PyModule_Type (./libboost_python.so) Could someone please let me know how could I make these missing symbols available?I will greatly appreciate it if someone can help me with this problem. Thank you. Maulik

1 0

mt safe containers - newbie [C1]
by graham.walsh＠sgcib.com 17 Sep '07

17 Sep '07

Hi, we're in the process of optimising our application. We've already deployed serialization, memory pools and now we're looking at the container code. unfortunately it is highly inefficient. We're attacking some basic optimisations we can use (setting the capacity etc), but there's one thing I'd like to clarify. Right now we're running with STL containers, vector and map for the most part. Before modifying the container in question, we're obliged to lock/protect the container as we have a highly concurrent environment. I would like to know if there's a MT safe container available...i.e. for map and vector. If yes, could anybody please direct me to a doc page that discusses it. I apologise if its staring me in the face but I can't get any doc that discusses mt safety. thanks much for any info and have a nice day Graham ************************************************************************* This message and any attachments (the "message") are confidential and intended solely for the addressee(s). Any unauthorised use or dissemination is prohibited. E-mails are susceptible to alteration. Neither SOCIETE GENERALE nor any of its subsidiaries or affiliates shall be liable for the message if altered, changed or falsified. ************ Ce message et toutes les pieces jointes (ci-apres le "message") sont confidentiels et etablis a l'intention exclusive de ses destinataires. Toute utilisation ou diffusion non autorisee est interdite. Tout message electronique est susceptible d'alteration. La SOCIETE GENERALE et ses filiales declinent toute responsabilite au titre de ce message s'il a ete altere, deforme ou falsifie. *************************************************************************

2 1

serialization mystery
by Neal Becker 17 Sep '07

17 Sep '07

I'm stumped as to why my template typedef simulation doesn't work with serialization. Here's a simple example: template<typename T> struct A { }; template<typename T> struct B { typedef A<T> type; }; namespace boost { namespace serialization { template<class Archive, class T> inline void serialize (Archive &ar, typename B<T>::type & v, const unsigned int file_version) { <<< This won't work //inline void serialize (Archive &ar, A<T> & v, const unsigned int file_version) { <<< This is OK boost::serialization::split_free (ar, v, file_version); } } } I expected typename B<T>::type is equivalent to A<T>, but gcc-4.1.2 doesn't agree. The latter compiles, but the 1st gives: /usr/local/src/boost.hg/boost/serialization/access.hpp:109: error: ‘struct A<int>’ has no member named ‘serialize’

2 1

iostreams + unzip
by Surya Kiran Gullapalli 17 Sep '07

17 Sep '07

Hello all, I'm newbie to boost::iostreams library. I'm trying to unzip a .zip file. for that I'm using iostream's zlib_decompressor class to inflate it. I'm using the sample code provided in the documentation. What I was getting is an exception (zlib error). My question is can i use boost::iostreams classes for unzipping a .zip file.? If so how? a small sample snippet would be helpful. Thanks in advance, Surya

3 2