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

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

Graph Library: Ordered Vertex List?
by dmatt001 01 Aug '03

01 Aug '03

Hi Guys, I would like to use an ordered vertex list (ie based on property type) in an implementation that I am working on such that duplication can be avoided. I have read and understand how to implement an ordered edge list thanks to the previous posts but am finding it hard to get started! Perhaps I have missed the key example? It appears that from the way config::VertList is constructed that it may be a similar process in nature? adj_list_impl::add_vertex appears to discard the boolean return value from the associative insertion. Would such a construction allow me to avoid the duplication I seek to avoid? I am guessing so, but some advice would give me a confidence "boost". ( <-- It's a lame pun: I really do need help ;-) ) My first steps are below rehashing the excellent ordered edges example with a simple search/replace and maching my target container base. I'll keep plugging along with it anyway and it may just compile one day. Suggestions/Ideas/Refs/Ptrs are appreciated. Matt --- first guess follows --- template <class VertDesc> struct order_by_name : public std::binary_function<VertDesc,VertDesc,bool> { bool operator()(const VertDesc& v1, const VertDesc& v2) const { // Order by vertex name. return boost::get(boost::vertex_name, v1) < boost::get(boost::vertex_name, v2); } }; #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION struct ordered_set_by_nameS { }; namespace boost { template <class ValueType> struct container_gen<ordered_set_by_nameS, ValueType> { typedef std::set<ValueType, order_by_name<ValueType> > type; }; } #else struct ordered_set_by_nameS { template <class T> struct bind_ { typedef std::multiset<T, order_by_name<T> > type; }; }; namespace boost { template <> struct container_selector<ordered_set_by_nameS> { typedef ordered_set_by_nameS type; }; } #endif

3 3

libbgl-viz.a instead of libbglviz.a
by dhofstee 16 Jul '03

16 Jul '03

Hi, I'm quite new at using boost (downloaded 1.30.0 a couple of days ago). I noticed that when I wanted to make libbglviz.a, as described in http://www.boost.org/libs/graph/doc/read-graphviz.html, there was already a makefile. "make libbglviz.a" does not work, but "make libbgl-viz.a" will. A second documentation error is in http://www.boost.org/libs/property_map/property_map.html, where the example is not equal to the actual cpp file. generic_foo_algorithm is on this page, but the file just mentions foo. I think it is a glitch in the doc, but if different... Comments?, David NL

2 1

Having problems with boost::signal and boost::function
by subsample 11 Jul '03

11 Jul '03

I'm having a problem (which was really hard to decipher) when connecting a function object to a signal. Thing is I default construct (no argument) a function object and connect it to the signal (using boost::ref), then at a later point in time I actually assign something to the function object (using boost::bind). But firing the signal after this causes a bad_function_call to be thrown. On the other hand; if I construct the function object with some dummy object before connecting it to the signal, and later do the assignment, the signal does its thing. If someone could enlighten me as to whats going on here, I'd be grateful .. : )

2 1

Signals library safety
by Eugene Talagrand 11 Jul '03

11 Jul '03

Hello to all, I'm looking into using the Boost.Signals. The library claims not to be thread safe. What does this mean exactly? When using Boost.Threads, can I make concurrent calls to connect as long as I wrap each call in a Mutex? If this is possible, do tackable objects also still work (if two trackable objects get destroyed in two different threads there might be a problem from what I understand) On an different note, I am trying to use Boost.Signals for network event handling. I'd like to set it up so that it uses something similar to he JavaScript event model, where every slot returns a boolean value. If that value is false, the remaining slots are not called. Would anyone have any recommendations on how to do this? Should I wrap each slot in a function that takes the return value and sets a global flag, then every subsequent slot checks the flag? It looks like combiners would not be appropriate, as it appears they are used after each slot is called (unless the InputIterator' opeator* actually calls the slot??) Thanks for any help -Eugene

2 1

Boost.Thread and fork
by Pavol Droba 02 Jul '03

02 Jul '03

Hi, I have problem with boost.threads on linux ( under gcc ). I have a multithreaded aplication using Boost.Thread. It works just fine. However, I want to make a daemon out of it. So I tried to fork() at the start of the program and run all the relevant code ( including all threading ) in the child process. But when I do so, first call to create_thread hangs the process. I'm quite new to linux threading, so it is possible, that the problem is not related to Boost.Threads. Any hints? Thanks in advance. Pavol

4 4

newbie bjam question
by Karsten Weinert 30 Jun '03

30 Jun '03

Hi, there are two questions about bjam I tried to answer, but failed: * which files are read by bjam in which order * where can I declare the standard include path I am using mingw on win98. Would be nice if someone could help me here, Karsten Weinert

2 1

BGL problem with filtered_graph and adjacency_matrix
by Matthias Rupp 30 Jun '03

30 Jun '03

Hi, i'm new to boost and encountered the following problem with the boost graph library and this code: #include "boost/graph/adjacency_list.hpp" #include "boost/graph/adjacency_matrix.hpp" #include "boost/graph/filtered_graph.hpp" int main (void) { using namespace boost; typedef adjacency_matrix<undirectedS> Graph; //typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef filtered_graph<Graph, keep_all> FilteredGraph; Graph g (5); FilteredGraph fg (g, keep_all ()); } This results in a lot of error messages from the compiler (see end of email), all located in the bgl files. If i use adjacency_list (as in the commented line above) instead of adjacency_matrix, everything's fine. I use gcc 3.3 under linux and version 1.30 of the boost library. Is this a bug? Is there an easy way to make filtered_graph work with adjacency_matrix? (I'd like to use adjacency_matrix because my graphs are almost complete graphs). Best regards, Matthias Rupp The first error messages from the compiler (the rest are also complaints about forming references to void): ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>': ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:852: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:927: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>': ../boost_1_30_0/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_convertible.hpp:191: instantiated from `boost::detail::is_convertible_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::is_convertible<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_helper<false>::type<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::is_enum<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::detail::is_scalar_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::is_scalar<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::detail::is_class_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::is_class<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::detail::is_empty_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::is_empty<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::compressed_pair<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>' ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:1313: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1315: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1344: error: forming reference to void [...]

1 0

New file uploaded to Boost-Users
by Boost-Users＠yahoogroups.com 30 Jun '03

30 Jun '03

Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the Boost-Users group. File : /uBLA Performance.pdf Uploaded by : sumohurd <matt(a)finray.net> Description : Updated to correctly use n^2*(2n-1) for notional FLOP count You can access this file at the URL http://groups.yahoo.com/group/Boost-Users/files/uBLA%20Performance.pdf To learn more about file sharing for your group, please visit http://help.yahoo.com/help/us/groups/files Regards, sumohurd <matt(a)finray.net>

1 0

boost with WS6U1
by Gabe E. Nydick 30 Jun '03

30 Jun '03

Has anyone gotten boost 1.29 to work with Sun WS6U1? If so, could you please help me out with some patch files to get it working? - Gabe [Non-text portions of this message have been removed]

1 0

boost::function and VC6 compile failure
by Vincent Finn 30 Jun '03

30 Jun '03

Hi, I am using the function classes in VC6 and have hit a problem The problem is that the compiler can't allocate enough space to build (The error mesages are at the bottom) Nomally you use the /ZmXXX compiler flag to make this bigger but that doesn't work in this case Has anyone hit this before? Is there a simple workaround? In case it makes a differnce the problem arises as follows I have a template class which has instances of boost::function1 and 2 If I build with only one version of my class everything is fine when I have more versions (I need about 12 different types) it stops Vin boost_1_30_0\boost\type_traits\has_trivial_copy.hpp(31): fatal error C1204: compiler limit : internal structure overflow boost_1_30_0\boost\type_traits\has_trivial_copy.hpp(43): see reference to class template instantiation 'boost::detail::has_trivial_copy_impl<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\type_traits\is_stateless.hpp(31): see reference to class template instantiation 'boost::has_trivial_copy<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\type_traits\is_stateless.hpp(43): see reference to class template instantiation 'boost::detail::is_stateless_impl<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_base.hpp(193): see reference to class template instantiation 'boost::is_stateless<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_template.hpp(431): see reference to class template instantiation 'boost::detail::function::get_function_tag<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_template.hpp(293): see reference to function template instantiation 'void boost::function2<bool,unsigned char,unsigned char,int>::assign_to(less_equal<unsigned char>)' being compil ed

2 2

RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39
by Tom Matelich 27 Jun '03

27 Jun '03

> -----Original Message----- > From: Toon Knapen [mailto:toon.knapen@fft.be] > > > Thanks for the update Toon. I think we're going to migrate > > to the gcc compiler on HP-UX for all our future work. That > > or we're going to go with Linux and bag HP altogether. > > OK but nevertheless some related info : > HP says that gcc only obtains 1/3th of the performance of aCC (never > checked myself though). And you should also now that I tried > to compile > boost with gcc (oops it's not shown anymore on the status pages, I'll > have to update it) and I had trouble compiling it (mostly to do with > posix threads AFAICT). > Not sure where that performance statistic comes from, but I didn't really notice it when we went from aCC to gcc a while back (but that was on 10.20, acc 1.18 -> gcc 2.9x). I'd recommend you use at least gcc 3.3 if you are going to go to gcc. There are a few big bugs. On 3.2.x we've had to drop to -O1 due to what appear to be optimizer bugs. GCC says they fixed some of those with 3.3, though I haven't had the chance to verify. In any case, back when Jens Maurer and I were trying to get Boost on aCC going, we were told Boost was going to become part of their test suite, but the lack of progress seems to indicate that didn't happen. And, if you have the opportunity, run as fast as you can away from HP to Linux. When Douglas Schmidt singles out a platform as being hard to work with (can't remember the exact reference, but it wasn't complimentary), you know its a pain. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

Unelegant constructs in date_time
by Claus Tondering 27 Jun '03

27 Jun '03

Here's a list of a few things I find unelegant in the date_time package: 1. Order or parameters Consider these declarations: date d(year, month, day); partial_date pd(day, month); So date() uses month before day, while partial_date() uses day before month. 2. No += and -= I can say date1 = date1 + date_duration(3); but not date1 += date_duration(3); 3. Namespace problems Date generators are in different namespaces: Both partial_date and first_kday_of_month are found in boost::date_time, but partial_date is also carried over in boost::gregorian, whereas first_kday_of_month is not. 4. Inconsistent abbreviations If I want the first Thursday in September, I must write: boost::date_time::first_kday_of_month<date> fts(Thursday, Sep); 'Thursday' must not be abbreviated to 'Thu'. 'Sep' must not be unabbreviated to 'September'. 5. Misleading exception string This code: try { date d(2003, Feb, 29); } catch (std::out_of_range exc) { std::cout << "Caught exception: " << exc.what() << std::endl; } surprisingly outputs this text: Caught exception: Day of month value is out of range 1..31 So, it seems that 29 is not in the range 1..31. -- Claus Tondering

2 1

RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39
by Murray, Charlie H 27 Jun '03

27 Jun '03

Thanks for the update Toon. I think we're going to migrate to the gcc compiler on HP-UX for all our future work. That or we're going to go with Linux and bag HP altogether. -----Original Message----- From: Toon Knapen [mailto:toon.knapen@fft.be] Sent: Friday, 27 June 2003 01:04 To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39 > Has anyone had any luck building Boost 1.30.0 on HP-UX 11i > (11.11) using the aCC version 3.39 compiler? The Compiler > Status page for HP-UX lists the 5.38 version of aCC, but it > looks like I'm having many of the same problems. > > Any help would be greatly appreciated. First of all, I'm planning to sync the status pages on HP/aCC every day. But yes, the aCC compiler fails misereably on compiling boost. I've started to try to isolate code that is legal but can't be handled by the aCC compiler and send it to their experts. By exchanging such code-snippets we could improve our understanding of the (deficiencies of the) aCC compiler and improve portability of the boost libraries. So I'll end with the same line as your post : any help would be greatly appreciated. toon 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/

2 1

boost::lambda::select2nd
by Markus Werle 27 Jun '03

27 Jun '03

Hi! I would like to write code like int main() { namespace l = boost::lambda; std::map<int, double> M; M[1] = 5.0; M[3] = 7.0; std::for_each(M.begin(), M.end(), l::select2nd(l::_1) *= 6.0); } Is it hard to implement this for boost::lambda? Markus

3 8

BGL problem with filtered_graph and adjacency_matrix
by Matthias Rupp 27 Jun '03

27 Jun '03

Hi, i'm new to boost and encountered the following problem with the boost graph library: #include "boost/graph/adjacency_list.hpp" #include "boost/graph/adjacency_matrix.hpp" #include "boost/graph/filtered_graph.hpp" int main (void) { using namespace boost; typedef adjacency_matrix<undirectedS> Graph; //typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef filtered_graph<Graph, keep_all> FilteredGraph; Graph g (5); FilteredGraph fg (g, keep_all ()); } This results in a lot of error messages from the compiler (see end of email), all located in the bgl files. If i use adjacency_list (as in the commented line above) instead of adjacency_matrix, everything's fine. I use gcc 3.3 under linux. Is this a bug? Is there an easy way to make filtered_graph work with adjacency_matrix? (I'd like to use adjacency_matrix because my graphs are almost complete graphs). Best regards, Matthias Rupp The first error messages from the compiler (the rest are also complaints about forming references to void): ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>': ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:852: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:927: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>': ../boost_1_30_0/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_convertible.hpp:191: instantiated from `boost::detail::is_convertible_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::is_convertible<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_helper<false>::type<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::is_enum<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::detail::is_scalar_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::is_scalar<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::detail::is_class_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::is_class<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::detail::is_empty_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::is_empty<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::compressed_pair<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>' ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:1313: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1315: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1344: error: forming reference to void [...]

1 0

Any luck with HP-UX 11i (11.11) using aCC 3.39
by Murray, Charlie H 27 Jun '03

27 Jun '03

Has anyone had any luck building Boost 1.30.0 on HP-UX 11i (11.11) using the aCC version 3.39 compiler? The Compiler Status page for HP-UX lists the 5.38 version of aCC, but it looks like I'm having many of the same problems. Any help would be greatly appreciated. Charlie Murray Senior Software Engineer National Access Services Comcast Media Centers Phone: 303-267-9819 Email: charlie_murray(a)cable.comcast.com CONFIDENTIAL NOTICE This electronic mail transmission and any accompanying documents contain information belonging to the sender which may be confidential and legally privileged. If you are not the intended recipient, any disclosure, copying, distribution or action taken in reliance on the message is strictly prohibited. If you have received this message in error, please delete it immediately. Thank You

2 1

Cannot compile posix_time.hpp on MSVC
by Claus Tondering 26 Jun '03

26 Jun '03

If I include "boost/date_time/posix_time/posix_time.hpp" in a file and compile the file using the Gnu C++ compiler, everything works fine. But if I compile the file using Miscrosoft Visual C++, I get this error message from the lexical_cast.hpp file: ...\boost\lexical_cast.hpp(147): error C2678: binary '<<' : no operator found which takes a left-hand operand of type 'std::basic_stringstream<_Elem,_Traits,_Alloc>' (or there is no acceptable conversion) with [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Alloc=std::allocator<wchar_t> ] The offending line in lexical_cast.hpp contains this function: bool operator<<(const Source &input) { return stream << input; } What am I doing wrong? -- Claus Tondering

2 1

Pyste and class methods
by Jim Wilson 26 Jun '03

26 Jun '03

Pystitos, Pyste digests foo.h: struct foo { static void bar(int); static int bar(); }; under guidance from foo.pyste: Class("foo", "foo.h") and silently yields foo.cpp devoid of any BOOST_PYTHON_MEMBER_OVERLOADS(...) macros. Consequently, gcc begins whining "no matches can be found converting function `bar' to type [..some incredibly complex C++ declaration that I'd never be able to type in correctly, much less understand...]" and suggests the obvious candidates. What stupid thing am I overlooking? Jim Wilson Gainesville, FL

1 0

Problem with filesystem attributes
by richard_fanta 26 Jun '03

26 Jun '03

Hiya, I've been trying to try out the attributes code in the boost-sandbox, but am running into some snags using VC++ version 7 (that comes with VS .NYET). One simple goal here would be to discern whether a file is writeable. Can this be done with the filesystem::attributes library?? The code for attr_test.cpp from the tests directory is included below; it's been slightly modified to run stand-alone instead of through the boost test harness. Problem #1: No string() method on the cache class. Problem #2: The "<<" operator won't work. For the latter, I've seen it suggested that typedefs might help, but don't understand what the underlying issue is. Is this a lingering Microsoft (i.e. VC++) specific issue? I'd greatly appreciate any clarification that people can offer. Much thanks, Richard Fanta ----------------Errors---------------------------------------------- x:\v\ReviewAgent\AttrTest\attr_test.cpp(23) : error C2039: 'string' : is not a member of 'boost::filesystem::cache' x:\ReviewAgent\Util\boost_1_30_0_filesystem\boost\filesystem\cache.hpp(33) : see declaration of 'boost::filesystem::cache' x:\v\ReviewAgent\AttrTest\attr_test.cpp(25) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator x:\v\ReviewAgent\AttrTest\attr_test.cpp(26) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator x:\v\ReviewAgent\AttrTest\attr_test.cpp(26) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator ----------------Source---------------------------------------------- #include <iostream> #include <exception> #include <string> #include "boost/filesystem/attributes.hpp" #include "boost/filesystem/path.hpp" //#include "boost/test/minimal.hpp" namespace fs = boost::filesystem; //int test_main (int argc, char **argv) int main (int argc, char **argv) { for (int i = 1; i < argc; ++i) { fs::path file (argv [i], fs::native); fs::cache pm (file); std::cout //<< "name: " << get <fs::filename> (pm).string () << "; size: " << get <fs::size> (pm) << "; owner: " << get <fs::owner> (pm) << "; group: " << get <fs::group> (pm) << "\n"; }

1 0

Newbie lambda question
by Ian 25 Jun '03

25 Jun '03

Boosters: Try as I might, I cannot figure a way of converting the following code snippet to use std::for_each with boost::lamdba. Any ideas? unsigned int table[1000]; for ( unsigned int* it = table_; it != table_ + (sizeof(table_) / sizeof(unsigned int)); ++i ) { *it = ((int)it % 3); } The pointer to int cast is the killer, the docs mention the ret<> template briefly, but it does not seem to help... Cheers Ian

3 3

Ublas library
by Alexey Nikitin 25 Jun '03

25 Jun '03

Hello everyone, I am try to use Ublas library and have some questions. I am want to write next code: template<class Matrix> void ProcessRecursive(Matrix& m) { typedef matrix_range<typename Matrix::matrix_type> MatrixRange; ... MatrixRange mr = project(m, range(...), range(...)); ... ProcessRecursive(mr); ... } void StartProcess() { ... matrix<double> m; ... ProcessRecursive(m); } But I have not enough type matrix_type in class matrix<...> and function template<class M> matrix_range<M> project(matrix_range<M>& data, const range& r1, const range& r2); There is almost the same function project but reciving const referens to matrix_range and compiler can't find it even using partial template ordering. Do somebody help my to write this code correctly? Or fix library? Regards, Alexey.

2 4

boost::spirit - why won't this palindrome code work?
by joshwaxman 24 Jun '03

24 Jun '03

Hi. I just started playing with spirit and tried the following code to match palindromes of strings consisting of a's and b's. Why won't this work? (It prints 0, not 1) #include "boost/spirit/core.hpp" #include <iostream.h> using namespace boost::spirit; int main(int argc, char* argv[]) { rule <> S; S = ch_p('a') | ch_p('b') | epsilon_p | ('a' >> S >> 'a') | ('b' >> S >> 'b'); char * str = "aabaa"; cout << parse(str, S).full; return 0; }

2 1

threads within threads
by pmedrow 23 Jun '03

23 Jun '03

Hi I am attempting to create a boost thread within an existing boost thread, i.e. a function called by the operator() function of an existing, running thread is attempting to make more threads. The new threads function objects are of the same type, but different from the parent function object type. This compiles and runs, but takes time equivalent to the threads running sequencially on a single thread. CPU usage indicates that both threads are running in parallel. Very strange... I am building with gcc v3.2.3 on red-hat linux build 2.4.20. Any ideas gratefully received!

2 3