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

[bind] Member fn has defeated me
by BRIDGES Dick 04 Oct '05

04 Oct '05

void foo(bool){} struct X { void f(bool b) {} } class Bar { typedef void (*pf)(bool); public: Bar(pf fn){ fn(true); } }; int main( int argc, char **argv ) { Bar bar_(foo); // ok. X x; Bar bar_(boost::bind(&X::f, &x)()); // compile fails. /*LOTS* of other failed attempts with various errors. 8( return(0); } <error_msg edited=yes instance="one of many"> error: no matching function for call to 'X::x()' candidates are: void X::x(bool). </error_msg> I've been reduced to [shudder] "...trying things." I'm simply trying to construct one class by passing in a function pointer (that happes to be a class member). Could someone point me in the right direction? Regards, Dick Bridges

2 1

using boost test framework with PWLIB
by Bondarenko Denis 04 Oct '05

04 Oct '05

Hello! I got a question about unit testing. I have an application, which uses PWLIB (http://www.voxgratia.org/docs/pwlib/pwlib-v1_7_4/index.html) This library creates MAIN function by it's own macros. When I'm trying to write unit tests for my application I have to use PWLIB. Can I use boost test unit framework with PWLIB application? As I understand, Boost test unit framework will try to create its MAIN function by its macros and this will cause to problems. Is it possible to use both - Boost test framework and PWLIB library? Will be grateful for your help. Storm.

2 2

The internal compiler error (python), gcc 4.0.2 of windows
by Huifeng Shen 04 Oct '05

04 Oct '05

The compiler is compiled by myself. The official mingw website only release the gcc 3.44. I use this complier to compile the boost 1.33.0 and find there is some internal compiler error when compiling python. Since I am not a expert of gcc. I report this and hope it is helpful. I give the all internal compiler error as below C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/object/class.cpp:688: internal compiler error: output_operand: invalid expression as operand Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/list.cpp: In constructor 'boost::python::detail::list_base::list_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/list.cpp:23: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/long.cpp: In constructor 'boost::python::detail::long_base::long_base(const boost::python::api::object&, const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/long.cpp:34: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/dict.cpp: In constructor 'boost::python::detail::dict_base::dict_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/dict.cpp:40: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/tuple.cpp: In constructor 'boost::python::detail::tuple_base::tuple_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/tuple.cpp:20: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/str.cpp: In constructor 'boost::python::detail::str_base::str_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/str.cpp:40: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/object/class.cpp:688: internal compiler error: output_operand: invalid expression as operand Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/object/class.cpp:688: internal compiler error: output_operand: invalid expression as operand Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/list.cpp: In constructor 'boost::python::detail::list_base::list_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/list.cpp:23: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/long.cpp: In constructor 'boost::python::detail::long_base::long_base(const boost::python::api::object&, const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/long.cpp:34: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/dict.cpp: In constructor 'boost::python::detail::dict_base::dict_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/dict.cpp:40: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/tuple.cpp: In constructor 'boost::python::detail::tuple_base::tuple_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/tuple.cpp:20: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/str.cpp: In constructor 'boost::python::detail::str_base::str_base(const boost::python::api::object&)': C:\opt\boost\libs\python\build\../src/str.cpp:40: internal compiler error: in valid_in_set, at tree-ssa-pre.c:1082 Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions. C:/opt/boost/boost/python/detail/wrapper_base.hpp:17: warning: type attributes are honored only at type definition C:/opt/boost/boost/python/object/instance.hpp:14: warning: type attributes are honored only at type definition C:\opt\boost\libs\python\build\../src/object/class.cpp:688: internal compiler error: output_operand: invalid expression as operand Please submit a full bug report, with preprocessed source if appropriate. See <URL:http://gcc.gnu.org/bugs.html> for instructions.

2 1

inconvenient for boost::thread::sleep
by RocWood 04 Oct '05

04 Oct '05

boost::thread::sleep, IMHO, it's too inconvenient. I get these example code to sleep 1 second, { boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += 1; // change xt to next second boost::thread::sleep(xt); } and, only 1 line in another platform(origianl plaform or java) { sleep(1000); } hmmm... Too inconvenient, and, to make things worse, quite a heavy calling. Is there any suggestion for me? Thanks.

4 3

Status of logging library
by Austin Bingham 03 Oct '05

03 Oct '05

Does anyone know what the status of John Torjo's logging library is? I've noticed that it's "in the review queue". Does this indicate that it's largely just a matter of time before it's ratified? If so, how long might this matter of time be? Thanks. -- Austin Bingham "If I were creating the world I wouldn't mess about with butterflies and daffodils. I would have started with lasers, eight o'clock, Day One!" Evil

2 1

[wave] Error when parsing files from ACE (Adaptive Communication Environment)
by Yariv Tal 03 Oct '05

03 Oct '05

Hi. I use the ACE library (http://www.cs.wustl.edu/~schmidt/ACE.html) which is known for being highly portable. When using wave to pre-process my code, which includes files from the ACE lib, wave fails on the following code snippet: -------------snippet------------------- // The number of bytes in a short. # if !defined (ACE_SIZEOF_SHORT) # if (USHRT_MAX) == 255U # define ACE_SIZEOF_SHORT 1 # elif (USHRT_MAX) == 65535U # define ACE_SIZEOF_SHORT 2 # elif (USHRT_MAX) == 4294967295U # define ACE_SIZEOF_SHORT 4 # elif (USHRT_MAX) == 18446744073709551615U <===[fails here] # define ACE_SIZEOF_SHORT 8 # else # error: unsupported short size, must be updated for this platform! # endif /* USHRT_MAX */ # endif /* !defined (ACE_SIZEOF_SHORT) */ -------------end snippet------------------- Note: USHRT_MAX is defined as 0xffff The failure occurs at the designated line, due to an ill-formed number. I suppose that the number is just too big, but shouldn't the comparison never even be "reached"? (since the previous elif would have been true) I am not too familiar with the standard, so I don't know if emitting an error for this case is correct, but my intuition is that even if this is not standard conforming, there should at least be a flag allowing this, since I assume (if it is used in such a highly portable library) that it _IS_ supported by most preprocessors out there. Apart from that, great lib! I just started using it, but I already love it. Yariv Tal.

2 1

newbie question: Boost graph library and GraphViz
by John Pye 03 Oct '05

03 Oct '05

Hi there, I've been working on using Boost Graph Library for the last few days and I've got to the point where I can't go further without some help. What I've got is an algorithm that I've implemented that works fine except for the part that involves 'remove_vertex'. Using this function wrecks my graph, for reasons that I understand (Iterator and Descriptor Stability/Invalidation, at http://www.boost.org/libs/graph/doc/adjacency_list.html) So, following the advice there, I switched from a vecS graph to a listS graph, with the following typedef: * *typedef boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, VertexData, EdgeData> Graph; When I do that, my algorithm seems to work OK but I can no longer view the results using the write_graphviz function -- I get a string of errors about some problem with the operator<< inside graphviz.hpp header. I'll paste in the errors at the end. The only thing I can see being the problem is that I'm using an AdjacencyGraph, and that doesn't include the VertexListGraph concept, which presumably is required for write_graphviz. How can I make write_graphviz run again with this new type of Graph? Happy to give some more info/code if that helps. Any suggestions would be very much appreciated! Cheers JP Here are the error messages: > g++ -O3 -Wall -ggdb -I../nnes -c -o westerberg.o westerberg.cpp > /usr/include/boost/graph/graphviz.hpp: In function `void > boost::write_graphviz(std::ostream&, const Graph&, > VertexPropertiesWriter, EdgePropertiesWriter, GraphPropertiesWriter) > [with Graph = boost::adjacency_list<boost::listS, boost::listS, > boost::bidirectionalS, Westerberg::VertexData, Westerberg::EdgeData, > boost::no_property, boost::listS>, VertexPropertiesWriter = > WesterbergPropertiesWriter, EdgePropertiesWriter = > WesterbergPropertiesWriter, GraphPropertiesWriter = > WesterbergPropertiesWriter]': westerberg.cpp:118: instantiated from > here /usr/include/boost/graph/graphviz.hpp:263: error: no match for > 'operator<<' in 'out << boost::get [with PropertyMap = > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t>, > Reference = const boost::detail::error_property_not_found&, K = > void*](((const boost::put_get_helper<const > boost::detail::error_property_not_found&, > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t> > >&)((const boost::put_get_helper<const > boost::detail::error_property_not_found&, > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t> > >*)((boost::put_get_helper<const > boost::detail::error_property_not_found&, > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t> > >*)(&vertex_index)))), ((void* const&)((void* > const*)(+(&i)->std::_List_iterator<_Tp>::operator* [with _Tp = > void*]()))))' > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:63: > note: candidates are: std::basic_ostream<_CharT, _Traits>& > std::basic_ostream<_CharT, > _Traits>::operator<<(std::basic_ostream<_CharT, > _Traits>&(*)(std::basic_ostream<_CharT, _Traits>&)) [with _CharT = > char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:74: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(std::basic_ios<_CharT, > _Traits>&(*)(std::basic_ios<_CharT, _Traits>&)) [with _CharT = char, > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:86: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(std::ios_base&(*)(std::ios_base&)) [with _CharT = > char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:121: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:155: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long unsigned int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:98: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(bool) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:178: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(short int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:189: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(short unsigned int) [with _CharT = char, _Traits > = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:193: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:204: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(unsigned int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:179: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long long int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:214: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long long unsigned int) [with _CharT = char, > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:238: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(double) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:219: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(float) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:261: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long double) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:284: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(const void*) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:307: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(std::basic_streambuf<_CharT, _Traits>*) [with > _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:449: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, char) [with > _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:505: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, char) [with > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:460: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, signed char) [with > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:465: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, unsigned char) > [with _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:567: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, const char*) > [with _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:612: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, const char*) [with > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:499: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, const signed > char*) [with _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:504: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, const unsigned > char*) [with _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:82: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, > std::_Resetiosflags) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:116: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, > std::_Setiosflags) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:154: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, std::_Setbase) > [with _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:227: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, > std::_Setprecision) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:261: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, std::_Setw) > [with _CharT = char, _Traits = std::char_traits<char>] > westerberg.cpp:118: instantiated from here > /usr/include/boost/graph/graphviz.hpp:269: error: no match for > 'operator<<' in 'out << boost::get [with PropertyMap = > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t>, > Reference = const boost::detail::error_property_not_found&, K = > void*](((const boost::put_get_helper<const > boost::detail::error_property_not_found&, > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t> > >&)((const boost::put_get_helper<const > boost::detail::error_property_not_found&, > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t> > >*)((boost::put_get_helper<const > boost::detail::error_property_not_found&, > boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, > boost::listS, boost::bidirectionalS, Westerberg::VertexData, > Westerberg::EdgeData, boost::no_property, boost::listS>, > boost::detail::error_property_not_found, const > boost::detail::error_property_not_found&, boost::vertex_index_t> > >*)(&vertex_index)))), ((void* const&)((void* const*)(&boost::source > [with Directed = boost::bidirectional_tag, Vertex = void*, > OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = > boost::bidirectionalS, VertexProperty = Westerberg::VertexData, > EdgeProperty = Westerberg::EdgeData, GraphProperty = > boost::no_property, EdgeListS = boost::listS](((const > boost::detail::edge_base<boost::bidirectional_tag, void*>&)((const > boost::detail::edge_base<boost::bidirectional_tag, > void*>*)((boost::detail::edge_base<boost::bidirectional_tag, > void*>*)(&((boost::iterator_facade<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, > boost::property<boost::edge_bundle_t, Westerberg::EdgeData, > boost::no_property> > >, > boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, > ptrdiff_t>, boost::detail::edge_desc_impl<boost::bidirectional_tag, > void*>, boost::bidirectional_traversal_tag, > boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, > ptrdiff_t>*)(&ei))->boost::iterator_facade<I, V, TC, R, D>::operator* > [with Derived = > boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<void*, > boost::property<boost::edge_bundle_t, Westerberg::EdgeData, > boost::no_property> > >, > boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, > ptrdiff_t>, Value = > boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, > CategoryOrTraversal = boost::bidirectional_traversal_tag, Reference = > boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, > Difference = ptrdiff_t]())))), ((const > boost::adjacency_list<boost::listS, boost::listS, > boost::bidirectionalS, Westerberg::VertexData, Westerberg::EdgeData, > boost::no_property, boost::listS>&)(+g)))))))' > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:63: > note: candidates are: std::basic_ostream<_CharT, _Traits>& > std::basic_ostream<_CharT, > _Traits>::operator<<(std::basic_ostream<_CharT, > _Traits>&(*)(std::basic_ostream<_CharT, _Traits>&)) [with _CharT = > char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:74: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(std::basic_ios<_CharT, > _Traits>&(*)(std::basic_ios<_CharT, _Traits>&)) [with _CharT = char, > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:86: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(std::ios_base&(*)(std::ios_base&)) [with _CharT = > char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:121: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:155: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long unsigned int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:98: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(bool) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:178: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(short int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:189: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(short unsigned int) [with _CharT = char, _Traits > = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:193: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:204: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(unsigned int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:179: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long long int) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:214: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long long unsigned int) [with _CharT = char, > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:238: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(double) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:219: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(float) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:261: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(long double) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:284: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(const void*) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:307: > note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, > _Traits>::operator<<(std::basic_streambuf<_CharT, _Traits>*) [with > _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:449: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, char) [with > _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:505: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, char) [with > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:460: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, signed char) [with > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:465: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, unsigned char) > [with _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:567: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, const char*) > [with _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/bits/ostream.tcc:612: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, const char*) [with > _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:499: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, const signed > char*) [with _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/ostream:504: > note: std::basic_ostream<char, _Traits>& > std::operator<<(std::basic_ostream<char, _Traits>&, const unsigned > char*) [with _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:82: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, > std::_Resetiosflags) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:116: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, > std::_Setiosflags) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:154: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, std::_Setbase) > [with _CharT = char, _Traits = std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:227: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, > std::_Setprecision) [with _CharT = char, _Traits = > std::char_traits<char>] > /usr/lib/gcc/i386-redhat-linux/3.4.4/../../../../include/c++/3.4.4/iomanip:261: > note: std::basic_ostream<_CharT, _Traits>& > std::operator<<(std::basic_ostream<_CharT, _Traits>&, std::_Setw) > [with _CharT = char, _Traits = std::char_traits<char>] make: *** > [westerberg.o] Error 1 -- John Pye School of Mechanical and Manufacturing Engineering The University of New South Wales Sydney NSW 2052 Australia t +61 2 9385 5127 f +61 2 9663 1222 mailto:john.pye_AT_student_DOT_unsw.edu.au http://pye.dyndns.org/

1 0

Linking with boost/mingw
by Foster Gareth 03 Oct '05

03 Oct '05

Hello all, I am trying to build an autotooled project that will use boost wave and filesystem. I can see the following files that were built when I compiled boost that I could link to. " libboost_wave-mgw-1_33.lib libboost_wave-mgw-mt-sd-1_33.lib libboost_wave-mgw-d-1_33.lib libboost_wave-mgw-mt-sd.lib libboost_wave-mgw-d.lib libboost_wave-mgw-mt.lib libboost_wave-mgw-mt-1_33.lib libboost_wave-mgw-s-1_33.lib libboost_wave-mgw-mt-d-1_33.lib libboost_wave-mgw-s.lib libboost_wave-mgw-mt-d.lib libboost_wave-mgw-sd-1_33.lib libboost_wave-mgw-mt-s-1_33.lib libboost_wave-mgw-sd.lib libboost_wave-mgw-mt-s.lib libboost_wave-mgw.lib " Which of those should I be linking to? I have added the following to my configure.ac " # Ask user for path to boost stuff:. AC_ARG_WITH(boost, [ --with-boost=<path> prefix of Boost 1.33 installation. e.g. /usr/local or /usr], [BOOST_PREFIX=$with_boost], AC_MSG_ERROR([You must call configure with the --with-boost option. This tells configure where to find the Boost C++ librarys and headers. e.g. --with-boost=/usr/local or --with-boost=/usr]) ) AC_SUBST(BOOST_PREFIX) # Individual boost libs BOOST_WAVE_LIBS="-L${BOOST_PREFIX}/lib/libboost_wave-mgw-1_33.lib" BOOST_FILESYSTEM_LIBS="-L${BOOST_PREFIX}/lib/libboost_filesystem-mgw-1_33.li b" BOOST_CFLAGS="-I${BOOST_PREFIX}/include/boost-1_33" AC_SUBST(BOOST_WAVE_LIBS) AC_SUBST(BOOST_FILESYSTEM_LIBS) AC_SUBST(BOOST_CFLAGS) " I get link errors when I try to make this project however. So the include path is working, I suppose I just need to get the right library. As an aside, it would be _really_ nice if the boost jam build procedure installed package config .pc files, I know Boost doesn't use autotools, but lots of people do, and it would make their lives easier :) <wish> PKG_CHECK_MODULES(DEPS, boost >= 1.33) </wish> Cheers all, Gaz

2 1

Class assignment and referencing
by Wyatt Greenway 02 Oct '05

02 Oct '05

Hello! I want to do the following with Boost::Python: class A { public: std::string Value; }; class B { public: A Str; int Val; }; /* Boost::Code */ class_<A>("A") .def("Value", &A::Value) ; class_<B>("B") .def("Str", &B::Str) .def("Val", &B::Val) ; /*---------*/ I then wish to do this in Python: ############### MyB = B() B.Str = "Some string" print "String: %s"%B.Str # The output should be as follows: > String: Some string How do I acomplish this?

1 0

[iostreams] problem with bzip2_decompressor and incomplete files
by Tiago de Paula Peixoto 02 Oct '05

02 Oct '05

Hello. I've been experiencing a problem with the bzip2_decompressor filter when reading from a stream attached to an incomplete file. Instead of throwing an exception or reaching EOF, the program just hangs. Consider the following example code (hello.cc) taken from the documentation: ----------------------------------------------------------- #include <fstream> #include <iostream> #include <boost/iostreams/filtering_streambuf.hpp> #include <boost/iostreams/copy.hpp> #include <boost/iostreams/filter/bzip2.hpp> int main() { using namespace std; using namespace boost; using namespace boost::iostreams; ifstream file("hello.bz2", ios_base::in | ios_base::binary); filtering_streambuf<input> in; in.push(bzip2_decompressor()); in.push(file); boost::iostreams::copy(in, cout); } ----------------------------------------------------------- Suppose this is compiled as "hello". The following command will generate a simple bzip2-compressed file: $ echo -e "Hello world\n" | bzip2 > hello-complete.bz2 The next line will copy everything but the last byte from "hello-complete.bz2" to "hello.bz2": $ dd if=hello-complete.bz2 of=hello.bz2 bs=1 count=53 So now if the program is run: $ ./hello It just hangs in an infinite loop, instead of throwing an exception or reaching EOF. In the same situation, gzip_decompressor throws an exception... Is there a reason for this not happening in this case, or is this just a bug? I'm using boost 1.33.0 with GCC 4.0.1 on an i686 with GNU/Linux. Thanks for any help. -- Tiago de Paula Peixoto <tiago(a)forked.de>

2 1

Managing builds
by Aaron Griffin 02 Oct '05

02 Oct '05

I have a question, and it's something that has been bothering me for some time when dealing with boost. There are certain boost libs which require link libraries (static/dynamic). That's normal. However, if I wanted to statically link against, say, multithreaded Boost.Filesystem (gcc), I would need to add -Bstatic -lboost_filesystem-gcc-mt (or something to that effect). A majority of projects provide some sort of pkg-config files, or even their own app (gtk-config ?). Is there any functionality like this out there? Is there any way I can make this re-buildable on multiple target machines with multiple install locations in an easy manner? Ideally, something like: boost-config --static-libs filesystem would fit the standard scheme and allow for different machine to have different boost installation roots, and things of that nature. Without something like that, I am forced to either add configure flags, or force a user to modify a "config.mk" style file.

3 4

scoped_ptr help.
by John Sun 01 Oct '05

01 Oct '05

New to this topic,and need some help here. I have a class which use the scoped_ptr as a member variable. Class CTest { public: CTest(); Initialize(); ~CTest(); private: scoped_ptr<CTest2> m_spTest2; } For some reason, that I cannot initialize m_spTest2 in the member initialization list of the constructor, so I have to initialize in some other functions like in Initialize. CTest::Initialize() { int aa, bb; m_spTest2=new CTest2(aa, bb); } The compiler will complain about that, so what's the right way to do it. Thanks, Jianwei

6 8

Dynamic-only installation
by George Sakkis 01 Oct '05

01 Oct '05

Hi all, I'd like to create a single version for each boost library instead of eight, so I run: bjam -sTOOLS=gcc -sBUILD="release <runtime-link>dynamic <threading>multi" install Although it doesn't build the debug single-threaded versions, it still creates both the dynamic and the static ones. Does the static version have to be built always ? TIA, George

1 0

[asio] init acceptor to reuse_address?
by BRIDGES Dick 01 Oct '05

01 Oct '05

I created a server something like this: handle_accept(){ do_the_right_thing(); } Class Foo { socket_acceptor acceptor_; Public: Foo(demuxer& d) : acceptor_( d, ipv4::tcp::endpoint(2525)){} Example(demuxer& d) { stream_socket* p = new stream_socket(d); acceptor_.async_accept(p, handle_accept); } } Everything works fine except when I (1) connect a client; (2) ^C the server; (3) try to restart the server - which, as expected, yields "Address already in use". Mumbling something about defaulting modern socket libraries to SO_REUSEADDR, I started trying to figure out where to call set_option(stream_socket::reuse_address(true)) - and can't work it out. I've set_option() on sockets and the acceptor but can't make the acceptor reuse the address as long as the connection that was established is still in TIME_WAIT. Do you have an example that shows how this can be done? Regards, Dick Bridges

1 0

Library's binary size
by Ugo Mendes Donelli 30 Sep '05

30 Sep '05

In the "Getting Started" section of boost web site, there should be a requirements section. When actually built and installed on Windows, the library 1.33 required more than 2GB of disk space. I was targeting VC++ 7.1. The 1.32 library used more or less 1GB of disk. The disk space requirements that I mention include the bin subdirectory created by the build process in the library's source tree, directory that I generally delete by hand shortly after. I don't think that any user will run out of disk space but it's better if the users know about this before they build the library. Ciao, Ugo

2 1

composing stream iterators?
by Robert Mathews 30 Sep '05

30 Sep '05

I have a collection of streams that I want to read from sequentially, and I want it to look like a single stream iterator to the calling code. Is there a boost template for a stream iterator that wraps a collection of other stream iterators? Thanks, Rob.

1 0

[serialization] Bug in demo.cpp?
by Paul Giaccone 30 Sep '05

30 Sep '05

Does the demo program demo.cpp <http://boost.org/libs/serialization/example/demo.cpp> have a bug in it? When I run it, it crashes at the line that does the actual serialisation: oa << s; in save_schedule(), reporting the error: Unhandled exception at 0x7c59bbf3 in SerializationDemo.exe: Microsoft C++ exception: __non_rtti_object @ 0x0012ee98 at line 260 of dbgheap.c: pvBlk = _heap_alloc_dbg(nSize, nBlockUse, szFileName, nLine); The call stack is > SerializationDemo.exe!_nh_malloc_dbg(unsigned int nSize=33, int nhFlag=1240696, int nBlockUse=5007849, const char * szFileName=0xe06d7363, int nLine=1) Line 260 + 0x15 C SerializationDemo.exe!malloc(unsigned int nSize=0) Line 139 + 0x15 C I'm compiling in Windows 2000 using Visual .NET, if this helps. Paul Giaccone PS: I modified the filename so it is correct for Windows (using backslashes) - it might be a good idea to use a boost::path here to make the code portable.

2 3

[TR1 Review] TR1 Formal Review Beginning
by Beman Dawes 30 Sep '05

30 Sep '05

The formal review of the Boost TR1 Library by John Maddock begins today, Saturday, September 24th, and runs through Wednesday, October 5th. The TR1 library provides an implementation of the C++ Technical Report on Standard Library Extensions. This library does not itself implement the TR1 components, rather it's a thin wrapper that will include your standard library's TR1 implementation (if it has one), otherwise it will include the Boost Library equivalents, and import them into namespace std::tr1. Functionality supported includes: * Reference Wrappers * Smart Pointers * Class template result_of. * Function template mem_fn. * Function Object Binders. * Polymorphic function wrappers. * Type Traits. * Random Number Generators and Distributions. * Tuples. * Tuple Interface to std::pair. * Fixed Size Array. * Hash Function Objects. * Regular Expressions. * Complex Number Algorithm Overloads. * Complex Number Additional Algorithms. Functionality in TR1 but not yet available: * Mathematical Special Functions. * Unordered Associative Set (Hash Table). * Unordered Associative Map (Hash Table). * C99 C language additions. Additional information including online documentation is available at http://freespace.virgin.net/boost.regex/tr1/index.html The complete TR1 lib source and docs can be downloaded from http://freespace.virgin.net/boost.regex/tr1/tr1-20050816.zip Please help Boost by posting your formal review of this library. Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every review should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. --Beman Dawes, Review Manager

6 18

[spirit] parser trees
by Aaron Griffin 30 Sep '05

30 Sep '05

Just a couple of "noob" spirit questions for you all which are more experiences in the zen ways of Spirit. If I chose to use a parser tree (or ast) instead of cluttering my code with semantic actions, is there any trade off in parse speed, besides the obvious tree generation itself? Now, let's say I generate a parse tree, and output the results to some sort of XML or structured format. Would spirit allow me to regenerate the tree from that format? i.e. Are there any issues/complications with generating the tree manually? What is more common, an AST or a parser tree? I understand the technical differences, but not the reasons behind them (yet). Thanks in advance.

1 0

[Fwd: [pointer container] Error populating pointer container with stack based objects]
by Allen Cronce 30 Sep '05

30 Sep '05

2 2

Newbie help please - trying to build for QNX6
by Jim Douglas 30 Sep '05

30 Sep '05

Hi, (New to Boost & bjam - not QNX) I am trying to build the Boost libs for QNX 6.3.0 on both the Windows hosted and QNX hosted development platforms using the gcc tools. What happens if I build out of the box is - Under Windows most of the libraries build, but they have Windows suffixes ".lib" and ".dll" which suggest that the build options are targeting Windows. Under QNX most of the build fails. The principal error seems to be a message "g++: unrecognised option -pthread". I have tried running './configure' but that does not make any difference. If I have interpreted the docs correctly perhaps the version 2 build system would be more appropriate for cross platform builds? Can I specify or detect the host, target and toolset independently? Any help and advice greatly appreciated... Jim Douglas

2 7

Re: [Boost-users] MSVC v6 build fails in file boost\detail\shared _count.hpp
by David Balazic 30 Sep '05

30 Sep '05

Correction. MSVC6 builds OK without this change. My project is compiled for win (msvc6) and winCE (evc4), so the changes are, it seems, needed for the evc4 compiler. I use STLport there anyway, so this issues might be a ... non-issue :-) Regards, David > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Aaron Griffin > Sent: Thursday, September 29, 2005 10:29 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] MSVC v6 build fails in file > boost\detail\shared_count.hpp > > > On 9/29/05, David Balazic <david.balazic(a)hermes.si> wrote: > > from : > > void * get_deleter(std::type_info const & ti) const > > > > to > > void * get_deleter(type_info const & ti) const > > > > I have Visual Studio c++ 6.0. > > > > Is this a known problem ? > > Will it be pathced ? > > Well, it's been a while since I've used VS6, but if it does not > support the std:: namespace, it does not support C++. It may be the > compiler, in which case you should get a new one (mingw works well on > Windows). It might just be your STL headers, in which case, I'd > suggest replacing it with STLPort or something .... better. > > Aaron Griffin > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

[lambda] Variable assignment from lambda expression
by Alexander Borghgraef 30 Sep '05

30 Sep '05

Hi all, I have been trying out boost::lambda for the first time, and I did encounter something which I can't seem to solve. Simplified, what I'd like to do amounts to this: list<int> intlist; // fill up list someway int n; for_each( intlist.begin(), intlist.end(), n = _1 ); Obviously, this fails because it implies a cast from placeholder to int, which isn't defined. Is there some way to do this using lambda? -- Alex Borghgraef

6 11

[iostreams] Linker error
by Klaus Nowikow 30 Sep '05

30 Sep '05

Hi, with the following test program: <code> #include <boost/iostreams/filter/bzip2.hpp> int main(int argc, char* argv[]) { return 0; } </code> I get the linker error (MSVC 7.1): LINK : fatal error LNK1104: cannot open file 'libboost_bzip2-vc71-mt-1_33.lib' A similar error occurs with "zlib.hpp" instead of "bzip2.hpp": LINK : fatal error LNK1104: cannot open file 'libboost_zlib-vc71-mt-1_33.lib' I did not find this lib files in my Boost library directory, so I might have missed something when I built Boost. This is what I did: - Got the sources for the bzip2 and the zlib libraries - Built the libs - Built Boost with this command line: bjam "-sTOOLS=vc-7_1" "-sNO_COMPRESSION=0" "-sNO_ZLIB=0" "-sZLIB_LIBPATH=c:/dev/Libraries/zlib/lib" "-sZLIB_INCLUDE=c:/dev/Libraries/zlib/include/zlib" "-sNO_BZIP2=0" "-sBZIP2_LIBPATH=c:/dev/Libraries/bzip2/lib" "-sBZIP2_INCLUDE=c:/dev/Libraries/bzip2/include/bzip2" (without the line breaks of course) The names of the bzip2 / zlib libraries are libbz2.lib and zdll.lib, resp., and the paths are correct. I did not get any error messages when building Boost, and I also did not get the "Building Boost.Iostream with .. support disabled..." message. Is there anything that I missed from the docs? Best regards, Klaus

2 4

Which boost libraries need libs?
by Richard Kaiser 29 Sep '05

29 Sep '05

Can anybody tell me, which of the Boost libraries need libs (usually created with bjam)? As far as I can see, for most of the Boost libraries source code #includes are sufficient. For them, installation step 1 from the "Getting Started"-page is sufficient. Or do I get something wrong? Richard

4 8

the strange warnings in using of boost::format
by Alan Huang 29 Sep '05

29 Sep '05

hi, here is the code fragment in my win32 project: namespace gtl { typedef unsigned int dword; }; void myFun( const char * _szText ){} int i = 10; myFun( boost::str( boost::format( " Page %2d" ) %i ).c_str() ); but there is so many more warinings as below: LobbyRoomListWnd.cpp d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(100) : warning C4244: '+=' : conversion from '__w64 int' to 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::off_type', possible loss of data with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char> ] c:\program files\microsoft visual studio .net 2003\vc7\include\xtree(267) : while compiling class-template member function 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::pos_type boost::io::basic_altstringbuf<Ch,Tr,Alloc>::seekoff (boost::io::basic_altstringbuf<Ch,Tr,Alloc>::off_type,std::_Iosb<_Dummy>::seekdir,std::_Iosb<_Dummy>::openmode)' with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char>, _Dummy=int ] d:\working\alan_gamma\publiclibrary\boost\boost\format\format_class.hpp(136) : see reference to class template instantiation 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>' being compiled with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char> ] d:\working\alan_gamma\richonlineclient\roclient\game\lobby\lobbyroomlistwnd.cpp(427) : see reference to class template instantiation 'boost::basic_format<Ch>' being compiled with [ Ch=char ] d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(102) : warning C4244: '+=' : conversion from '__w64 int' to 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::off_type', possible loss of data with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char> ] d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(110) : warning C4244: 'argument' : conversion from '__w64 int' to 'int', possible loss of data d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(118) : warning C4244: '+=' : conversion from '__w64 int' to 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::off_type', possible loss of data with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char> ] d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(120) : warning C4244: '+=' : conversion from '__w64 int' to 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::off_type', possible loss of data with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char> ] d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(151) : warning C4244: 'argument' : conversion from '__w64 int' to 'int', possible loss of data c:\program files\microsoft visual studio .net 2003\vc7\include\xtree(267) : while compiling class-template member function 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::pos_type boost::io::basic_altstringbuf<Ch,Tr,Alloc>::seekpos (boost::io::basic_altstringbuf<Ch,Tr,Alloc>::pos_type,std::_Iosb<_Dummy>::openmode)' with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char>, _Dummy=int ] d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(160) : warning C4244: 'argument' : conversion from '__w64 long' to 'int', possible loss of data d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(265) : warning C4244: 'initializing' : conversion from '__w64 int' to 'int', possible loss of data c:\program files\microsoft visual studio .net 2003\vc7\include\xtree(267) : while compiling class-template member function 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::int_type boost::io::basic_altstringbuf<Ch,Tr,Alloc>::overflow (boost::io::basic_altstringbuf<Ch,Tr,Alloc>::int_type)' with [ Ch=char, Tr=std::char_traits<char>, Alloc=std::allocator<char> ] d:\working\alan_gamma\publiclibrary\boost\boost\format\alt_sstream_impl.hpp(266) : warning C4244: 'initializing' : conversion from '__w64 int' to 'int', possible loss of data d:\working\alan_gamma\publiclibrary\boost\boost\format\format_implementation.hpp(193) : warning C4267: 'initializing' : conversion from 'size_t' to 'std::streamsize', possible loss of data c:\program files\microsoft visual studio .net 2003\vc7\include\ios(119) : while compiling class-template member function 'boost::basic_format<Ch>::string_type boost::basic_format<Ch>::str(void) const' with [ Ch=char ] c:\program files\microsoft visual studio .net 2003\vc7\include\xtree(267) : while compiling class-template member function 'boost::basic_format<Ch>::basic_format(const Ch *)' with [ Ch=char ] d:\working\alan_gamma\publiclibrary\boost\boost\format\format_implementation.hpp(206) : warning C4267: 'initializing' : conversion from 'size_t' to 'std::streamsize', possible loss of data d:\working\alan_gamma\publiclibrary\boost\boost\optional\optional.hpp(102) : while compiling class-template member function 'boost::basic_format<Ch>::size_type boost::basic_format<Ch>::size(void) const' with [ Ch=char ] c:\program files\microsoft visual studio .net 2003\vc7\include\ios(119) : while compiling class-template member function 'boost::basic_format<Ch> &boost::basic_format<Ch>::parse(const boost::basic_format<Ch>::string_type &)' with [ Ch=char ] d:\working\alan_gamma\publiclibrary\boost\boost\format\format_implementation.hpp(210) : warning C4267: '+=' : conversion from 'size_t' to 'std::streamsize', possible loss of data d:\working\alan_gamma\publiclibrary\boost\boost\format\format_implementation.hpp(213) : warning C4267: '+=' : conversion from 'size_t' to 'std::streamsize', possible loss of data RichOnline.cpp c:\program files\microsoft visual studio .net 2003\vc7\include\xutility(1136) : warning C4267: '=' : conversion from 'size_t' to 'std::allocator<_Ty>::value_type', possible loss of data with [ _Ty=gtl::dword ] c:\program files\microsoft visual studio .net 2003\vc7\include\vector(862) : see reference to function template instantiation 'void std::fill<std::vector<_Ty>::_Tptr,_Ty>(_FwdIt,_FwdIt,const _Ty &)' being compiled with [ _Ty=size_t, _FwdIt=std::vector<size_t>::_Tptr ] c:\program files\microsoft visual studio .net 2003\vc7\include\vector(809) : while compiling class-template member function 'void std::vector<_Ty>::_Insert_n(std::vector<_Ty>::iterator,std::vector<_Ty>::size_type,const _Ty &)' with [ _Ty=size_t ] d:\working\alan_gamma\publiclibrary\boost\boost\regex\v4\cregex.hpp(229) : see reference to class template instantiation 'std::vector<_Ty>' being compiled with [ _Ty=size_t ] c:\program files\microsoft visual studio .net 2003\vc7\include\xutility(1161) : warning C4267: '=' : conversion from 'size_t' to 'std::allocator<_Ty>::value_type', possible loss of data with [ _Ty=gtl::dword ] c:\program files\microsoft visual studio .net 2003\vc7\include\memory(237) : see reference to function template instantiation 'void std::fill_n<_Ty*,_Diff,_Tval>(_OutIt,_Diff,const _Ty &)' being compiled with [ _Ty=std::allocator<gtl::dword>::value_type, _Diff=std::vector<size_t>::size_type, _Tval=size_t, _OutIt=std::allocator<gtl::dword>::value_type * ] c:\program files\microsoft visual studio .net 2003\vc7\include\memory(257) : see reference to function template instantiation 'void std::_Uninit_fill_n<std::allocator<_Ty>::value_type,_Diff,_Tval>(_Ty *,_Diff,const _Tval &,std::allocator<_Ty> &,std::_Scalar_ptr_iterator_tag)' being compiled with [ _Ty=gtl::dword, _Diff=std::vector<size_t>::size_type, _Tval=size_t ] c:\program files\microsoft visual studio .net 2003\vc7\include\vector(878) : see reference to function template instantiation 'void std::_Uninitialized_fill_n<std::vector<_Ty>::pointer,std::vector<_Ty>::size_type,_Ty,std::_Vector_val<_Ty,_Alloc>::_Alty>(_FwdIt,_Diff,const _Tval &,_Alloc &)' being compiled with [ _Ty=size_t, _Alloc=std::allocator<gtl::dword>, _FwdIt=std::vector<size_t>::pointer, _Diff=std::vector<size_t>::size_type, _Tval=size_t ] c:\program files\microsoft visual studio .net 2003\vc7\include\vector(877) : while compiling class-template member function 'std::vector<_Ty>::pointer std::vector<_Ty>::_Ufill(std::vector<_Ty>::pointer,std::vector<_Ty>::size_type,const _Ty &)' with [ _Ty=size_t ] thanks very much for any reply. -- Yours Sincerely, Alan Huang

2 1

[lambda]Predicate construction
by Anakreon 29 Sep '05

29 Sep '05

I tried to create a predicate based on lambda expressions. The attempt failed with compiler errors so finally I created a struct to do the job. The problem is: I have a vector with pointers of objects of class Event. vector<Event*> events and want to call find_if on the vector. The struct which does this is: struct event_locator: public unary_function<bool, Event*> { int tId; event_locator(const int tid) : tId(tid) {} const bool operator() (Event* e) { return e->hasTransaction() && e->getTransaction().getId() == tId; } }; The main problem in translating the code in the struct into lambda expressions is that I don't know how to call a method from the placeholder like:_1->hasTransaction(). I tried _1->* &Event::hasTransaction without success.

3 5

MSVC v6 build fails in file boost\detail\shared_count.hpp
by David Balazic 29 Sep '05

29 Sep '05

Hi! I had to change line 216 in file boost\detail\shared_count.hpp from : void * get_deleter(std::type_info const & ti) const { to void * get_deleter(type_info const & ti) const { to get it built. (I am using boost in a prokejet. The build of my project fails in the above file ). I also had to make the same change in files boost\detail\sp_counted_base_w32.hpp and boost\detail\sp_counted_impl.hpp I have Visual Studio c++ 6.0. Is this a known problem ? Will it be pathced ? Regards, David --------------------------------------------------------------------- http://noepatents.eu.org/ Innovation, not litigation ! --- David Balazic mailto:david.balazic@hermes.si HERMES Softlab http://www.hermes-softlab.com Zagrebska cesta 104 Phone: +386 2 450 8851 SI-2000 Maribor Slovenija --------------------------------------------------------------------- "Be excellent to each other." - Bill S. Preston, Esq. & "Ted" Theodore Logan ---------------------------------------------------------------------

2 1

Spirit and CTTL
by Aaron Griffin 29 Sep '05

29 Sep '05

Ok, I didn't go to school for computer programming, so I never had experience with a "Compilers" class or anything related to lexing/parsing. But now I'm getting interested in it and have begun looking at some things. Spirit seems good, but it seems very weighty to work with. I was wondering if anyone has experiences with Spirit *and* CTTL and would be able to list for me some of the pros and cons of each. Spirit is, of course, a boost library and would be easier to find help and things of that nature, but CTTL seems to be a tad more lightweight (I'm not really sure). Thanks for any and all replies.

5 10

BOOST_CHECK_CLOSE with integral types
by Will Bryant 29 Sep '05

29 Sep '05

Hi all, Is BOOST_CHECK_CLOSE supposed to work with integral types? I find that if I try: long var1 = 1001; BOOST_CHECK_CLOSE(var1, 2000L, 10L); under both MSVC 2005 and GCC 3.4, it'll pass, which is wrong as far as I can see - whereas: double var2 = 1001.0; BOOST_CHECK_CLOSE(var2, 2000.0, 10.0); fails as it should. Why is this? int has the same problem. Cheers, Will -- Will Bryant http://carcino.gen.nz/ will(a)core-dev.co.nz +64 21 655 443

2 5

Using indirect_iterators for input
by Alexander Borghgraef 29 Sep '05

29 Sep '05

Hi all, I've been experimenting with indirect_iterator, which seems to be a very useful concept. However, I'm having some trouble getting it to work in the case where I want to fill a container with pointers to values, not just getting at the data. For example, this compiles but segfaults: std::vector < int * > v( 10 ); std::fill( boost::make_indirect_iterator( v.begin() ), boost::make_indirect_iterator( v.end() ), 1.0 ); Another case: std::vector< boost::shared_ptr<double> > v(10); std::vector< boost::shared_ptr<double> > w(10); // v gets filled somehow std::copy( boost::make_indirect_iterator( v.begin() ), boost::make_indirect_iterator( v.end() ), boost::make_indirect_iterator( w.begin() ) ); Why isn't this working? Also, some way to get it to work as a back_insert_iterator would be interesting, does this exist (aside from writing your own)? If not, are there any plans to incorporate it in future versions? -- Alex Borghgraef -- Alex Borghgraef

2 4

[serialization] Non intrusive splitting of serialize
by Marco Segurini 28 Sep '05

28 Sep '05

Hi, I like to know if is it possible to split the non intrusive 'serialize' to 'load/save/BOOST_SERIALIZATION_SPLIT_...(<class name>)' thanks. Marco.

2 1

Program options
by Paul Giaccone 28 Sep '05

28 Sep '05

In the documentation on program_options (program_options/overview.html), in the section Parsers Component it says "Sometimes it's desirable to specify value as several tokens. For example, an option "--email-recipient" may be followed by several emails, each as a separate command line token. This behaviour is supported, though it can lead to parsing ambiguities and is not enabled by default." This is just what I would like to. However, I haven't found anything in the documentation explaining how to do this. I don't think this can be done using positional options - is this correct? For example, I would like to be able to have command-line options along the lines of: -A 1 2 3 -B hello goodbye and have 1, 2, and 3 stored in a vector of integers associated with the -A flag, and "hello" and "goodbye" in a vector of strings associated with the -B flag. So how do I enable this? Paul Giaccone

1 0

VC++ 7.1 and precompiled header
by Marco Segurini 28 Sep '05

28 Sep '05

Hi VC++ 7.1 compiler uses the stdafx.h to create a precompiled headers file. I usually put all the boost headers in stdafx.h but sometime strange compiler errors are reported. If I move some headers out of stdafx.h all works fine. I like to know if there is a list of boost headers that cannot be put in the stdafx.h TIA Marco.

2 2

how to download a single library
by Stas Khirman 28 Sep '05

28 Sep '05

Hi, Is the way to extract one specific library ( smart_ptr in my case) from complete BOOST source tree? I need to use only smart_pointers, but undirtunately keeping a full BOOSt treen is too heavy for my CVS server. Are boost libraries heavy interrelated each with another? Regards Stas

4 3

boost::is_complex
by Edward Grace 28 Sep '05

28 Sep '05

Dear all, Can someone add an is_complex<T>::value trait to type_traits.hpp ::boost::is_complex<T>::value trait to type_traits.hpp I have found myself having to do this frequently. It strikes me that for templated scientific codes it is a common requirement. Below is my implementation, please feel free to add it. I should probably inform the maintainer as well, John Maddock but there is no obvious way of contacting him via the boost site. namespace boost { /** * @brief Default trait for determining if a type is complex at * compile-time. * * If the supplied template parameter type is not a std::complex<> * then this struct is instantiated and the ::value enum will be 0 * at compile time. * * See also boost::is_float and associated in * boost/type_traits.hpp */ template <typename T> struct is_complex : ::boost::mpl::false_{}; /** * @brief Overloaded trait for std::complex<> to determine if a * type is complex at compile-time. * * If the supplied type is std::complex<double> or similar this * overloaded struct is instantiated and the ::value enum will be * 1 at compile-time. * * See also boost::is_float and associated in * boost/type_traits.hpp */ template <typename T> struct is_complex<std::complex<T> > : ::boost::mpl::true_{}; } -ed -- Dr. Edward Grace Photonics Group, Physics Department Blackett Laboratory Imperial College SW7 2BW t: 020 759 47719 e: ej.grace(a)imperial.ac.uk w: http://ptweb.op.ph.ic.ac.uk/~graceej

2 1

[regex] Bug: negative lookahead does not work in 1.33.0
by Rob Willis 28 Sep '05

28 Sep '05

The following regex should match any document that IS NOT a pdf file: .*[.](?!pdf$).*$ This regex should match: Mynotes.doc It should fail on: Myinfo.pdf However, the above regex returns true on both using boost 1.33.0. But positive lookahead works fine: .*[.](?=pdf$).*$ Above regex correctly matches only documents ending in .pdf . Can anyone confirm this is a bug? Thanks, -Rob

2 1

[iostreams] interrupted reads / writes
by Marcus Alanen 28 Sep '05

28 Sep '05

Hello, I have been toying with a framework for process management. I have opted to catch SIGCHLD in my signal handler to handle child processes. However, boost::iostreams does not seem to recognize system calls which are interrupted, and throws exceptions. Witness ./libs/iostreams/src/file_descriptor.cpp: errno = 0; std::streamsize result = BOOST_RTL(read)(pimpl_->fd_, s, n); if (errno != 0) throw detail::bad_read(); return result == 0 ? -1 : result; if ::read fails with errno == EINTR, a bad_read will result. This is unfortunate, as caught SIGCHLD signals will result in spurious errors, as the following strace shows: ... read(9, 0x95d83ac, 4096) = ? ERESTARTSYS (To be restarted) --- SIGCHLD (Child exited) @ 0 (0) --- waitpid(-1, [{WIFEXITED(s) && WEXITSTATUS(s) == 0}], WNOHANG) = 2407 sigreturn() = ? (mask now []) write(2, "terminate called after throwing "..., 48) = 48 write(2, "std::ios_base::failure", 22) = 22 write(2, "\'\n", 2) = 2 write(2, " what(): ", 11) = 11 write(2, "bad read", 8) = 8 write(2, "\n", 1) = 1 ... As I understand it, boost was going to use ::read(), but the SIGCHLD got in between, resulting in a an exception being thrown. I realize that boost::process is not up and running yet, so this might be a usage conflict of posix & boost. Can somebody please enlighten me what the usage pattern here should be? Thanks in advance, Marcus

3 3

Re: [Boost-users] how to download a single library
by Sohail Somani 28 Sep '05

28 Sep '05

You can use bcp then import it into your tree. The link escapes memory though. Might want to google it. > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Stas Khirman > Sent: Monday, September 26, 2005 11:32 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] how to download a single library > > > Hi, > > Is the way to extract one specific library ( smart_ptr in my > case) from complete BOOST source tree? I need to use only > smart_pointers, but undirtunately keeping a full BOOSt treen > is too heavy for my CVS server. Are boost libraries heavy > interrelated each with another? > > Regards > Stas > > > > > > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Problems non intrusively serializing template inheritance classes, boost 1.33
by Pyush Agrawal 27 Sep '05

27 Sep '05

Hi, I am relatively a new to Boost serialization classes. I am trying to serialize a derived template class. template<class T> class base {}; tempate<class T> class derived : public base<T> {}; I am trying to serialize 'derived' and have tried many different things. I am unable to serialize the inherited template classes. For some reason the code calls (1) 'derived::Serialize' (2) 'base::Save' and never executes 'derived:: Save' and doesnot serialize the 'derived' object properly. I am attaching the source code (SerializeTemplates.cpp) and the output( output.txt) of the program. I am using MSVC7.1, debug mode, Boost 1.33, Spirit 1.8 It will be great, if somebody could point out what I am doing wrong. Thanks, Pyush

2 5

[function] Tiny documentation error?
by Stuart Dootson 27 Sep '05

27 Sep '05

I noticed that the documentation for boost::functionN::swap has a parameter type of "const functionN&". Shouldn't that be "functionN&" (i.e. non-const rather than const reference)? Stuart Dootson

1 0

Building boost for WinCE (eVC4)
by David Balazic 27 Sep '05

27 Sep '05

Hi! Did anyone succeed building boost with MS embedded C++ 4 for WinCE 4.2 (x86) platform ? I see no TOOLS is defined for "evc4". Help ! David Balazic PS: I posted this first over http://groups.google.com on friday, but it did not appear on the list, so I subscribed and re-posted it. --------------------------------------------------------------------- http://noepatents.eu.org/ Innovation, not litigation ! --- David Balazic mailto:david.balazic@hermes.si HERMES Softlab http://www.hermes-softlab.com Zagrebska cesta 104 Phone: +386 2 450 8851 SI-2000 Maribor Slovenija --------------------------------------------------------------------- "Be excellent to each other." - Bill S. Preston, Esq. & "Ted" Theodore Logan ---------------------------------------------------------------------

2 1

Documentation links home
by Andy Little 26 Sep '05

26 Sep '05

Hi, I was looking at http://www.boost.org/libs/smart_ptr/smart_ptr.htm and I was surprised to find that there was no link to the main boost page. There are many other doc pages that dont have a link either to their own index pages or the boost index page. (Though many others do e.g http://www.boost.org/doc/html/date_time.html .) Anyone arriving at pages with no link to their parents has no direct way to find e.g what is boost or how/ where to download the boost libraries. That aside it is annoying when browsing that one has no means to get back up the tree. URLs such as smart pointer above are frequently posted on eg comp.lang.++, but the lack of any simple means to get up the tree must leave many potential users stranded and frustrated. Shouldnt it possible at least to get from any page in a libraries documentation to its main index page (e.g http://www.boost.org/libs/smart_ptr/shared_ptr.htm) and ideally http://www.boost.org/ too? (FWIW You could at least make the boost logo a link to http://www.boost.org/) Just a thought. Andy Little

3 5

[xpressive] multiple matches for a group
by Cory Nelson 26 Sep '05

26 Sep '05

I'm attempting to learn xpressive by writing a simple IRC regex. The IRC protocol goes like: :prefix numericreplyorcommandstring param1 param2 :trailing param The regex looks like this (ignore comments and newlines): ^ (?::(\S+)\s)? // prefix (?:(\d+)|(\S+)) // command (?:\s([^:]\S*))* // parameters (?:\s:(.+))? // trailing parameter $ And my static xpressive looks like this: bos >> optional(':' >> (s1=+~_s) >> _s) >> // prefix ((s2=+_d)|(s3=+~_s)) >> // command *(_s >> (s4 = ~as_xpr(':') >> *~_s)) >> // parameters optional(_s >> ':' >> (s5=+_)) >> // trailing parameter eos I'm not sure how to retrieve the multiple matches for s4 - any help? -- Cory Nelson http://www.int64.org

3 2

[serialization] vector deserialization problem
by Sergey Filippov 26 Sep '05

26 Sep '05

Hi, all. I'm using boost 1.33.0 and I have a problem deserializing from an archive (I'm using VC 7.1). To reproduce the problem I wrote a sample program listed below. #include <sstream> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/vector.hpp> struct A { virtual ~A() {} friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) {} }; struct B: A { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<A>(*this); } }; BOOST_CLASS_EXPORT(A); BOOST_CLASS_EXPORT(B); int main(int argc, char* argv[]) { std::string str; { std::stringstream stream; boost::archive::binary_oarchive ar(stream); B b; std::vector<int> v(10); ar & b; ar & v; str = stream.rdbuf()->str(); } { std::stringstream stream; stream.rdbuf()->str(str); boost::archive::binary_iarchive ar(stream); B b; std::vector<int> v; ar & b; ar & v; // causes an assert } return 0; } During deserialization of the vector (a line with "// causes an assert"), an assert occurs in the line 266 in basic_iarchive.cpp. I don't understand the library source code well, but it looks something strange for me. As far as I understood the reset_object_address function supposed to be called with addresses of tracked objects. In my case the new_address parameter is the address of an element in the vector. But the vector elements are of a primitive type and must not be tracked. Maybe reset_object_address supposed to handle such a situation, but in the provided sample something goes wrong. If I skip the line with reset_object_address in archive_input_seq (collections_load_impl.hpp, line 91) in debugger, the sample works as expected. Also with 1.32 (in which archive_input_seq almost identical with one in 1.33 except the call to reset_object_address) the sample works as well. So I'm considering to patch the library by commenting this line. What side effects will it have? I as understood from previous posts in this forum reset_object_address was added as a bugfix to loading of containers with pointers to trackable objects. Is it safe to comment out the reset_object_address call, if I do not serialize such containers? Or maybe I'm just using the serialization library in a wrong way? Then where is the problem in my code? Thanks in advance. Sergey

2 1

Re: [Boost-users] [BBv2] getting started problem with headers
by Tino S. 26 Sep '05

26 Sep '05

Hi Volodya, after checking the "bin\msvc\release\hello.obj.rsp" file i saw that the backslashes was removed from the path name. Input in Jamfile : <include>D:\Temp\boost_1_33_0 Ouput in hello.obj.rsp: -I"D:Tempboost_1_33_0" Should the path substitution fixed in bjam? I changed the backslashes to slashes in Jamfile, removed the bin folder and invoked bjam ... and now it works!!! :) I tryed again the exe hello3 : hello.cpp : <include>$(BOOST_ROOT) ; after removing the bin folder and this works to!!! ..hmmm..??? Thanks a lot Volodya for fast help!! Tino ___________________________________________________________ Was denken Sie über E-Mail? Wir hören auf Ihre Meinung: http://surveylink.yahoo.com/wix/p0379378.aspx

2 1

Re: [Boost-users] [BBv2] getting started problem with headers
by Tino S. 26 Sep '05

26 Sep '05

>To begin with, try: > > exe hello : hello.cpp : <include>FULL_PATH_TO_BOOST ; > >If that builds, we can go on to solve you problem with >project constant. >If not, tell me what specific problem you have? Are >boost headers not found? >Or you get an error from Boost.Build? Or something >else? Hi Volody, thanks for the helping, but it would'nt work... The compliler could'nt find the boost header file. bjam should add -I$(BOOST_ROOT) to the command line invocation for compiling. Again my Jamfile ECHO " Build :\"" $(__name__) " boost dir: " $(BOOST_ROOT) ; exe hello1 : hello.cpp : <include>D:\Temp\boost_1_33_0 ; # hard coded... bad And this is my cmd output: D:\Temp\my_prj>bjam -d4 release Build :" Jamfile</D:/Temp/my_prj> boost dir: D:\Temp\boost_1_33_0 make -- all make -- all time -- all: unbound make -- <pbin\msvc\release>hello1.exe make -- <pbin\msvc\release>hello1.exe bind -- <pbin\msvc\release>hello1.exe: bin\msvc\release\hello1.exe time -- <pbin\msvc\release>hello1.exe: missing make -- bin\msvc\release make -- bin\msvc\release time -- bin\msvc\release: Thu Sep 22 20:47:40 2005 make -- bin\msvc make -- bin\msvc time -- bin\msvc: Thu Sep 22 20:47:40 2005 make -- bin make -- bin time -- bin: Thu Sep 22 20:47:40 2005 made stable bin made stable bin\msvc made stable bin\msvc\release make -- <pbin\msvc\release>hello.obj make -- <pbin\msvc\release>hello.obj bind -- <pbin\msvc\release>hello.obj: bin\msvc\release\hello.obj time -- <pbin\msvc\release>hello.obj: missing make -- <p.-object(c-scanner)@1>hello.cpp make -- <p.-object(c-scanner)@1>hello.cpp bind -- <p.-object(c-scanner)@1>hello.cpp: hello.cpp time -- <p.-object(c-scanner)@1>hello.cpp: Thu Sep 22 20:37:12 2005 make -- <p.>hello.cpp make -- <p.>hello.cpp bind -- <p.>hello.cpp: hello.cpp time -- <p.>hello.cpp: Thu Sep 22 20:37:12 2005 made stable <p.>hello.cpp make -- <p.-object(c-scanner)@1>hello.cpp make -- <p.-object(c-scanner)@1>hello.cpp time -- <p.-object(c-scanner)@1>hello.cpp: unbound make -- <object(c-scanner)@1>boost/array.hpp make -- <object(c-scanner)@1>boost/array.hpp bind -- <object(c-scanner)@1>boost/array.hpp: boost/array.hpp time -- <object(c-scanner)@1>boost/array.hpp: missing made stable <object(c-scanner)@1>boost/array.hpp make -- <object(c-scanner)@1>iostream make -- <object(c-scanner)@1>iostream bind -- <object(c-scanner)@1>iostream: iostream time -- <object(c-scanner)@1>iostream: missing made stable <object(c-scanner)@1>iostream made* newer <p.-object(c-scanner)@1>hello.cpp make -- <pbin\msvc\release>hello.obj.rsp make -- <pbin\msvc\release>hello.obj.rsp bind -- <pbin\msvc\release>hello.obj.rsp: bin\msvc\release\hello.obj. rsp time -- <pbin\msvc\release>hello.obj.rsp: Thu Sep 22 20:47:40 2005 made+ temp <pbin\msvc\release>hello.obj.rsp made+ update <pbin\msvc\release>hello.obj make -- <pbin\msvc\release>hello1.exe.rsp make -- <pbin\msvc\release>hello1.exe.rsp bind -- <pbin\msvc\release>hello1.exe.rsp: bin\msvc\release\hello1.exe .rsp time -- <pbin\msvc\release>hello1.exe.rsp: missing made+ update <pbin\msvc\release>hello1.exe.rsp made+ update <pbin\msvc\release>hello1.exe made update all ...found 12 targets... ...using 1 temp target... ...updating 3 targets... ...using <pbin\msvc\release>hello.obj.rsp... msvc.compile.c++ bin\msvc\release\hello.obj call "C:\Programme\Microsoft Visual Studio .NET 2003\Vc7\bin\vcvars32.bat" > nul cl /Zm800 -nologo -TP /Ob2 /GR /MD /Ogity /O2 /Gs /wd4675 /EHs @"bin\msvc\r elease\hello.obj.rsp" -c -Fo"bin\msvc\release\hello.obj" && del /f "bin\msvc\ release\hello.obj.rsp" Executing through .bat file Executing command [cmd.exe] [/Q/C] [C:\DOKUME~1\Tino\LOKALE~1\Temp\jam672-00.bat ] hello.cpp hello.cpp(9) : fatal error C1083: Include-Datei kann nicht geöffnet werden: 'boo st/array.hpp': No such file or directory 0.015625 sec system; 0.015625 sec user ...failed msvc.compile.c++ bin\msvc\release\hello.obj... ...skipped <pbin\msvc\release>hello1.exe.rsp for lack of <pbin\msvc\release>hell o.obj... ...skipped <pbin\msvc\release>hello1.exe for lack of <pbin\msvc\release>hello.ob j... ...failed updating 1 target... ...skipped 2 targets... Should i use the current cvs version? Tino ___________________________________________________________ Gesendet von Yahoo! Mail - Jetzt mit 1GB Speicher kostenlos - Hier anmelden: http://mail.yahoo.de

2 1

Python 'in' keyword-like in C++
by Tzu-Chien Chiu 25 Sep '05

25 Sep '05

Any boost library can make me write the expression like int x = 3; if ( x in list(3, 5, 6, 7) ) { ... } -- Tzu-Chien Chiu, 3D Graphics Hardware Architect <URL:http://www.csie.nctu.edu.tw/~jwchiu>

4 8

Re: [Boost-users] Newbie questions - regex namespace issue
by Charlton, Paul 25 Sep '05

25 Sep '05

Problem solved -- as for some shared learning -- the msvc.jam file was always stomping my <carefully> set Environment variables by calling "vcvars32.bat" as a setup, and placing MSVC/Includes ahead of STLPORT in the include search path. Msvc.jam has logic for "user setup|vcvars32", but does not have logic for "user setup|vcvars32|<do nothing, use env>" -- of course, providing a stubbed "setup.bat" will do the trick of keeping the env vars pristine. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Sunday, September 25, 2005 2:27 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Newbie questions - regex namespace issue >I just downloaded and built boost 1.33 for VC-8_0 and STLPORT 5.0. >(which required adding a jam file for vc-8_0) the build seems to have >gone fine, and a lot of things work, but I get the following link >error which seems to indicate that at least part of boost builds for >a client application with the wrong namespace on >stlpd_std::allocator<signature>. The library actually has exports for >std::allocator<signature> If the library has symbols with std:: in them, then it was *not* built against STLport. Double check all your bjam build options (do we have a toolset for VC8 and STLport anyway?), and if all else fails, I suggest you treat the regex lib as "just a bunch of sources" and build from your IDE, taking care to ensure that build options are the same as for your application. John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Newbie questions - regex namespace issue
by Charlton, Paul 25 Sep '05

25 Sep '05

I just downloaded and built boost 1.33 for VC-8_0 and STLPORT 5.0. (which required adding a jam file for vc-8_0) the build seems to have gone fine, and a lot of things work, but I get the following link error which seems to indicate that at least part of boost builds for a client application with the wrong namespace on stlpd_std::allocator<signature>. The library actually has exports for std::allocator<signature> I realize that it could easily be operator error <mine>, but I don't have the tools handy to backtrack through miles of templates and #define configuration variables to grok the underlying cause yet. Any pointers would be appreciated. ============================================================================ ========== FileUtils.obj : error LNK2019: unresolved external symbol "public: bool __thiscall boost::re_detail::perl_matcher<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::match(void)" (?match@?$perl_matcher@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@U ?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@re_detail@boost@@QAE_N XZ) referenced in function "bool __cdecl boost::regex_match<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> >,char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >(char const *,char const *,class boost::match_results<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> > > &,class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::_match_flags)" (??$regex_match@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@DU?$rege x_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@YA_NPBD0AAV?$match_re sults@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@@0@ABV?$basic_rege x@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@0@W4_match_flags@r egex_constants@0@@Z) FileUtils.obj : error LNK2019: unresolved external symbol "public: __thiscall boost::re_detail::perl_matcher<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::perl_matcher<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >(char const *,char const *,class boost::match_results<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> > > &,class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::_match_flags)" (??0?$perl_matcher@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@U?$re gex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@re_detail@boost@@QAE@PBD0A AV?$match_results@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@@2@ABV ?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@2@W4_m atch_flags@regex_constants@2@@Z) referenced in function "bool __cdecl boost::regex_match<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> >,char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >(char const *,char const *,class boost::match_results<char const *,class stlpd_std::allocator<struct boost::sub_match<char const *> > > &,class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::_match_flags)" (??$regex_match@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@DU?$rege x_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@YA_NPBD0AAV?$match_re sults@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlpd_std@@@0@ABV?$basic_rege x@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@0@W4_match_flags@r egex_constants@0@@Z) QBUtilities.DLL : fatal error LNK1120: 2 unresolved externals

2 1

Re: [Boost-users] Boost.Thread memory leak reported
by Will Bryant 25 Sep '05

25 Sep '05

Continuing on the thread about the threadmon singleton: > In addition, there is no good place to put the delete. You have to play > games with atexit and then deal with the possibily of resurrection > (singleton access after it's been deleted.) Can we not just use a static instance of a small deleter class whose destructor frees the singleton? (Note that I'm not suggesting that we use the static instance to also _create_ the singleton, nor to be the singleton itself - as already discussed, that's insufficient as there's no general way to specify initialization order so using call_once remains the best option there IMHO - but we _can_, I believe, fix the problem that's causing Visual C++ programs to spew out memory leak errors every time we run them.) -- Will Bryant http://carcino.gen.nz/ will(a)core-dev.co.nz +64 21 655 443

1 0

[mpl] bug in mpl::at?
by Geoffrey Romer 24 Sep '05

24 Sep '05

I'm trying to use the 3-argument version of the mpl::at metafunction, as described in the on-line manual[1], but I'm getting a compile error (using gcc 4.0.2): --- error: wrong number of template arguments (3, should be 2) /usr/include/boost/mpl/at_fwd.hpp:20: error: provided for 'template<class Sequence, class N> struct boost::mpl::at' --- Looking at at.hpp, at_fwd.hpp, and aux_/at_fwd.hpp, I don't see any sign of a 3-argument version of at; everything seems to be defined in terms of a 2-argument template. Am I doing something wrong, or is this a bug? [1] http://www.boost.org/libs/mpl/doc/refmanual/at.html

1 0

Memory leak in zlib iostreams unit
by Will Bryant 24 Sep '05

24 Sep '05

Hi all/Jonathan, valgrinding my applications that use zlib reveals that the zlib filter classes leak memory on destruction, as the call to inflateInit2/deflateInit2 is not matched by a corresponding call to inflateEnd/deflateEnd. I notice that boost/iostreams/filter/zlib.hpp has: template<typename Alloc> zlib_compressor_impl<Alloc>::~zlib_compressor_impl() { /*reset(true, false);*/ } and: template<typename Alloc> zlib_decompressor_impl<Alloc>::~zlib_decompressor_impl() { /*reset(false, false);*/ } - which I imagine were added in response George M. Garner's note about what I assume was the same problem (http://lists.boost.org/Archives/boost/2005/03/83379.php) Uncommenting those calls to reset fixes the memory leaks. Are they meant to be commented out in the release? Cheers, Will -- Will Bryant http://carcino.gen.nz/ will(a)core-dev.co.nz +64 21 655 443

2 1

mpl question
by Karl Meerbergen 24 Sep '05

24 Sep '05

Dear boost users, I have a question regarding mpl. Consider the following piece of code: typedef boost::mpl::vector<int,double> v_i_d_t ; typedef boost::mpl::pop_front<v_i_d_t>::type v_d_t ; Is v_d_t equal to boost::mpl::vector<double> ? I do not have the impression. Thanks, Karl

3 6

Error populating pointer container with stack based objects
by Allen Cronce 23 Sep '05

23 Sep '05

1 0

Re: [Boost-users] Python 'in' keyword-like in C++
by Foster Gareth 23 Sep '05

23 Sep '05

What do people think of actually including things like this in code? In terms of maintenance and readability, is it a good idea to create so many different ways of doing things? Purely thinking from the POV that, I find a library I want to modify to support some new thing, and I find it is full of unusual styles and obfuscated custom techniques. I'm not knocking boost or the stl, just wondering if things like trying to recreate python styles in C++ are a step too far, a sort of "what is wrong with the C++ style?" question. No flames, I'm _not_ telling anybody they are 'wrong' :) Gaz

3 2

[Serialization] Serializing classes defined in DLLs
by Topi Mäenpää 23 Sep '05

23 Sep '05

Hi, How do I register classes that are defined in a dynamically loaded so/dll? Using BOOST_CLASS_EXPORT just causes "terminate called after throwing an instance of 'boost::archive::archive_exception' what(): unregistered void cast". My set-up is as follows: class A { public: A(); virtual ~A() {} private: // polymorphic archive stuff here }; class B : public A {} BOOST_CLASS_EXPORT(B); Serializing instances of B through a A* works fine if B is defined in the main executable. Now, I have tried the following (approximately): // An exported function that returns a void pointer typedef void* (*func)(); int main() { // Load a dynamic library dll lib = load_dll("mylib.dll"); // Get a pointer to the instance creator function func instance_creator = (func)lib.resolve("instance_creator"); // An instance of B is created in the dll and returned as a void*. A* a = (A*)instance_creator(); ... archive & a; //throws unregistered void cast } B is both defined and exported in mylib.dll. So, what is the deal? I don't understand the soul of BOOST_CLASS_EXPORT well enough to solve the problem myself. But since I'm using the dll version of the serialization library, I'd assume that the dynamically loaded dll (mylib.dll) and the main executable use the same address space for the archive classes. I would understand this if I encountered this problem with static linking because I'd need to inlude two copies of the serialization library... Any advice? Regards, Topi

3 11

Python list comprehension-like syntax in C++
by Tzu-Chien Chiu 23 Sep '05

23 Sep '05

In Pyhon: y = [foo(_1) for _1 in x] In C++: list<int> x; x.push_back(...); .. list<int> y; for (list<int>::iterator it = x.begin(); x.end() != it; ++ it) y.push_back( foo(y) ); With boost, can we write the Python-like statement: copy( x.begin(), x.end(), magic_back_inserter(foo(_1), y) ); // pseudo-code -- Tzu-Chien Chiu, 3D Graphics Hardware Architect <URL:http://www.csie.nctu.edu.tw/~jwchiu>

5 6

example with Matrix iterator1, iterator2
by DrJekyll 23 Sep '05

23 Sep '05

dear group members I read through the Ublas document but could not see any example with the iterator1 and iterator2 of matrix. Could someone kindly send me some example and explanation please? thanks XS ________________________________________________________________ Sent via the WebMail system at empirics.net

1 0

[BBv2] getting started problem with headers
by Tino S. 23 Sep '05

23 Sep '05

Hi boosters, i can't build my first stand alone project with boost.build. I did'nt found any solutions in the doc. :( Here the facts: envirement: - winxp with vc7.1 and cygwin with gcc3.4 - bjam version 03.01.11 (which comes with boost 1.33) - set the SystemVar BOOST_ROOT=D:\Temp\boost_1_33_0 (under win) In my home directory are these files: // FILE: site-config.jam # Get Boost location from build system path-constant BOOST_ROOT : [ modules.peek : BOOST_ROOT ] ; // FILE: user-config.jam import toolset : using ; using msvc ; and here is my simple project dir + my_prj // FILE: hello.cpp #include <boost/array.hpp> #include <iostream> int main() { boost::array<int,4> a = { { 1, 2, 3 } }; std::cout << "Hello!\n"; std::cout << "a[1]:" << a[1] << '\n'; std::cin.get(); return 1; } // FILE: Jamfile # nothing works, :( .. could not find the boost header # nothing works.. exe hello : hello.cpp ; #exe hello1 : hello.cpp : <include>boost ; #exe hello2 : hello.cpp : <include>BOOST_ROOT ; #exe hello3 : hello.cpp : <include>$(BOOST_ROOT) ; // FILE: project-root.jam path-constant MY_DIR : . ; using lex ; using bison ; using testing ; What's wrong? Why could'nt found the boost header files? For beginners it would wounderfull to add samples to the doc which shows the integration of Boost (include and libs). Thanks in advance Tino Schumacher ___________________________________________________________ Gesendet von Yahoo! Mail - Jetzt mit 1GB Speicher kostenlos - Hier anmelden: http://mail.yahoo.de

2 1

Re: [Boost-users] [BGL] detect cycles in a directed graph
by Andrea Olgiati 23 Sep '05

23 Sep '05

Giulio, Here's an idea. You say you want to list all the vertices that make up any one of the (potentially very numerours) cycles that originate on a vertex X. If _any_ cycle will do, how about the shortest? You can use Dijkstra. From http://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html: "Also you can record the shortest paths tree in a predecessor map: for each vertex u in V, p[u] will be the predecessor of u in the shortest paths tree (unless p[u] = u, in which case u is either the source or a vertex unreachable from the source)." I don't think Dijkstra will work on a path that looks like V->X->Y->U->V (ie, a cycle). But, to get around this, you do know that U->V is an edge, so you can compute the shortest path between V and U, and know that there's an edge between U and V. HTH, Andrea -- Andrea Olgiati - Elixent - Castlemead, Lwr Castle St., Bristol BS1 3AG, UK andrea.olgiati(a)elixent.com ++44 (0)117 9175612 > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Giulio Veronesi > Sent: 22 September 2005 11:05 > Cc: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [BGL] detect cycles in a directed graph > > Thanks Vladimir. > > I'm not sure that I've followed well your description. Here > is my test implementation... but it doesn't work. > > Please, could you help me to discover the problem? > > Thanks in advance, > Giulio > > > typedef adjacency_list<vecS, vecS, directedS, > no_property, no_property> MyGraph; > > typedef graph_traits<MyGraph>::vertex_descriptor Vertex; > > > struct CycleDetector : public dfs_visitor<> { > CycleDetector(std::vector<Vertex> p, > std::vector<Vertex>& _cycle) : > m_predecessor(p), cycle(_cycle) { } > > template <class Edge, class Graph> > void back_edge(Edge e, Graph& g) > { > Vertex t = target(e, g); > Vertex c = source(e, g); > > cycle.push_back(c); > do { > c = m_predecessor[c]; > cycle.push_back(c); > } while(c != t); > } > > protected: > std::vector<Vertex>& cycle; > std::vector<Vertex> m_predecessor; > }; > > int main(int,char*[]) > { > > typedef std::pair<int,int> Edge; > std::vector<Edge> edges; > edges.push_back(Edge(0,1)); > edges.push_back(Edge(1,2)); > edges.push_back(Edge(2,3)); > edges.push_back(Edge(3,1)); > edges.push_back(Edge(3,4)); > edges.push_back(Edge(4,0)); > > MyGraph g(edges.begin(), edges.end(), 5); > > std::vector<Vertex> cycle; > std::vector<Vertex> p(num_vertices(g)); > CycleDetector vis(p, cycle); > depth_first_search(g, visitor(vis)); > > for (int i=0; i<cycle.size(); i++) > std::cout << cycle[i] << ", "; > std::cout << std::endl; > > return 0; > } > > > Vladimir Prus ha scritto: > >>something like this? > >> > >>template <class Edge, class Graph> > >>void back_edge(Edge e, Graph& g) { > >> clinks.push_back(TLink(source(e, g), target(e, g))); } > >> > >>where: > >> > >>typedef std::pair<int,int> TLink; > >>vector<TLink> clinks; > > > > > > Something more like: > > > > struct vis > > { > > vis(vector_property_map<int> predecessor) > > : m_predecessor(predecessor) {} > > > > template<......> > > void back_edge(Edge e, Graph& g) > > { > > vertex_descriptor t = target(e, g); > > vertex_description c = source(e, g); > > vector<vertex_descriptor> cycle; > > cycle.push_back(c); > > do { > > c = m_predecessor[c]; > > cycle.push_back(c); > > } while(c != t); > > } > > }; > > > > On construction, you need to pass the same > vector_property_map both to > > the visitor and the depth_first_search algorithm. > > > > Yes, this is untested code, sorry :-( > > > > - Volodya > > > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > >

2 1

Re: [Boost-users] A question about boost::lambda::if_ behavior
by tom gee 23 Sep '05

23 Sep '05

Thanks to Simon for the elaborate explanation. Thanks to Bjorn again for the url, getting me to the right place. Yes, I should have gone through the docs. (*^�n^*) > Message: 1 > Date: Thu, 22 Sep 2005 20:44:08 +1200 > From: Simon Buchan <simon(a)hand-multimedia.co.nz> > Subject: Re: [Boost-users] A question about boost::lambda::if_ > behavior > To: boost-users(a)lists.boost.org > Message-ID: <dgtqts$e0j$1(a)sea.gmane.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Bjorn.Karlsson(a)readsoft.com wrote: > > Hello Tom, > > > > -----Original Message----- > > From: tom gee [mailto:rockonedge@gmail.com] > > Subject: [Boost-users] A question about boost::lambda::if_ behavior > > > > > >>Can anyone please explain this code: > > > > [snip] > > > > The problem is that the expression std::cout << constant("Bingo:<") is > > evaluated immediately. Why? Because it's not a lambda expression. You have > > two options that will help you turn your if-branch into a lambda expression; > > either use boost::lambda::var or boost::lambda::constant. > > > > Using boost::lambda::var: > > > > std::for_each(setFinalVal.begin(),setFinalVal.end(), > > (std::cout << _1 << " ", if_(_1 < 24.000001 && _1 > 23.999999) > > [var(std::cout) << "Bingo:<" << _1 << ">"])); > > > > Using boost::lambda::constant: > > > > std::for_each(setFinalVal.begin(),setFinalVal.end(), > > (std::cout << _1 << " ", if_(_1 < 24.000001 && _1 > 23.999999) > > [std::cout << constant("Bingo:<") << _1 << ">"])); > > > > > > Cheers, > > Bjorn Karlsson > constant should be better (lower overhead, conceptually closer), > but no biggy. I beleive this is the No.1 FAQ, is it not? > (PS: why does not the lambda docs say in the function call overload > section to use BLL's bind? It took me AGES to figure out how to do > that!) > > Message: 7 > Date: Thu, 22 Sep 2005 22:37:28 +1200 > From: Simon Buchan <simon(a)hand-multimedia.co.nz> > Subject: Re: [Boost-users] A question about boost::lambda::if_ > behavior > To: boost-users(a)lists.boost.org > Message-ID: <dgu1ic$2g2$1(a)sea.gmane.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > tom gee wrote: > > Hello Bjorn, > > > > Thanks for such a quick help. I works now. > > > > Can you please further explain the usage of var and constant . > > in the expression > > if_(_1 < 24.000001 && _1 > 23.999999)[ cout <<"Bingo:<"<<_1<<">"]) > > I understand "Bingo:<" is evaluated immediately, why not ">", which is not a > > lambda expression either, is not > > evaluated along. > > > Refresher course: an expression like: > cout << foo << bar << endl; > is read (aka parsed) by the compiler to be shorthand for the following: > (((cout << foo) << bar) << endl); > which, incidently is just shorthand for: > operator<<(operator<<(operator<<(cout, foo), bar), endl); > Thus, '<<' is known as a 'left assosiative' (I think :D) operator. > Refresher over. > Basicly, the 'cout << "Bingo:<"' sub-expression has no 'lambda stuff' in > it, and therefore calls the _normal_ operator<<, which immediately > prints "Bingo:<". This operator<< returns a reference to cout, so the > next '<<' sees: > cout << _1 > Which (obviously) is an expression containing a lambda (sub-)expression. > The guys who made this library were nice enough to provide overloads of > '<<' (along with every other possible operator) that return a 'lambda > function object', you just have to know that it is a valid lambda > expression that _will_ evalute as "cout << _the_first_argument_" when > called. The same happens with the next <<, it sees: > _lambda_operator_left_shift_ << ">" > , where the left argument is the previous lambda function object made > from the "cout << _1" sub-expression. Now there is _another_ overload of > << that creates _another_ lambda function object, that _will_ evalute as > if it was: > cout << _the_first_argument_ << ">" > So, basicly, anytime there is a sub-expression that doesn't have a > lambda object in it, it is treated as a normal expression, but if it > does, it creates a function object that will do what it looks like it > would do. What 'constant' and 'var' do is make a (lambda?) function > object that just returns it's argument, as, respectively, a constant > copy, or a reference to the original (I think, again, use boost::ref to > be sure) > > Forgive me if this question seems stupid, but I am new to Lambda, fascinated > > by its power, but convoluted by its mechanism yet. > > > > Thanks. > > > [snip] > > Don't worry about it, but don't forget to read the documentation! > One more thing to keep in mind, the overload for '()', the call > operator, for a lambda function object immeadiatly evaluates it's > contained expression, ie: > (_1 + 3)(4) == (4 + 3); > to get around this if you want to delay a call to that object, use: > boost::lambda::bind(_1 + 3, 4); > which returns a lambda function object that when called, calls the first > argument with the rest of bind's arguments as it's arguments, so: > bind(_1 + 3, 4)() == (_1 + 3)(4) == (4 + 3) > Which is VERY usefull if you want to, say call functions in a STL container: > > int i, j; > std::vector<void(*)(int, int)> some_funcs; > ... > std::for_each(some_funcs.begin(), some_funcs.end(), bind(*_1, i, j)); > > Although, Boost.Signals is probably a better bet if you do stuff like > that a bit. >

1 0

why not boost::bind::_1 ?
by ClassyK 22 Sep '05

22 Sep '05

when include "boost\bind.hpp", why _1 is in global space rather than boost::bind, while in lamba, there is boost::lamba::_1

1 0

Re: [Boost-users] [BGL] detect cycles in a directed graph
by Vladimir Prus 22 Sep '05

22 Sep '05

On Thursday 22 September 2005 10:50, Giulio Veronesi wrote: [replying to list, no need to keep this off-list] > Vladimir Prus ha scritto: > > Giulio Veronesi wrote: > >>assistance in the following problem: "get all the edges of a cycle". > > > > Of which cycle? > > > > If you want to get at least one cycle in a graph that has one, then you > > need to create a visitor that implements "back_edge" method and use > > predecessor map to traverse the cycle in reverse order. > > Yes! Only one cycle. Please, could you give me a pratical example (just > the pseudo code)? I've very little experience with BGL. Do you intend > something like this? > > template <class Edge, class Graph> > void back_edge(Edge e, Graph& g) { > clinks.push_back(TLink(source(e, g), target(e, g))); > } > > where: > > typedef std::pair<int,int> TLink; > vector<TLink> clinks; Something more like: struct vis { vis(vector_property_map<int> predecessor) : m_predecessor(predecessor) {} template<......> void back_edge(Edge e, Graph& g) { vertex_descriptor t = target(e, g); vertex_description c = source(e, g); vector<vertex_descriptor> cycle; cycle.push_back(c); do { c = m_predecessor[c]; cycle.push_back(c); } while(c != t); } }; On construction, you need to pass the same vector_property_map both to the visitor and the depth_first_search algorithm. Yes, this is untested code, sorry :-( - Volodya

4 3

[bind] use with shared_ptr
by Neal Coombes 22 Sep '05

22 Sep '05

Bind is very convenient for use with shared_ptr: struct C { void func() {} }; shared_ptr<C> c(new C); bind(&C::func, c)(); // calls c->func() However I've found a snag when trying to do function composition: class A { shared_ptr<C> func() { return shared_ptr<C>(new C); } }; A a; bind(&C::func, bind(&A::func, a)); // doesn't work, instead must: bind(&C::func, bind(&get_pointer<B>, bind(&A::func, a))); The fact that I can work around this is obviously a good thing. But the work around is significantly less clear, especially when attempting to convince a development team that boost and bind are Good Things(tm) and they should be adopted. Is it horribly difficult to make the simpler composition work (i.e. was it tried and impossible or simply overlooked)? Thanks, Neal

2 2

Re: [Boost-users] A question about boost::lambda::if_ behavior
by Bjorn.Karlsson＠readsoft.com 22 Sep '05

22 Sep '05

From: tom gee [mailto:rockonedge@gmail.com] > Can you please further explain the usage of var and constant . > in the expression if_(_1 < 24.000001 && _1 > 23.999999)[ > cout <<"Bingo:<"<<_1<<">"]) > I understand "Bingo:<" is evaluated immediately, why not ">", > which is not a lambda expression either, is not evaluated along. Actually it is a lambda expression! The reason is the preceding streaming of _1, which implicitly marks the expression as a lambda expression. So, std::cout << "Bingo:<" is not a lambda expression, and is thus evaluated immediately. The last part of the expression is a lambda expression, _1 << ">" (or rather std::cout << _1 << ">"), but it won't be invoked. See http://tinyurl.com/7jq3v for details on how to use constant and var. > Forgive me if this question seems stupid, but I am new to Lambda, > fascinated by its power, but convoluted by its mechanism yet. The question isn't stupid, and you're more than welcome to keep asking. And I agree that Boost.Lambda's power is fascinating. Bjorn Karlsson

1 0

Re: [Boost-users] A question about boost::lambda::if_ behavior
by tom gee 22 Sep '05

22 Sep '05

Hello Bjorn, Thanks for such a quick help. I works now. Can you please further explain the usage of var and constant . in the expression if_(_1 < 24.000001 && _1 > 23.999999)[ cout <<"Bingo:<"<<_1<<">"]) I understand "Bingo:<" is evaluated immediately, why not ">", which is not a lambda expression either, is not evaluated along. Forgive me if this question seems stupid, but I am new to Lambda, fascinated by its power, but convoluted by its mechanism yet. Thanks. -----Original Message----- From: tom gee [mailto:rockonedge@gmail.com] Subject: [Boost-users] A question about boost::lambda::if_ behavior > Can anyone please explain this code: [snip] The problem is that the expression std::cout << constant("Bingo:<") is evaluated immediately. Why? Because it's not a lambda expression. You have two options that will help you turn your if-branch into a lambda expression; either use boost::lambda::var or boost::lambda::constant. Using boost::lambda::var: std::for_each(setFinalVal.begin(),setFinalVal.end(), (std::cout << _1 << " ", if_(_1 < 24.000001 && _1 > 23.999999) [var(std::cout) << "Bingo:<" << _1 << ">"])); Using boost::lambda::constant: std::for_each(setFinalVal.begin(),setFinalVal.end(), (std::cout << _1 << " ", if_(_1 < 24.000001 && _1 > 23.999999) [std::cout << constant("Bingo:<") << _1 << ">"])); Cheers, Bjorn Karlsson

2 1

Re: [Boost-users] algorithms and member functions
by Foster Gareth 22 Sep '05

22 Sep '05

> What's wrong with: > std::for_each > ( as.begin > , as.end() > , bool some_function_keyword(A& a) > { return a.wee() & SOME_FLAG; > } > ); > I think the previous poster (whos comments where appreciated) implied that while some languages (he mentioned Lisp and Perl I think, and I mentioned Java) could/do support this, C++ would struggle to. It would make things hairy for the compiler because a function definition is not preceeded by any keyword. I think you can also do things a bit like this in java ... Interesting perhaps that there is a keyword involved in this case, would this still bog down compilers so much as to outweight the advantages of the sytax style (assuming there are any, I'm happy to be argued out of thiking this kind of coding is neat). button_click_event.set_handler ( new class : public button_click_event_handler { void on_click() { std::cout << "anon_class::on_click() : printing wee" << std::endl; } } ); > I don't know what a good function keyword name would be. > Obviously: fn, function, lambda are in common use everywhere > (and fn is too short for a C++ keyword! :D) > Reuse 'inline'? I suppose inline would make sense, but it might be a bit of a hack to have it used in two senses. I wonder if you can do this stuff in Delphi, they have a function keyword. Thesaurus :) " function noun 1. The proper activity of a person or thing: job, purpose, role, task. See do/not do. 2. A large or important social gathering: affair, celebration, festivity, fete, gala, occasion, party, soiree. Informal do. Slang bash. See group, work/play. verb 1. To react in a specified way: act, behave, operate, perform, work. See action/inaction. 2. To perform a function effectively: go, operate, run, take, work. See thrive/fail/exist. 3. To perform the duties of another: act, officiate, serve. See do/not do, substitute. " Cheers for the responses anyway, Gaz

2 1

Re: [Boost-users] A question about boost::lambda::if_ behavior
by Bjorn.Karlsson＠readsoft.com 22 Sep '05

22 Sep '05

Hello Tom, -----Original Message----- From: tom gee [mailto:rockonedge@gmail.com] Subject: [Boost-users] A question about boost::lambda::if_ behavior > Can anyone please explain this code: [snip] The problem is that the expression std::cout << constant("Bingo:<") is evaluated immediately. Why? Because it's not a lambda expression. You have two options that will help you turn your if-branch into a lambda expression; either use boost::lambda::var or boost::lambda::constant. Using boost::lambda::var: std::for_each(setFinalVal.begin(),setFinalVal.end(), (std::cout << _1 << " ", if_(_1 < 24.000001 && _1 > 23.999999) [var(std::cout) << "Bingo:<" << _1 << ">"])); Using boost::lambda::constant: std::for_each(setFinalVal.begin(),setFinalVal.end(), (std::cout << _1 << " ", if_(_1 < 24.000001 && _1 > 23.999999) [std::cout << constant("Bingo:<") << _1 << ">"])); Cheers, Bjorn Karlsson

2 1

Boost function
by Labour, Matthieu (MLPRO SF) 22 Sep '05

22 Sep '05

Hi Is it possible to have boost function with unlimited arguments For example: boost::function <../boost/function.html> <float (int x, ...)> f; Thank you -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

3 2

Re: [Boost-users] algorithms and member functions
by Alan M. Carroll 22 Sep '05

22 Sep '05

Using the example in your other e-mail, a solution is find_if(as.begin(), as.end(), boost::bind(std::bitwise_and<int>(), SOME_FLAG, boost::bind(&A::wee, _1))); Anonymous functions and classes are nice. LISP, of course, did it best :-). The closest approximation of this in modern languages is actually in Perl. In Perl, any place you need a code/function pointer, you can write an anonymous function instead of using an existing one. This anonymous function is identical to any other function, it just doesn't have a name (and in fact, you could give it a name later, if you really wanted). It is definitely a very powerful language feature and a lot of the bind / lambda work is intended to support as much of that as possible. I suspect that we're not seeing change in this area because the C++ grammar is already extremely hard to parse and rather cantankerous. Adding this kind of feature might well push it over in to unusablity. A more uniform concept of "code block" as the chunk of stuff enclosed by curly braces would help, but you still have the problem of argument declaration. Perl solves that by having only one argument style so explicit specification is not needed. LISP solved it by embedding the argument declarations inside the code block. C++, unfortunately, puts argument declarations outside the code block while not having a keyword to indicate a function declaration (perhaps, finally, a use for "entry"?). At 11:04 AM 9/21/2005, you wrote: >Hello all, > > >What interests me is the anonymous methods / class style syntax that Java >offers. I've played with it myself, and it seems nice, and one of the >proponents in the afore mentioned flame war advocates it. > >What is the thinking behind not introducing such syntax into C++?

2 1

A question about boost::lambda::if_ behavior
by tom gee 22 Sep '05

22 Sep '05

Can anyone please explain this code: for_each( setFinalVal.begin(), setFinalVal.end(), ( cout<<_1<<" ", if_(_1 < 24.000001 && _1 > 23.999999)[ cout <<"Bingo:<"<< _1<<">"]) ); where setFinalVal is defined as set<double>. I expect it to result in: -32 -24 -16 -12 -11 -10 -9 -8 -7 -5 -4 -3 -2 0 4 5 6 7 8 9 11 12 13 14 24 Bingo:<24>32 40 However, compiled with VC++2005 express, it results in: Bingo:<-32 -24 -16 -12 -11 -10 -9 -8 -7 -5 -4 -3 -2 0 4 5 6 7 8 9 11 12 13 14 24 24>32 40 Why?

1 0

[BGL] detect cycles in a directed graph
by Giulio Veronesi 22 Sep '05

22 Sep '05

Hi, This is my second post for the same problem. Excuse me! I think that the problema can be resolved using the EventVisitor Concept but I don't understand how use it. I would be extremely grateful for any assistance in the following problem: "get all the edges of a cycle". Thanks a lot in advance, Giulio

2 2

[Boost.Signals] One-shot slot?
by Simon Buchan 22 Sep '05

22 Sep '05

What would be the simplest way to make a slot that, once signaled, would disconnect itself? I thought that boost::signals::trackable & 'delete this' would do it, but it seems to be only for boost::bind functors... I am trying: my_slot* foo = new my_slot(...); connection c = sig.connect(bind(foo)); foo->my_connection = c; (vastly simplified, that probably wouldn't compile) and have my_slot 'delete this' in it's op() and 'my_connection.disconnect()' in it's d'tor, but this seems very inelegant, particlarly as this is in a mutli-threaded environment (I know signal isn't thread- safe, but some boost::mutex's normally do the trick) Should I try using a Combiner to weed out slots marked 'once only' or something? Many thanks in advance!

1 0

Boost.Graph can a graph that is a directedS be safely converted to a bidirectionalS?
by Elisha Berns 22 Sep '05

22 Sep '05

Hi, I have a Boost.Graph object that needs to model as closely as possible a DAG in order to be a dependency graph. As such it is an adjacency_list with a directedS policy. All works fine, except that it also needs to work as the inverse of a dependency graph: it needs to find the vertices for a given vertex V that are the 'dependents' (?) of V, that is to say that all the found vertices depend upon V, not that V depends upon them. So I assume that to search for the dependents of vertex V I need to get all the in-edges of V, and the in-edges of all those in-edges recursively? This is apparently feasible by using a bidirectionalS policy for the graph. But my questions are the following: 1) Is there some other better way to do this, such as another graph traversal algorithm? 2) What's the computational expense, in general, of using a bidirectionalS graph over a directedS graph in terms of speed and memory? 3) In the event that there is no better way and a bidirectionalS graph is much fatter and slower than a directedS graph does it make sense to construct the bidirectionalS graph only when needed? Since I only need this when its requested, not as a permanent feature of the application, I could copy the entire directedS graph to create some other graph for this purpose. But here the graph size can vary from a few hundred vertices to several tens of thousands of vertices, so if there is a way to avoid this its probably best. Thanks for any insight here, Elisha Berns e.berns(a)computer.org tel. (310) 556 - 8332 fax (310) 556 - 2839

2 3

Boost.Tuple extension *style* question
by Alan M. Carroll 21 Sep '05

21 Sep '05

2 1

ICU vs Boost Regex
by louis 21 Sep '05

21 Sep '05

I was just looking at the ICU code from IBM and noticed they have a regex engine. Does anyone have experience with this regex engine and how does it compare to the one in the boost library? Any feedback would be greatly appreciated. Thanks Louis

1 0

list of optional dependencies for building boost?
by Benjamin Rutt 21 Sep '05

21 Sep '05

I am new to boost and have a question on building it from source. I built it once using the command: bjam --with-python-root=/home/rutt/python-2.4 -sPYTHON_VERSION=2.4 --prefix=/home/rutt/boost install So you can see that I at least resolved the optional dependency on Python. I also noticed that it warned me that it could not find the bzip2 or gzip packages (I can't remember which). At the end of the build, it mentioned something about a number of errors it had in building, yet it did install the boost libraries. So it seems that the build process continues on past failures (something like 'make -k'). I guess those "failures" must have been unmet optional dependencies? My intention is to build a fully capable boost library and have zero errors and zero unmet dependencies. Is there some documentation or method to obtain information about all optional dependencies boost can pick up at build time? I would like to install them all, to ensure a clean, zero-error build and know that I have a fully functional boost. Thank you, -- Benjamin Rutt

2 3

Re: [Boost-users] inheriting from boost::thread
by Simmons, Aaron 21 Sep '05

21 Sep '05

I write a lot of cross-platform code that's used from JNI. In JNI, you should tell the JVM about native threads that are running. Because Java threads are named, when you attach a native thread to the JVM you have to specify a name. It occurred to me that I could write a "jnithread" class that inherits from boost::thread. It would take a thread-name argument. Before the threadfunc runs it would attach the new thread to the JVM, and when the threadfunc ends it would detach from the JVM. It's relatively easy to write such a class, and would make life easier for thread creation within JNI. However, I hesitate because of the lack of a virtual destructor... -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of me22 Sent: Wednesday, September 21, 2005 1:27 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] inheriting from boost::thread On 21/09/05, Simmons, Aaron <a-simmons1(a)ti.com> wrote: > > I've been thinking about writing a class that inherits from boost::thread. > However, I noticed that the destructor isn't virtual. Shouldn't it be? > boost::thread is designed neither as a base class nor to be used polymorphically. Why do you want to inherit from a thread? You still couldn't get at the private thread handles and there are no virtual functions to modify behavior. - Scott _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

boost::test 1.33 compile problem on VC7.0+STLport (1.32 fine)
by Steve Streeting 21 Sep '05

21 Sep '05

Hi, I just upgraded to Boost 1.33 and a set of my unit test routines written against boost::test 1.32 have suddenly started reporting compile errors. I can trigger the issue very simply: --- #include <boost/test/included/unit_test_framework.hpp> #include <boost/test/unit_test.hpp> using namespace boost::unit_test; test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_suite* test = BOOST_TEST_SUITE( "tests" ); } --- In Boost 1.32 this works fine, in Boost 1.33 it reports: --- c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2440: 'initializing' : cannot convert from 'long' to 'boost::unit_test::for _each::static_any_t' Reason: cannot convert from 'long' to 'const boost::unit_test::for_each::static_any_base' No constructor could take the source type, or constructor overload resolution was ambiguous c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2143: syntax error : missing ')' before '=' c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2143: syntax error : missing ';' before '=' c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2059: syntax error : ')' c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2143: syntax error : missing ';' before '{' c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2181: illegal else without matching if c:\temp\boost_1_33_0\boost\test\impl\framework.ipp(305) : error C2440: 'initializing' : cannot convert from 'long' to 'boost::unit_test::for_each::static_any_t' Reason: cannot convert from 'long' to 'const boost::unit_test::for_each::static_any_base' No constructor could take the source type, or constructor overload resolution was ambiguous --- .. and so on (hits upper error limit). I've just reverted back to 1.32 for now, but can you tell me why this happens? Many thanks Steveboost::test 1.33 compile problem on VC7.0+STLport

2 1

Re: [Boost-users] inheriting from boost::thread
by Sohail Somani 21 Sep '05

21 Sep '05

-----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Simmons, Aaron Sent: Wednesday, September 21, 2005 10:29 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] inheriting from boost::thread I've been thinking about writing a class that inherits from boost::thread. However, I noticed that the destructor isn't virtual. Shouldn't it be? Your problem might be better solved using containment

1 0

inheriting from boost::thread
by Simmons, Aaron 21 Sep '05

21 Sep '05

I've been thinking about writing a class that inherits from boost::thread. However, I noticed that the destructor isn't virtual. Shouldn't it be? Thanks, aaron

2 1

Re: [Boost-users] static maps (was trouble with boost::assign)
by Gottlob Frege 21 Sep '05

21 Sep '05

On 9/20/05, boost-users-request(a)lists.boost.org < boost-users-request(a)lists.boost.org> wrote: > > Message: 2 > Date: Mon, 19 Sep 2005 12:35:08 -0500 > From: "Lee Crabtree" <lcrabtree(a)goisi.com> > Subject: [Boost-users] trouble with boost::assign > To: boost-users(a)lists.boost.org > Message-ID: <dgmsos$amg$1(a)sea.gmane.org> > > Hi, I'm trying initialize a static map with map_list_of. Something along > the > lines of: > > map<int,int> blarg = map_list_of(1, 2); > > However, when I go to compile, I receive the following error: ... Lee Crabtree > > > Can't help you with the error, unfortunately, but just wondering - does this map *remain* static after initialization? ie Do you do any inserts or deletes after init? I wrote a static_map<K, T> that is constructed from a static array, which I use for those cases where the map doesn't change, and I was just wondering how useful people thought it might be - ie how often do you have maps that never change after initialization from static data?

2 1

Re: [Boost-users] algorithms and member functions
by Foster Gareth 21 Sep '05

21 Sep '05

> " > class A { > void wee(); > } > > container<A> as; > for_each(in as, a::wee()); > " > So as as not to miss the point, I think I'd better expand the pseudo code example just a tad ... " class A { int wee() { return m_wee } // returns bit flag style int int m_wee; }; container<A> as; find_if ( in as, // somehow need to say here "current->wee() & SOME_FLAG" ); " Hope that is a little more clear. Thanks again, Gaz

1 0

algorithms and member functions
by Foster Gareth 21 Sep '05

21 Sep '05

Hello all, Take for example, a situation where, in psuedo code of course, I want to do this sort of thing ... " class A { void wee(); } container<A> as; for_each(in as, a::wee()); " I did a little google work on this and found this amazing flame war between a Java user and a Boost/C++ user: [ http://episteme.arstechnica.com/groupee/forums/a/tpc/f/6330927813/m/26500301 5731 ] It seems from this that we, as c++ users, have as options: * writing a new functor to call methods * using std::mem_fn * using the boost enhancements to the above I get the impression that boost bind and lambda are relevent here, although I've only glanced at examples. What interests me is the anonymous methods / class style syntax that Java offers. I've played with it myself, and it seems nice, and one of the proponents in the afore mentioned flame war advocates it. What is the thinking behind not introducing such syntax into C++? I am sort of working from the assumption that the template solutions (as opposed to language modification solutions) in boost at the moment, will be moved into std:: and offered as a solution rather than an update to the language. It may be that I have the wrong end of the stick there, and that the boost solutions are a temporary solution. It may also be there are good reasons to prefer the template style solution. It may also be I am talking tripe :) Anyway, I hope this doesn't make a mountain out of a mole hill. I'm just wondering about the decisions that have been / are likely to be made, in this area. I don't claim to hold any opionion on the matter, other than "I think it is an interesting matter" :) Thanks all, Gaz ********************************************** * http://www.mozilla.org/products/firefox/ * **********************************************

1 0

BGL - edge descriptor and map
by Giulio Veronesi 21 Sep '05

21 Sep '05

I'd like to specify better my problem. I'd like to use an edge_descriptor (graph_traits<G>::edge_descriptor) as key in a map. The graph type is something like this: typedef adjacency_list<vecS, vecS, bidirectionalS, no_property, MyStuff> G; I think that I've to overload the < operator for graph_traits<G>::edge_descriptor. Is this correct? If so, given two edge_descriptors I need to access the source and the target of the edge in such a way to define a sort ordering. Thanks, Giulio

2 1

enable_if missing from status summary
by Steven Solie 21 Sep '05

21 Sep '05

I'm finding the utility/enable_if tests are missing from the status summary for my AmigaOS port. I think the process_jam_log tool is unable to handle it for some reason because the xml output files are incorrect. I see from a Google search this has been discussed before. Has there been any resolution to this problem? --Steven

3 2

[BGL] detecting cycles path in a graph
by Giulio Veronesi 21 Sep '05

21 Sep '05

Hi, I'd like to obtain the path of a cycle in a graph. The file dependency example in the user guide only allow to discover cycles and not the path that forms the cycle. Please, could you help me to address this problem? Thanks a lot, Giulio

1 0

Re: [Boost-users] list of optional dependencies for building boost?
by Andrew Holden 21 Sep '05

21 Sep '05

One other I know of: the Regex library can depend on the ICU Unicode libraries (http://www-306.ibm.com/software/globalization/icu/index.jsp) Andrew Holden -----Original Message----- From: Benjamin Rutt [mailto:rutt@bmi.osu.edu] Sent: Tuesday, September 20, 2005 9:38 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] list of optional dependencies for building boost? OK, from what I've gathered, boost can optionally depend on python and gzip+bzip2 libraries. If anyone can think of something I have missed, let me know. Thanks, -- Benjamin Rutt _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: [Boost-users] Scons users?
by David Abrahams 21 Sep '05

21 Sep '05

Andy Moreton <andy.moreton(a)artimi.com> writes: > I think that the effort expended on BBv1/BBv2 would have been far better > spent on fixing the performance issues in scons. Just for the record, BBv1 predates Scons by some considerable time. When I began that project I tried to get Steven Knight to start on Scons with me and at the time he wasn't ready yet. -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

BGL - edge descriptor
by Giulio Veronesi 21 Sep '05

21 Sep '05

Hi, I'd like to extract the source and target vertex id from an edge_descriptor without using the graph that contains the edge. More specifically, consider the following code: typedef graph_traits<MyGraph>::edge_descriptor MyLink; void MyFunction(MyLink& link) { cout << "source vertex id: " << ??? << ", target vertex id: " << ??? << endl; } What I've to put at place of ??? to print the source and target vertex id? Is it a dirty solution to use the m_source and m_target field of the edge_descriptor structure? Thanks, Giulio

1 0

Date_time library question
by Michal Lijowski 20 Sep '05

20 Sep '05

I just started with date_time library using boost-1.33.0-3 on FC4 and gcc 4.0.1 20050727. It is rpm version downloaded from http://download.fedora.redhat.com/pub/fedora/linux/core/development/i386/Fe…. I copied some lines of code from boost_date_time.pdf to get familiar with capabilities of this library and I encountered some problems. Here is a modified code taken from page 3 of the manual /* The following is a simple example that shows conversion of dates * to and from a std::string. ** Expected output: * 2001-Oct-09 * 2001-10-09 * Tuesday October 9, 2001 * An expected exception is next: * Exception: Month number is out of range 1..12 */ #include "boost/date_time/gregorian/gregorian.hpp" #include "boost/date_time/posix_time/posix_time.hpp" #include "boost/date_time/posix_time/posix_time_duration.hpp" #include "boost/date_time/local_time/local_time.hpp" #include <iostream> #include <string> #include <sstream> using namespace boost::gregorian; using namespace boost::local_time; using namespace boost::posix_time; using namespace std; int main() { try { //input streaming stringstream ss("2004-Jan-1"); date d; ss >> d; cout << " d " << d << endl; ptime t0; ss >> t0; cout << " t0 " << t0 << endl; date d1(1999, Jan, 1); ss >> d1; cout << " d1 " << d1 << endl; ptime t2(d1, minutes(0)); cout << " t2 " << t2 << endl; ss >> t2; cout << " t2 " << t2 << endl; date d3(2002,Feb,1); //an arbitrary date // the line below compiles with error: ‘nanosec’ was not declared in this scope // ptime t1(d3, hours(5)+nanosec(100)); //date + time of day offset ptime t1(d3, hours(5)); cout << " d3 " << d3 << endl; ptime t3 = t1 - minutes(4)+seconds(2); ptime now = second_clock::local_time(); //use the clock date today = now.date(); //Get the date part out of the time date tomorrow = today + date_duration(1); ptime tomorrow_start(tomorrow); //midnight // std::stringstream ss1("2004-Jan-1 05:21:33.20"); stringstream ss1("2004-Jan-1"); ss1 >> t2; cout << " t2 " << t2 << endl; //starting at current time iterator adds by one hour time_iterator titr(now,hours(1)); for (; titr < tomorrow_start; ++titr) { cout << (*titr) << std::endl; } } catch(std::exception& e) { std::cout << " Exception: " << e.what() << std::endl; } return 0; } And output from this program is d not-a-date-time t0 not-a-date-time d1 1999-Jan-01 t2 1999-Jan-01 00:00:00 t2 1999-Jan-01 00:00:00 d3 2002-Feb-01 t2 2004-Jan-01 00:00:00 2005-Sep-16 08:58:09 2005-Sep-16 09:58:09 2005-Sep-16 10:58:09 2005-Sep-16 11:58:09 2005-Sep-16 12:58:09 2005-Sep-16 13:58:09 2005-Sep-16 14:58:09 2005-Sep-16 15:58:09 2005-Sep-16 16:58:09 2005-Sep-16 17:58:09 2005-Sep-16 18:58:09 2005-Sep-16 19:58:09 2005-Sep-16 20:58:09 2005-Sep-16 21:58:09 2005-Sep-16 22:58:09 2005-Sep-16 23:58:09 My question is why d and t0 are not-a-date-time? Is this expected? Also the line ptime t1(d3, hours(5)+nanosec(100)); //date + time of day offset compiles with error: ‘nanosec’ was not declared in this scope Thanks, Michal

2 3

Re: [Boost-users] Scons users?
by David Abrahams 20 Sep '05

20 Sep '05

"Reece Dunn" <msclrhd(a)hotmail.com> writes: > David Abrahams wrote: >>Kevin Wheatley <hxpro(a)cinesite.co.uk> writes: >> > David Abrahams wrote: >> >> On the Boost.Build list we were just discussing the fact that some >> >> people otherwise inclined towards Boost have chosen Scons over >> >> Boost.Build. It would be useful for us to understand some of the >> >> reasons why, if some of you wouldn't mind letting us know. No flames, >> >> please! >> > >> > not a flame, but some test results (Noel Llopis' Blog) shows a few >> > interesting results: >> > >> > http://tinyurl.com/7fdns (www.gamesfromwithin.com) >> > >> > These are updated from previously. >> >>Wow, harsh. The numbers aside, I think his commentary is rather >>flame-ish. > > I thought it was harsh as well. Here are a few comments: > > Ant/Rant outperform Jam on full builds even though he claims Jam is the > fastest performing build system. > > BBv2 and SCons are aimed at being truely platform independant, i.e. one > script will work for everything, whereas the others need work on your part > to get that or only support one target. I didn't think Scons was trying to achieve that. IIUC you still deal with many platform specifics when writing Sconscripts... no? > I agree with him that there is a learning curve when learning Jam/BBv2, but > you get this with learning any new language. Yes, but we ought to be doing more to make it shallow. I am about to start posting editorial review commentary on our documentation. I hope that many on this list will participate, so we can make BBv2 much more usable. > He says to avoid BBv2/SCons because of performance, but performance > is only one factor. Well, yes. The other factor for most people is "how easy is it for me to get it to do what I want?" If the system is complex and hard-to-understand, it won't be easy to use, so we may be failing on both counts. > [As a note, how much of a performance penalty is there from BBv2 and > SCons being built on top of and run from a scripting engine?] Some, but I think for BBv2 that only hurts to the extent that we're trying to do something smarter and more abstract than what people do with the other systems. Gnu Make, too, has a kind of scripting engine in it. However, some of its primitives are more closely directed at the problem domain. > What I like about BBv2 is that I can create a hello world > application in 1 minute! The jam file: > > exe hello : hello.cpp ; > install . : hello ; # copy hello.exe to this directory > > hello.cpp: > > #include <iostream> > int main() > { > std::cout << "Hello World!" << std::endl; > return 0; > } > > and most of that is writing hello.cpp! Heh, with make I think you might not even need a makefile for this one ;-) $ cat > foo.cpp #include <iostream> int main() { std::cout << "hello, world!" << std::endl; return 0; } dave@i9300 /tmp $ make foo g++ foo.cpp -o foo dave@i9300 /tmp $ ls *ake* ls: *ake*: No such file or directory See? > With this, I can now build debug and release versions - and build on > any supported C++ compiler/platform - as easily as changing the > command line, BBv2 takes care of the rest. Make and Jam don't give > you this out of the box. Now you're talking... but: "changing the command line" isn't easy unless you can come to grips with the system, and we've made that a bit too difficult. > I have lost count of the number of times I have run into problems with > incorrect project settings for MSVC projects, most of which are due to the > IDE defaulting to the current configuration (debug or release) instead of > editing all configurations. > > BBv2 (and I assume SCons has this as well) allows you to set project wide > settings (e.g. include paths) that are inherited by all targets in this > directory and below. You can't do this with the other build tools as far as > I am aware, or doing so is complex and unmaintainable. That's also true. > Also, BBv2 (and SCons?) works out the build dependancies for you based on > how targets are associated, so if you add another dependancy on one of the > targets, you don't need to change the build order as you would in *Ant. > (MSVC does dependancy analysis, but only for the current solution and you > can't nest solution files). > > It would be interesting to have more data from large build projects and > timing/profile data for these. Q: Is it possible to get profiling data for > bjam and BBv2 to see what parts of bjam and BBv2 are taking the most time. Yes, pass -d+10 on the command line. > Also, I don't believe that BBv2 has incremental build support. I > wonder what this and pre-compiled header support would do to the > timing data. What do you mean by "incremental build support?" -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Scons users?
by David Abrahams 20 Sep '05

20 Sep '05

Hi, On the Boost.Build list we were just discussing the fact that some people otherwise inclined towards Boost have chosen Scons over Boost.Build. It would be useful for us to understand some of the reasons why, if some of you wouldn't mind letting us know. No flames, please! -- Dave Abrahams Boost Consulting www.boost-consulting.com

8 10

Re: [Boost-users] Scons users?
by Vladimir Prus 20 Sep '05

20 Sep '05

Arkadiy Vertleyb wrote: > "Reece Dunn" <msclrhd(a)hotmail.com> wrote > >> Also, I don't believe that BBv2 has incremental build support. > > Do you mean it always rebuilds everything?! Any reason why it is > acceptable? Ehm... do you really think that Boost.Build rebuilds every target on every invocation? Reece most likely meant various "incremental rebuild" options in windows compilers. - Volodya

1 0

Re: [Boost-users] [boost] Scons users?
by Martin Bonner 20 Sep '05

20 Sep '05

----Original Message---- From: David Abrahams [mailto:dave@boost-consulting.com] Sent: 20 September 2005 12:59 To: boost(a)lists.boost.org Cc: jamboost(a)yahoogroups.com; boost-users(a)lists.boost.org Subject: Re: [boost] Scons users? > Kevin Wheatley <hxpro(a)cinesite.co.uk> writes: > >> David Abrahams wrote: >>> On the Boost.Build list we were just discussing the fact that some >>> people otherwise inclined towards Boost have chosen Scons over >>> Boost.Build. It would be useful for us to understand some of the >>> reasons why, if some of you wouldn't mind letting us know. No >>> flames, please! >> >> not a flame, but some test results (Noel Llopis' Blog) shows a few >> interesting results: >> >> http://tinyurl.com/7fdns (www.gamesfromwithin.com) >> >> These are updated from previously. > > Wow, harsh. The numbers aside, I think his commentary is rather > flame-ish. Well, without the numbers, I agree. But the numbers do rather back him up (except that BoostBuild does seem to be marginally quicker than Scons on three out of four tests, whereas he describes it as "Slower even than Scons!"). Are there any known optimization oportunities in BoostBuild? Are the results an artifact of his test set up? -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 441434

1 0

[iostreams] experience with automatically decompressing with gzip or bzip2
by Marcus Alanen 19 Sep '05

19 Sep '05

Hello, I've recently used iostreams for easier gziping and bzip2ing of output streams. However, I'd also like to be able to read any file compressed with either gzip or bzip2, by analyzing the input stream and deducing which decompressor to use. I don't want to open the file twice or to seek in the stream, as this might not be possible due to e.g. reading from the network. My solution is to create a custom streambuf, which is told to read and retain the first few bytes to determine which decompressor to push onto the boost::iostreams::filtering_streambuf. Then the actual reading can take place, and the custom streambuf first returns the retained bytes, then just streams the rest of the actual input streambuf. As far as I can tell, this works nicely. I wonder if anybody else has better solutions for this? Perhaps there is come capability of iostreams that I've overlooked? Below is the code, feel free to use as you wish. I don't know if I need to override xsgetc(), underflow() and uflow(), so they are currently just non-working stubs. So far nothing seems to have triggered any of them: only xsgetn seems to be used. I haven't found any actual errors, though. Both gzip and bzip2 files seem to decompress. Otherwise the code can be improved a lot, e.g. by registering separate compression detectors instead of hard-coding them in the streambuf. I think I'm also lost a bit where and when to use streambufs instead of streams, e.g. m_input. Apologies if the code is too long for your mailing-list, I didn't find any guidelines for this. Regards, Marcus #include <boost/iostreams/filtering_streambuf.hpp> #include <boost/iostreams/copy.hpp> #include <boost/iostreams/filter/bzip2.hpp> #include <boost/iostreams/filter/gzip.hpp> #include <iostream> #include <boost/noncopyable.hpp> class general_decompressor_streambuf : public std::basic_streambuf<char, std::char_traits<char> >, public boost::noncopyable { private: std::streambuf& m_input; static const int BUFFER_SIZE = 5; unsigned char m_read[BUFFER_SIZE]; std::streamsize m_readpos; std::string m_compression_type; public: general_decompressor_streambuf(std::streambuf& i) : m_input(i), m_readpos(0) { ; } ~general_decompressor_streambuf() throw () { ; } std::string get_compression_type() const { return m_compression_type; } void resolve_compressor (boost::iostreams::filtering_streambuf<boost::iostreams::input>& sb) { int pos = 0; while (pos < BUFFER_SIZE) { int c = m_input.sbumpc(); if (c == EOF) return; m_read[pos++] = c; } if (m_read[0] == 037 && m_read[1] == 0213) { m_compression_type = "GZIP"; sb.push( boost::iostreams::gzip_decompressor() ); } else if (m_read[0] == 'B' && m_read[1] == 'Z' && m_read[2] == 'h') { m_compression_type = "BZIP2"; sb.push( boost::iostreams::bzip2_decompressor() ); } else { ; } } std::streamsize xsgetn(char* s, std::streamsize n) { std::streamsize cnt = 0; if (m_readpos < BUFFER_SIZE) { while (m_readpos < BUFFER_SIZE && n > 0) { unsigned char ch = m_read[m_readpos++]; *s++ = ch; ++cnt; } if (cnt == n) return cnt; } std::streamsize ss = m_input.sgetn(s, n - cnt); ss += cnt; return ss; } int xsgetc() { std::cerr << "xsgetc" << std::endl; return m_input.sgetc(); } int underflow ( ) { std::cerr << "underflow" << std::endl; return m_input.sgetc(); } int uflow ( ) { std::cerr << "uflow" << std::endl; return m_input.sgetc(); } }; int main() { general_decompressor_streambuf buffering_in_streambuf(*std::cin.rdbuf()); boost::iostreams::filtering_streambuf<boost::iostreams::input> cmpr; buffering_in_streambuf.resolve_compressor(cmpr); cmpr.push(buffering_in_streambuf); std::istream i(&cmpr); boost::iostreams::copy(i, std::cout); return 0; }

2 4

trouble with boost::assign
by Lee Crabtree 19 Sep '05

19 Sep '05

Hi, I'm trying initialize a static map with map_list_of. Something along the lines of: map<int,int> blarg = map_list_of(1, 2); However, when I go to compile, I receive the following error: error C2440: 'initializing' : cannot convert from 'boost::assign_detail::generic_list<T>' to 'std::map<_Kty,_Ty,_Pr,_Alloc>' with [ T=std::pair<boost::assign_detail::assign_decay<int>::type,boost::assign_detail::assign_decay<int>::type> ] and [ _Kty=int, _Ty=int, _Pr=std::less<int>, _Alloc=std::allocator<std::pair<const int,int>> ] I have absolutely no idea what this means. Am I missing something obvious, or is there a more sinister problem afoot? Lee Crabtree

1 0

Re: [Boost-users] [RMI-like-lib] is there any interest in such?
by Foster Gareth 19 Sep '05

19 Sep '05

> Jarl Lindrud has done a lot of work on this already - see > > http://www.codeproject.com/threads/RMI_For_Cpp.asp > > While it uses boost and mpl techniques extensively it's not > quite boost style. > I'd be using it extensively but for the fact that it doesn't > integrate well with > our own code framework. > Looks interesting. Just out of interest, could you site any examples, or point me toward previous discussion that does so? Cheers, Gaz

1 0

Find all the shortest path from a graph
by Giulio Veronesi 19 Sep '05

19 Sep '05

Hi all, I'd like to extract all possible shortest path from a source to a destination... not only one path. Please, could you help me to resolve this problem? Thanks a lot in advance, Giulio

4 11