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

[statechart] - BOOST_ASSERTION in state_machine::send_event if used by multiple threads
by Oliver.Kowalke＠infineon.com 19 Apr '06

19 Apr '06

Hello, I've several threads running. Each thread has its own state_machine. Sometime (not reproducible) I get following assertion: /opt/boost/include/boost-1_33_1/boost/statechart/state_machine.hpp:833: void boost::statechart::state_machine<MostDerived, InitialState, Allocator, ExceptionTranslator>::send_event(const boost::statechart::event_base&) [with MostDerived = iris::proto::svc::sm<ogx::net::ipv4::stream>, InitialState = iris::proto::svc::proto<ogx::net::ipv4::stream>, Allocator = std::allocator<void>, ExceptionTranslator = boost::statechart::null_exception_translator]: Assertion `get_pointer( pOutermostUnstableState_ ) == 0' failed. What does get_pointer( pOutermostUnstableState_ ) != 0' indicate? Regards, Oliver

1 0

Re: [Boost-users] Boost website failed?
by James Hughes 19 Apr '06

19 Apr '06

Thanks - forgot about that copy. Doh! James > -----Original Message----- > From: Jeff Flinn [mailto:TriumphSprint2000@hotmail.com] > Sent: 18 April 2006 15:52 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Boost website failed? > > > James Hughes wrote: > > I'm trying to look at the Boost documentation - but the website > > appears to be dead, so I cannot use the bit I want as I have no idea > > how! > > I see the same here. > > > Is it possible to download a PDF of all the Boost docs for when this > > situation arises so I can keep working? > > You should have a full copy of the docs with your boost > installation. Just > open the index.html file from the directory that you > downloaded/unzipped for > boost. > > Jeff > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Re: [Boost-users] is there any lib used to parse XML file in boost?
by james.jones＠firstinvestors.com 19 Apr '06

19 Apr '06

>From: Tomas Puverle <Tomas.Puverle(a)morganstanley.com> >> ... or you can use libxml (http://xmlsoft.org) which is also >> portable. I used it on Windows and Linux. It is a C library. >There are further advantages to using libxml. >The programming model of expat is based on the SAX2 interface. Libxml has >both the SAX2 and a pull-parser interface, which is generally easier to use >from an application point of view. Libxml2 is generaly faster than expat. It >also has better support for all the different XML features such as entities >etc. I also believe it's more actively maintained and developed. I may just be showing my ignorance here, but how do people feel about Xerces? Especially given that it's written in C++. (Note: I'm trying to install Xerces now on Solaris, and it isn't easy.) Ob the original question: Why not just use Boost serialization? - James Jones Administrative Data Mgmt. (v)732-510-1806 375 Raritan Center Pkwy, Suite A (f)732-510-1855 Edison, NJ 08837 Visit us on the web at http://www.firstinvestors.com/

7 6

boost::numeric::ublas : matrix comparsion.
by chun ping wang 19 Apr '06

19 Apr '06

I went through the matrix_expression library and realize there is no way of comparing matrix...like say i want to compare ith row together, how would i do that.. (considering i want to write a generic implementation) of matrix comparison Are there any out there?

1 0

[Boost Threads] Setting thread stack size...
by Matt Amato 19 Apr '06

19 Apr '06

I have a Windows application that has some very data intensive threads that require much more than the default 2 MB allocated to them. There doesn't seem to be a way to do this via boost threads (which I already make use of throughtout my app). Is there any way to do this with the current release, or will I have to use beginthreadex directly for these threads. Thanks, Matt

1 0

[serialization] Build error: 1.33.1, vc-8_0 toolset, Windows XP
by Rush Manbert 18 Apr '06

18 Apr '06

Hi, I am having problems building Boost 1.33.1 under Windows XP for the vc-8_0 toolset. My problems seem to come from a bug in the build of the serialization library. The attached zip file contains information from 2 builds. One of them succeeds and the other fails. The difference between them is that the failed build includes "--layout=system" on the bjam command line, while the successful build does not. In both cases, the build is run by a script that makes sure the build location and the installation location are cleaned up before the build starts. In the zip file are the following files: * failedBoostBuild.log contains all of the output generated by bjam for the failed build. * failedConsoleTranscript.txt is the console output from the build script. It shows the bjam command line for the failed build. * failedInstalledLibList.txt is a "dir" listing of the library installation directory, after the failed build completed. * goodBoostBuild.log, goodConsoleTranscript.txt, and goodInstalledLibList.txt are the equivalents to the above for the successful build. I believe that there is an error shown in failedBoostBuild.log at line 3000. The line says: "LINK : fatal error LNK1104: cannot open file 'boost_serialization-vc80-mt-gd-1_33_1.lib'" and I believe that the error is that the library file name includes the toolset name and the Boost version number. Since I specified --layout=system, neither of these are included in the generated library names. There is a similar error at line 3058. If you compare the failedInstalledLibList.txt and goodInstalledLibList.txt, you can see that none of the boost_wserialization libraries are present in the failed case. I am guessing that they represent the four failed targets reported by bjam at the end of the build. I want to use the --layout=system naming conventions and do internal releases of the Boost libraries to our development environment. I have already done this successfully under Mac OSX, and I expected it to work the same way under Windows. If my conclusion that there is a build bug is correct, is there some workaround possible to make the build succeed? (I looked at the serialization jamfile and came away unenlightened. :-) Is there some other explanation? Thanks, Rush

1 0

property map: does a given key exist?
by Irek Szczesniak 18 Apr '06

18 Apr '06

In nutshell: how can I check whether a property map has some given key? The exact problem is as follows. I have graph edges with the property "lambdas" of positive integers, but its the exact meaning is not important here. With the read_graphviz function I am loading graph files which look like this: graph { a; b; c; c -- a [distance="100"]; a -- b [lambdas="8"]; } After I load the file I want to examine which edges have the "lambdas" property, but I don't know how to do this. If I request the property value with the "get" function, I get some random value. My program is at the bottom of this email. The program prints the edge and the value of the "lambdas" property. I get this: (2,0): 33489268 (0,1): 8 The first line is bad: the edge (2,0), i.e. c -- a in my graphviz file, has the reported value of 33489268. The second line is OK. Thanks for reading. Best, Irek ********************************************************************* #include <boost/graph/adjacency_list.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/iteration_macros.hpp> #include <boost/graph/graphviz.hpp> using namespace boost; typedef boost::adjacency_list<vecS, vecS, undirectedS, property<vertex_name_t, std::string>, property<edge_weight_t, double, property<edge_weight2_t, int> >, no_property > Graph; int main() { Graph g; dynamic_properties dp; dp.property("node_id", get(vertex_name, g)); dp.property("distance", get(edge_weight, g)); dp.property("lambdas", get(edge_weight2, g)); read_graphviz(std::cin, g, dp); typedef boost::property_map<Graph, edge_weight2_t>::type lambdas_t; lambdas_t weight2_map = get(edge_weight2, g); BGL_FORALL_EDGES(e, g, Graph) // Before printing this out I would like to make sure that an edge // has this property. std::cout << e << ": " << get(weight2_map, e) << std::endl; }

3 3

[plugin] run arbitrary function in library / query contained objects
by Tim Blechmann 18 Apr '06

18 Apr '06

hi all, i'm currently trying to incorporate the boost.plugin library from the boost-sandbox cvs into my program. i need to compile one or more plugins into one shared library and i need a possibility to call a certain function in the library to tell me the names of the contained plugins and give me some more information about the plugin. is there a possibility to run an arbitrary function inside the library, using the dll or plugin_factory? the only workaround i was thinking about is using a dummy plugin class, that's providing virtual functions returning information about the library ... any other hints? or is there any way to get the names of the contained plugins of a certain base class? thanks in advance ... tim -- TimBlechmann(a)gmx.de ICQ: 96771783 http://www.mokabar.tk Nothing exists until or unless it is observed. An artist is making something exist by observing it. And his hope for other people is that they will also make it exist by observing it. I call it 'creative observation.' Creative viewing. William S. Burroughs

1 0

how to install boost in a different directory
by yinglcs2＠yahoo.com 18 Apr '06

18 Apr '06

Hi, How can I install boost in a different directory? I try this command: bjam "-sTOOLS=gcc --prefix=/home/yinglcs/boost" install But it gives me error message saying some *.jam file is not found. Thank you for any help. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

program_options: how to retrieve positional options
by Dean Sturtevant 18 Apr '06

18 Apr '06

Let's say one has defined the following: boost::program_options::positional_options_description pdesc; pdesc.add("generic_name", -1); Then included it in the parse: boost::program_options::variables_map options_map; boost::program_options::basic_parsed_options<char> options = boost::program_options::basic_command_line_parser<char>(argc, argv). positional(pdesc).run(); po::store(options, options_map); po::notify(options_map); How does one retrieve the positional options? - Dean

2 1

Boost website failed?
by James Hughes 18 Apr '06

18 Apr '06

I'm trying to look at the Boost documentation - but the website appears to be dead, so I cannot use the bit I want as I have no idea how! Is it possible to download a PDF of all the Boost docs for when this situation arises so I can keep working? James

2 1

Re: [Boost-users] [multi_index] Sorting object based on some specified criteria!!
by Patel Priyank-PPATEL1 18 Apr '06

18 Apr '06

Hi Joaquin, Thanks for all your replies. Let me read carefully the link you sent out. I will write you back in case of any more questions. Thanks for this great library, it is really helpful. Thanks again, Priyank -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Joaquín Mª López Muñoz Sent: Tuesday, April 18, 2006 2:21 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [multi_index] Sorting object based on some specified criteria!! Patel Priyank-PPATEL1 ha escrito: > Hi Joaquin, > > First of all thanks for your time and response. I have it working as follows, but seems I have to recalculate iterators if in case I later on modify group associated with that access point. Is there any way that iterators will know automatically update when I update access point in future to some other group? > Let me know if you have come across that one. I am going to look in your code in detail and get back to you in case of any questions. Hello Priyank, there's an issue in your code: > // change paging group from access point 4 > a4->pg(2); This is incorrect and can lead to hard-to-detect failures later on during the execution of the program: basically, you're changing an element key "under the table", that is, without the multi-index container having a chance to notice, which directly breaks the internal invariants the container relies on. Under usual conditions it is difficult to change a key in such a way, because the elements of a multi-index container are treated as const, but here you can easily get by because it is pointers that you are storing. The proper way to modify an element is by using replace, modify of modify_key, as explained in http://boost.org/libs/multi_index/doc/tutorial.html#ord_updating In your case, instead of what you've got you could write the following: // get an iterator to a4. You could also have stored those iterators in the // first place when inserting the elements. Access_Points::iterator it=pool.find(4); // change paging group from access point 4 pool.modify(it,boost::bind(&Access_point::pg,_1,2)); By using modify(), the multi-index container is on control of the updating operation, and will rearrange a4 according to its new paging group. > // NEED TO RECALCULATE ITERATORS > boost::tuples::tie(pg0, pg1) = get<paging_group> > (pool).equal_range(1); As for your original question, yes, you've got to recalculate these iterators in the general case, as elements might have been moved around, inserted or deleted: for instance, if the element originally pointed to by pg0 had been deleted, pg0 would not even be valid after that. 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

ptr_container: splice function in ptr_list
by Detlef Mages 18 Apr '06

18 Apr '06

Hi there, I am using a ptr_list as a (huge) container where I can store objects (different types of a single interface). I am using a ptr_list as I need to store iterators to elements that do not invalidate when reordering the structure. Though a standard function of the STL list is missing: "splice". I know, I can mimic "splice" by "transfer", though I think that this results in a runtime complexity of O(N) whereas "splice" would be O(1). Is there a way to add splice to ptr_list? Or will there be problems I haven't thought of? If you give me some hint I could take a shot on this functionality. Detlef

2 1

Re: [Boost-users] [multi_index] Sorting object based on some specified criteria !!
by Patel Priyank-PPATEL1 18 Apr '06

18 Apr '06

Hi Joaquin, First of all thanks for your time and response. I have it working as follows, but seems I have to recalculate iterators if in case I later on modify group associated with that access point. Is there any way that iterators will know automatically update when I update access point in future to some other group? Let me know if you have come across that one. I am going to look in your code in detail and get back to you in case of any questions. Thanks Priyank // class Access point test class Access_Point { public: Access_Point(int id, int paging_group):id_(id), pg_(paging_group) { } bool by_id(int _id) const { return (_id == id_); } int paging_group(int _pg) const { return (_pg == pg_); } int id() const { return id_; } int pg() const { return pg_; } int pg(int _pg) { pg_ = _pg; } friend ostream& operator << (ostream& _os, const Access_Point& _ap); private: int id_; int pg_; }; ostream& operator << (ostream& _os, const Access_Point& _ap) { _os << "Id: " << _ap.id_ << "Pg: " << _ap.pg_ << endl; return _os; } // tag ids struct hashed_objs { }; struct paging_group { }; // Create multi index container typedef multi_index_container< Access_Point*, indexed_by< hashed_unique< tag<hashed_objs>, const_mem_fun<Access_Point, int, &Access_Point::id> >, ordered_non_unique < tag<paging_group>, const_mem_fun<Access_Point, int, &Access_Point::pg> > > > Access_Points; int ACE_MAIN (int, ACE_TCHAR *[]) { // ACCESS POINT CHECK Access_Points pool; Access_Point * a1 = new Access_Point(1, 1); Access_Point * a2 = new Access_Point(2, 1); Access_Point * a3 = new Access_Point(3, 2); Access_Point * a4 = new Access_Point(4, 1); // insert all the access points pool.insert(a1); pool.insert(a2); pool.insert(a3); // get iterator index_iterator<Access_Points, paging_group>::type pg0, pg1; boost::tuples::tie(pg0, pg1) = get<paging_group> (pool).equal_range(1); pool.insert(a4); // print all that is there while (pg0 != pg1) { cout << *(*pg0) << endl; pg0++; } // change paging group from access point 4 a4->pg(2); // NEED TO RECALCULATE ITERATORS boost::tuples::tie(pg0, pg1) = get<paging_group> (pool).equal_range(1); while (pg0 != pg1) { cout << *(*pg0) << endl; pg0++; } // return success return 0; } -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Joaquin M Lopez Munoz Sent: Monday, April 17, 2006 2:26 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users][multi_index] Sorting object based on some specified criteria !! Patel Priyank-PPATEL1 <priyankpatel <at> motorola.com> writes: > > > Hi > all, > > > I have following > kind of class and having some identifier and group id associated with > particular procedure. I want to know if I have to get the procedures > relating particular > > group for ex. > (groupId == 1). How do I do using multiindex container? Can somebody > please give me some hint or code if they have done something similar > to what I want to do? > Hello Priyank, I'm not sure I've understood what you're after, but let me try anyway: As you'll search for group, you'll need an additional index (the one you've set up is based on process ID). The following has not been compiled, beware typos: struct id {}; struct group {}; typedef multi_index_container< Procedure*, indexed_by< hashed_unique< tag<id>, const_mem_fun<Procedure, int, &Procedure::get_id> > >, hashed_non_unique< tag<group>, const_mem_fun<Procedure, int, &Procedure::get_group> > > > > Procedure_Hashed_Pool; typedef Procedure_Hashed_Pool:: index<id>::type Procedure_By_Id; typedef Procedure_Hashed_Pool:: index<group>::type Procedure_By_Group; (I've decided to make the new index hashed non-unique, you could also have it ordered non-unique if you need the elements to be sorted by group ID --hashing only guarantees fast retrieval.) And now you can simply use equal_range() on this index to do what you want: int gr=...; const Procedure_By_Group& procedure_bg= procedure_pool.get<group>(); std::pair< Procedure_By_Group::iterator, Procedure_By_Group::iterator > p=procedure_bg.equal_range(gr); p will hold the range of elements with group ID == gr. Is this what you were after? 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

2 1

Re: [Boost-users] [format] 64bit integer
by Wu Yinghui, Freddie 18 Apr '06

18 Apr '06

> Christian Henning wrote : > >> boost::format will not swallow "%I64d". Instead, it throws a >> boost::io::bad_format_string exception. How can I use 64 bit integers? > > C++ doesn't have a 64 bit integer type. I mean no offense. But I'm a bit sick seeing this answer. Yes, we all know that C++/98 doesn't have 64-bit integral types. But it is a matter of fact that many of us have to deal with 64-bit integral types on a daily basis. I think we can only push boost to its full potential if it supports 64-bit integral types natively. Just my 5 cents... Cheers, Freddie -- Wu Yinghui, Freddie Research & Development Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

1 0

[BGL]:adjacency_list swap
by Louis Lavery 17 Apr '06

17 Apr '06

Hello, Does adjacency_list::swap swap the bundled vertex properties? Also, does it invalidate vertex_descriptors? Thanks, Louis.

2 1

[multi_index] Sorting object based on some specified criteria !!
by Patel Priyank-PPATEL1 17 Apr '06

17 Apr '06

Hi all, I have following kind of class and having some identifier and group id associated with particular procedure. I want to know if I have to get the procedures relating particular group for ex. (groupId == 1). How do I do using multiindex container? Can somebody please give me some hint or code if they have done something similar to what I want to do? Thanks a lot, Priyank // class procedure test class Procedure { public: Procedure(int _id, int _group ) : id_(_id), group_(_group) { } int get_id() const { return id_; } int get_group() const { return group_; } friend ostream& operator << (ostream& _os, const Procedure& _proc); private: int id_; int group_; }; ostream& operator << (ostream& _os, const Procedure& _proc) { _os << "PROCEDURE : " << _proc.id_ << endl; return _os; } // Defines multiindex container that is hashed based on id struct id { }; typedef multi_index_container< Procedure*, indexed_by< hashed_unique< tag<id>, const_mem_fun<Procedure, int, &Procedure::get_id> > > > Procedure_Hashed_Pool; typedef Procedure_Hashed_Pool::index<id>::type Procedure_By_Id;

2 1

lambdaL
by chun ping wang 17 Apr '06

17 Apr '06

the thing is i have list<list<string> > examples. template <typename T, template <typename ELEM,typename = std::allocator<ELEM> > class CONT > void testFunc(const CONT<CONT<T> >& container) { std::find_if(container.begin(), container.end(), ( bind(&CONT<T>::back(), _1) == var(targetValue) ) ); } std::vector<std::vector<std::string> > examples; testFunc<std::string, std::vector>(examples); since list don't have indexing i want to see if the last item in the container is. . However i get this error... cannot call member function `typename _Alloc::reference std::vector<_Tp, _Alloc>::back() [with _Tp = std::string, _Alloc = std::allocator<std::string>]' without object

1 0

Re: [Boost-users] question on using any.
by Alan M. Carroll 17 Apr '06

17 Apr '06

I would look at Boost.Variant and see if that would work for you. Any is designed primarily for libraries that need to carry data for clients and give it back later without having to know anything about the type. At 08:36 PM 4/16/2006, you wrote: > Any ideas on how to store the type of an object stored in an any instance for later use in comparisons (like <, >, ==, etc)? I don't want to store an instance of the class unless necessary. I thought about storing a pointer to the type, but could that be used with any_cast?

1 0

stl questions: how can I compare 2 stl list?
by yinglcs2＠yahoo.com 17 Apr '06

17 Apr '06

is there a better way to compare 2 stl list? I write a function like this below, but I wonder if there is a better way to achieve that with boost(e.g. less code)? bool isSame(const list<int>& srcList, const list<int>& destList ) { if (srcList.size() != destList.size()) { return false; } int size = srcList.size(); for (int i = 0; i < size; i++) { if (srcList[i] != destList[i]) { return false; } } return true; } Thank you. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

3 2

question on using any.
by Joe McCay 17 Apr '06

17 Apr '06

Any ideas on how to store the type of an object stored in an any instance for later use in comparisons (like <, >, ==, etc)? I don't want to store an instance of the class unless necessary. I thought about storing a pointer to the type, but could that be used with any_cast? like: template<class type> class typestuffPOD { typedef type value_type; type *datatype_; } This requires knowing the type when you want to use the any_cast. Sincerely, Joe McCay

1 0

Iterators: harmless (but annoying) warnings in filter_iterator
by Roman Neuhauser 16 Apr '06

16 Apr '06

My CFLAGS provoke two instances of the "'x' shadows a member 'this'" warning in filter_iterator constructors. Although the code is ok, I'd still like to ask for a change so that I may return to using -Werror without tinkering with the installed boost. :) /usr/local/include/boost/iterator/filter_iterator.hpp: In constructor `boost::filter_iterator<Predicate, Iterator>::filter_iterator(Predicate, Iterator, Iterator)': /usr/local/include/boost/iterator/filter_iterator.hpp:57: warning: declaration of 'end' shadows a member of 'this' /usr/local/include/boost/iterator/filter_iterator.hpp: In constructor `boost::filter_iterator<Predicate, Iterator>::filter_iterator(Iterator, Iterator)': /usr/local/include/boost/iterator/filter_iterator.hpp:63: warning: declaration of 'end' shadows a member of 'this' So long, and thanks for all the software! -- How many Vietnam vets does it take to screw in a light bulb? You don't know, man. You don't KNOW. Cause you weren't THERE. http://bash.org/?255991

2 2

Re: [Boost-users] [boost] Mixing a dll boost library with a static runtime is a really bad idea..."
by Rene Rivera 16 Apr '06

16 Apr '06

Redirecting to users list... Saurabh Ramya wrote: > Thanks for your reply. > But I am just including the header files of the boost like muthex.hpp and not using the DLL. > But even though itried by changing the setting to the Debug MT DLL" > And I am getting warning > "non dll-interface class 'boost::noncopyable' used as base for dll-interface class 'boost::mutex'" > And at the end I get error > fatal error LNK1104: cannot open file "boost_thread-vc6-mt-gd-1_31.lib" It's called automatic linking, see <http://www.boost.org/more/getting_started.html#auto-link>. And more generally the getting started docs <http://www.boost.org/more/getting_started.html> The "non dll-interface" warning can be ignored. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

1 0

[xpressive] use of Boyer-Moore
by Lynn Allan 16 Apr '06

16 Apr '06

Eric N. wrote during 2005 > do to make Boyer-Moore work with the regex traits interface make > Boyer-Moore more trouble than its worth for case-insensitive matches. I > haven't yet run the other tests. Just curious ... does xpressive use "standard" Boyer-Moore or a variant? In my limited experience, the Horspool variant of Boyer-Moore is simpler and tends to be faster. It may be more or less prone to have problems with "pathological" cases than "standard" Boyer-Moore, however.

3 3

[Test] minimal test
by Robert Ramey 15 Apr '06

15 Apr '06

I attempted to use the minimal verision of boost test. In order to do this I replaced occurencs of #include <boost/test/exec_monitor.hpp> with #include <boost/test/minimal.hpp> This generates a few problems. a) In the tests which use the serialization DLL, It seems that references are being made to symbols in the library. Here is the output from the link. I can't figure out why this is. test_array.cpp C:\BoostHead\boost\test\impl\execution_monitor.ipp(204) : warning C4273: 'boost::execution_monitor::execute' : inconsistent dll linkage C:\BoostHead\boost\test\impl\execution_monitor.ipp(496) : warning C4273: 'boost::execution_monitor::catch_signals' : inconsistent dll linkage C:\BoostHead\boost\test\impl\execution_monitor.ipp(624) : warning C4273: 'boost::detect_memory_leaks' : inconsistent dll linkage C:\BoostHead\boost\test\impl\execution_monitor.ipp(646) : warning C4273: 'boost::break_memory_alloc' : inconsistent dll linkage Linking to lib file: boost_serialization-vc71-mt-gd-1_34.lib Linking to lib file: boost_serialization-vc71-mt-gd-1_34.lib Linker output: Creating library c:\BoostHead\bin\boost\libs\serialization\test\test_array_binary_archive_dll.test\vc-7_1\debug\threading-multi\test_array_binary_archive_dll.lib and object c:\BoostHead\bin\boost\libs\serialization\test\test_array_binary_archive_dll.test\vc-7_1\debug\threading-multi\test_array_binary_archive_dll.exp test_array.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::execution_exception::execution_exception(enum boost::execution_exception::error_code,class boost::unit_test::basic_cstring<char const >)" (__imp_??0execution_exception@boost@@QAE@W4error_code@01@V?$basic_cstring@$$CBD@unit_test@1@@Z) referenced in function "void __cdecl boost::detail::report_error(enum boost::execution_exception::error_code,class boost::unit_test::basic_cstring<char const >,class boost::unit_test::basic_cstring<char const >)" (?report_error@detail@boost@@YAXW4error_code@execution_exception@2@V?$basic_cstring@$$CBD@unit_test@2@1@Z) test_array.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: class boost::unit_test::basic_cstring<char const > __thiscall boost::execution_exception::what(void)const " (__imp_?what@execution_exception@boost@@QBE?AV?$basic_cstring@$$CBD@unit_test@2@XZ) referenced in function $L159233 test_array.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: enum boost::execution_exception::error_code __thiscall boost::execution_exception::code(void)const " (__imp_?code@execution_exception@boost@@QBE?AW4error_code@12@XZ) referenced in function $L159233 test_array.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::execution_monitor::~execution_monitor(void)" (__imp_??1execution_monitor@boost@@QAE@XZ) referenced in function _main test_array.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::execution_monitor::execution_monitor(void)" (__imp_??0execution_monitor@boost@@QAE@XZ) referenced in function _main c:\BoostHead\bin\boost\libs\serialization\test\test_array_binary_archive_dll.test\vc-7_1\debug\threading-multi\test_array_binary_archive_dll.exe : fatal error LNK1120: 5 unresolved externals b) At least a few "test tools" macros aren't present BOOST_CHECK_EQUAL and BOOST_CHECK_MESSAGE among themRobert Ramey

2 4

Using Spirit library for loading objects from XML
by Catalin Pitis 15 Apr '06

15 Apr '06

Hi * I am looking to implement some kind of persistence of objects using XML (only simple tags), and I'm wondering whether I can use Spirit library for that. For example, I have the following file: <MyAggregation SomeAttribute="value"> <MyAggregated>Some Value</MyAggregated> </MyAggregation> I know how to implement the parser for getting the structure, so that's not an issue. However, I need a second pass, through the extracted structure, in order to validate it and build the objects. Is this possible by using spirit, or do I have to implement my own library for that? Thank you, Catalin

2 2

Re: [Boost-users] Boost::Regex runtime link error
by gdprosch＠micron.com 15 Apr '06

15 Apr '06

I need to amend my earlier assertion (see below). I had incorrectly specified my link instructions for static linkage. If I link against the static library the problem is resolved. This is, however, undesirable so I would still like to resolve the link issue against the dynamic library. << I have verified that the symbol is present in the debug and archive versions of the library and I have even tried linking against those with the same results. >> Thanks again - Greg

2 1

BGL and graphviz: extra property for links
by Irek Szczesniak 14 Apr '06

14 Apr '06

I want to use the read_graphiz function to load graphviz files. Graph links have an extra property called "lambdas," which tells about the number of wavelengths a link has. This link attribute is a positive integer. Below I'm sending you the program which I thought should work, but it doesn't. Plus, there is a sample graphviz file. I have hard time trying to decipher the errors, and made little progress, and so I would appreciate any advice. I'm attaching the compilation errors. Thanks for reading. Thanks & best, Irek ********************************************************************* #include <fstream> #include <string> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/iteration_macros.hpp> using namespace boost; enum edge_lambdas_t { edge_lambdas }; namespace boost { BOOST_INSTALL_PROPERTY(edge, lambdas); } typedef boost::adjacency_list<vecS, vecS, undirectedS, property<vertex_name_t, std::string>, property<edge_weight_t, double>, property<edge_lambdas_t, int> > Graph; int main() { Graph g; dynamic_properties dp; dp.property("lambdas", get(edge_lambdas, g)); dp.property("node_id", get(vertex_name, g)); dp.property("distance", get(edge_weight, g)); read_graphviz(std::cin, g, dp); } *********************************************************************** graph { a; b; c; c -- a [distance="100", lambdas="4"]; a -- b [distance="200", lambdas="4"]; } *********************************************************************** g++ -I /usr/local/include/boost-1_33_1/ -l bgl-viz load.cc -o load /usr/local/include/boost-1_33_1/boost/dynamic_property_map.hpp: In member function `std::string boost::detail::dynamic_property_map_adaptor<PropertyMap>::get_string(const boost::any&) [with PropertyMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t>]': load.cc:236: instantiated from here /usr/local/include/boost-1_33_1/boost/dynamic_property_map.hpp:196: error: no match for 'operator<<' in 'out << boost::get [with PropertyMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t>, Reference = boost::detail::error_property_not_found&, K = boost::detail::edge_desc_impl<boost::undirected_tag, size_t>](((const boost::put_get_helper<boost::detail::error_property_not_found&, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t> >&)((const boost::put_get_helper<boost::detail::error_property_not_found&, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t> >*)((boost::put_get_helper<boost::detail::error_property_not_found&, boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t> >*)(((boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t>*)((boost::detail::dynamic_property_map_adaptor<boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t> >*)this)) + 4u)))), ((const boost::detail::edge_desc_impl<boost::undirected_tag, size_t>&)((const boost::detail::edge_desc_impl<boost::undirected_tag, size_t>*)(&boost::any_cast [with ValueType = boost::detail::edge_desc_impl<boost::undirected_tag, size_t>](((const boost::any&)(+key)))))))' /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:63: note: candidates are: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_ostream<_CharT, _Traits>&(*)(std::basic_ostream<_CharT, _Traits>&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:74: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_ios<_CharT, _Traits>&(*)(std::basic_ios<_CharT, _Traits>&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:86: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(std::ios_base&(*)(std::ios_base&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:121: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(long int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:155: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(long unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:98: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(bool) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:178: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(short int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:189: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(short unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:193: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:204: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:179: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:214: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(long long unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:238: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(double) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:219: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(float) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:261: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(long double) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:284: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(const void*) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:307: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_streambuf<_CharT, _Traits>*) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:504: note: std::basic_ostream<char, _Traits>& std::operator<<(std::basic_ostream<char, _Traits>&, const unsigned char*) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:499: note: std::basic_ostream<char, _Traits>& std::operator<<(std::basic_ostream<char, _Traits>&, const signed char*) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:612: note: std::basic_ostream<char, _Traits>& std::operator<<(std::basic_ostream<char, _Traits>&, const char*) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:567: note: std::basic_ostream<_CharT, _Traits>& std::operator<<(std::basic_ostream<_CharT, _Traits>&, const char*) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:465: note: std::basic_ostream<char, _Traits>& std::operator<<(std::basic_ostream<char, _Traits>&, unsigned char) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:460: note: std::basic_ostream<char, _Traits>& std::operator<<(std::basic_ostream<char, _Traits>&, signed char) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:505: note: std::basic_ostream<char, _Traits>& std::operator<<(std::basic_ostream<char, _Traits>&, char) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:449: note: std::basic_ostream<_CharT, _Traits>& std::operator<<(std::basic_ostream<_CharT, _Traits>&, char) [with _CharT = char, _Traits = std::char_traits<char>] /usr/local/include/boost-1_33_1/boost/lexical_cast.hpp: In member function `bool boost::detail::lexical_stream<Target, Source>::operator>>(InputStreamable&) [with InputStreamable = boost::detail::error_property_not_found, Target = boost::detail::error_property_not_found, Source = std::basic_string<char, std::char_traits<char>, std::allocator<char> >]': /usr/local/include/boost-1_33_1/boost/lexical_cast.hpp:222: instantiated from `Target boost::lexical_cast(const Source&) [with Target = boost::detail::error_property_not_found, Source = std::basic_string<char, std::char_traits<char>, std::allocator<char> >]' /usr/local/include/boost-1_33_1/boost/dynamic_property_map.hpp:42: instantiated from `Value boost::detail::read_value(const std::string&) [with Value = boost::detail::error_property_not_found]' /usr/local/include/boost-1_33_1/boost/dynamic_property_map.hpp:160: instantiated from `void boost::detail::dynamic_property_map_adaptor<PropertyMap>::do_put(const boost::any&, const boost::any&, mpl_::bool_< true>) [with PropertyMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t>]' /usr/local/include/boost-1_33_1/boost/dynamic_property_map.hpp:203: instantiated from `void boost::detail::dynamic_property_map_adaptor<PropertyMap>::put(const boost::any&, const boost::any&) [with PropertyMap = boost::adj_list_edge_property_map<boost::undirected_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, size_t, boost::property<boost::edge_weight_t, double, boost::no_property>, edge_lambdas_t>]' load.cc:236: instantiated from here /usr/local/include/boost-1_33_1/boost/lexical_cast.hpp:156: error: no match for 'operator>>' in '((boost::detail::lexical_stream<boost::detail::error_property_not_found, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >*)this)->boost::detail::lexical_stream<boost::detail::error_property_not_found, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >::stream >> output' /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:87: note: candidates are: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_istream<_CharT, _Traits>&(*)(std::basic_istream<_CharT, _Traits>&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:93: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_ios<_CharT, _Traits>&(*)(std::basic_ios<_CharT, _Traits>&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:102: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(std::ios_base&(*)(std::ios_base&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:111: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(bool&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:133: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(short int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:164: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(short unsigned int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:186: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:217: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(unsigned int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:239: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(long int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:261: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(long unsigned int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:284: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(long long int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:306: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(long long unsigned int&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:329: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(float&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:351: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(double&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:373: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:395: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/istream.tcc:417: note: std::basic_istream<_CharT, _Traits>& std::basic_istream<_CharT, _Traits>::operator>>(std::basic_streambuf<_CharT, _Traits>*) [with _CharT = char, _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/istream:692: note: std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, signed char*) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/istream:687: note: std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, unsigned char*) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/istream:651: note: std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, signed char&) [with _Traits = std::char_traits<char>] /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/istream:646: note: std::basic_istream<char, _Traits>& std::operator>>(std::basic_istream<char, _Traits>&, unsigned char&) [with _Traits = std::char_traits<char>] make: *** [load] Error 1

1 1

tribool serialization
by Austin Bingham 14 Apr '06

14 Apr '06

I've been trying to write serialization code for tribool, and I'm completely dumbfounded at this point. I'm using the "split free" approach, but no matter how I phrase things, the compiler never seems to believe that I've written code to de/serialize tribool. Here's an example of what doesn't work: template <class Archive> void save(Archive& ar, const boost::logic::tribool& b, const unsigned int version) { // irrelevant } template <class Archive> void load(Archive& ar, boost::logic::tribool& b, const unsigned int version) { // irrelevant } BOOST_SERIALIZATION_SPLIT_FREE(boost::logic::tribool); This *seems* correct, but the compiler complains that "tribool has no member named serialize". While this is true, the split-free technique means it won't be requested. Our code uses the split-free approach for other classes, so I'm fairly certain I know how to do it correctly. Is there something magical about tribool that makes this approach break? More importantly, is there a known way to de/serialize tribool? Thanks. -- Austin Bingham "If I were creating the world I wouldn't mess about with butterflies and daffodils. I would have started with lasers, eight o'clock, Day One!" Evil

2 1

Boost::Regex runtime link error
by gdprosch＠micron.com 14 Apr '06

14 Apr '06

I am getting the following runtime link error when running a process that has a dependency on libboost_regex-gcc.so ld.so.1: configsrv: fatal: relocation error: file /esdadev/dev/gdprosch/7.1/solaris/debug/lib/libesda.so: symbol _ZN5boost11basic_regexIcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEE9 do_assignEPKcS7_j: referenced symbol not found The demangled symbol is... nm --demangle ../lib/libesda.so | grep do_assign U boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned) My linkage looks to be okay in my library (libesda.so): ldd ../lib/libesda.so | grep boost libboost_date_time-gcc.so => /esdadev/extsrc/solaris/boost/lib/libboost_date_time-gcc.so libboost_filesystem-gcc.so => /esdadev/extsrc/solaris/boost/lib/libboost_filesystem-gcc.so libboost_regex-gcc.so => /esdadev/extsrc/solaris/boost/lib/libboost_regex-gcc.so The function is in /boost/regex/v4/basic_regex.hpp basic_regex& do_assign(const charT* p1, const charT* p2, flag_type f); I am running on a Solaris 2.8 host where my application and boost 1_33_1 were built using gcc 3.3.1 I have seen two other posting in the archives (V824.1 and V850.3) where other users had similar problems but I saw no resolution posted. I have verified that the symbol is present in the debug and archive versions of the library and I have even tried linking against those with the same results. nm --demangle $BOOST_HOME/lib/libboost_regex-gcc-d.so | grep do_assign 000a65ac W boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned) 000e3b70 W boost::basic_regex<wchar_t, boost::regex_traits<wchar_t, boost::cpp_regex_traits<wchar_t> > >::do_assign(wchar_t const*, wchar_t const*, unsigned) Any insight would be most helpful. Thanks in advance :-) Greg Prosch

1 0

[Boost.Signals] signalN
by Benjamin Lau 14 Apr '06

14 Apr '06

Hello all, I've been searching around the documentation a while but I can't find out up to how many parameters can a signal take in. Or to phrase the question differently, for signalN as referenced in the documentation of Boost.signals: http://www.boost.org/doc/html/signalN.html what is the highest possible N assuming I use an unmodified version of the latest Boost release. Thanks. Benjamin Lau

2 1

[general] Speeding up compilation?
by Lynn Allan 14 Apr '06

14 Apr '06

<alert comment="stl newbie"> vc7.1 Visual C++ user: Sorry if this has been asked before. My impression is that this is the nature of templates, since code is being generated as objects are instantiated. Are there guidelines for speeding up compilation/linkage of code that moderately/heavily uses templates? It seems to take a looooong time, even on a relatively modern development computer. Precompiled headers don't seem to help .... perhaps it is counter-productive to use precompiled headers with stl/boost? Or I'm ignorant about proper usage? Are there vc7.1 / vc8 settings to speed up development? GCC? Is this #define applicable (and/or perhaps others): BOOST_MPL_USE_PREPROCESSED_HEADERS </alert>

5 6

utf8_codecvt_facet linking problem with VC 7.1
by Raider 14 Apr '06

14 Apr '06

I'm trying to compile simple code using utf8_codecvt_facet: // ---- UTF8.cpp starts ------------------------------ #include <iostream> #include <fstream> #include <string> #include <locale> #include <boost/program_options/detail/utf8_codecvt_facet.hpp> using namespace std; int main() { locale loc; locale utf8loc(loc, new boost::program_options::detail::utf8_codecvt_facet()); wifstream f; f.imbue(utf8loc); f.open("UTF8.txt", ios::binary); wstring s; f >> s; f.close(); return 0; } // ---- UTF8.cpp ends ------------------------------ It works OK with VC 8.0 (both building Boost and this code with VC 8.0). But I get linker errors with VC 7.1 (both building Boost and this code with VC 7.1): UFT8.obj : error LNK2001: unresolved external symbol "protected: virtual int __thiscall boost::program_options::detail::utf8_codecvt_facet::do_out(int &,unsigned short const *,unsigned short const *,unsigned short const * &,char *,char *,char * &)const " (?do_out@utf8_codecvt_facet@detail@program_options@boost@@MBEHAAHPBG1AAPBGPAD3AAPAD@Z) UFT8.obj : error LNK2001: unresolved external symbol "protected: virtual int __thiscall boost::program_options::detail::utf8_codecvt_facet::do_in(int &,char const *,char const *,char const * &,unsigned short *,unsigned short *,unsigned short * &)const " (?do_in@utf8_codecvt_facet@detail@program_options@boost@@MBEHAAHPBD1AAPBDPAG3AAPAG@Z) As a linker tells me the reference is: ?do_in@utf8_codecvt_facet@detail@program_options@boost@@MBEHAAHPBD1AAPBDPAG3AAPAG@Z But library (auto-linked libboost_program_options-vc71-sgd-1_33_1.lib) contains: ?do_in@utf8_codecvt_facet@detail@program_options@boost@@MBEHAAHPBD1AAPBDPA_W3AAPA_W@Z When I add Boost/libs/program_options/src/utf8_codecvt_facet.cpp to my VC 7.1 project, the sample code builds fine. The question is how to build this code under VC 7.1? Is it needed to rebuild Boost's libboost_program_options-vc71-*-1_33_1.lib with some compiler options to get ?do_in@utf8_codecvt_facet@detail@program_options@boost@@MBEHAAHPBD1AAPBDPAG3AAPAG@Z export or to build code above with some options to get ?do_in@utf8_codecvt_facet@detail@program_options@boost@@MBEHAAHPBD1AAPBDPA_W3AAPA_W@Z reference?

1 0

[spirit] thread safety / lock freedom
by Tim Blechmann 13 Apr '06

13 Apr '06

hi all, i'm currently looking into the spirit library to create a parser ... it seems to be threadsafe, but it's using thread locks. is it possible to use the library in a lockfree manner? can i be sure, that there will be no lock misses, when i'm not sharing parsers between the threads? thanks in advance ... tim -- TimBlechmann(a)gmx.de ICQ: 96771783 http://www.mokabar.tk All we composers really have to work with is time and sound - and sometimes I'm not even sure about sound. Morton Feldman

2 1

[Xpressive] Baffled about results of search
by Lynn Allan 13 Apr '06

13 Apr '06

<alert comment="xpressive newbie"> vc7.1 xpressive from "vault" as of today (April 11) With the statements below (more or less based on Example 1 and Example 2 in the sample code provided with xpressive), I'm attempting to detect which "group" of subexpressions matched, and getting results that I don't understand (not unexpected for a newbie <g>). std::string altDow( "Alternate days of the week are Tue and Thursday and Sat and Monday." ); sregex rex = sregex::compile( "((Sunday|Sun)" "|(Monday|Mon)" "|(Tuesday|Tue)" "|(Wednesday|Wed)" "|(Thursday|Thu)" "|(Friday|Fri)" "|(Saturday|Sat))" ); The first regex_search sort of works, but I'm unclear what field in the smatch:what variable to use to tell what matched, and some oddities are happening. regex_search( altDow, what, rex ) Length(0): 3 Position(0): 31 what[0]: Tue what[1]: Tue what[2]: what[3]: what[4]: Tue The subsequent searches give valid information about the length and position, but other fields in the smatch:what variable seem invalid. regex_search( altDow.substr(32), what, rex) regex_search( altDow.substr(45), what, rex) Regardless, I'm unclear how to tell which of the "groups" of subexpressions was "hit". With boost::regex there was a way to loop thru the boolean field: what[i].matched and see what "hit", but I am not seeing a comparable accessor. Am I doing something wrong, leaving something out, completely clueless on using xpressive, or is xpressive not intended for this kind of usage? (and if xpressive is appropriate, what statements will provide the intended information?) The intention is to be able to to replace/encode the altDay string to be: Alternate days of the week are <dow=2>Tue</dow> and <dow=4>Thursday</dow> and <dow=6>Sat</dow> and <dow=1>Monday</dow>." ); If it will help, here is a link to the vc7.1 project. http://cleanspeech.sf.net/misc/DayOfWeekTest.zip </alert>

4 10

catch(...) in thread_proxy
by Jeremy Stanley 13 Apr '06

13 Apr '06

I find the catch(...) in thread_proxy to be a real nuisance. The only thing I can do to prevent threads from silently slipping away is to put a catch(...) inside my thread procedure, but when this is hit I have no idea what the exception is or where it was thrown. I could configure the debugger (msvc71) to break whenever an exception is thrown, but then I have to wade through handled exceptions in order to find the real error. There was a discussion on this subject about eight months ago where the consensus seemed to be get rid of the catch(...)--any progress on this since then? I notice the catch(...) is still present in CVS, which isn't encouraging. As a refresher, this approach won't help... try { thread_proc(); } catch(...) { exception_filter(); // ... because I don't have a stack trace here. } This sort of approach could be okay though: if ( swallow_exceptions ) { try { thread_proc(); } catch(...) { whatever(); } } else { thread_proc(); } If swallow_exceptions were on by default, it wouldn't change behavior unless the programmer asked for it, perhaps using an optional parameter in the thread and thread_group constructors.

2 1

High memory requirement of adjacency_list
by Pratyush 13 Apr '06

13 Apr '06

Hi, It seems that adjacency list takes up lot of memory than what I was expecting. Below is the code that I used for testing. int main() { typedef boost::adjacency_list<> graph_t; graph_t g(6045064); } The graph populated is taking about 190MB of memory, i.e., 32 bytes/vertex approx. I was expecting it to take 4 bytes/vertex. Am I doing something wrong? My intent is to use "vec_adj_list_impl" having no properties at all. Thanks & regards, Pratyush

5 8

Release Candiate Download Location?
by Olaf van der Spek 13 Apr '06

13 Apr '06

Hi, What is the location where the current release candidate can be downloaded?

1 0

[format] %d, %u etc. with (unsigned) char types
by Luke Elliott 13 Apr '06

13 Apr '06

I couldn't find anything on this in the list archives or the format docs, but it seems likely to have been asked before so apologies if that is the case. I would expect something like: boost::format fmt("%d"); fmt % char(0); std::cout << fmt; to output "0" given that %d is explicitly specified. This isn't the case (with VC++ 7.1 and GCC 3.4 at least, and presumably all others given this is normal stream behaviour). Obviously it can be worked around by casting to a non-char type, but that seems a shame given the nature of the library and not having to worry about type-safety too much. So, is this by design or accident? If not by design, would it be possible to change the behaviour (specialisation somewhere for (unsigned) char types or something??)? Thanks in advance Luke Elliott.

1 0

Validating file names using regex
by Jean-Sebastien Vachon 13 Apr '06

13 Apr '06

Hi there, I am sure what I am looking for exist somewhere but I haven't been able to find anything that works in boost::regex. What I am looking for is a regular expression that will validate a filename according to the specification of the OS (UNIX systems and Windows). I would be very grateful if someone could provide me with these two expressions (one for Linux and one for Windows). Later,

4 7

[xpressive] Installation prepares .lib files?
by Lynn Allan 13 Apr '06

13 Apr '06

WinXp-SP2 vc7.1 Would it be feasible/advantageous for xpressive to have an installation procedure a'la regex to build a whole series of .lib libraries? That seems to speed up builds quite a bit.

2 1

Iostreams and Tarballs?
by Gareth Foster 13 Apr '06

13 Apr '06

Hello list, I am wanting to manage a file format used by another application in my own application. They have a tar.gz file, renamed to something else. In it, there is an XML file and some .wav sound files. Can I use Boost to handle this? I would want to parse the XML from the archive, and then load a few of the sound files. What I don't want to do is something cheesy like call the tar program from mine! That's'orrible :) Cheers for any help, and code (pseudo or otherwise) would be great. Or just a yes or no you can/can't do that would be a start. Cheers all, Gaz

3 2

[review] promotion traits - result
by Tobias Schwinger 12 Apr '06

12 Apr '06

Dear Boost community, Alexander Nasonov's Promotion Traits have been accepted conditionally into Boost with 4/4 positive votes. The conditions are - an example must be added to the documentation (plus accompanying source code for the example folder), - the reference should be clarified (cv-qualification, bit fields) - further conditions might arise from the merger with the extended library (TypeTraits) and are subject to synchronization with the library maintainer (John Maddock). Thanks to Alexander for the submission and to our reviewers for their work! Regards, Tobias (Review Manager)

1 0

[multi_index] multi index container with Managed C++
by Parag Gadkari 12 Apr '06

12 Apr '06

I am having trouble while using multi index container with the "managed c++" component. Here is the typedef that the compiler won't accept. typedef multi_index_container< gcroot<interface_entity*>, indexed_by< ordered_unique<identity<gcroot<interface_entity*> > >, ordered_non_unique<member<gcroot<interface_entity*>, int,&interface_entity::entity_drawingid> >, > > entity_collection; The real deal is with the member template which needs the address of member variable of the interface_entity class. Entity class is an abstract Managed type (specified with __gc), and it is not allowed to take the address of a non-static member of a managed type. Does anybody know of a workaround? Thanks Parag

2 3

Re: [Boost-users] Validating file names using regex
by Nat Goodspeed 12 Apr '06

12 Apr '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Jean-Sebastien Vachon > Sent: Wednesday, April 12, 2006 3:38 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Validating file names using regex > > I am sure what I am looking for exist somewhere but I haven't > been able to find anything that works in boost::regex. > > What I am looking for is a regular expression that will validate > a filename according to the specification of the OS (UNIX systems > and Windows). > > I would be very grateful if someone could provide me with > these two expressions (one for Linux and one for Windows). [Nat] This isn't what you're asking for -- but would it work to instantiate a boost::filesystem::path with the putative pathname in question and an appropriate checker?

2 1

[xpression] fuzzy on smatch fields
by Lynn Allan 12 Apr '06

12 Apr '06

<alert comment="xpression newbie"> Xpressive looks very promising to be able to do some things I'm trying to implement. Thanks for providing and supporting it. I was trying to figure out the fields that make up xpression smatch'es, and expanded the Example-1 to be more verbose. Basically, I tried to "unpack" as much info as I could find in the variable "what" to clarify some fuzziness on my part. There were some questions: * The suffix and prefix info seemed blank. Are there accessors to get more info to conform to my (possibly flawed) understanding of the docs? * The return from regex_id seemed to be an address (like 00323F58). Is that intended? Is there some accessor to get something more meaningful? (but I'm not clear what would be meaningful). What is the purpose of "regex_id" to the user of xpressive? * With vc7.1, there were warnings unless I cast the lengths and positions ... is this intended? void example1_verbose() { std::string hello( "hello world!" ); sregex rex = sregex::compile( "(\\w+) (\\w+)!" ); smatch what; if( regex_match( hello, what, rex ) ) { std::cout << "Overall Size: " << static_cast<int>(what.size()) << '\n'; std::cout << "Regex Id: " << what.regex_id() << '\n'; std::cout << "what[0]: " << what[0] << '\n'; std::cout << "Length(0): " << static_cast<int>(what.length(0)) << '\n'; std::cout << "Position(0): " << static_cast<int>(what.position(0)) << '\n'; std::cout << "Str(0): " << what.str(0) << '\n'; std::cout << "what[1]: " << what[1] << '\n'; std::cout << "Length(1): " << static_cast<int>(what.length(1)) << '\n'; std::cout << "Position(1): " << static_cast<int>(what.position(1)) << '\n'; std::cout << "Str(1): " << what.str(1) << '\n'; std::cout << "what[2]: " << what[2] << '\n'; std::cout << "Length(2): " << static_cast<int>(what.length(2)) << '\n'; std::cout << "Position(2): " << static_cast<int>(what.position(2)) << '\n'; std::cout << "Str(2): " << what.str(2) << '\n'; std::cout << "Prefix(): " << what.prefix() << '\n'; std::cout << "Prefix().matched: " << what.prefix().matched << '\n'; std::cout << "Prefix().length(): " << static_cast<int>(what.prefix().length()) << '\n'; std::cout << "Prefix().str(): " << what.prefix().str() << '\n'; std::cout << "Suffix(): " << what.suffix() << '\n'; std::cout << "Suffix().matched: " << what.suffix().matched << '\n'; std::cout << "Suffix().length(): " << static_cast<int>(what.suffix().length()) << '\n'; std::cout << "Suffix().str(): " << what.suffix().str() << '\n'; } } Example 1: Verbose: Overall Size: 3 Regex Id: 00323F58 what[0]: hello world! Length(0): 12 Position(0): 0 Str(0): hello world! what[1]: hello Length(1): 5 Position(1): 0 Str(1): hello what[2]: world Length(2): 5 Position(2): 6 Str(2): world Prefix(): Prefix().matched: 0 Prefix().length(): 0 Prefix().str(): Suffix(): Suffix().matched: 0 Suffix().length(): 0 Suffix().str(): </alert>

2 5

link issues with BOOST_AUTO_TEST_CASE() facility
by Pierre-Jules Tremblay 12 Apr '06

12 Apr '06

I would like to use the BOOST_AUTO_TEST_CASE() facility in a static library. Obviously this library does not have a main() so it needs to be linked with a test executable which may run test cases found in one or more of those static libraries. Unfortunately, the tests do not make it past the linker. The executable links fine but runs none of the tests defined in the libraries. Could it be that BOOST_AUTO_TEST_CASE() works via some global which gets stripped when the static lib is created? Do you have a suggestion for a workaround? The idea is to keep some of the lowest-level unit test code in the same translation unit as the class implementation. Thanks, pj

2 3

Obscure error while trying to use Boost XML Serialization (boost::archive::xml_iarchive)
by Dilip 12 Apr '06

12 Apr '06

Hello all I am trying to use Boost Serialization library to de-serialize a complex object hierarchy from XML to its class representation. The class hierarchy gets serialized into XML just fine. But while trying to do the reverse, that is read from XML and pump it into my class, I run into the following compiler error that is driving me nuts. Can someone help please? FYI if its relevant I have a std::list<Stock*> datatype in one of the classes. The error dump is slightly big so I apologize in advance. The compiler is VC 7.1 on windows XP. C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(487) : error C2440: 'reinterpret_cast' : cannot convert from 'const Stock **__w64 ' to 'void ** ' Conversion loses qualifiers C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(484) : while compiling class-template member function 'void boost::archive::detail::load_pointer_type<Archive,Tptr>::invoke(Archive &,Tptr & )' with [ Archive=boost::archive::xml_iarchive, Tptr=const Stock * ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(572) : see reference to class template instantiation 'boost::archive::detail::load_pointer_type<Archive,Tptr>' being compiled with [ Archive=boost::archive::xml_iarchive, Tptr=const Stock * ] C:\Boost\include\boost-1_33_1\boost\archive\basic_xml_iarchive.hpp(80) : see reference to function template instantiation 'void boost::archive::load<Archive,T>(Archive &,T & )' being compiled with [ Archive=boost::archive::xml_iarchive, T=const Stock * ] C:\Boost\include\boost-1_33_1\boost\archive\xml_iarchive.hpp(74) : see reference to function template instantiation 'void boost::archive::basic_xml_iarchive<Archive>::load_override<const X*>(const boost::serialization::nvp<T> &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, X=Stock, T=const Stock * ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(76) : see reference to function template instantiation 'void boost::archive::xml_iarchive_impl<Archive>::load_override<T>(T &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<const Stock *> ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(83) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator >><T>(T &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<const Stock *> ] MarketData.cpp(118) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator &<const boost::serialization::nvp<T>>(const boost::serialization::nvp<T> &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const Stock * ] C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\algorithm(21) : see reference to function template instantiation 'void printeachlevel<T>::operator ()<Stock>(const X *& )' being compiled with [ T=boost::archive::xml_iarchive, X=Stock ] MarketData.cpp(131) : see reference to function template instantiation '_Fn1 std::for_each<std::list<_Ty>::iterator,printeachlevel<T>>(_InIt,_InIt,_Fn1)' being compiled with [ _Fn1=printeachlevel<boost::archive::xml_iarchive>, _Ty=Stock *, T=boost::archive::xml_iarchive, _InIt=std::list<Stock *>::iterator ] C:\Boost\include\boost-1_33_1\boost\serialization\access.hpp(109) : see reference to function template instantiation 'void Stocks::serialize<Archive>(Archive &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive ] C:\Boost\include\boost-1_33_1\boost\serialization\serialization.hpp(81) : see reference to function template instantiation 'void boost::serialization::access::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\serialization\serialization.hpp(140) : see reference to function template instantiation 'void boost::serialization::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(164) : see reference to function template instantiation 'void boost::serialization::serialize_adl<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\serialization\extended_type_info_typeid.hpp(74) : while compiling class-template member function 'void boost::archive::detail::iserializer<Archive,T>::load_object_data(boost::archive::detail::basic_iarchive &,void *,const unsigned int) const' with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(375) : see reference to class template instantiation 'boost::archive::detail::iserializer<Archive,T>' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(369) : while compiling class-template member function 'void boost::archive::detail::load_non_pointer_type<Archive,T>::load_standard::invoke(Archive &,T &)' with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(425) : see reference to class template instantiation 'boost::archive::detail::load_non_pointer_type<Archive,T>::load_standard' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\includ e\boost-1_33_1\boost\archive\detail\iserializer.hpp(418) : while compiling class-template member function 'void boost::archive::detail::load_non_pointer_type<Archive,T>::invoke(Archive &,T &)' with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(572) : see reference to class template instantiation 'boost::archive::detail::load_non_pointer_type<Archive,T>' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\basic_xml_iarchive.hpp(80) : see reference to function template instantiation 'void boost::archive::load<Archive,T>(Archive &,T &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\xml_iarchive.hpp(74) : see reference to function template instantiation 'void boost::archive::basic_xml_iarchive<Archive>::load_override<Stocks>(const boost::serialization::nvp<T> &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(76) : see reference to function template instantiation 'void boost::archive::xml_iarchive_impl<Archive>::load_override<T>(T &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<Stocks> ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(83) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator >><T>(T &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<Stocks> ] MarketData.cpp(179) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator &<const boost::serialization::nvp<T>>(const boost::serialization::nvp<T> &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Stocks ] C:\Boost\include\boost-1_33_1\boost\serialization\access.hpp(109) : see reference to function template instantiation 'void Securities::serialize<Archive>(Archive &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive ] C:\Boost\include\boost-1_33_1\boost\serialization\serialization.hpp(81) : see reference to function template instantiation 'void boost::serialization::access::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\serialization\serialization.hpp(140) : see reference to function template instantiation 'void boost::serialization::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(164) : see reference to function template instantiation 'void boost::serialization::serialize_adl<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\serialization\extended_type_info_typeid.hpp(74) : while compiling class-template member function 'void boost::archive::detail::iserializer<Archive,T>::load_object_data(boost::archive::detail::basic_iarchive &,void *,const unsigned int) const' with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(375) : see reference to class template instantiation 'boost::archive::detail::iserializer<Archive,T>' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(369) : while compiling class-template member function 'void boost::archive::detail::load_non_pointer_type<Archive,T>::load_standard::invoke(Archive &,T &)' with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(425) : see reference to class template instantiation 'boost::archive::detail::load_non_pointer_type<Archive,T>::load_standard' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(418) : while compiling class-template member function 'void boost::archive::detail::load_non_pointer_type<Archive,T>::invoke(Archive &,T &)' with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(572) : see reference to class template instantiation 'boost::archive::detail::load_non_pointer_type<Archive,T>' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\basic_xml_iarchive.hpp(80) : see reference to function template instantiation 'void boost::archive::load<Archive,T>(Archive &,T &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33 _1\boost\archive\xml_iarchive.hpp(74) : see reference to function template instantiation 'void boost::archive::basic_xml_iarchive<Archive>::load_override<Securities>(const boost::serialization::nvp<T> &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(76) : see reference to function template instantiation 'void boost::archive::xml_iarchive_impl<Archive>::load_override<T>(T &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<Securities> ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(83) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator >><T>(T &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<Securities> ] MarketData.cpp(209) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator &<const boost::serialization::nvp<T>>(const boost::serialization::nvp<T> &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Securities ] C:\Boost\include\boost-1_33_1\boost\serialization\access.hpp(109) : see reference to function template instantiation 'void MarketData::serialize<Archive>(Archive &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive ] C:\Boost\include\boost-1_33_1\boost\serialization\serialization.hpp(81) : see reference to function template instantiation 'void boost::serialization::access::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=Mar ketData ] C:\Boost\include\boost-1_33_1\boost\serialization\serialization.hpp(140) : see reference to function template instantiation 'void boost::serialization::serialize<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(164) : see reference to function template instantiation 'void boost::serialization::serialize_adl<Archive,T>(Archive &,T &,const unsigned int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\serialization\extended_type_info_typeid.hpp(74) : while compiling class-template member function 'void boost::archive::detail::iserializer<Archive,T>::load_object_data(boost::archive::detail::basic_iarchive &,void *,const unsigned int) const' with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(375) : see reference to class template instantiation 'boost::archive::detail::iserializer<Archive,T>' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(369) : while compiling class-template member function 'void boost::archive::detail::load_non_pointer_type<Archive,T>::load_standard::invoke(Archive &,T &)' with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(425) : see reference to class template instantiation 'boost::archive::detail::load_non_pointer_type<Archive,T>::load_standard' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(418) : while compiling class-template member function 'void boost::archive::detail::load_non_pointer_type<Archive,T>::invoke(Archive &,T &)' with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(572) : see reference to class template instantiation 'boost::archive::detail::load_non_pointer_type<Archive,T>' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\basic_xml_iarchive.hpp(80) : see reference to function template instantiation 'void boost::archive::load<Archive,T>(Archive &,T &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\xml_iarchive.hpp(74) : see reference to function template instantiation 'void boost::archive::basic_xml_iarchive<Archive>::load_override<MarketData>(const boost::serialization::nvp<T> &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\interface_iarchive.hpp(76) : see reference to function template instantiation 'void boost::archive::xml_iarchive_impl<Archive>::load_override<T>(T &,int)' being compiled with [ Archive=boost::archive::xml_iarchive, T=const boost::serialization::nvp<MarketData> ] MarketData.cpp(223) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_iarchive<Archive>::operator >><const boost::serialization::nvp<T>>(const boost::serialization::nvp<T> &)' being compiled with [ Archive=boost::archive::xml_iarchive, T=MarketData ] C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(493) : error C2664: 'const T *boost::archive::detail::load_pointer_type<Archive,Tptr>::pointer_tweak<const X>(const boost::serialization::extended_type_info &,void *,const T &)' : cannot convert parameter 2 from 'const Stock *' to 'void *' with [ T=Stock, Archive=boost::archive::xml_iarchive, Tptr=const Stock *, X=Stock ] Conversion loses qualifiers

1 1

Boost.Test - memory allocated during test case run prevents memory leak detection?
by Pierre-Jules Tremblay 12 Apr '06

12 Apr '06

We use Boost.Test extensively as our unit test framework. Recently, we introduced some code to check for memory leaks. Each test case is expected to release all the memory it allocates (i.e. fixtures and what not). However, we observe that several of our test cases appear to leak memory when in fact they don't. For instance, a memory leak check when main() exits reveals no leaks, even though leaks were "found" in several test cases. Our observation is that the apparent leaks appear and disappear as we modify the test code. Scrutinizing the code has revealed that adding a BOOST_REQUIRE(true) here and there in the problematic test cases can make this problem go away. Is it at all possible that Boost.Test somehow allocates memory during a test case run, say for logging or other purpose, and doesn't release it before the test case ends? Here is the code we use to check for memory leaks after each test case is run: #define DECLARE_TEST_CASE(name) \ void test##name##__(); \ void test##name##() \ { \ mytestlib::TestCaseResetLeakCheck(); \ const uint32 uiMemUsageBeforeTest = MMGetAllocatedBytes(); \ test##name##__(); \ const uint32 uiMemUsageAfterTest = MMGetAllocatedBytes(); \ const uint32 uiMemUsageDiff = uiMemUsageBeforeTest > uiMemUsageAfterTest ? uiMemUsageBeforeTest - uiMemUsageAfterTest : uiMemUsageAfterTest - uiMemUsageBeforeTest; \ if (uiMemUsageDiff) \ { \ if (mytestlib::TestCaseLeakCheck()) \ { \ BOOST_ERROR("Test " #name " has memory leaks (" << uiMemUsageAfterTest << " != " << uiMemUsageBeforeTest << ", " << uiMemUsageDiff << " bytes leaked)"); \ } \ else \ { \ BOOST_WARN_MESSAGE(false,"Test " #name " has memory leaks (" << uiMemUsageAfterTest << " != " << uiMemUsageBeforeTest << ", " << uiMemUsageDiff << " bytes leaked) (marked as expected)"); \ } \ } \ } \ void test##name##__() DECLARE_TEST_CASE( SomeTest ) { // arbitrary test code goes here... }

2 2

[regex_spirit_xpressive] Are timings of search algo's available vs "by-hand"?
by Lynn Allan 12 Apr '06

12 Apr '06

<alert comment="boost newbie"> I've been impressed by the functionality provided by the regex-related libraries in boost that I've looked at so far. However, before trekking to far-distant "grok-land" off in the mists, I wanted to get some idea if there were negligible or minor or major performance tradeoffs. I've seen comparisons between regex, spirit, and xpressive (that were from several years ago and probably obsolete .... done by the library developers). I'm wondering how these would compare to a "hand-tuned" state-machine routine, and to an automatically generated state-machine from a FSM utility (tend to be bloated but can be fast). My interest is specialized to finding which pattern in a "group" of patterns was detected, and the offset within the testStr. To illustrate, the regex would be something like detecting the full or abbreviated Day-Of-Week: ((Sunday|Sun)|(Monday|Mon)|(Tuesday|Tue) |(Wednesday|Wed)|(Thursday|Thu) |(Friday|Fri)|(Saturday|Sat)) The testStr is something like: std::string testStr = "Alternate days of the week are Tue and Thursday and Sat and Monday. " "And then Monday and Wed and Friday and Sun. " "Near misses are WeD TuE ThU SuN SaT MoN FrI "; The real application is inputting a batch of 2mb files and generating SGML-like output with embedded tags. (e.g. enclose Tue in <dow=2>Tue</dow> and <dow=4>Thursday</dow>) The above seems like the kind of task for which regex libraries would be appropriate, would be beyond strstr, but wouldn't be excessively difficult to accomplish "by hand". The unknown is whether there is a perfomance trade-off in using a regex library, and whether it is positive, negative, minor, or major. I've started some preliminary timings with vc7.1 release /O2 build with HiResTimer using QueryPerformanceTimer in ABOVE_NORMAL_PRIORITY_CLASS Before proceeding much further, this newbie thought it would be good to check if people with real boost experience have done this kind of benchmarking. A search for "benchmark" and "timings" in boost-user and boost-devel didn't turn up much. Preview: so far the preliminary results look VERY GOOD, but "consider the source". </alert>

1 0

[test] Possible race condition? (minor)
by Paul Giaccone 12 Apr '06

12 Apr '06

Boost unit test framework seems to have a race condition in its output. When I run my test program from a shell, I get this output: paulg@klingon 120% ./CubicTest Running 8 test cases... *** No errors detected paulg@klingon 121% ./CubicTest>/dev/null *** No errors detected Note that the second call above, redirecting output to /dev/null, suggests to me that "Running 8 test cases..." goes to standard out and "*** No errors detected" goes to standard error. Because standard error is unbuffered, this can mean that the messages are output in the reverse order. This is the case when I run my program from Eclipse (under Linux), and, in general, will happen if the tests run faster than the time it takes for the buffer to flush to the output. This suggests one of the following is required: * Flush standard out before running the tests * Send all output to the same stream (but this is not recommended, as this would break the defined behaviour of test suites) * Synchronise the two streams by some other means It's possible that Eclipse displays the output to standard error before the output from standard out, but such behaviour isn't seen when executing a makefile, so it seems likely there there is a race condition in Boost unit test framework. Paul

2 1

multi_array math operation.
by chun ping wang 12 Apr '06

12 Apr '06

Question 1: How would i add or subtract multiarray given the fact that i don't know the dimension of it... Like its N dimension where N = 4. and u know both Multi_array A and Multi_Array B has [x][y][z][w] dimension and u want to add them together. Question 2: are there any built in operator for that...the built in + only does pointers address not adding actual object together.

1 0

[xpressive&regex&spirit] Can previous regex be cached?
by Lynn Allan 12 Apr '06

12 Apr '06

<alert comment=<boost newbie"> Xpressive provides a "tips n tricks" to: Compiling a regex (dynamic or static) is more expensive than executing a match or search. If you have the option, prefer to compile a pattern into a basic_regex<> object once and reuse it rather than recreating it over and over. Would it be feasible/advantageous for the regex-related libraries to automagically to "cache" the immediately previous regex compilation? (or provide as an option) I've seen code that had the same regex being compiled inside a loop, which I suppose would really diminish performance. Perhaps this could be detected, and the user/developer "protected from themselves" ... and/or perhaps informed that this is happening? Could there be a "helper" class that somehow or other allowed the last "n" regexes to be cached? (btw .... what is the plural of regex .... regexen? regices?) </alert>

2 1

undefined reference to boost::detail::graph::read_graphviz
by Irek Szczesniak 12 Apr '06

12 Apr '06

Hi, I have a problem with the Boost Graph Library: I'm unable to link with the read_graphviz function. I'm using Boost v. 1.33.1 on Fedora Core 3, Linux 2.6.10, gcc 3.4.4. I try to compile the example boost_1_33_1/libs/graph/example/graphviz.cpp. > g++ -I /usr/local/include/boost-1_33_1/ /home/ijs/boost_1_33_1/libs/graph/src/libbgl-viz.a graphviz.cpp /tmp/ccBWKH7i.o(.gnu.linkonce.t._ZN5boost13read_graphvizINS_14adjacency_listINS_4vecSES2_NS_11undirectedSENS_8propertyINS_13vertex_name_tESsNS_11no_propertyEEENS4_INS_13edge_weight_tEdS6_EES6_NS_5listSEEEEEbRSiRT_RNS_18dynamic_propertiesERKSs+0x6e): In function `bool boost::read_graphviz<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_name_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >(std::basic_istream<char, std::char_traits<char> >&, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_name_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>&, boost::dynamic_properties&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)': : undefined reference to `boost::detail::graph::read_graphviz(std::basic_istream<char, std::char_traits<char> >&, boost::detail::graph::mutate_graph&)' collect2: ld returned 1 exit status I would appreciate any advice. Thanks for reading. Best, Irek

2 2

[xpressive] Glitch with example project re xpressive_typeof.hpp
by Lynn Allan 11 Apr '06

11 Apr '06

<alert comment="boost newbie"> Thanks for providing the example project for demonstrating usage of xpressive. As a windows developer with minimal stl / boost experience, it is a terrific aid for "getting up to speed" (and could be a model for other libraries to provide "baby steps with training wheels" sample code?). Just a glitch: The vc7.1 project file has a reference to xpressive_typeof.hpp, which refers to the non-existent file <boost/typeof/typeof.hpp> ... and it goes downhill from there. The project doesn't actually use xpressive_typeof.hpp, so the example project still compiles/links ok .... I suppose this is an obsolete reference reflecting an earlier configuration? HTH, </alert>

2 1

Serialization: hugo file size, binary archives
by Sascha Ochsenknecht 11 Apr '06

11 Apr '06

Hello, I'm using the Serialization Library of Boost to store my data structure. I want to use the binary archive type by default: boost::archive::binary_oarchive(ostream &s) // saving boost::archive::binary_iarchive(istream &s) // loading But I noticed that these files can be very big compared to the stored data. I got a binary archive with around 1.5GByte. That could be but when I compress it I got only ~200MByte left (!). It seems that there is a lot of 'overhead' data or 'redundant' data (I see a lot of '0' when I look into it with an Hex editor). i tried the gzip (...) filter of the Iostreams library, but I want to avoid this for production due to increasing runtime. Some Information about my data structure (maybe helpful): - using a lot of pointer - using a lot of std::vector Does anybody investigate the same problem? Is there a possibility to decrease the archive size but storing the same amount of data? What could be a solution? Writing an own/optimized (regarding to my data structure) Archive class? thanks in advance Sascha

3 6

Re: [Boost-users] Changing name of function being called in a tem plate
by James Hughes 11 Apr '06

11 Apr '06

Sorry that should read "boost.function does NOT (....." amongst other bad spelling mistakes... James > -----Original Message----- > From: James Hughes [mailto:JHughes@Linx.co.uk] > Sent: 11 April 2006 17:01 > To: 'boost-users(a)lists.boost.org' > Subject: Re: [Boost-users] Changing name of function being called in a > tem plate > > > >Have you checked out Boost.Function? You can use a > >boost::function<void (T &)> > >instance in your class to point to the correct member > function you want > >to call. > > > >Alternatively, you may try to use member function pointer: > > > >template <typename T, void (Observer::*Notify)(T & )> > >class .... > >{ } > > > >Just my 5 cents... > > > >Cheers, > > > >Freddie > > Thanks Freddie, > > boost.function does allows me (I dont think) to specify the > function when > the template is instantiated (it has to be done programmatically). The > alterantive might, but I am unsure of the syntax and how to > use it - could > you add any detail? > > At the moment, it seems like a robust option is to use > macros, and simply > redefine the function name to whatever I want - quick and > simple, but not > very templatey!! > > James > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Re: [Boost-users] Changing name of function being called in a tem plate
by James Hughes 11 Apr '06

11 Apr '06

>Have you checked out Boost.Function? You can use a >boost::function<void (T &)> >instance in your class to point to the correct member function you want >to call. > >Alternatively, you may try to use member function pointer: > >template <typename T, void (Observer::*Notify)(T & )> >class .... >{ } > >Just my 5 cents... > >Cheers, > >Freddie Thanks Freddie, boost.function does allows me (I dont think) to specify the function when the template is instantiated (it has to be done programmatically). The alterantive might, but I am unsure of the syntax and how to use it - could you add any detail? At the moment, it seems like a robust option is to use macros, and simply redefine the function name to whatever I want - quick and simple, but not very templatey!! James

1 0

[shared_ptr] commit/rolback
by Denis G. Priyomov 11 Apr '06

11 Apr '06

Wouldn't it be nice to extend shared_ptr to support transaction-like semantics? Or is it possible already? Sometimes it's needed to execute code on exit only until we haven't reached some point (of "no return"): { shared_ptr<void> cr_guard(static_cast<void*>(0), bind(rollback_fun, x, y)); [...some critical part which should call rollback_fun on failure only...] //don't call rollback_fun if we get here cr_guard.commit(); [...any code that follows...] } Thanks! Wish you well! -=-=-=-=-=-=-=-=-=- Denis G. Priyomov

4 3

Re: [Boost-users] Changing name of function being called in a template
by Wu Yinghui, Freddie 11 Apr '06

11 Apr '06

> From: > James Hughes <JHughes(a)Linx.co.uk> > Date: > Tue, 11 Apr 2006 10:14:12 +0100 > > Hello all, > > I have a feeling this may be off the topic of Boost, so if anyone can point > me in the direction of a better place to ask please do (a templates mailing > list?). However, I post it here because I think Boost::Bind does something > similar internally to what I want to do, so someone may be able to advise. > > I have a couple of templated class which implement a simple observer pattern > (yes I know Boost has signals, but it's not thread safe). > > It uses a virtual function to make a call in to the observer from the > subject. My own observer then derive from this class and implement the > notify function. However, I would like to 'template' the name of the > function, so that different instances of the template can make calls to > different named function. > > Now in Boost:bind you specify the name of the function in the class to be > called, but I don't know how to implement that in my own template class. > > class observer<typename T> > { > virtual void Notify(T&); // This is the function I want to rename > according to the template > } > > so I might want, in a different instance, the Notify function to be called, > Shutdown(). Following code is NOT valid C++, but gives an idea of what I am > trying to implement, but don't know enough yet to do so!! > > class observer<typename T, typename functionname> > { > virtual void <functionname>(T&) > } > > Is there a way I can use templates to do this? Boost:bind can call a > particular member function passed in as part of the template defn, how do I > that? > > I hope that is vaguely clear... > > James Have you checked out Boost.Function? You can use a boost::function<void (T &)> instance in your class to point to the correct member function you want to call. Alternatively, you may try to use member function pointer: template <typename T, void (Observer::*Notify)(T & )> class .... { } Just my 5 cents... Cheers, Freddie

1 0

program_options, /Ob<n>
by Strelnikov Michael 11 Apr '06

11 Apr '06

Hello All, I'd like to parse cl.exe's command line with program_options. po::command_line_style::style_t op_style = po::command_line_style::style_t( po::command_line_style::allow_long | po::command_line_style::allow_long_disguise | po::command_line_style::long_allow_adjacent ); Parses only -Ob=<n> thanks

2 1

Validating a URI according to RFC 3986 using boost::regex
by Jean-Sebastien Vachon 11 Apr '06

11 Apr '06

Hi All, I'm trying to use the regex library in order to validate a generic URI according to the regular expression specified in RFC 3986 - Uniform Resource Identifier (URI): Generic Syntax. Here is the expression: ^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))? As far as I know this is a POSIX compliant regex. I'm building my regex with the following flags: boost::regex::basic | boost::regex::icase Here is the complete code: bool RegExPOSIXValidator::IsValid(const std::string &oName) const { /* -------------------------------------------------------------------- */ /* Build the Regular Expression */ /* -------------------------------------------------------------------- */ boost::regex re(moRegex, boost::regex::basic | boost::regex::icase); return boost::regex_match(oName, re); } The function is returning false for the following URI: http://dimitrov@www.google.ca:88/index1.html?name=dimitrov#title Which seem valid to me. Unless there is something I don't see. I try doubling the \ in front of the ? at the end of the expression as a solution but it didn't help. Any idea?

2 1

serialization of shared_ptrs with non-default deleter and factory construction
by Mikko Vainio 11 Apr '06

11 Apr '06

Dear Sirs, Does anyone have a working example of serialization of shared_ptrs with non-default deleter and factory construction as described in http://www.boost.org/libs/smart_ptr/sp_techniques.html#preventing_delete ? The code below (correctly) triggers error in boost/checked_delete.hpp because the destructor of class X is private. #include <iostream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/shared_ptr.hpp> class X { private: ~X(); class deleter; friend class deleter; class deleter { public: void operator()(X * p) { delete p; } }; friend class boost::serialization::access; template< typename Archive > void serialize(Archive & ar, const unsigned int version) { ar & some_data; } public: static boost::shared_ptr<X> create() { boost::shared_ptr<X> px(new X, X::deleter()); return px; } int some_data; }; inline std::ostream& operator<<( std::ostream& os, const X& x ) { return os << "x = " << x.some_data << std::endl; } using namespace std; int main ( int argc, char* argv[] ) { boost::shared_ptr<X> x = X::create(); x->some_data = 1; cout << *x; std::ofstream ofs("filename"); boost::archive::text_oarchive oa(ofs); oa & x; ofs.close(); std::ifstream ifs("filename", std::ios::binary); boost::archive::text_iarchive ia(ifs); x->some_data = 3; cout << *x; ia & x; cout << *x; } I'm using boost 1.33.1 and gcc 4.0.1 on linux. Any help on this is greatly appreciated. Thanking in advance, Mikko Vainio -- :: Mikko Vainio <mikko.vainio(a)abo.fi> tel + 358 2 215 4600 :: Structural Bioinformatics Laboratory :: Department of Biochemistry and Pharmacy :: Abo Akademi University, Tykistokatu 6A, FI-20520 Turku Finland

1 0

[date-time] fatal error LNK1104
by chanekane 11 Apr '06

11 Apr '06

Hi, I am using boost version 1.33.1 and Microsoft Visual C++ 2005 Express Edition. I have made my own solution in VS to generate my library boost using only the classes I use in my project. Here all is fine. But when I compile my project. I have a Link error : fatal error LNK1104: cannot open file 'libboost_date_time-vc80-mt-1_33_1.lib' I have defined this in user.hpp in my own solution but Nothing changes : #define BOOST_ALL_DYN_LINK Thanks for your help.

1 0

Changing name of function being called in a template
by James Hughes 11 Apr '06

11 Apr '06

Hello all, I have a feeling this may be off the topic of Boost, so if anyone can point me in the direction of a better place to ask please do (a templates mailing list?). However, I post it here because I think Boost::Bind does something similar internally to what I want to do, so someone may be able to advise. I have a couple of templated class which implement a simple observer pattern (yes I know Boost has signals, but it's not thread safe). It uses a virtual function to make a call in to the observer from the subject. My own observer then derive from this class and implement the notify function. However, I would like to 'template' the name of the function, so that different instances of the template can make calls to different named function. Now in Boost:bind you specify the name of the function in the class to be called, but I don't know how to implement that in my own template class. class observer<typename T> { virtual void Notify(T&); // This is the function I want to rename according to the template } so I might want, in a different instance, the Notify function to be called, Shutdown(). Following code is NOT valid C++, but gives an idea of what I am trying to implement, but don't know enough yet to do so!! class observer<typename T, typename functionname> { virtual void <functionname>(T&) } Is there a way I can use templates to do this? Boost:bind can call a particular member function passed in as part of the template defn, how do I that? I hope that is vaguely clear... James

1 0

multitoken program_options
by Javier Gonzalez 10 Apr '06

10 Apr '06

Hi, I'm using the program_options library and wanted to have two multitoken options, but it seems the only multitoken option allowed has to be last one in the line. I want something like: ./my_program --files-a a* --files-b b* but when I declared the files-a option to be multitoken, then it treats '--files-b' like a value of the files-a option. Isn't there a way to do that? thanks Javier

1 0

[BGL]: adjacency_list_io bug?
by Sebastian Weber 10 Apr '06

10 Apr '06

Hello everybody! I'm using adjacency_list_io to import my graphs from the disk: typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS > graph_t; graph_t wwwg; //string dataFile("www.bdat"); string dataFile("www_undirected.bdat"); cout << "importing www network from file \"" << dataFile << "\" ... "; ifstream wwwDatIn(dataFile.c_str()); wwwDatIn >> read( wwwg ); wwwDatIn.close(); This works nicely with g++ 3.3, but g++ 4.0 refuse to compile this code and chokes with an error message like /home/sebi/projects/diplom/src/boost_1_33_1/boost/graph/adjacency_list_io.hpp: In member function 'boost::GraphParser<Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset>& boost::GraphParser<Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset>::operator()(std::istream&) [with Graph_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, VertexProperty = boost::no_property, EdgeProperty = boost::no_property, VertexPropertySubset = boost::no_property, EdgePropertySubset = boost::no_property]': /home/sebi/projects/diplom/src/boost_1_33_1/boost/graph/adjacency_list_io.hpp:327: instantiated from 'std::istream& boost::operator>>(std::istream&, boost::GraphParser<Graph, VP, EP, VPS, EPS>) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, VP = boost::no_property, EP = boost::no_property, VPS = boost::no_property, EPS = boost::no_property]' I have no clue where this comes from, but it seems to be some incompatibility between g++ 4.0 and adjacency_list_io. Would be nice if someone could enlighten me or fix it. Thanks! Sebastian My system: Ubuntu 5.10, Boost 1.33.1, anything else needed?

4 8

Regex Submatch Position Question
by admin＠geocodenet.com 10 Apr '06

10 Apr '06

Hi all, Quick question about the Boost::Regex library. Is there a way to identify, with sub-matches, where a match in the search string is made and the length of the match? For instance, with the following regular expression and search string: Regex ==> "(\d+)" Search String ==> "Give me 100 dollars or give me 2001 dollars." Is there a way to determine that the subexpression matched at positions 8 and 31 in the search string, and that the lengths of the matches were three and four characters? Thanks

4 5

[boost][bgl] kevin-bacon.cpp example
by Harsh Deshmane 10 Apr '06

10 Apr '06

Hello Doug, I am trying to create a custom visitor class, for bfs, which accumulates all predecessors (based on Doug Gregor's suggestion for finding all paths between 2 vertices) I compiled and ran this example from the examples dir. However, the output is not consistent with kevin_bacon.expected in the example dir. Output I get is listed below (top lines) $ a.out William Shatner has a Bacon number of 0 has a Bacon number of 1 Denise Richards has a Bacon number of 0 has a Bacon number of 0 Patrick Stewart has a Bacon number of 0 has a Bacon number of 0 Steve Martin has a Bacon number of 0 Gerard Depardieu has a Bacon number of 0 has a Bacon number of 0 Clint Howard has a Bacon number of 0 Sean Astin has a Bacon number of 0 ..... (basically, all values are zero) except the first. http://www.boost.org/libs/graph/example/kevin-bacon.cpp I am using boost version 1.33.0/x86_64/include/boost-1_33 gcc version 3.2.3 20030502 (Red Hat Linux 3.2.3-52) If possible, can someone please check whether the output you get is the correct one ? regards, -harsh

2 1

[iterator] joint_iterator?
by Shunsuke Sogame 10 Apr '06

10 Apr '06

Hi gurus, I compared Boost.MPL Views... http://www.boost.org/libs/mpl/doc/refmanual/views.html with Boost.Iterator adaptors... http://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors I think joint_iterator seems missing from Boost.Iterator. Is such iterator impossible or prohibited by STL? -- Shunsuke Sogame

2 2

[BGL] bug in PLOD algorithm
by Johan Oudinet 10 Apr '06

10 Apr '06

Hi, I'm using Parrallel Boost Graph Library to generate some graphs and compute their pagerank. I found the PLOD algorithm and I'd like using it with bidirected graphs. But, the PLOD algorithm generates self_edges whereas I put allow_self_edges to false. I look at the code in plod_generator.hpp and found that the next(directed_tag) function never uses allow_self_edges boolean ! I think it's a bug... I suggest replace: current.second = x(*gen); with: do { current.second = x(*gen); } while (current.first == current.second && !allow_self_loops); Regards, -- Johan

2 1

[Graph] How to free memory allocated when constructing a graph?
by Olivier Delalleau 10 Apr '06

10 Apr '06

I am constructing a graph exactly the same way as in the spanning tree example here: http://www.boost.org/libs/graph/example/prim-example.cpp i.e. using a constructor of the kind Graph g(edges, edges + sizeof(edges) / sizeof(E), weights, num_nodes); where Graph is some kind of adjacency_list. In my application, edges is rather big (on the order of 1e7 elements). Problem: when this constructor is called, it allocates a huge amount of memory (I see this when I do a 'top' to monitor the memory usage while in gdb). And this memory is not freed when the graph is deleted (when it gets out of the scope, or, if I use a pointer instead, when I delete it explicitely). Is there a way to recover this memory? Any hint on how to make it use less memory? Thank you, Olivier

2 1

Re: [Boost-users] FW: adjacency_list remove_edge
by Sean Kelly 10 Apr '06

10 Apr '06

Hi Doug, here is the example code that works - XFlatGraph is a listS, listS adjacency_list. Note if I replace the remove edge expression with remove_edge(*iter, _graph) the edge is intermittently not removed thanks Sean XFlatGraph& graph = _flat_view->get_graph(); XFlatEdgePMap& edge_pmap = get(kFlatGraphEdgeProperty, graph); std::list<XFlatView::edge_descriptor> scheduled_for_removal; XFlatView::edge_iterator current, end; tie(current, end) = edges(graph); for(;current!=end;++current) { if(edge_pmap[*current]->get_impl()->isSimulationOnly()) { scheduled_for_removal.push_back(*current); } } // Remove edges marked as simualtion only scheduled_for_removal.unique(); for(std::list<XFlatView::edge_descriptor>::iterator iter = scheduled_for_removal.begin(); iter != scheduled_for_removal.end(); ++iter) { remove_edge(source(*iter, graph), target(*iter,graph), graph); } System Information: compiler info: Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 13.10.3077 for 80x86 Copyright (C) Microsoft Corporation 1984-2002. All rights reserved. Boost version 1-32 -----Original Message----- From: boost-users-bounces(a)lists.boost.org [ mailto:boost-users-bounces@lists.boost.org] On Behalf Of Doug Gregor Sent: Thursday, March 02, 2006 12:42 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] FW: adjacency_list remove_edge On Mar 1, 2006, at 6:33 PM, Sean Kelly wrote: > I have observed the following behavior using the remove_edge function > and am curious if anyone else has seen this. > > remove_edge(edge_descriptor, graph) // occasionally fails in a > seemingly indeterminant way > > remove_edge(source(edge_descriptor, graph), > target(edge_descriptor, graph), > graph) // works fine It sounds like either the edge_descriptor is getting invalidated or there is a bug somewhere in remove_edge. > The adjacency list I am using is listS listS, and this is not an issue > with invalid edge_iterators, i.e. I collect all the edge_descriptors > to be removed before removing them. Are you sure that there are no duplicate edge descriptors? > I can provide more detailed info upon request. We won't be able to help without more detailed information. Doug _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Shortest Path City map
by Jeroen Vanattenhoven 10 Apr '06

10 Apr '06

Hello, I'm just learning and reading about the graph theory and shortest path algorithms. For graph representation there are 3 possibilities: adjacency matrix for dense graphs, adjacency lists for sparse graphs and edge lists. The road network of a city map belongs to which category? I've also been reading that Dijkstra is applied to a directed graph. Calculating the shortest route in a city map implies an undirected graph (am I wrong?). So how can I do shortest path calculation of a city map the best way? Jeroen

2 1

[Graph] Very minor typo/doc-bug in bellman-ford example
by Greg Link 10 Apr '06

10 Apr '06

I'm not quite sure where to submit this, but the main boost.org site noted that bug reports are often best reported to mailing lists, so here goes. In the documentation for the Bellman-Ford algorithm, there is an example program (bellman-example.cpp) that contains the following 'main' function (snippet): main() { enum { u, v, x, y, z, N }; char name[] = { 'u', 'v', 'x', 'y', 'z' }; typedef std::pair < int, int >E; const int n_edges = 10; E edge_array[] = { E(u, y), E(u, x), E(u, v), E(v, u), E(x, y), E(x, v), E(y, v), E(y, z), E(z, u), E(z,x) }; ... Note that edge_array[] is of type "E", which of course, should be "Edge". The example doesn't work as listed, as such. - Greg Link

2 1

Using raph algorithm
by David Zweigenhaft 10 Apr '06

10 Apr '06

Does anyone know how to achieve the following: * find all the paths between 2 nodes ? Or, find the first N shortest paths between 2 nodes ? * find the shortest path using include/exclude constraints (passing through list of nodes) * BWY - am I using the correct mailing list ?

2 1

cvs activity
by Serge Skorokhodov 10 Apr '06

10 Apr '06

Hi, Whenever I try to update boost source tree from sf.net, I see no changes. Is it just a low activity period or I missed the change of the settings? TIA -- Serge

2 1

(no subject)
by Karim Bakir 10 Apr '06

10 Apr '06

Hi , I have a problem, I can' use boost multi array as private member, I have the mistake: "unexpected extents" I can only return a boost multi array in my function Thanks // KOKO.h: interface for the KOKO class. // ////////////////////////////////////////////////////////////////////// #if !defined(AFX_KOKO_H__3E4A2230_0446_43C2_BD69_6FF9C2614C02__INCLUDED_) #define AFX_KOKO_H__3E4A2230_0446_43C2_BD69_6FF9C2614C02__INCLUDED_ #if _MSC_VER > 1000 #pragma once #endif // _MSC_VER > 1000 #include "boost/multi_array.hpp" #include <cassert> using namespace std; using namespace boost; class KOKO { typedef boost::multi_array<double,3> array_type_3dd; public: KOKO(); virtual ~KOKO(); boost::multi_array<double,3>MiseEnFormeMatrice3D(vector<double>data,int nbJourSimule, int na, int nbEnergie); private: int d1; int d2; int d3; array_type_3d myvector(boost::extents[d1][d2][d3]); }; #endif // !defined(AFX_KOKO_H__3E4A2230_0446_43C2_BD69_6FF9C2614C02__INCLUDED_) --------------------------------- Nouveau : téléphonez moins cher avec Yahoo! Messenger ! Découvez les tarifs exceptionnels pour appeler la France et l'international.Téléchargez la version beta.

6 6

[BGL] Survivability Network Design Problem
by Alejandro Aragón 10 Apr '06

10 Apr '06

Hello everybody, I was wondering if anybody had to implement the SNDP problem using graphs. Is there anything in the boost library that deals with this problem? In the SNDP we have to design a graph having certain degree of redundancy (cycles in the graph) so if you remove one edge, then you can still reach every part in the graph. Stated in a different way, you should be able to have different paths between two vertices in the graph. So far I have seen only algorithms to deal with minimum spanning trees. I appreciate anything related to this problem. Alejandro Aragon

2 1

Selective depth-first search in a graph
by Anatoli Sakhnik 10 Apr '06

10 Apr '06

Hello, boost users! Is there a simple way to perform a selective depth-first search in a graph, so that I could choose edges to traverse the graph? For example, let's assume I can walk through an edge, only if its weight is greater than 0. How could I reveal all reachable vertices? It worth pointing out that the real availability condition is a little bit more complicated, but easity can be revealed from edge's inner properties. Thank you in advance! -- Anatoli Sakhnik

2 1

Boost and CPAN and CodeProject
by Lynn Allan 10 Apr '06

10 Apr '06

From: "Eric Niebler" <eric(a)boost-consulting.com> > evening, and he asked why C++ didn't have the equivalent of Perl's CPAN > -- that is, a huge repository of useful code to which anybody can > submit. No releases. No quality assurance. No reviews. Survival of the > fittest. Here's a wacky thought: can we turn boost-sandbox into CBAN > (the Comprehensive Boost Archive Network), and cherry-pick the best > libraries from CBAN for inclusion in boost? If anybody could make > something like this fly, it's boost. We'd need to look closely at the > CPAN model to find out why it's successful. Something this boost newbie would find valuable would be the equivalent of codeproject.com (or a Boost section within codeproject ... there is a section for STL). http://www.codeproject.com/vcpp/stl/ This might be yet another repository for code examples and "best practices" that are "peer reviewed" ... and there is certainly as element of "survival of the fittest".

1 0

embedded platform setup help, please
by Garrett Weinberg 10 Apr '06

10 Apr '06

Hi all, I'm trying to use a few header-only Boost libraries in an embedded environment -- to be specific, an SH4 platform that runs Windows CE.NET 4.2. My IDE is Embedded Visual C++ 4.0. My minimal "hello world" does nothing interesting but instantiating a simple boost::shared_array of chars. I get the following unresolved external when linking: minimal.obj : error LNK2019: unresolved external symbol __InterlockedDecrement referenced in function "public: void __cdecl boost::detail::sp_counted_base::release(void)" (?release@sp_counted_base@detail@boost@@QAAXXZ) SH4Rel/minimal.exe : fatal error LNK1120: 1 unresolved externals Further information: My compiler /? output is: "Microsoft (R) C/C++ Optimizing Compiler Vers. 12.20.9518 for Hitachi SH" This compiler does support Exceptions and RTTI when you turn on the right switches (/GX and /GR, respectively), provided that you link against a library that has also been custom-built (using WinCE Platform Builder) to support these features (the default CE 4.2 SDK's lib does not). I have tried the WinCE 4.2's (limited) native C++/STL as well as STLPort -only and Dinkumware-only implementations. I get the same unresolved external in each case. Any help would be greatly appreciated. Thanks in advance, Garrett

2 2

Re: [Boost-users] Delayed write file handling
by Andrew Holden 10 Apr '06

10 Apr '06

> -----Original Message----- > From: James Hughes [mailto:JHughes@Linx.co.uk] > Sent: Monday, April 10, 2006 11:59 AM > For example, if our machine power fails, we have very limited amount of > battery backup to store everything cached to flash before we run out of > watts, so whatever scheme I implement needs to be able to be told to flush > immediately - can I do that with streambufs? I think you can force a stream to flush immediatly with something similar to the following: outputStream << std::flush;

1 0

Re: [Boost-users] Delayed write file handling
by James Hughes 10 Apr '06

10 Apr '06

> -----Original Message----- > From: me22 [mailto:me22.ca@gmail.com] > Sent: 10 April 2006 16:24 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Delayed write file handling > > > On 4/10/06, James Hughes <JHughes(a)linx.co.uk> wrote: > > My question is this - does Boost provide anything that does > this already (or > > does anyone know of anything that does), or am I looking at > this the wrong > > way? Should I look at boost filesystem, and provide extra > bits to implement > > what we need? Alternatives? > > > > I'm not certain that you need Boost for this. > > streambufs are already designed to buffer information, so simply > providing a large enough buffer for the amount of information > generated on average in the time span you wish between writes ought to > limit writes enough for your application. > > The main issue I foresee would be insuring that std::endl isn't used > when you don't want the flush and insuring that the implementations of > your streambufs actually use the buffer as you're expecting. > > ~ SWMc I can see what you are getting at, but I am not sure that it would give us everything we need. For example, if our machine power fails, we have very limited amount of battery backup to store everything cached to flash before we run out of watts, so whatever scheme I implement needs to be able to be told to flush immediately - can I do that with streambufs? Hmm. I will look in to it though, as I like the concept. James

1 0

Delayed write file handling
by James Hughes 10 Apr '06

10 Apr '06

Hello all, not sure if this is the right place to ask, but there maybe something in boost that can help. I would like to use/write some file handling classes that implement something like delayed writing. The reason is that on our embedded device, we need to log information to flash memory. This information may be generated very frequently (every second or more). However, since our devices are in the field for long periods of time (8-10 years) this means that to continually be writing to flash memory, we can reach the limit of the capability of the flash re-write cycle (10k to 1mill erases before failure depending on quality), even when using a load levelling fs like Jffs2 (running on Linux). By delaying to write of the logging information so that the classes 'cache' data until either told to write by the system, or a time limit is reached, we can dramatically reduce the amount of flash erasing done. I would like to do this transparently to the end user, by perhaps writing a iostream class that handles it all (with some extra bits to handle urgent shutdowns and user requested flushes). My question is this - does Boost provide anything that does this already (or does anyone know of anything that does), or am I looking at this the wrong way? Should I look at boost filesystem, and provide extra bits to implement what we need? Alternatives? James Hughes

2 1

[string] HowTo: equiv of printf("%.5s\n", myBuf10);
by Lynn Allan 10 Apr '06

10 Apr '06

I've been puzzled about doing the equivalent of: printf("%.5s\n", myBuf10); and also: printf("%.*s\n", 5, myBuf10); std::string myBuf10("0123456789"); const char* pBuf = myBuf10.c_str(); printf("%.5s\n", pBuf); printf("%.*s\n", 5, pBuf); cout << myBuf10.substr(0, 5) << endl; // works ok -> 01234 cout << setw(5) << myBuf10 << endl; // 0123456789 I've used: myBuf10.substr(0, 5); and also ostringstream but it seems like there might be a simpler way. setw(5) doesn't work to accomplish truncation (at least for me). It seems more for padding. Am I unaware of some iomanip functionality to accomplish this? I suppose I could do something like: char hack = myBuf[5]; myBuf[5] = '\0'; .... do something myBuf[5] = hack; (may or may not be portable?) Note: newbie with std::string ... using Microsoft vc7.1 compiler Thanks.

3 5

thread safe dynamic array and matrix
by Lars Schouw 10 Apr '06

10 Apr '06

Does boost provide me with a thread-safe dynamic array and/or matrix? The container should be thread safe for write from many thread at the same time for chaning information in the elements stored in the array. Regards Lars Schouw --------------------------------- Talk is cheap. Use Yahoo! Messenger to make PC-to-Phone calls. Great rates starting at 1¢/min.

1 0

Program Options: What to do with positional_options_description?
by Olaf van der Spek 09 Apr '06

09 Apr '06

Hi, The example says: positional_options_description pd; pd.add("output-file", 2).add_optional("input-file", -1); But what do I do with pd after this?

1 0

boost::bind and std::copy for member functions
by Leon Mergen 09 Apr '06

09 Apr '06

Hello, Ok, this is what I'm trying to do: I want to define some base class A which has a container with elements it needs to sort. I want to be flexible with the comparison function, so the base class A will define an abstract comparison function which will be implemented by derived classes. Since std::sort () expects function objects, after a lot of asking around I found out I needed to use boost::bind. However, trying almost all different types of combinations and looking up all kind of manuals, I'm pretty much clueless... Here's the test-case code: --- #include <algorithm> #include <string> #include <vector> #include <boost/bind.hpp> class A { public: virtual bool sort (std::string const * const & a, std::string const * const & b) const = 0; void func () { // std::sort ( _elements.begin(), _elements.end(), boost::mem_fn ( A::sort) ); std::sort ( _elements.begin(), _elements.end(), boost::bind ( A::sort, this, _1, _2 ) ); } private: std::vector < std::string * > _elements; }; class B : public A { public: virtual bool sort (std::string const * const & a, std::string const * const & b) const { return true; } }; class C : public A { public: virtual bool sort (std::string const * const & a, std::string const * const & b) const { return false; } }; --- I hope the code makes it a bit more clear as to what I'm trying to do... I follow examples listed at threads like http://blog.gmane.org/gmane.comp.lib.boost.user/day=20050617 , and well, this is almost a literate copy of some recommendations but it doesn't work: -- sort.cpp: In member function ‘void A::func()’: sort.cpp:13: error: no matching function for call to ‘bind(<unknown type>, A* const, boost::arg<1>&, boost::arg<2>&)’ /usr/local/include/boost/bind.hpp:1416: note: candidates are: boost::_bi::bind_t<boost::_bi::unspecified, F, typename boost::_bi::list_av_3<A1, A2, A3>::type> boost::bind(F, A1, A2, A3) [with F = bool (A::*)(const std::string* const&, const std::string* const&)const, A1 = A*, A2 = boost::arg<1>, A3 = boost::arg<2>] /usr/local/include/boost/bind/bind_mf_cc.hpp:78: note: boost::_bi::bind_t<R, boost::_mfi::cmf2<R, T, A1, A2>, typename boost::_bi::list_av_3<A1, A2, A3>::type> boost::bind(R (T::*)(B1, B2)const, A1, A2, A3) [with R = bool, T = A, B1 = const std::string* const&, B2 = const std::string* const&, A1 = A*, A2 = boost::arg<1>, A3 = boost::arg<2>] -- and well, the error is cryptic enough for me to not quite understand what I'm doing wrong... any suggestions ? Thanks in advance! Regards, Leon Mergen

2 2

[string] Are std::string's null terminated?
by Lynn Allan 08 Apr '06

08 Apr '06

Sorry if this is off-topic. Just wanted to check .... are std::string's defined to be null terminated? I came across a web page that indicated they are, but you can find lots of misinformation on the web. http://www.codeproject.com/string/cppstringguide2.asp std::string's seem to be null terminated with the Microsoft vc7.1 and vc8 compiler, but I wanted to check if this is generally true according to the C++ standard. I'm relatively new to stl and using std::string .... mostly have used C strings and MFC CStrings (which changed from vc6 to vc7.1?) std::string strA = "ABC"; std::string strB = "DEF"; std::string strC = "GHI"; std::string strD = "JKL"; std::string strE = "MNO"; // Check if std::string's are null terminated const char* pTest = strC.c_str(); for (int i = 0; i < 80; ++i) { printf("I: %2d ch:%3d %c\n", i, pTest[i], pTest[i]); } std::string testStrings[] = { "abc", "def", "ghi", "jkl" }; const char* p = testStrings[1].c_str(); printf("\n********************\n"); for (int i = 0; i < 80; ++i) { printf("I: %2d ch:%3d %c\n", i, p[i], p[i]); } printf("\n********************\n"); TIA,

7 9

total noob help: LAMBDA with zip_iterator
by chun ping wang 08 Apr '06

08 Apr '06

I have several questions that I asked earlier but never got an answer. So I will start one by one.. a.) How do I use lambda with zip_iterator. (assuming you have a zip_iterator of vector, list, map)? Thats my first question...

2 3

[FYI] RCF 0.2
by Jarl Lindrud 08 Apr '06

08 Apr '06

Hi all, I just thought I would announce that I've released v. 0.2 of RCF, a portable C++ IPC framework. It makes extensive use of boost, including Boost.Threads, Boost. Serialization, and the recently accepted asio library, so maybe people on this list will find it of interest :) http://www.codeproject.com/threads/Rcf_Ipc_For_Cpp.asp /Jarl.

1 0

regex_search? Which subexpression smatch'ed?
by Lynn Allan 08 Apr '06

08 Apr '06

<alert comment="boost and regex newbie"> I'm using regex_search to detect which subexpression matched. I adapted the "Captures" example at: http://www.boost.org/libs/regex/doc/captures.html In the snippet below, it works ok to loop thru m[num].matched, but I was wondering if there was a more direct way of getting the information about which match was "hit". (The real application is going to have about 70 possible subexpressions to match against, instead of just four.) std::string contents("String has two, three, one, and four in it. "); boost::regex reg("(one)|(two)|(three)|(four)"); >From the above, I want the output to be: <match=2>two <match=3>three <match=1>one <match=4>four void test_search() { boost::smatch m; std::string contents("String has two, three, one, and four in it. "); boost::regex reg("(one)|(two)|(three)|(four)"); std::string::const_iterator it = contents.begin(); std::string::const_iterator end = contents.end(); while (boost::regex_search(it, end, m, reg)) { for (int num = 1; num <= 4; ++num) { if (m[num].matched == true) { std::cout << "<match=" << num << ">" << m[0] << std::endl; break; } } it = m[0].second; } } </alert>

4 12

Re: [Boost-users] Boost Graph Library: Shortest path problem
by Grégoire Dooms 07 Apr '06

07 Apr '06

> > Date: Fri, 07 Apr 2006 11:39:20 +0200 > From: Steven Van Ingelgem <steven.vaningelgem(a)dpd.be> > Subject: [Boost-users] Boost Graph Library: Shortest path problem > To: boost-users(a)lists.boost.org > Message-ID: > <D3D675A5A7892D4287068E36BAFABB91016EC6DD(a)dcexch2.dpdbe.com> > Content-Type: text/plain; charset=us-ascii > > Hi, > > > > I have a problem with using (actually with finding the correct function > for my problem) the BGL. > > What I have is 5000 cities (vertices), 14000 roads (edges) between them > (directional roads)... And what I want to know is which roads I have to > take to encounter the least cities on my way. > Simple answer: take no road at all ;-) > Every edge has a weight of 1... So the documentation points me to using > the breadth_first_search algorithm. > > But this function - as far as I can see - goes through the entire graph. > I don't see any way to stop it (for example when it has discovered my > targetcity)?? > Sorry about that, I did know you had a target city. If you want to stop at the target city, the short answer is : use a visitor and throw an exception. void breadth_first_search(const Graph& g, typename graph_traits<Graph>::vertex_descriptor s, Buffer& Q, BFSVisitor vis, ColorMap color); The BFSVisitor can be made with the make_bfs_visitor http://www.boost.org/libs/graph/doc/bfs_visitor.html pass it an eventlist made of a predecessor_recorder and a custom eventprocessor use breadth_first_search(g, s, Q, make_bfs_visitor(make_pair(record_predecessors(predecessor_map, on_tree_edge), my_eventvisitor(target_node)), colormap) with struct my_eventvisitor : public boost::base_visitor<my_eventvisitor>{ typedef boost::on_finish_vertex event_filter; Graph::vertex_descriptor target; my_eventvisitor(Graph::vertex_descriptor target): target(target) {} template <class Vertex, class Graph> void operator()(Vertex v, Graph& g) { if (v==target){ throw TargetDiscoveredException; } }; I did not try to compile this but it should be along the lines of what you are looking for. > Is it possible someone can point me where I can have a look at? > In short I need to calculate (a lot) of roads from different cities to > other cities (so it's not that I always have the same root vertex). > > If you have to compute the distance for nearly all pairs of cities, you might want to look for one of the all pairs shortest paths. Hope this helps, -- Gregoire Dooms

1 0

Re: [Boost-users] Serialization: crash atlaunchofprogram(duetoboost::serialization::base_object)
by RIVASSEAU Jean Noel 07 Apr '06

07 Apr '06

Hi I've tried to set up a small example that can reproduce the problem, however I cannot seem to succeed... One thing is sure, the crash is due to the BSL and the base_object thing, because if I change this only thing, the program goes from running perfectly to crashing at launch. Note that it is not really a problem of a class having multiple parents (this could happen if for example you use multiple inheritance). It is a problem of a class "switching parents". Jean-Noël -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : vendredi 7 avril 2006 06:25 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] Serialization: crash atlaunchofprogram(duetoboost::serialization::base_object) Note that there is a test test_..._mi which tests serialization with classes which have multiple parents. So I would hope that this wouldn't be a problem. But you never know Robert Ramey RIVASSEAU Jean Noel wrote: > Ok, I will try to send a small example to the list tomorrow. In fact > I think everything lies in the fact that using > boost::serialization::base_object also registers the fact that the > classes are parent and child. The serialization system needs to know > that in order to make casts later. > > Somehow it probably does not like it when it tries to register > several different classes as the parent of the same class. > > Jean-Noël

2 1

Boost Graph Library: Shortest path problem
by Steven Van Ingelgem 07 Apr '06

07 Apr '06

Hi, I have a problem with using (actually with finding the correct function for my problem) the BGL. What I have is 5000 cities (vertices), 14000 roads (edges) between them (directional roads)... And what I want to know is which roads I have to take to encounter the least cities on my way. Every edge has a weight of 1... So the documentation points me to using the breadth_first_search algorithm. But this function - as far as I can see - goes through the entire graph. I don't see any way to stop it (for example when it has discovered my targetcity)?? Is it possible someone can point me where I can have a look at? In short I need to calculate (a lot) of roads from different cities to other cities (so it's not that I always have the same root vertex). Thanks for any suggestion! Steven Van Ingelgem

2 1

[LAMBDA] calling a function pointer stored in a struct
by Imre 07 Apr '06

07 Apr '06

Hi I'm new to the boost::lambda lib, and have a problem. I have a list that stores struct objects. One field of the struct is a function pointer. I'd like to call the function pointer stored in each element of the list, but I can't get it right. First, I tried something like this: struct S { typedef void (*Func)(); Func f; ... }; ... std::list<S> l; ... for_each(l.begin(), l.end(), bind(&S::f, _1)); I think this doesn't work because the bind yields a function object that returns f itself, but doesn't call it. Instead, I'd need to build a function object that returns the result of calling the f stored in the current list node. Unfortunately, I don't know how to do it. Thanks for any help. Imre

2 1

How to parse_config_file with blank key value?
by Matt England 07 Apr '06

07 Apr '06

Summary: Is it possible for the program_options parse-config-file capability to support a config file that has a "blank" keyword value as per this config file example: ---- cut here ---- username= password= ---- cut here ---- This file would be parsed as if there's no value set for these keys/parameters/settings. More background: I manage a development group that uses Boost, and our developers aren't sure how to do this, and I'm posting on their behalf. The answer is not obvious to me at: http://boost.org/doc/html/parse_config_file.html Are there other, pertinent docs? We want to do this to assist the users of our software to know which values *can* be set...without setting them in a default config file. -Matt

1 0

Re: [Boost-users] Serialization: crash at launch ofprogram(duetoboost::serialization::base_object)
by RIVASSEAU Jean Noel 07 Apr '06

07 Apr '06

Ok, I will try to send a small example to the list tomorrow. In fact I think everything lies in the fact that using boost::serialization::base_object also registers the fact that the classes are parent and child. The serialization system needs to know that in order to make casts later. Somehow it probably does not like it when it tries to register several different classes as the parent of the same class. Jean-Noël -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : jeudi 6 avril 2006 17:20 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] Serialization: crash at launch ofprogram(duetoboost::serialization::base_object) I would be wiling to look at a small example which demonstrates the problem. Robert Ramey RIVASSEAU Jean Noel wrote: > I have tried to use versioning. Exact same problem. > > More explanations: if I use the version facility, and at load I > switch the boost::serialization::base_object<MyBaseClass> depending > on the version, the same crash will happen. > > Eg: this code: > > if (version == 0) > { > boost::serialization::base_object<MyBaseClass_1> > } > Else > { > boost::serialization::base_object<MyBaseClass_2> > } > > Will cause the same crash. > > So, could you look at the code, because currently there is no way to > change the base class of an object appearing in serialized archives, > if you want to be able to read old archives. > > It seems like there is a bug, if the base_object is used several > times with different classes, the crash will appear. > > Thanks > > Jean-Noël > > > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] De la part de Robert > Ramey > Envoyé : mercredi 5 avril 2006 17:15 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] Serialization: crash at launch of program > (duetoboost::serialization::base_object) > > The "version" facility is provided for maintaining the ability to > read old > archives. It doesn't sound like you're using this and its sounds > like you > should be. > > Robert Ramey > > > "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message > news:87F60F7FA02FF749AFB02BD9FCAA6B0401074928@naserv31.nanterre.oberthurcs.com... > Hello, > > My program crashes at launch (not even a exit(0) as the first line of > main(int argc, char *argv[]) will stop it from crashing), due to the > BSL. > > What I am trying to do is: I have a class, whose serialization is > split (eg, > save and load functions are provided, and they are different). Now > this > class had a parent class, so I used to call > boost::serialization::base_object<MObject>() on the base class > MObject. > > However I want to change the parent of my class to a different class. > I also > want to update my old archives, so I decided to leave the load > function of > my class untouched, while I would change the save function, to update > the > call to base_object to the new parent class (not MObject anymore). I > thought > it would work, since it would load the old archive using the same > method, > but save it using the new, so I would have ran only one time the > program and > the archive would be updated (then, of course, before running it > again I > would have to recompile it one more time with the correct changes to > the > load function). > > But it does not work as expected, since it seems the BSL does not > like the > fact that save and load functions calls to > boost::serialization::base_object > do not specify the same base class. It does not complain at compile > time but > crashes at run time before even entering main and certainly before > loading > any archive. The crash is due to a NULL pointer, I have tried to > debug with > gdb but the crash apparently occurs on the _libkernel32_a_iname () so > I do > not not know where it is (too low level for me). > > Robert, do you have an idea what is going on? I suspect a bug - > however if > it is "normal" behaviour (I think it should then throw an exception > rather > than crash), > > *** > Tell that to the author of _libkernel32_a_iname () > > do you have an idea how could I update my archives? I need to change > the > parent of this class, but need to be able to read my old archives - > and > changing them "by hand" by looking into the XML archive code is tool > hard. > > Thank you, regards > > Jean-Noël Rivasseau > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users =

3 2

iterator_adapter conversion to base iterator?
by Sebastian Weber 07 Apr '06

07 Apr '06

Hello everybody! Please don't blame for beeing foolish - I'm using the iterator-adapter class for the first time. I converted a standard iterator from a std::vector with the iterator_adapter stuff into another class random_set_iterator. But at certain points in my programm I need the random_set_iterator converted back to the original iterator class from the vector class. I noticed the base()-function which basically does the job, but I think there should be a more elegant and clearer way to do it. Am I wrong or shouldn't an adapted iterator almost always be convertible to it's base iterator? I'm sure, it should not hard to implement somthing like this, but how? Thanks in advance! Greetings, Sebastian

2 3