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

N-dimensional array besides multi_array
by Paul Cameron 09 Nov '02

09 Nov '02

I'm looking for an N-dimensional array that doesn't require the dimensionality be specified at compile time, like multi_array. Does anyone know of such a beast? It doesn't need a lot of functionality, just basic storage/retrieval and some slicing. Just thought I'd ask before I roll my own. I'm thinking of tweaking Giovanni Bavestrelli's implementation which is what multi_array is based on. Thanks, Paul

1 0

RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering
by Randy Bowen 09 Nov '02

09 Nov '02

I assume you meant, What's the matter with Visio, right? -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 4:11 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Hi, Every time I try to reverse engineer a project where I've used boost::shared_ptr Visio 2002 locks my Visual C++. What's the matter with the shared_ptr library? Marcio Del'Valle [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=238900.2578845.3984497.2273195/D=egroupweb/S=1705 006788:HM/A=1309024/R=0/*http://www.gotomypc.com/u/tr/yh/cpm/grp/300_you H1/g22lp?Target=mm/g22lp.tmpl> <http://us.adserver.yahoo.com/l?M=238900.2578845.3984497.2273195/D=egrou pmail/S=:HM/A=1309024/rand=607495686> Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

2 1

Boost (shared_ptr) vs Visio 2002 reverse engineering
by Marcio Del'Valle 09 Nov '02

09 Nov '02

Hi, Every time I try to reverse engineer a project where Ive used boost::shared_ptr Visio 2002 locks my Visual C++. Whats the matter with the shared_ptr library? Marcio DelValle [Non-text portions of this message have been removed]

1 0

RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering
by Randy Bowen 09 Nov '02

09 Nov '02

Actually, we've played with the Visio reverse engineering stuff a bit, but it appears to choke on any moderately complex use of templates in C++. I would assume that this is the issue you're encountering with the use of the Boost libraries. Randy Bowen Software Architect Stamps.com -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 5:03 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Yep!! =) Sorry about that. But, after all, it's M$! Marcio Del'Valle -----Original Message----- From: Randy Bowen [mailto:rbowen@stamps.com] Sent: Friday, November 08, 2002 8:41 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering I assume you meant, What's the matter with Visio, right? -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 4:11 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Hi, Every time I try to reverse engineer a project where I've used boost::shared_ptr Visio 2002 locks my Visual C++. What's the matter with the shared_ptr library? Marcio Del'Valle [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT < http://rd.yahoo.com/M=238900.2578845.3984497.2273195/D=egroupweb/S=1705 006788:HM/A=1309024/R=0/* http://www.gotomypc.com/u/tr/yh/cpm/grp/300_you H1/g22lp?Target=mm/g22lp.tmpl> < http://us.adserver.yahoo.com/l?M=238900.2578845.3984497.2273195/D=egrou pmail/S=:HM/A=1309024/rand=607495686> Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service < http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=237459.2482214.3917349.2146399/D=egroupweb/S=1705 0067 88:HM/A=1267611/R=0/*http://ad.doubleclick.net/jump/N2524.Yahoo/B1071650 ;sz= 300x250;ord=1036798890310715?> Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . _____ Esta mensagem foi verificada pelo E-mail Protegido Terra <http://www.emailprotegido.terra.com.br/> . Scan engine: VirusScan / Atualizado em 06/11/2002 / Versco: 1.3.13 Proteja o seu e-mail Terra: http://www.emailprotegido.terra.com.br/ [Non-text portions of this message have been removed] Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

[BGL] Problem getting a property map from a reverse graph
by kweeheong 08 Nov '02

08 Nov '02

When I create a reverse_graph from a graph, is it possible to get the property map as well? I have reduced the code to the following snippet: typedef adjacency_list<vecS, vecS, bidirectionalS, property<vertex_name_t,string> > GraphType; typedef boost::property_map<GraphType,vertex_name_t>::type VertexNameMapType; typedef reverse_graph<GraphType> ReverseGraphType; typedef boost::property_map<ReverseGraphType,vertex_name_t>::type ReverseVertexNameMapType; GraphType g; VertexNameMapType nameMap=get(vertex_name,g); // get nameMap from graph g reverse_graph<GraphType> rg(g); // create the reverse_graph ReverseVertexNameMapType rnameMap=boost::get(vertex_name,rg); // get rnameMap frmo rg, but this line fails to compile The VC6 compile error message, with long substrings substituted for string ( STR ) and adjacency list ( ADJL ) looks like: graph\reverse_graph.hpp(241) : error C2664: '__thiscall boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t>::boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t><class boost::ADJL *>' : cannot convert parameter 1 from 'struct boost::vec_adj_list_vertex_property_map<class boost::ADJL,class boost::ADJL const *,class STR,class STR const &,enum boost::vertex_name_t>' to 'class boost::ADJL *' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called example\testreverse.cpp(97) : see reference to function template instantiation 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> __cdecl boost::get<enum boost::vertex_name_t,class boost::reverse_graph<class boost::ADJL,class boost::ADJL const &> &>' being compiled graph\reverse_graph.hpp(241) : error C2553: no legal conversion of return value to return type 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> *' example\testreverse.cpp(97) : see reference to function template instantiation 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> __cdecl boost::get<enum boost::vertex_name_t,class boost::reverse_graph<class boost::ADJL,class boost::ADJL const &> &>' being compiled I am trying to determine whether I have made the call incorrectly or is this a limitation of the reverse_graph?

1 0

[BGL SUGGESTION] about source() and target()
by mycia 08 Nov '02

08 Nov '02

to Boost Graph Library designers: in the boost/graph/graph_traits.hpp (line 104): //--begin---------------------------------------------------------------- // Since pair is in namespace std, Koenig lookup will find source and // target if they are also defined in namespace std. This is illegal, // but the alternative is to put source and target in the global // namespace which causes name conflicts with other libraries (like // SUIF). namespace std { template <class T, class G> T source(pair<T,T> p, const G&) { return p.first; } template <class T, class G> T target(pair<T,T> p, const G&) { return p.second; } } //--end---------------------------------------------------------------- why not change it with: //--begin---------------------------------------------------------------- template <class E, class G> typename boost::graph_traits<G>::vertex_descriptor source(E e, const G& g) { return boost::source(e,g); } template <class E, class G> typename boost::graph_traits<G>::vertex_descriptor target(E e, const G& g) { return boost::target(e,g); } //--end---------------------------------------------------------------- and add the following in boost/graph/vector_as_graph.hpp //--begin---------------------------------------------------------------- template <class T, class EdgeList, class Alloc> T source(std::pair<T,T> p, const std::vector<EdgeList, Alloc>&) { return p.first; } template <class T, class EdgeList, class Alloc> T target(std::pair<T,T> p, const std::vector<EdgeList, Alloc>&) { return p.second; } //---end--------------------------------------------------------------- which means, vector_as_graph handles source() and target() inside its class (and in boost namespace) and makes std::source() and std::target() more general the reason why I want to modify this is that the original design makes trouble when I try to develop a subgraph view adaptor (something like filtered_graph, but accept vector_as_graph type) I need to define my own source() and target() to deal with my own subgraph view class, as shown below: namespace boost { template <class G> typename subview_graph<G>::vertex_descriptor target(typename subview_graph<G>::edge_descriptor e, subview_graph<G>& v) {...} } however, when dealing with vector_as_graph (which means the 1st argument, edge_descriptor, will be std::pair<int,int>), the compiler complains ambiguity between std::target() and boost::target() in fact, it will make trouble to everyone who wants to define his/her own source() & target() function but the 1st argument is std::pair<T,T> if it's possible, please fix this strange design or any other opinions will be appreciated best regards, hcyeh

1 0

using regexps with streams
by David VERGNAUD 08 Nov '02

08 Nov '02

hi i'm wondering if it's possible to use apply the regex-search algorithm on an input stream. my first thought is that it's not, since i've read (and so it looks on the specification) that the regex_search function can be passed only bi-directional iterators, and as far as i know one can only create input iterators on streams. typically, the first and second arguments of regex_search are iterators on the first and (most annoyingly) last element, which one cannot get with a stream. however, there might be (and i hope there is) another way to do it i'm not aware of. thx David __________________________________________________ Do you Yahoo!? U2 on LAUNCH - Exclusive greatest hits videos http://launch.yahoo.com/u2

2 1

problems with posix
by silvermangbs 08 Nov '02

08 Nov '02

Since I don't have librt.so on my Solaris (2.6 & 8) machines, I am trying to get Boost to use libposix4.so (which contains the same functions). I have substituted "posix4" for "rt" in the configure and configure.in files. I have done the same for the gcc-tools.jam file, since, I am using gcc (2.95.2 and 3.2). All seems to go well until I try to run the thread tests. Then, the linker is unable to find the posix4 library! What's going on? libposix4.so is in /usr/lib, so, the gcc compiler should be able to find it. Any ideas? Greg Silverman TRW Sunnyvale, CA

1 1

year_iterator
by deane_yang 08 Nov '02

08 Nov '02

Contrary to the documentation, the type "year_iterator" does not appear to be defined in the file "gregorian_types.hpp". Or did I miss something?

2 4

Trouble compiling regexpp example
by Cameron McCormack 08 Nov '02

08 Nov '02

Hi everyone. I'm using the libboost-regex Debian package and I'm trying to compile one of the example programs, regex_match_example.cpp. I am compiling with the command g++ -g -Wall -lboost_regex regex_match_example.cpp \ -o regex_match_example but I get many errors: /tmp/ccCZxmp1.o: In function __static_initialization_and_destruction_0': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:31: undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, allocator<char> >::reg_expression(char const *, unsigned int, allocator<char> const &)' /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:31: undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, allocator<char> >::~reg_expression(void)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.m_free(void)+0x20): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.m_free(void)+0xbe): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0x26): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0x6d): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0xb2): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /tmp/ccCZxmp1.o(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.set_accumulator_size(unsigned int)+0x37):/usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h: more undefined references to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' follow /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::match_results_base<char const *, allocator<char> >::gnu.linkonce.t.set_second(char const *)+0x13): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::cow(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.gnu.linkonce.t.__as__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcRCQ35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc+0x19): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::m_free(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::match_results_base<char const *, allocator<char> >::gnu.linkonce.t.set_second(char const *, unsigned int, bool)+0x1a): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::cow(void)' /tmp/ccCZxmp1.o: In function `main': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:89: undefined reference to `boost::c_regex_traits<char>::transform(basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > const &)' /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:99: undefined reference to `boost::c_regex_traits<char>::transform_primary(basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > const &)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.bool boost::re_detail::gnu.linkonce.t.query_match_aux<char const *, allocator<char>, char, boost::regex_traits<char>, allocator<char> >(char const *, char const *, boost::match_results<char const *, allocator<char> > &, boost::reg_expression<char, boost::regex_traits<char>, allocator<char> > const &, unsigned int, boost::re_detail::_priv_match_data<char const *, allocator<char> > &, char const * *)+0x77): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_first(char const *)' /tmp/ccCZxmp1.o: In function `main': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:95: undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_first(char const *, unsigned int)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.bool boost::gnu.linkonce.t.regex_match<char const *, allocator<char>, char, boost::regex_traits<char>, allocator<char> >(char const *, char const *, boost::match_results<char const *, allocator<char> > &, boost::reg_expression<char, boost::regex_traits<char>, allocator<char> > const &, unsigned int)+0x34): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_size(unsigned int, char const *, char const *)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.gnu.linkonce.t._._Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc+0x13): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::m_free(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::match_results<char const *, allocator<char> >::gnu.linkonce.t.(allocator<char> const &)+0x14): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::match_results_base(allocator<char> const &)' collect2: ld returned 1 exit status make: *** [regex_match_example] Error 1 (Sorry for the messiness, I can't get Mozilla not to wrap those error lines.) Anyone know what is going on here (a template instantiation problem perhaps)? Thanks, Cameron -- Cameron McCormack // clm(a)csse.monash.edu.au // http://www.csse.monash.edu.au/~clm/ // icq 26955922

2 3

Q: Graphs. Sorting edges. Possible? How to?
by stas_fomin 07 Nov '02

07 Nov '02

Hello. I a newbie in BGL and I rewrite my LEDA code now... I have to sort (order) edges according to some functor. For example (simplified): typedef adjacency_list<vecS, vecS, bidirectionalS> MyGraph; typedef graph_traits < MyGraph >::edge_descriptor MyGraphEdge; typedef graph_traits < MyGraph >::edge_iterator MyEdgeIter; class MyCompareEdges{ public: bool operator()(MyGraphEdge e1, MyGraphEdge e2) const { return true; } }; .... { MyGraph Gr(10); MyEdgeIter ei_beg, ei_end; MyCompareEdges comp; tie(ei_beg, ei_end) = edges(Gr); std::sort(ei_beg, ei_end, comp); //Error C2676 } And I have error C2676 (below the message...). Questions: 1. Is it possible to sort edges in the graph? 2. How to... Thanks all in advance... Stas Fomin. P.S. vecS, setS, listS for edge container... - C2676. ------------------------------ d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp(264) : error C2676: binary '+=' : 'class std::list<struct boost::list_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost:: no_property> > >::iterator' does not define this operator or a conversion to a type acceptable to the predefined operator d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp (911) : see reference to function template instantiation 'void __thiscall boost::default_iterator_policies::advance(struct boost::iterator_adaptor<class std::list<struct boost::lis t_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost::no_property> > >::iterator,struct boost::detail::undirected_edge_iter_policies,class boost::detail::edge_desc_impl<struct boost::b idirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int> *,struct boost::multi_pass_input_iterator_tag,int> &,i nt)' being compiled Error executing cl.exe.

4 7

[Regex] Case insensitive pb
by f_mayot 07 Nov '02

07 Nov '02

Hi, Maybe a stupid question but I didn't manage to make my regular expression objects case insensitive. What should I do insted of this : boost::regex* pRegExp = new boost::wregex(sRegExp); ? Thanks. Fred

4 3

Can't use adjacency_list AND adjacency_matrix in same program
by loopylozzysdad 06 Nov '02

06 Nov '02

Hi, It seems to me that you can't use adjacency_list AND adjacency_matrix in the same program. When I had both the relevant inludes in the program I got duplicate definition errors from the linker. Is this by design, or a bug? Cheers - Richard Howells (loopylozzydad at yahoo dot com)

3 2

RE: [Boost-Users] shared_ptr capabilities
by Mark Storer 06 Nov '02

06 Nov '02

>I don't believe the above statement will affect me, >but I just want to be sure Correct. A language-level array is not an STL container. There IS a shared_ptr-like template called shared_array that calls "delete []" instead of "delete". Had to look that one up. It doesn't get used much. std::vector is a superior choice (in every situation I can think of). An STL container of shared_ptr's is just fine. Just don't create a circular reference. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Collin Peters [mailto:yg-boost-users@m.gmane.org] Sent: Wednesday, November 06, 2002 1:04 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] shared_ptr capabilities http://www.boost.org/libs/smart_ptr/shared_ptr.htm states that: "Normally, a shared_ptr cannot correctly hold a pointer to a dynamically allocated array. See shared_array for that usage." What I hope to use shared_ptr for, is to store pointers to a class in a vector, and that class will also have a vector that stores pointers via shared_ptr. example: class Foo { int a; } class one { int var1; int var2; std::vector<Foo> foo_vector; } class two { std::vector<one> one_vector; } I don't believe the above statement will affect me, but I just want to be sure Collin Peters Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

shared_ptr capabilities
by Collin Peters 06 Nov '02

06 Nov '02

http://www.boost.org/libs/smart_ptr/shared_ptr.htm states that: "Normally, a shared_ptr cannot correctly hold a pointer to a dynamically allocated array. See shared_array for that usage." What I hope to use shared_ptr for, is to store pointers to a class in a vector, and that class will also have a vector that stores pointers via shared_ptr. example: class Foo { int a; } class one { int var1; int var2; std::vector<Foo> foo_vector; } class two { std::vector<one> one_vector; } I don't believe the above statement will affect me, but I just want to be sure Collin Peters

3 2

Q: Problems building boost.python under cygwin
by "Schnörr, Claudius Dr." 06 Nov '02

06 Nov '02

Hello, I run into problems building boost under cygwin. It seems to be merely a matter of a wrong configuration or wrong scripts. After running 'bjam -sTOOLS=gcc -n > build.com' in boost/libs/python/build in order to get hands on the statements being executed by bjam, there had to be made a lot of textual replacements to get the statements in build.com run: Just to mention some: - replace '-isystem ' by '-I' - remove '-I""' - change shared library-names from *.so to *.dll - insert '-L <path_to_libpython2.2.dll> -lpython2.2' where shared libs are created In boost/libs/python/test, going the same way, there have in addition this changes to be made: - LD_LIBRARY_PATH=... --> PATH=$PATH:..., because cygwin uses PATH to look for .dlls My question: I think there have to be made more configurations than I did to create the boost.python-stuff under cygwin. Where have they to be done, and what? (I already configured environment variables like GCC_ROOT_DIRECTORY, GXX, PYTHON_ROOT, ...etc...) Any suggestions are welcome! Please send a copy of your answer to schnoerr(a)mailzone.com Thank you in advance, Claudius --------------------------------------------------------- This Mail has been checked for Viruses Attention: Encrypted mails can NOT be checked! ** Diese Mail wurde auf Viren geprueft Hinweis: Verschluesselte mails koennen NICHT auf Viren geprueft werden! ---------------------------------------------------------

2 1

RE: [Boost-Users] set thread priority
by Mark Storer 05 Nov '02

05 Nov '02

I'd think you could get away with something like a set range, like 0 to 1000, and then map those values into whatever system is present. You could even use floating point values, 0.0 to 1.0, though people might look at you cross-eyed, at least until they got used to the idea. Then it's just a matter of mapping those ranges to whatever OS settings are present. You just state up front a couple caveats: Given two threads, A (higher priority) and B (lower priority), you only guarentee that A won't be given a lower underlying system priority than B. This would save you quite a bit of grief... particularly when someone wants threads with priority 1.0, 0.99 and 0.98. The thread with 0.98 might not run slower than the one with a 1.0 priority, but it certainly won't be faster. SOUNDS simple enough. At least to someone whose sum total multi-threading experience is a toy java applet and a dozen lines of boost::thread code. ;) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

3 3

set thread priority
by boxerab 05 Nov '02

05 Nov '02

Dear Boost Users, I am considering using the boost thread library; currently I use the Win32 API for threading on Windows. Is it possible to set the thread priority of a boost thread? Thanks! Aaron Boxer boxerab(a)NOSPAMyahoo.com

2 1

can't compile johnson-eg.cpp with VC6
by chul_de_condares 05 Nov '02

05 Nov '02

I get the following errors when trying to compile the example code for johnson_all_pairs_shortest_paths. Has anyone ever seen this before? Thanks in advance. d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(61) : error C2899: typename cannot be used outside a template declaration d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(166) : see reference to function template instantiation 'bool __cdecl boost::johnson_all_pairs_shortest_paths(class boost::adjacency_list<struct boost::vec S,struct boost::vecS,struct boost::directedS,struct boost::no_property,struct boost::property<enum boost::edge_weight_t,int,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> >,struct boost::no_property,struct boost::li stS> &,int (&)[5][5],struct boost::vec_adj_list_vertex_id_map<struct boost::no_property,unsigned int>,struct boost::adj_list_edge_property_map<struct boost::directed_tag,int,int const &,unsigned int,struct boost::property<enum boost::edge_weight_t,i nt,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> > const ,enum boost::edge_weight_t>,int)' being compiled d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(84) : error C2899: typename cannot be used outside a template declaration d:\swapps\source\axrt\c\boost\boost_1_29_0 \boost\graph\johnson_all_pairs_shortest.hpp(166) : see reference to function template instantiation 'bool __cdecl boost::johnson_all_pairs_shortest_paths(class boost::adjacency_list<struct boost::vec S,struct boost::vecS,struct boost::directedS,struct boost::no_property,struct boost::property<enum boost::edge_weight_t,int,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> >,struct boost::no_property,struct boost::li stS> &,int (&)[5][5],struct boost::vec_adj_list_vertex_id_map<struct boost::no_property,unsigned int>,struct boost::adj_list_edge_property_map<struct boost::directed_tag,int,int const &,unsigned int,struct boost::property<enum boost::edge_weight_t,i nt,struct boost::property<enum boost::edge_weight2_t,int,struct boost::no_property> > const ,enum boost::edge_weight_t>,int)' being compiled Error executing cl.exe. test.obj - 2 error(s), 0 warning(s)

1 0

Boost Python v2 - extending and embedding - memory leaks, compiler warnings
by texrmex 04 Nov '02

04 Nov '02

First, I'm excited about the new work that's been done with Boost Python v2. I can't wait to see if it's enough to overcome the pitfalls that prevented me from getting past the evaluation stage with v1. I'm using VC7 IDE to build my project and link to python22.lib and boost_python.lib (built with VC7 command line tools using bjam). I'm attempting to extend and embed in my existing project, so I'm not building a dll, but and exe. First of all, can I do this? When it links it says "Creating library ....lib and object ....exp", and still creates an exe. If I don't include my test module (and thus boost/python.hpp) I don't get this message. I'm assuming that by defining a module, boost defines exports and the linker then creates the lib and exp, since there were exports? Although I've built dlls before, I really don't know the inner workings of the process. The following is a brief example of my module. At the bottom is a simple test function that I'm calling just to test importing of the module. When I call TestModule(), I get 2 memory leaks from the module definition section, one from the class definition, and the other from the method definition. If I remove these, I get no memory leaks, and if I add more classes and methods, I get one 12 byte leak per class and one 12 byte leak per method I add. I do not get a leak from defining the top level function "greet". /////////////////////////////////////////////////// #include <boost\python.hpp> using namespace boost::python; namespace { const char * greet() { return "Hello World"; } class CSimple { public: bool Test() { return true; } }; }; BOOST_PYTHON_MODULE(Test) { def("greet", greet); class_<CSimple>("Simple") .def("Test", &CSimple::Test) ; } void TestModule() { Py_Initialize(); initTest(); Py_Finalize(); } /////////////////////////////////////////////////// In addition to the memory leaks, I get a number of compiler warnings, similar to the following: d:\Boost\boost\python\instance_holder.hpp(18) : warning C4275: non dll-interface class 'boost::noncopyable' used as base for dll- interface struct 'boost::python::instance_holder' d:\Boost\boost\utility.hpp(50) : see declaration of 'boost::noncopyable' d:\Boost\boost\python\instance_holder.hpp(17) : see declaration of 'boost::python::instance_holder' *and* d:\Boost\boost\python\detail\exception_handler.hpp(34) : warning C4251: 'boost::python::detail::exception_handler::m_impl' : class 'boost::function2<R,T0,T1,Policy,Mixin,Allocator>' needs to have dll-interface to be used by clients of struct 'boost::python::detail::exception_handler' with [ R=bool, T0=const boost::python::detail::exception_handler &, T1=const boost::function0<void,boost::empty_function_policy,boost::empty_functi on_mixin,int> &, Policy=boost::empty_function_policy, Mixin=boost::empty_function_mixin, Allocator=int ] I was wondering if my project is not set up properly, and if these warnings might have something to do with the memory leaks. In v1 there was a vc project you could use for building boost python. This works well if you are planning on linking to a vc built project, since you can make sure your settings, paths and libs are consistent between the boost python lib and your project. I currently have 3 different sets of build tools (yes, 3 compilers) on this box, with several different versions of standard and other libraries, so making sure I have control of the paths and settings used is very important. This is one reason I'm weary of the jam environment. It's yet another build environment, one that I'm not familiar with, and one that I'm not going to be using with any other projects except to build boost python. So a question would be: how easy would it be for me to set up a VC project for building boost python? Has this already been done? Or am I barking up the wrong tree? Thanks in advance, -Tex

1 0

RE: [Boost-Users] Iterator Adaptor Question
by Hickman, Greg 04 Nov '02

04 Nov '02

> -----Original Message----- > From: Mark Storer [mailto:mstorer@cardiff.com] > > You wrote up your sample so anyone could easily compile it... Thanks for noticing. :) > On > VC++ v6, I got two compiler errors: > > samplecode.cpp(58) : error C2663: 'reset' : 2 overloads have > no legal conversion for 'this' pointer > samplecode.cpp(59) : error C2678: binary '=' : no operator > defined which takes a left-hand operand of type 'const class > boost::shared_ptr<struct Shape const >' (or there is no > acceptable conversion) > > These errors are on the two lines you want to prevent. > > My first impression of the code was that it was already > illegal to perform those two actions. You shouldn't be able > to call non-const functions through a const_iterator, and > since neither reset() nor operator=() are const, no problem. > Right? I wasn't expecting the first error message, but the > second is in line with my expectations. > > I take it this code compiles for you? What tools/OS/etc are > you using? Unfortunately it does. I'm using Borland C++ Builder 5, for which I believe I have all of the available patches installed. (I'm using the IDE, but my command-line tells me I'm using Borland C++ 5.5.1. Borland gives away a set of free command-line tools that are distinct from the Builder IDE, and it may be that the compiler they give away is now more compliant than the one included in C++ Builder 5. If there is a way to point my IDE at the latest version of the free compiler, I don't know how to do it. I need to get gcc set up on my machine as a sanity check.) My first thought was that iterator_adaptor might be stripping away the const-ness from reference_type<const Const_shape_ptr>, and that the pointer type being generated was somehow pointing to a non-const Const_shape_ptr, thus allowing the indicated lines to compile. However, since you seem to get the desired results, perhaps the problem is with my compiler (or with Boost's support of it). Thanks very much for taking the time to respond. -Greg Hickman

1 0

Property maps
by Edward Diener 04 Nov '02

04 Nov '02

The documentation for boost::property_map is awful, so would someone please explain to me what this implementation does and how it differs from std::map<> and std::multi_map<> ? I know this post sounds irascible and I am not trying to dump on Mr. Siek but really I do not understand what this idea is or why one should use it over and above what already exists in the C++ standard library. I only wish that Boost implementors would stop explaining their ideas through examples and start explaining them in logical ways in which a knowledge of the English language would suffice.

1 0

RE: [Boost-Users] Iterator Adaptor Question
by Mark Storer 04 Nov '02

04 Nov '02

>Specifically, I'd like to prevent clients from writing the two lines >preceeding the return from main below. Can anyone help? Eh? You wrote up your sample so anyone could easily compile it... and I did. On VC++ v6, I got two compiler errors: samplecode.cpp(58) : error C2663: 'reset' : 2 overloads have no legal conversion for 'this' pointer samplecode.cpp(59) : error C2678: binary '=' : no operator defined which takes a left-hand operand of type 'const class boost::shared_ptr<struct Shape const >' (or there is no acceptable conversion) These errors are on the two lines you want to prevent. My first impression of the code was that it was already illegal to perform those two actions. You shouldn't be able to call non-const functions through a const_iterator, and since neither reset() nor operator=() are const, no problem. Right? I wasn't expecting the first error message, but the second is in line with my expectations. I take it this code compiles for you? What tools/OS/etc are you using? --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Hickman, Greg [mailto:greg.hickman@lmco.com] Sent: Friday, November 01, 2002 2:22 PM To: Boost-Users (Boost-Users(a)yahoogroups.com) Subject: [Boost-Users] Iterator Adaptor Question The following code illustrates a problem I'm having trying to use iterator_adaptor. Basically, I have a container of shared pointers to mutable, and I'd like to provide a const_iterator to clients that disallows modification of both the shared pointer as well as the pointee. Specifically, I'd like to prevent clients from writing the two lines preceeding the return from main below. Can anyone help? Thanks, Greg #include <boost/iterator_adaptors.hpp> #include <boost/shared_ptr.hpp> #include <vector> using namespace boost; using namespace std; struct Shape { virtual ~Shape() {} virtual void draw() const = 0; virtual void update() = 0; }; struct Concrete_shape : Shape { void draw() const {} void update() {} }; typedef shared_ptr<Shape> Shape_ptr; typedef shared_ptr<const Shape> Const_shape_ptr; struct Picture { typedef vector<Shape_ptr> Shapes; // Declare a const_iterator that converts // to the underlying Shape_ptr to a // Const_shape_ptr. Since the returned // Const_shape_ptr is a temporary, clients // shouldn't be allowed to modify it. typedef iterator_adaptor< Shapes::const_iterator, default_iterator_policies, value_type_is<Const_shape_ptr>, reference_is<const Const_shape_ptr>, iterator_category_is<input_iterator_tag> > const_iterator; const_iterator begin() const { return const_iterator(shapes_.begin()); } Shapes shapes_; }; int main(int argc, char* argv[]) { Picture pic; const Picture& cpic = pic; pic.shapes_.push_back(Shape_ptr(new Concrete_shape)); Picture::const_iterator i = cpic.begin(); // I'd like to prevent clients from writing... i->reset(new Concrete_shape); *i = Const_shape_ptr(new Concrete_shape); return 0; } Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

Bug fix for format library
by Fred Jackson 04 Nov '02

04 Nov '02

I found a bug in the format library and fixed it. strm << boost::format("%64.64s") % "hello"; gave an access violation. It was caused by passing an argument greater than the string length to std::string::erase. I added a check so as not to try to erase text that is not there. Here is a diff of my small fix. < is feed_args.hpp from the boost_1_29_0 distribution. > is my fixed file. 158c158,162 < if (specs.truncate_ >= 0) --- > // @@@@@ fjackson 20021022 Added test to make sure we don't call > // std::string::erase with an arg greater than the length - this > // caused an access violation, noted on outputting a short string > // with a %64.64 format specifier. > if (specs.truncate_ >= 0 && specs.truncate_ < res.length())

1 0

Wrapping a std::list with boost.python
by jefflholle 03 Nov '02

03 Nov '02

I've just started experimenting with version 2 of boost.python. In iterator.cpp, a std::list is wrapped using following code: typedef std::list<int> list_int; void push_back(list_int& x, int y) { x.push_back(y); } int back(list_int& x) { return x.back(); } . . . class_<list_int>("list_int") .def("push_back", push_back) .def("back", back) .def("__iter__", iterator<list_int>()) ; Is it possible to use the container methods instead of user defined functions? I've tried the code: class_<list_int>("list_int") .def("push_back", &list_int::push_back) .def("back", &list_int::back) .def("__iter__", iterator<list_int>()) ; This doesn't work. Am what I'm tried to do possible? If so, how?

2 1