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

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