- Boost-users - lists.boost.org

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