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

Re: [Boost-users] [Subversion] Repository back online; please re-checkout
by David Abrahams 06 Aug '07

06 Aug '07

on Mon Aug 06 2007, "Aleksey Gurtovoy" <agurtovoy-AT-meta-comm.com> wrote: > Douglas Gregor wrote: >> We still need help updating regression.py to work with Subversion! > > Done now: http://article.gmane.org/gmane.comp.lib.boost.testing/4578. Thank you! -- Dave Abrahams Boost Consulting http://www.boost-consulting.com The Astoria Seminar ==> http://www.astoriaseminar.com

1 0

QR approximation linear exponantial estimation line fitting
by Alper Emrah Gur 06 Aug '07

06 Aug '07

Is there anyone who can say whether any of the Boost libraries can help me on the subject of this message? Any help will be greatly appreciated.

1 0

serialization build error (and possible fix)
by craigp 06 Aug '07

06 Aug '07

I couldn't build the latest boost from svn with boost build v2 (win32 with msvc 80 sp1, serialization wide-archive compilation/link problems). I've attached a patch which allowed it to build (dunno if this is the right way to fix the problem). It also seems that the following files get deleted after I run bjam... 'svn up' restores these files: Restored: D:\dev\boost\boost.svn\trunk\libs\function_types\build\timestamps\arity_loops Restored: D:\dev\boost\boost.svn\trunk\libs\function_types\build\timestamps\encoding Restored: D:\dev\boost\boost.svn\trunk\libs\function_types\build\timestamps\cc_names HTH, --craig Index: boost/archive/detail/interface_iarchive.hpp =================================================================== --- boost/archive/detail/interface_iarchive.hpp (revision 38471) +++ boost/archive/detail/interface_iarchive.hpp (working copy) @@ -32,7 +32,7 @@ namespace archive { namespace detail { -class BOOST_ARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_iserializer; +class BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_iserializer; template<class Archive> class interface_iarchive @@ -51,9 +51,9 @@ } template<class T> - const BOOST_ARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_iserializer * + const BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_iserializer * register_type(T * = NULL){ - const BOOST_ARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_iserializer & bpis = + const BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_iserializer & bpis = pointer_iserializer<Archive, T>::get_instance(); this->This()->register_basic_serializer(bpis.get_basic_serializer()); return & bpis; Index: boost/archive/detail/interface_oarchive.hpp =================================================================== --- boost/archive/detail/interface_oarchive.hpp (revision 38471) +++ boost/archive/detail/interface_oarchive.hpp (working copy) @@ -32,7 +32,7 @@ namespace archive { namespace detail { -class BOOST_ARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_oserializer; +class BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_oserializer; template<class Archive> class interface_oarchive @@ -51,9 +51,9 @@ } template<class T> - const BOOST_ARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_oserializer * + const BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_oserializer * register_type(const T * = NULL){ - const BOOST_ARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_oserializer & bpos = + const BOOST_ARCHIVE_OR_WARCHIVE_DECL(BOOST_PP_EMPTY()) basic_pointer_oserializer & bpos = pointer_oserializer<Archive, T>::get_instance(); this->This()->register_basic_serializer(bpos.get_basic_serializer()); return & bpos; Index: libs/serialization/build/Jamfile.v2 =================================================================== --- libs/serialization/build/Jamfile.v2 (revision 38471) +++ libs/serialization/build/Jamfile.v2 (working copy) @@ -44,7 +44,6 @@ basic_xml_archive binary_iarchive binary_oarchive - codecvt_null extended_type_info extended_type_info_no_rtti extended_type_info_typeid @@ -66,6 +65,7 @@ binary_woarchive text_wiarchive text_woarchive + codecvt_null utf8_codecvt_facet xml_wgrammar xml_wiarchive ____________________________________________________________________________________ Pinpoint customers who are looking for what you sell. http://searchmarketing.yahoo.com/

1 0

boost 1.34.1 Foreach conversion to iterators.
by chun ping wang 06 Aug '07

06 Aug '07

Hi i would like to know whats the best way to use BOOST_FOREACH and iterator. Example... BOOST_FOREACH(char c, String str) { first_c = c; // blah.. first iterator = c after condition x. second_c = c; // blah... second iterator = c after condition y. } str2.insert(first_c, second_c). Thanks for any help.

2 3

Serialization issues with 1.34.0 and 1.34.1
by ben.carlyle＠wrsa.com.au 05 Aug '07

05 Aug '07

I tried to raise a bug with trac, but my request was rejected as possible spam. I am currently using the 1.32.0 boost library, but would like to get away from it. One of the main features I am using is boost::serialization. There are some problems with serialization in 1.32.0, in particular that shared_ptr needs to have the "serialization" header included before the real header. The mechanim for handling serialization of shared_ptr is also a problem. Bitset support is also missing. I was hoping to pick up 1.34.0, and have since also made an attempt to use 1.34.1. However, both of these revision appear to have regressions against the 1.32.0 versions. Here is the first bug report I attempted to submit == bug 1: boost/serialization/optional doesn't include necessary headers == The following function refers to version<T>::value without an include of boost/serialization/version.hpp, resulting in user code that won't compile. It is possible to work around this problem by including boost/serialization/version.hpp before including boost/serialization/optional.hpp. I did not require a work-around with boost 1.32.0, but both 1.34.0 and 1.34.1 appear to need the work-around. {{{ template<class Archive, class T> void save( Archive & ar, const boost::optional<T> & t, const unsigned int /*version*/ ) }}} == bug 2: Archive headers missing multiple(?) include files == Here is my test program: #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> int main(void) { return 0; } Here are the first few lines of gcc output: ../boost/boost/boost/archive/basic_binary_iprimitive.hpp:72: error: ISO C++ forbids declaration of ‘scoped_ptr’ with no type ../boost/boost/boost/archive/basic_binary_iprimitive.hpp:72: error: invalid use of ‘::’ ../boost/boost/boost/archive/basic_binary_iprimitive.hpp:72: error: expected ‘;’ before ‘<’ token ../boost/boost/boost/archive/basic_binary_iprimitive.hpp:73: error: ISO C++ forbids declaration of ‘basic_streambuf_locale_saver’ with no type ../boost/boost/boost/archive/basic_binary_iprimitive.hpp:73: error: expected ‘;’ before ‘<’ token ../boost/boost/boost/archive/basic_binary_iprimitive.hpp: In member function ‘void boost::archive::boost::archive::basic_binary_iprimitive<Archive, Elem, Tr> ::load_binary(void*, size_t)’: ../boost/boost/boost/archive/basic_binary_iprimitive.hpp:150: error: ‘throw_exception’ is not a member of ‘boost::archive::boost’ It looks to my untrained eye that there could be several includes missing, or perhaps some circular including going on. == This second bug hits pretty early in my build process, so I would not be surprised if there were additional problems down the line. I am using an ubuntu 7.04 distribution, gcc 4.1.2, etc. Benjamin.

2 4

WIN32_LEAN_AND_MEAN
by KSpam 05 Aug '07

05 Aug '07

My projects need to define WIN32_LEAN_AND_MEAN. Unfortunately, they receive many compilation warnings due to macro redefinition in the following Boost headers (1.34.1). boost/iostreams/detail/system_failure.hpp boost/spirit/iterator/impl/file_iterator.ipp I understand that I can avoid the need to define WIN32_LEAN_AND_MEAN by ensuring that Boost headers are always included prior to <windows.h>. I do not like the idea of include order dependencies, as I am certain that I will come back to bite me down the road. Another option would be to turn the particular warning off; however, I would rather not do this. Would it be prudent to patch the Boost headers to only define WIN32_LEAN_AND_MEAN if it is not already defined? If not, is there another solution that I am overlooking. Thanks, Justin

3 3

Boost.Lambda - using member functions
by Daniel Dilts 05 Aug '07

05 Aug '07

I'm trying to figure out how to use the boost.lambda library, and I'm having some issues, probably stupid ones, but still, issues. In the following code I want to remove all obects from m_devices that only have 1 remaining reference (unique() returns true). Yes, I know that this would be pretty easy, using regular function pointers, and the like, however, I'm trying to learn this library. What am I doing wrong? I would also appreciate any pointers for using boost.lambda Whenever I compile the following code on VS2005 I get the following errors: Warning 1 warning C4512: 'boost::lambda::identity<T>' : assignment operator could not be generated c:\program files (x86)\boost\boost_1_34_0\boost\lambda\detail\lambda_functor_base.hpp 43 Warning 2 warning C4512: 'boost::lambda::lambda_functor<T>' : assignment operator could not be generated c:\program files (x86)\boost\boost_1_34_0\boost\lambda\detail\lambda_functors.hpp 204 Warning 3 warning C4512: 'boost::lambda::identity<T>' : assignment operator could not be generated c:\program files (x86)\boost\boost_1_34_0\boost\lambda\detail\lambda_functor_base.hpp 43 Warning 4 warning C4512: 'boost::lambda::lambda_functor<T>' : assignment operator could not be generated c:\program files (x86)\boost\boost_1_34_0\boost\lambda\detail\lambda_functors.hpp 204 Error 5 error C2451: conditional expression of type 'boost::lambda::detail::member_pointer_caller<RET,A,B>' is illegal c:\program files (x86)\microsoft visual studio 8\vc\include\algorithm 87 Error 6 error C2675: unary '!' : 'boost::lambda::detail::member_pointer_caller<RET,A,B>' does not define this operator or a conversion to a type acceptable to the predefined operator c:\program files (x86)\microsoft visual studio 8\vc\include\algorithm 1240 Error 7 error C2582: 'operator =' function is unavailable in 'std::pair<_Ty1,_Ty2>' c:\program files (x86)\microsoft visual studio 8\vc\include\algorithm 1241 My code for the class I'm having trouble with follows: #pragma once #include <string> #include <map> #include <boost/shared_ptr.hpp> #include "SocketDevice.h" namespace Socket { class SocketFactory { public: SocketFactory(std::string Host, std::string Port); virtual ~SocketFactory(void); protected: std::pair<std::string, std::string> m_dest; boost::shared_ptr<SocketDevice> m_device; static std::map<std::pair<std::string, std::string>, boost::shared_ptr<SocketDevice>> m_devices; private: void RemoveUnreferencedSockets(void); }; }; #include "SocketFactory.h" #include <boost/lambda/lambda.hpp> #include <boost/bind.hpp> Socket::SocketFactory::~SocketFactory(void) { } void Socket::SocketFactory::RemoveUnreferencedSockets(void) { std::remove_if(Socket::SocketFactory::m_devices.begin(), Socket::SocketFactory::m_devices.end(), boost::lambda::_1 ->* &std::pair<std::pair<std::string, std::string>, boost::shared_ptr<SocketDevice> >::second ->* &boost::shared_ptr<SocketDevice>::unique); }

1 0

[1.34.0][iostreams] regex filter seg faults when zero matches found
by Evan Herbst 04 Aug '07

04 Aug '07

The suffix pointer is used in a copy() after only having been initialized to NULL. I attach a patch. My compliments to the chef, otherwise. - Evan

2 1

boost lambda 1.34.1 questions.
by chun ping wang 03 Aug '07

03 Aug '07

HI I have several questions. How do I delete a pointer to a bind type and how do i specify a return type. 2 examples: I want to transform this BOOST_FOREACH code into std::for_each using lambda. typedef std::pair<Foo*, Bar*> FooBar BOOST_FOREACH(FooBar fb , MapFooBar) { delete fb.second; } Foo* f = ... ; BOOST_FOREACH(FooBar fb, MapFooBar) { if (fb.second == o) return fb.first; } 2.) In this case is using BOOST_FOREACH better?

1 0

[Important] Boost Subversion repository is now online
by Douglas Gregor 03 Aug '07

03 Aug '07

Hello all, The Boost Subversion repository is now back online. All of the files in CVS (including their histories) have been imported into the Subversion repository. CVS is still available for anonymous, read- only access for now, but will not be updated. The main Boost development branch is available via anonymous, read- only checkout at: http://svn.boost.org/svn/boost/trunk/ Or for developer read/write access at: https://svn.boost.org/svn/boost/trunk/ Information about accessing the Boost Subversion repository is available at: http://svn.boost.org/trac/boost/wiki/BoostSubversion Please report any problems to me to the main Boost list, and we will try to resolve them as quickly as possible. We still need help porting the regression-testing script over to use Subversion. See Trac ticket #1122: http://svn.boost.org/trac/boost/ticket/1122 Also, there is more documentation that will need to be updated within the Boost tree. - Doug Subversion tip: when you commit a change to Subversion that fixes ticket number NNN, include the text "Fixes #NNN" in your commit log. Trac will automatically close the ticket and cross-reference the commit with the ticket. See, for example, http://svn.boost.org/trac/ boost/changeset/38330

10 16

Re: [Boost-users] boost::regex_match throws exception
by mildaiv＠centrum.cz 03 Aug '07

03 Aug '07

>mildaiv(a)centrum.cz wrote: >> I build boost::regex 1.34 using Borland BDS 2006. >> Simple regular expresions works fine, but I have problem with this >> regular expresion: >> ^[_a-zA-Z0-9-]+(\.[_a-zA-Z0-9-]+)*(a)[a-zA-Z0-9-]+(\.[a-zA-Z0-9-]+)+$ >> if a try to match it with any string longer then 22 bytes, regex >> throws exception. >> After some investigations i simplified regular expresion to >> ^[10+]*@$ >> and it still throws exception >I can't reproduce with Boost-1.34: please post a complete self contained >test case. Also make sure that those \'s are double escaped if they're >embedded in code: >boost::regex >e("^[_a-zA-Z0-9-]+(\\.[_a-zA-Z0-9-]+)*(a)[a-zA-Z0-9-]+(\\.[a-zA-Z0-9-]+)+$"); This was the problem, everything now works fine. Thanks for your help. >Otherwise the expression does something rather different, and *will* get >pathological and throw an exception. >HTH, John.

1 0

Packed resource files with iostreams & zlib filter
by gyrotech＠freakinabox.com 03 Aug '07

03 Aug '07

Hello all. I am trying to create a wrapper for a set of resources (mixed text, image, etc files) for use in an SDL-based application. I want to use iostreams and keep it as close to C++ as I can, but SDL uses some functions that load data from c-type file pointers or a location in memory using a void* and byte-count. Is it possible to define a method of file access using iostreams and a filter that will then let me create sub-streams of the data inside?? For instance - a zlib-compressed file called 'foobar.gz' that contains 'foo.txt' and 'bar.png'. I want to attach an iostream to foobar.gz then use functions to get the contents in different formats, e.g. stream<my_res_file> compressed_file( "foobar.gz" ); ifstream foo = compressed_file.getasfilestream( "foo.txt" ); // read stuff from foo foo.close(); char* img_data; unsigned long size; compressed_file.getasmembuffer( img_data, &size ); // read img_data and poke around with it delete[] img_data; I know the above is just for illustration, but I can't find any libs that do this sort of work. I am having some real problems now even at the design stage, for instance how to neatly pack multiple files into a single one. My packed-file headers always seem to go wrong and without fixed-length space for files names it gets even more painful :-) If this isn't the right place for this sort of question (I see it's far more conceptual than directly boost-related) then I apologise and will start hitting on some more generic forums and lists ;-) Thanks for your time, GT

1 0

Location of html documention?
by Robert Ramey 03 Aug '07

03 Aug '07

I've downloaded boost on my system and run tests which build the libraries. When I surf the documention on my local hard drive in to "type_traits" I'm redirected to the www.boost.org How do I get the html documentation on my hard drive. Perhaps it is produced by the normal install process - which I confess I didn't do - as running the tests builds the libraries I need. I looked for it there but I didn't see it. Robert Ramey

3 2

[Boost.Thread] self deadlocking issue
by Cheng Lian 03 Aug '07

03 Aug '07

Hi, all I was debugging a buggy program which could be simplified as below: #include <boost/thread.hpp> using namespace boost; mutex m; void f() { mutex::scoped_lock lock( m ); } int main() { mutex::scoped_lock lock( m ); f(); return 0; } I think this would definitely self deadlock and the program should be waiting forever. And my Debian Linux box proved that true. But on my XP (with SP2) box, the program didn't dead lock and everything pass through! Seems that on Win32 platform, the mutex is recursive? I checked the code and only CRITICAL_SECTION related is found around the lock/unlock lines. But I think CRITICAL_SECTION itself is not recursive. Then why? Thanks for response. Cheers Cheng

3 2

[serialization]Error occured when serializing pointer
by wei niu 03 Aug '07

03 Aug '07

My compiler is VC7.1.When compiling the demo.cpp,an runtime error occured. the output is below: original schedule 6:24 bob 0x003409F8 34?35'52.56" 134?2'78.3" 24th Street and 10th Avenue 0x00340A58 35?37'23.456" 133?5'54.12" State street and Cathedral Vista Lane 0x00340B08 35?36'15.456" 133?2'15.3" White House 9:57 bob 0x003409F8 34?35'52.56" 134?2' 78.3" 24th Street and 10th Avenue 0x00340A58 35?37'23.456" 133?5'54.12" State street and Cathedral Vista Lane 0x00340B08 35?36'15.456" 133?2'15.3" White House 11:2 alice 0x003409F8 34?35'52.56" 134?2'78.3" 24th Street and 10th Avenue 0x00340A58 35?37'23.456" 133?5'54.12" State street and Cathedral Vista Lane 0x00340B08 35?36'15.456" 133?2' 15.3" White House 7:17 ted 0x00340B48 35?34'48.789" 133?2'16.23" Lincoln Memorial 0x00340B08 35?36'15.456" 133?2'15.3" White House 0x00340A58 35?37'23.456" 133?5' 54.12" State street and Cathedral Vista Lane 9:38 ted 0x00340B48 35?34'48.789" 133?2'16.23" Lincoln Memorial 0x00340B08 35?36'15.456" 133?2'15.3" White House 0x00340A58 35?37' 23.456" 133?5'54.12" State street and Cathedral Vista Lane 11:47 alice 0x00340B48 35?34'48.789" 133?2'16.23" Lincoln Memorial 0x00340B08 35?36'15.456" 133?2'15.3" White House 0x00340A58 35?37'23.456" 133?5'54.12" State street and Cathedral Vista Lane This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information. When debuging I found it cannot serialize the pointer.Why? Thanks. PS: boost's source code is hard for me,are there any good and easy ways of studying it?

2 2

[Graph] How to initialize edge index map?
by Anton A. Patrushev 03 Aug '07

03 Aug '07

Hi, How to initialize edge index map? I tried following: typedef adjacency_list<vecS, vecS, directedS, Vertex, Edge> graph_t; graph_traits<graph_t>::edge_iterator ei, ei_end; graph_t graph(num_nodes); ...... adding edges ...... for(tie(ei, ei_end) = edges(graph); ei != ei_end; ++ei, ++index) put(edge_index, graph, *ei, index); But I always get a compilation error: /usr/include/boost/property_map.hpp: In function ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, unsigned int, boost::property<boost::edge_bundle_t, Edge, boost::no_property>, boost::edge_index_t>, Reference = boost::detail::error_property_not_found&, K = boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, V = int]’: /usr/include/boost/graph/detail/adjacency_list.hpp:1667: instantiated from ‘void boost::put(Property, boost::adj_list_helper<Config, Base>&, const Key&, const Value&) [with Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, Vertex, Edge, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_bundle_t, Vertex, boost::no_property>, boost::property<boost::edge_bundle_t, Edge, boost::no_property>, boost::no_property, boost::listS>::config, Base = boost::directed_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, Vertex, Edge, boost::no_property, boost::listS>, boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_bundle_t, Vertex, boost::no_property>, boost::property<boost::edge_bundle_t, Edge, boost::no_property>, boost::no_property, boost::listS>::config>, Property = boost::edge_index_t, Key = boost::detail::edge_desc_impl<boost::directed_tag, unsigned int>, Value = int]’ shooting_star_boost_wrapper.cpp:266: instantiated from here /usr/include/boost/property_map.hpp:319: error: no match for ‘operator=’ in ‘((const boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, unsigned int, boost::property<boost::edge_bundle_t, Edge, boost::no_property>, boost::edge_index_t>*)((const boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, unsigned int, boost::property<boost::edge_bundle_t, Edge, boost::no_property>, boost::edge_index_t>&)((const boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::error_property_not_found, boost::detail::error_property_not_found&, unsigned int, boost::property<boost::edge_bundle_t, Edge, boost::no_property>, boost::edge_index_t>*)(& pa))))->boost::adj_list_edge_property_map<Directed, Value, Ref, Vertex, Property, Tag>::operator[] [with Directed = boost::directed_tag, Value = boost::detail::error_property_not_found, Ref = boost::detail::error_property_not_found&, Vertex = unsigned int, Property = boost::property<boost::edge_bundle_t, Edge, boost::no_property>, Tag = boost::edge_index_t](k) = v’ /usr/include/boost/pending/detail/property.hpp:21: note: candidates are: boost::detail::error_property_not_found& boost::detail::error_property_not_found::operator=(const boost::detail::error_property_not_found&) I really can't get through all these template parameters :( Please, tell me how to initialize this map properly! Thanks, Anton.

2 2

ScopeExit Review Announcement
by Jody Hagins 03 Aug '07

03 Aug '07

Alexander Nasonov's ScopeExit submission will be formally reviewed August 13 - August 22. The current submission has been uploaded to http://boost-consulting.com/vault/index.php?action=downloadfile&filename=sc… It's also available at http://tinyurl.com/2z6qg2 Online documentation is here http://194.6.223.221/~nasonov/scope_exit-0.04/libs/scope_exit/doc/html/inde…

2 1

[Graph] problem with arguments of transitive closure algorithm ?
by Emmanuel Viaud 02 Aug '07

02 Aug '07

Hello. Using Boost 1.34.1 (with g++-3.4.2) and more specifically the Boost Graph library, I stumbled on a small problem with the transitive_closure algorithm. I saw in the documentation that I can get a map containing the mapping between the vertices of the original graph and the ones in the transitive closure graph (the orig_to_copy parameter). But every time I call the method, I get an empty map as a result. To sum up my code, I use the following data structures for the graph: typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::directedS > graph_t; typedef boost::graph_traits < graph_t >::vertex_descriptor vertex_t; and the following one for the expected map: typedef std::map < vertex_t, vertex_t > ioMap_t; The graphs and map are declared the following way: graph_t myGraph; graph_t myTCGraph; ioMap_t ioMap; I used both versions of the algorithm: 1) using named parameters, I call: transitive_closure(myGraph, myTCGraph, orig_to_copy(ioMap)); 2) using "standard" parameters, I call: transitive_closure(myGraph, myTCGraph, ioMap, get(vertex_index, myGraph)); So, the main question is easy: Where did I write something wrong ? :-) A remark though. I see that the declaration in the case of "standard" parameters is the following : template <typename Graph, typename GraphTC, typename G_to_TC_VertexMap, typename VertexIndexMap> void transitive_closure(const Graph& g, GraphTC& tc, G_to_TC_VertexMap g_to_tc_map, VertexIndexMap index_map); So, if I understand everything (I'm far from speaking C++ fluently), this means that the g_to_tc_map parameter is passed by value. Shouldn't it be rather passed by reference (this would explain my problem as, when debugging my code, I saw that the map is correctly filled in the transitive_closure method but the caller gets back nothing at all) ? Hope I managed to be clear and thanks for your help. Best regards, Emmanuel

2 3

Re: [Boost-users] [Boost.Test] warning C4265 whenincluding<boost/test/unit_test.hpp> and friends
by Gennadiy Rozental 02 Aug '07

02 Aug '07

> "Pierre-Jules Tremblay" <iamtrep(a)gmail.com> wrote in message > news:4590bfef0707230842t2e296753g9546b73e2de8cc25@mail.gmail.com... > Just for my personal culture, given that your object will have a > vtable anyway, what's wrong with a virtual dtor() ? > > Cheers, Nothing really. It just doesn't have to be. If by any chance the design will change, I do not want destructor to be the only virtual function. Gennadiy

1 0

[Subversion] Repository back online; please re-checkout
by Douglas Gregor 02 Aug '07

02 Aug '07

The Boost Subversion repository is back online. You are strongly advised to remove any previous checkouts from the Subversion repository and to check out a clean copy from Subversion. The MIME types problem has been fixed. I hope this also fixes the issues that we have been seeing with TortoiseSVN. Please report back whether it works or not. We still need help updating regression.py to work with Subversion! - Doug

2 1

[Graph] A minor bug of the max-flow algorithm?
by Da Wang 02 Aug '07

02 Aug '07

Hi there, It seems that when searching a network maxflow, if the source and sink are the same vertex, the max-flow function in BGL will create some invalid data and cause the program to crash. To reproduce, simply change the "max_flow.dat" in libs\graph\example, and change the "s" and "t" to be the same vertex. Then compile the " edmunds-karp-eg.cpp". When run "edmunds-karp-eg < max_flow.dat", Windows will give me a crash message. I am using boost 1.34.0 with MS Visual Studio Express 2005 on Win XP2. It seems that the following line 62 of edmunds_karp_max_flow.hpp is having an error: delta = min BOOST_PREVENT_MACRO_SUBSTITUTION(delta, residual_capacity[e]) I admit that generally it doesn't make sense to have the source and sink at the same vertex, but I think it will be nicer if the program can check for this simple case... Just to point this out so the author could fix it if s/he thinks it is necessary. Thanks, Da

2 1

[regex] ".*" expression matches twice in regex_replace?
by Arne Babnik 02 Aug '07

02 Aug '07

Hi all, I am trying to perform some simple (as I thought) text manipulation. The task was to prepend a text with some other, e.g. 1234 -> 01234. I tried to do this with the expression ".*" and format "0$&". I used regex_replace with the following parameters: std::basic_string<char> string("1234"); std::basic_string<char> format("0$&"); boost::regex exp(".*"); std::basic_string<char> result; result = boost::regex_replace(string, exp, format); I was very surprised when I got the result "012340", i.e. the format string was applied twice. After some testing, I found out that regex_replace matches a second time at the end of the string, where the expression matched an empty string (therefore only the zero was appended at the end). When using the (undocumented) option match_not_initial_null, it basically works - but then empty input strings would not match either. This also applies to the expression ".+", which works correct on the input but would not match on empty strings as well. The only solution I found so far was using "^.*" as expression. Is this a bug or a feature? Or what did I get wrong with this regular expression? Regards, Arne ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

2 1

newbie: boost::filesystem problems
by Eduard Diner 02 Aug '07

02 Aug '07

Hi, I want to use the filesystem library. For simplicity I first tried to compile the simple_ls.cpp (provided at: http://www.boost.org/libs/filesystem/doc/index.htm) Unfortunately I get lots of compiler-errors. For example the line 22: >> fs::path full_path( fs::initial_path<fs::path>() ); splitARFF.cpp:22: error: expected primary-expression before '>' token splitARFF.cpp:22: error: expected primary-expression before ')' token Does anyone have an idea how to solve the problem? THANKS The Makefile I used: ------------- OBJ = splitARFF.o CC = g++ SRC = $(OBJ:%.o=%.cpp) HDR = $(OBJ:%.o=%.h) LDFLAGS = -Wall -pg CFLAGS = -g -pg all: boostARFF boostARFF: splitARFF.o $(CC) $(LDFLAGS) $(OBJ) $(LIBS) -L/usr/lib -lboost_filesystem %.o: %.cpp $(CC) -c $(CFLAGS) $(SRC) -I/usr/include -------------

2 1

[regex] suggestion: function object for replace
by Neil Hunt 02 Aug '07

02 Aug '07

Thanks for the excellent library John and others. I could not easily find an option to specify a callback function that somehow returns a custom built replacement string for use with regex_replace. The .NET framework utilises the MatchEvaluator mechanism: http://msdn2.microsoft.com/en-us/library/system.text.regularexpressions.reg… While there is no one definition of a string to return in the case of boost regex's, perhaps a Range or a pair of iterators would be sufficient (although temporaries may cause trouble for the unwary). Anyway, I have had need of of this mechanism and couldn't use the excellent regex_replace as a consequence. Neil

1 0

custom allocation for boost::array
by Clemens Buchacher 01 Aug '07

01 Aug '07

Hi, Is it safe to do this? using boost::array; const size_t n; void* p = new char[sizeof(T) * n]; array<T, n>* data = new(p) array<T, n>; The reason I want to do this is that I have implemented my own memory pool, so new char[...] would be replaced by my_pool<T>::allocate(n). I don't want to use something like my_pool<array<T, n> >::allocate(1), because then my allocator would have to align the allocated memory to the total array size instead of just the size of its elements. I suppose the safest solution would be an implementation of array with dynamic memory and support for a standard allocator like, for example, a one-dimensional multi_array or even multi_array_ref? I am concerned about performance of those containers, however. Regards, Clemens

1 0