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

Boost license / OSI approved
by Ruediger Berlich 01 Oct '07

01 Oct '07

Hi there, I noticed that the Boost license is not listed as an OSI approved license (see here: http://www.opensource.org/licenses/alphabetical ). Why is this ? The license seems to nicely comply with the Open Source definition, from what I can see (see http://www.opensource.org/docs/osd) http://www.fsf.org/licensing/licenses/ lists it as GPL-compatible. Best Regards, Ruediger

4 3

thread, use case: one manager and several worker threads
by Torsten Mohr 01 Oct '07

01 Oct '07

Hi, i have a question regarding boost::thread on general usage. I have a calculation intense problem that can be parallelised quite well. But i'd like the whole thing to be interruptible, so when the user commands to stop calculationg then the threads should stop working on the problem. I don't know how to set this up in principle, some thoughts: I want to create one manager thread and several worker threads. The manager thread commands the worker threads on what job to work. When a worker thread has finished, it tells the manager thread so and can get another job to work on. If a user commands the manager thread to stop working, the manager thread commands the worker threads to stop as soon as possible. I think these are quite some normal requirements, but i don't know how to implement this using boost::thread. What is the preferred way to send commands to threads? Just lock a mutex that is shared with the thread and then write a shared variable? How can a manager thread wait on several worker threads at once without wasting CPU time? How does a worker thread notify the manager thread? I can't see how this can be done with boost::condition, do i miss something? Or is it possible for the worker thread to share a boost::mutex with every worker thread, let the manager thread lock those mutexes? It then can only do "condition->wait" on _one_ of the conditions. Best regards, Torsten.

1 0

one reason I suspect a build problem in prior post,
by Mike Marchywka 01 Oct '07

01 Oct '07

when I added the code to trap the regex_error, the previously clean build returned the following during linking but I didn't think it would be a problem: Info: resolving vtable for boost::regex_errorby linking to __imp___ZTVN5boost11r egex_errorE (auto-import) I'm linking to /libboost_regex-gcc-mt-1_33_1.a and cygboost_regex-gcc-mt-1_33_1.dll Thanks again. [ I decided to add boost while using my mom's machine and I found out I had accidentally included boost in "her" cygwin install so it is quite likely I botched something ] Mike Marchywka 586 Saint James Walk Marietta GA 30067-7165 404-788-1216 (C)<- leave message 989-348-4796 (P)<- emergency only marchywka(a)hotmail.com Note: Hotmail is blocking my mom's entire ISP claiming it is to reduce spam but probably to force users to use hotmail. Please DON'T assume I am ignoring you and try me on marchywka(a)yahoo.com if no reply here. Thanks. _________________________________________________________________ Test your celebrity IQ. Play Red Carpet Reveal and earn great prizes! http://club.live.com/red_carpet_reveal.aspx?icid=redcarpet_hotmailtextlink2

1 0

date_time time_duration getting milliseconds
by Sebastian Hauer 01 Oct '07

01 Oct '07

Hi Boost Users, I've started using boost's date_time library recently which I find quite convenient for the most part. I have to handle times with sub second parts frequently and was wondering what the recommended way is to extract the milliseconds part of a time_duration instance? It seems there is no time_duration.milliseconds() method available and fractional_seconds() is platform dependent. BTW: I am currently using boost 1.34.1. Regards, Sebastian

1 0

u32regex_search crashes
by Anjaly 01 Oct '07

01 Oct '07

Hello, I am new to Boost-regex library. The libray is build with icu support.The user interface is created using wxWidgets library. I want to search a file using u32regex_search. But the program crashes and the error it shows is 'Invalid UTF-8 sequence encountered while trying to encode UTF-32 character'.I am reading the contents of the file and it is stored in char array.The program is crashing when it encounters a char with hex value 00. wxString s=SearchTxt->GetValue(); const char *start=(const char*)buffer; const char *end=(const char*)buffer+len; boost::cmatch what; boost::u32regex e1= boost::make_u32regex(s.fn_str(), boost::regex::icase); while(boost::u32regex_search(start,end, what,e, boost::match_default)) { cout << what[0] << "\n"; } ______________________________________ Scanned and protected by Email scanner

3 9

Problem in calculating cycle sequence...
by abhishek.v＠tcs.com 01 Oct '07

01 Oct '07

Hi I m able to calculate whether the cycle exist in the graph or not. With the help of following code.. //Finding out cycles struct cycle_detector : public dfs_visitor<> { cycle_detector( bool& has_cycle, int& num):_has_cycle(has_cycle),cycle(num) { } template <class Edge, class Graph> void back_edge(Edge, Graph&) { cycle++; _has_cycle = true; } protected: bool& _has_cycle; int& cycle; }; int main () { ...... .... .... //Finding out whether the graph has cycles.. bool has_cycle = false; int count_cycle=0; typedef Traits::vertices_size_type size_type; cycle_detector vis(has_cycle,count_cycle); boost::depth_first_search(g, visitor(vis)); if(has_cycle) { file_op << "\nThe graph is cyclic"<< std::endl; file_op<<"\nNumber of cycles in the graph is "<<count_cycle; } else std::cout << "The graph is acyclic"<< std::endl; return 0; } Now what i want is to calculate the vertex between which the cycle exist ... How to calculate that.. 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

string_algo no replace_if
by gast128 01 Oct '07

01 Oct '07

Dear all I was requesting an 'erase_if' a while ago, and now I ran into a 'replace_if' problem. So after spendig 2 hours in the documentation, I finally found on www ('[string_algo] replace repeated char with single instance?') that one should use the 'find_format_all': boost::find_format_all(str, boost::token_finder(boost::is_any_of("ab")), boost::const_formatter("c")); But wouldn't it be better to make a 'replace_if' shortcut solely for the purpose of documentation reasons: boost::replace_all_if(str, boost::is_any_of("ab"), "c"); I think that most people find the last line easier to read and comprehend than its (more powerful) 'find_format' cousin. The string_algo library is nice but I get lost more than once. Especially find, replace, erease with predicates are often used by us. However direct use seems not possible. wkr, me

2 2

Passing extra compiler arguments with bjam
by Cory Nelson 01 Oct '07

01 Oct '07

I'm wanting to pass some extra arguments for VC++ whole program optimization (specifically, /GL to the compile, /LTCG to the linker). Does anyone know how? -- Cory Nelson

1 0

Problem in calculating critical path and fundamental ckts
by abhishek.v＠tcs.com 01 Oct '07

01 Oct '07

Hi.. I want to calculate the critical paths of a graph using BGL. So what i did is i calculated the connected components of a graph then remove the edge one by one if the number of connected component increase then the edge is critical edge or a bridge. This works fine in case of undirected graph. But how do i calculate connected component of a directed or Bidirected graph i m able to calculate the strongly connected component but it is not helping me out. Can you suggest me something regarding this. Also i want to calculate the fundamental ckt that exist in a graph now. What i did here is i m calculating K-MST. Now i want to calculate the fundamental ckt how should i do that... 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

Inquiring about the feasibility of boost::mpl based statechart DSELs that generate boost::statechart based components
by Tony Turner 01 Oct '07

01 Oct '07

Greetings; I am currently experimenting with the feasibility of writing a boost::mpl based library of metaprograms that process statechart DSEL language phrases ( see ref #1 below), that then specifically generate boost::statechart based components. I would be most grateful to hear from others regarding both difficulties to this approach, as well as success stories. If this approach seems feasible, I would like to contribute the resultant code back to the open source community. Since I'm not sure how the contribution process works, I would appreciate it if someone could point me in the right direction. Reference (#1) ( the statechart developed in chap 11, "A DSEL Design Walkthrough" in Abrahams and Gurtovoy's "C++ Template Metaprogramming book".) Thankyou very much for your time; Tony Turner R&D Software Engineer

2 2

Re: [Boost-users] How does one build the asio system library?
by console shark 30 Sep '07

30 Sep '07

Yeah I mean Boost.System, but that wasn't part of the boost download, it seems to come with Asio, right? So now that I put the /system stuff in there, how does it get built? As far as I know it wasn't there prior to me putting it in the /boost/ directory. ----- Original Message ---- From: Richard Dingwall <rdingwall(a)gmail.com> To: boost-users(a)lists.boost.org Sent: Sunday, September 30, 2007 6:04:13 PM Subject: Re: [Boost-users] How does one build the asio system library? On 10/1/07, console shark <consolejoker(a)yahoo.com> wrote: The docs say to run bjam inside /boost/libs/system/build I did this, and it claims to have built the file but I can't fine it anywhere on my hard drive. Subsequent attempts to run bjam don't seem to do anything. The Asio library is header only. You don't need to build anything. You may however need to link against the Boost.System and Boost.Regex libraries. Richard ____________________________________________________________________________________ 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&…

1 0

Serialization recursive include problem
by Fred Lupien 30 Sep '07

30 Sep '07

Hi, I am using the boost serialization library in a personal project and ran into a recursive include problem. Class A serialize an object of class B and class B also serialize an object of class A. So class A must be a complete type in class B and class B must be a complete type in class A, hence the recursive include problem. A easy way to fix this would be to put the serialization code in the source file instead of the header file but I can't get this to work... I always end up with unresolved externals if the body of my serialization functions are not within the header file. Any way around this beside switching to non-intrusive serialization? thanx! -- Frédérick Martel-Lupien Étudiant en Génie Informatique Université de Sherbrooke fred.lupien(a)gmail.com

2 3

How does one build the asio system library?
by console shark 30 Sep '07

30 Sep '07

The docs say to run bjam inside /boost/libs/system/build I did this, and it claims to have built the file but I can't fine it anywhere on my hard drive. Subsequent attempts to run bjam don't seem to do anything. ____________________________________________________________________________________ Looking for a deal? Find great prices on flights and hotels with Yahoo! FareChase. http://farechase.yahoo.com/

2 1

serialization -- thank you!
by Ed Hill 30 Sep '07

30 Sep '07

Hi folks, Many thanks to the Boost developers (esp. Robert Ramey) for the serialization library. I've been tinkering with (de-)serialization of derived classes through base pointers and it works so nicely. thanks again! Ed -- Edward H. Hill III, PhD | ed(a)eh3.com | http://eh3.com/

1 0

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