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

[Asio]How to compile the HelloWorld ?
by SP Z 08 Aug '06

08 Aug '06

Maybe this is a stupid problem , but I really don't konw how to find the right way. My compile environment is WinXP, Msys , MinGw , G++ 3.4.2, Boost 1.33.1, asio_0_3_7, bjam 3.1.13. I have already copy the header files of boost and asio into mingw/include I write the helloWorld.cpp follow the tutorial. #include <iostream> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> int main() { boost::asio::io_service io; boost::asio::deadline_timer t(io, boost::posix_time::seconds(5)); t.wait(); std::cout << "Hello, world!\n"; return 0; } I write Jamroot as follow: exe hello : hello.cpp ; then I compile it in Msys, but link wrong happened(wrong messages see the end of this Email). Would you please help me to solve this problem . Thank you for(;;){} //forever $ bjam ...found 11 targets... ...updating 5 targets... MkDir1 bin MkDir1 bin\gcc MkDir1 bin\gcc\debug gcc.compile.c++ bin\gcc\debug\hello.o In file included from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/win_local_free_on_block_exit.hpp:27, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/system_exception.hpp:33, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/win_mutex.hpp:26, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/mutex.hpp:27, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/service_registry.hpp:25, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/io_service.hpp:32, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/basic_io_object.hpp:20, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/basic_socket.hpp:20, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/basic_datagram_socket.hpp:25, from e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio.hpp:18, from hello.cpp:11: e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/socket_types.hpp:31:5: warning: #warning Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/detail/socket_types.hpp:32:5: warning: #warning Assuming _WIN32_WINNT=0x0500 (i.e. Windows 2000 target) hello.cpp:24:2: warning: no newline at end of file gcc.link bin\gcc\debug\hello.exe bin\gcc\debug\hello.o: In function `ZN5boost4asio6detail31reactive_deadline_timer_serviceINS0_11time_traitsINS_10posix_time5ptimeEEENS1_14select_reactorILb1EEEE16shutdown_serviceEv':e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initC1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::do_init()]+0x1f): undefined reference to `WSAStartup@8' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6selectEiP6fd_setS4_S4_P7timeval[boost::asio::detail::socket_ops::select(int, fd_set*, fd_set*, fd_set*, timeval*)]+0xc9): undefined reference to `select@20' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops13error_wrapperIiEET_S4_[int boost::asio::detail::socket_ops::error_wrapper<int>(int)]+0x8): undefined reference to `WSAGetLastError@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops9set_errorEi[boost::asio::detail::socket_ops::set_error(int)]+0x17): undefined reference to `WSASetLastError@4' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initD1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::~do_init()]+0x7): undefined reference to `WSACleanup@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops5closeEj[boost::asio::detail::socket_ops::close(unsigned int)]+0x19): undefined reference to `closesocket@4' bin\gcc\debug\hello.o: In function `main':e:/job/word-online/source/cpp/hello.cpp:15: undefined reference to `inet_addr@4' :e:/job/word-online/source/cpp/hello.cpp:23: undefined reference to `getsockname@12' bin\gcc\debug\hello.o: In function `ZN5boost4asio6detail31reactive_deadline_timer_serviceINS0_11time_traitsINS_10posix_time5ptimeEEENS1_14select_reactorILb1EEEE16shutdown_serviceEv':e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../.. o `closesocket@4' bin\gcc\debug\hello.o: In function `main':e:/job/word-online/source/cpp/hello.cpp:15: undefined reference to `inet_addr@4' :e:/job/word-online/source/cpp/hello.cpp:23: undefined reference to `getsockname@12' bin\gcc\debug\hello.o: In function `ZN5boost4asio6detail31reactive_deadline_timer_serviceINS0_11time_traitsINS_10posix_time5ptimeEEENS1_14select_reactorILb1EEEE16shutdown_serviceEv':e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops5ioctlEjlPm[boost::asio::detail::socket_ops::ioctl(unsigned int, long, unsigned long*)]+0x27): undefined reference to `ioctlsocket@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6acceptEjP8sockaddrPi[boost::asio::detail::socket_ops::accept(unsigned int, sockaddr*, int*)]+0x27): undefined reference to `accept@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops13error_wrapperIjEET_S4_[unsigned int boost::asio::detail::socket_ops::error_wrapper<unsigned int>(unsigned int)]+0x8): undefined reference to `WSAGetLastError@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops7connectEjPK8sockaddri[boost::asio::detail::socket_ops::connect(unsigned int, sockaddr const*, int)]+0x27): undefined reference to `connect@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6listenEji[boost::asio::detail::socket_ops::listen(unsigned int, int)]+0x20): undefined reference to `listen@8' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops4bindEjPK8sockaddri[boost::asio::detail::socket_ops::bind(unsigned int, sockaddr const*, int)]+0x27): undefined reference to `bind@12' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops10setsockoptEjiiPKvj[boost::asio::detail::socket_ops::setsockopt(unsigned int, int, int, void const*, unsigned int)]+0x35): undefined reference to `setsockopt@20' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops9get_errorEv[boost::asio::detail::socket_ops::get_error()]+0x7): undefined reference to `WSAGetLastError@0' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops6socketEiii[boost::asio::detail::socket_ops::socket(int, int, int)]+0x3f): undefined reference to `WSASocketA@24' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops4recvEjP7_WSABUFji[boost::asio::detail::socket_ops::recv(unsigned int, _WSABUF*, unsigned int, int)]+0x58): undefined reference to `WSARecv@28' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZNK5boost4asio6detail14fd_set_adapter6is_setEj[boost::asio::detail::fd_set_adapter::is_set(unsigned int) const]+0x14): undefined reference to `__WSAFDIsSet@8' :e:/program/mingw/mingw/bin/../lib/gcc/i686-pc-mingw32/3.4.2/../../../../include/boost/asio/deadline_timer_service.hpp:(.text$_ZN5boost4asio6detail10socket_ops4sendEjPK7_WSABUFji[boost::asio::detail::socket_ops::send(unsigned int, _WSABUF const*, unsigned int, int)]+0x58): undefined reference to `WSASend@28' collect2: ld returned 1 exit status "g++" -o "bin\gcc\debug\hello.exe" -Wl,--start-group "bin\gcc\debug\hello.o" -Wl,--end-group -g ...failed gcc.link bin\gcc\debug\hello.exe... ...failed updating 1 target... ...updated 4 targets... -- I'm Earth-Man. 我是地球人. --zsp(张沈鹏)

1 0

[Serialization] Non-standard extensions used.
by Stephen Hewitt 08 Aug '06

08 Aug '06

The following is a dead simple example of using Boost.Serialization using an XML output archive which follows the patterns laid down in examples: /* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ */ #include <iostream> #include <boost/archive/xml_oarchive.hpp> #include <boost/serialization/nvp.hpp> // Warning level 4. #pragma warning(push, 4) #pragma message("********") struct MyData { MyData(int val) : m_Value(val) {} template<typename Archive> void serialize(Archive & ar, const unsigned int) { ar & BOOST_SERIALIZATION_NVP(m_Value); // <-- Warning here. } int m_Value; }; void main() { using namespace std; MyData d(3); boost::archive::xml_oarchive oa(cout); oa << BOOST_SERIALIZATION_NVP(d); <-- Warning here. } // Warning level back to normal. #pragma warning(pop) /* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ */ When compiling this code I get the following error: "warning C4239: nonstandard extension used : 'argument' : conversion from 'struct boost::serialization::nvp<struct MyData>' to 'struct boost::serialization::nvp<struct MyData> &' A reference that is not to 'const' cannot be bound to a non-lvalue" I tried MSVC 6 and "Visual C++ 2005" which can be downloaded from here: http://msdn.microsoft.com/vstudio/express/visualC/default.aspx Interestingly I could not get it to happen with "Microsoft Visual C++ Toolkit 2003". The warning seems valid to me. The "BOOST_SERIALIZATION_NVP" looks like this: -------------------------------------------------------------------------------------------------------------------------- #define BOOST_SERIALIZATION_NVP(name) \ boost::serialization::make_nvp(BOOST_PP_STRINGIZE(name), name) -------------------------------------------------------------------------------------------------------------------------- The "make_nvp" function looks like as follows: ------------------------------------------------------- nvp<T> make_nvp(const char * name, T & t){ return nvp<T>(name, t); } ------------------------------------------------------- "Operator<<", which is used in "main" is reproduced below: -------------------------------------------------------------------------------------- template<class Archive> class interface_oarchive { // ... Code removed ... // template<class T> Archive & operator<<(T & t){ this->This()->save_override(t, 0); return * this->This(); } // ... Code removed ... // }; -------------------------------------------------------------------------------------- So, to cut to the chase, "BOOST_SERIALIZATION_NVP" expands to a call to make_nvp" which returns a temporary which is bound to a non-const reference in "interface_oarchive::operator<<": this is not legal in standard C++ (unless I'm mistaken). It seems that if you follow to documentation and examples the resulting code isn't standard C++!?!

2 2

[bgl] problem with topological_sort
by Renaud Lepere 08 Aug '06

08 Aug '06

I would like to use a graph and add/remove vertices frequently so i try to use a list for the vertices. At the begining, i would like to sort my vertices using dfs or topological_sort. But my program refuses to compile, apparently there is a problem with a property map for the colors. (c:/Boost/include/boost-1_33_1/boost/property_map.hpp:319: instantiated from `void boost::put....'). How can i make a dfs with such a graph ? Are there special requirements for using dfs or topologic_sort on a graph ? Thanks, Renaud. Following is a small example illlustrating the problem. #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/visitors.hpp> #include <boost/graph/topological_sort.hpp> #include <iterator> typedef boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, int, int > Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; typedef std::vector< Vertex > Vertices; int main() { Graph g; Vertices vs; boost::topological_sort(g, back_inserter(vs)); }

1 0

Re: [Boost-users] [threads] extension proposal
by Oliver.Kowalke＠qimonda.com 08 Aug '06

08 Aug '06

> looks like what I need ;) The only question is, what does > stop() function of a defer_point? defer_pool::stop deactivates the threaded queue. All threads are awakened. > Will it stop all tasks > immediately or will it wait until the task queue is empty and > stop it then? It waits until all tasks were removed and processed from the queue. > Are there some plans to integrate this into the official > boost release? not yet > It would be nice to provide support for > different queue policies, like priority queue etc... May be > there are more wishes, like Vsevolod stated, by adding > support for threading or process policies... definetly - the library needs some improvements (fpr instance meber function defer should return a future). Oliver

2 1

Re: [Boost-users] [threads] extension proposal
by Oliver.Kowalke＠qimonda.com 08 Aug '06

08 Aug '06

Hello Ovanes, please look into the boost vault (Concurrent Programming). I think the defer library fits your needs. The thread pool pre-spawns N threads which operate on a special queue (inside of the pool). If no task (boost::function objects) is queued all threads are set to sleep - if a task arives the queue one thread is awakened and fetches the task item from the queue and executes it (after that the thread goes to sleep again). The library was originally developed by Simon Meiklejohn. I've added the queue-stuff. regards, Oliver

2 1

[program_options] Issues with boost::program_options freezing
by Zachary Mark 07 Aug '06

07 Aug '06

Hello, Our application is using boost::program_options to parse commandline arguments. We have found that when we perform our own builds of boost from source code, program_options freezes the application hard at variable points in the code (a step through in GDB confirms this). However, when we use pre-built binaries of the program_options library for any of our target OSes (Debian stable, Centos 4, Fedora 4) the application runs properly. We are also using the boost::thread library. Are there thread safety or interaction issues between thread and program_options that I am not aware of? We are using 1.32 due a change in the behavior of program_options in 1.33. This script shows how we are building boost. # run configure cd libs/config || fail-configure chmod +x configure || fail "error: could not change permissions on ${PACKAGE} configure script" ./configure || fail-configure cp user.hpp ../../boost/config/ cd ../.. # build and install libraries BOOST_LIBS="date_time filesystem program_options regex thread" for LIB in ${BOOST_LIBS}; do echo "Building library ${LIB}..." bjam -sTOOLS=gcc -sBUILD="release threading=multi" --with-${LIB} \ --layout="system" stage 2>&1 || \ fail "error: could not build boost library ${LIB}" bjam -sTOOLS=gcc -sBUILD="release threading=multi" --with-${LIB} --layout="system" \ --prefix=`pwd`/../../${INSTALL_DIR} install 2>&1 || \ fail "error: could not install boost library ${LIB}" done Thanks in advance. -- Zach

2 2

Need help in serialization
by Anil Krishna 07 Aug '06

07 Aug '06

Hi All, Currently I am using the boost serialization library to serialize and the following structure: typedef list<int> testList; typedef testList::iterator lIter; typedef map<int, testList> testMap; typedef testMap::iterator tIter; testMap _tMap; template<class Archive> void serialize(Archive &ar, const unsigned int version) { ar & _tMap; } int main() { test_map tm; ofstream ofs("map_details.txt"); tm.fillMap(); //tm.display(); boost::archive::binary_oarchive oa(ofs); oa << (const test_map)tm; ofs.close(); test_map newTm; ifstream ifs("map_details.txt", std::ios::binary); boost::archive::binary_iarchive ia(ifs); ia >> newTm; ifs.close(); newTm.display(); } In the above code, I am saving the map to a binary file and retrieving it from the file. Instead of that I would want to serialize the data into a char buffer and restore it from the buffer. This is useful for message communication, where I would like to send the map as a message from one process to another using socket communications. Can you any one let me know, how this can be done in boost? Regards, Anil

2 2

Re: [Boost-users] Need help in serialization
by Todd Greer 07 Aug '06

07 Aug '06

Anil Krishna wrote: > In the above code, I am saving the map to a binary file and retrieving it > from the file. Instead of that I would want to serialize the data into a > char buffer and restore it from the buffer. Serialize into a std::ostringstream, ship its buffer to the other receiver, construct a std::istringstream from the received buffer, then deserialize from the istringstream you just constructed. Read up on std::istringstream and std::ostringstream (in <sstream>) for the details. BTW, if the sender and receiver are on different platforms, or you happen to need to send the data through something that has a problem with binary data, you can use text_[io]archive instead of binary_[io]archive. HTH, Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

2 1

shmem on multi-user machine
by Steven Wooding 07 Aug '06

07 Aug '06

Hi Ion, I've noticed that the "file" /dev/shmem/sem.boost_shmem_shm_global_mutex keeps hanging around after my program finishes. This file has write permission only for the user that created it. When different user comes along a runs another program that uses shmem, it seg faults on sem_wait(), probably due to the file permissions. Should this global mutex be cleaned up after use? Or could the permissions be changed somehow to let other use it (though probably not a good idea if user A and user B run a shmem based program at the same time). Thanks for your advice. Cheers, Steve.

4 7

[Filesystem] Drive letter in argument for boost::filesystem::path
by Maarten Nieber 07 Aug '06

07 Aug '06

Dear boost users, can anybody explain how to pass a filename containing a (windows) drive letter into a boost::filesystem::path? For instance, if the path should point to c:\test.txt (on a Windows system), what is the portable filename that I should pass to the boost::filesystem::path constructor? Thanks in advance! Maarten __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 2

Portability of boost libs for "universal linux binary?"
by Zachary Mark 07 Aug '06

07 Aug '06

Details: I work on a project where one of the eventual goals is to have one binary for a given architecture that runs on multiple Linux distributions. This goal is currently accomplished by both Sun's Java VM as well as the cmake project ( http://www.cmake.org/HTML/Index.html ). We are in the process of evaluating how this goal is impacted by third party dependencies. We currently use the following boost libs: thread, program_options, regex, date_time, and filesystem. I strongly suspect that the thread lib is going to be the biggest cause of grief towards accomplishing this goal (mostly due to the inability to static link it). Are the other (non thread) boost libs statically linkable? Thanks in advance. -- Zach

2 2

zlib memory leaks [RC_1_34_0]
by Thomas Pintaric 06 Aug '06

06 Aug '06

I noticed that /boost/boost/iostreams/filter/zlib.hpp (Revision 1.25.2.1) from the RC_1_33_0 branch, for which the zlib memory leaks were fixed, still needs to be merged with the MAIN branch.

1 0

boost-python Newbie tutorial needed.
by chun ping wang 06 Aug '06

06 Aug '06

Hmm k i have a simple question, how would I build boost.python given this following information. I am using dev-cpp and its install in "c:\dev-cpp" folder. IN it contains the mingw32 sub directory My project folder is "c:\cs classes\cs386\c++". In it contains FiniteAutomta.cpp which maps to python module... my boost folder is "C:\boost_1_33_1" in it contains the bjam.exe file. PYTHON_ROOT = "C:\python24" Thanks for the help. I look at the tutorial but is confused on how I can build my project.

3 2

[boost.python] void pointer argument problem
by michael_gruner＠arcor.de 06 Aug '06

06 Aug '06

Hello, I'm trying to use boost.python to wrap a C function that takes a pointer on a void pointer as an argument. But I'm going wrong to use the example from the FAQ. Could anyone help me on this? my code looks like this: struct void_; BOOST_PYTHON_OPAQUE_SPECIALIZED_TYPE_ID(void_); int myfunc(char * mychar, void ** mypointer); int myfunc_wrp(char * mychar, void_ ** mypointer){ return myfunc(mychar,(void ** ) mypointer); } ... BOOST_PYTHON_MODULE(mymodule){ def("myfunc", &myfunc_wrp); } later in python I do: import mymodule mystring = " " mypointerobject = 0 mymodule.myfunc(mystring,mypointerobject) and get: Boost.Python.ArgumentError: Python argument types in mymodule.myfunc(str, int) did not match C++ signature: myfunc(char *, struct void_ * *) Are there any advices to solve this problem? thank you for your answers. Kind regards, Michael

2 2

using filesystem library
by Fred J. 06 Aug '06

06 Aug '06

hi this is given me some error I cannot locate a fix. thanks **************** code **************** #include <iostream> #include <string> #include "boost/filesystem/operations.hpp" // includes boost/filesystem/path.hpp #include "boost/filesystem/fstream.hpp" namespace fs = boost::filesystem; using namespace std; int main(){ fs::path full_path("../data"); if (exists(full_path)) cout << "yes" << endl; } //there exists data directory in the parent of the current directory. **************** error **************** $ make g++ -gdwarf-2 -c -o try.o try.cpp g++ -Wall -gdwarf-2 -o proj try.o try.o: In function `main': /home/fred/myPrograms/backtest/try/try.cpp:11: undefined reference to `boost::filesystem::path::path(char const*)' /home/fred/myPrograms/backtest/try/try.cpp:12: undefined reference to `boost::filesystem::exists(boost::filesystem::path const&)' collect2: ld returned 1 exit status make: *** [proj] Error 1 __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[regex] compile issue
by Thomas Matelich 06 Aug '06

06 Aug '06

Finally got around to upgrading to 1.33.1 on HP 11i, g++ 4.1.1. in v4/regex_traits_defaults.hpp, the compiler was not happy with the WCHAR_MIN == 0 and WCHAR_MAX <= USHRT_MAX checks. This appears to be due to their definition: #define WCHAR_MIN (wchar_t)0 #define WCHAR_MAX (wchar_t)UINT_MAX I tried a few things I could think of, but ended up undef'ing and redefining them without the (wchar_t). Tom Matelich

2 3

Re: [Boost-users] Boost.Signals example/doc_view application question
by Wu Yinghui, Freddie 05 Aug '06

05 Aug '06

[snip] > The View abstract base class requires concrete bases to provide a > concrete implementation of the refresh() member function matching the > slot signature required. > > class View > { > public: > virtual void refresh(bool) const = 0; > // ... > }; > > Here's my problem. If I change the signal to take no args using the > preferred or portable syntax I get compilation errors: > > class Document > { > public: > typedef boost::signal< void () > signal_t; > // ... > > void append(const char* s) > { > m_text += s; > m_sig(true); You should use m_sig(); instead! > } > // ... > }; > > class View > { > public: > virtual void refresh() const = 0; > // ... > }; > > Compilation output (msvc-7.1): > > Compiling... > SignalTest.cpp > c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2825: > 'F::result_type': cannot form a qualified name > c:\Boost\include\boost-1_33_1\boost\bind\bind_template.hpp(15) : > see reference to class template instantiation > 'boost::_bi::result_traits<R,F>' being compiled > with > [ > R=boost::_bi::unspecified, > F=void (__thiscall View::* )(void) const > ] > c:\development\SignalTest\SignalTest.cpp(49) : see reference to > class template instantiation 'boost::_bi::bind_t<R,F,L>' being compiled > with > [ > R=boost::_bi::unspecified, > F=void (__thiscall View::* )(void) const, > L=boost::_bi::list2<boost::_bi::list_av_2<View > *,boost::arg<1>>::B1,boost::_bi::list_av_2<View *,boost::arg<1>>::B2> > ] > c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2039: > 'result_type' : is not a member of 'operator``global namespace''' > c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2146: syntax > error : missing ';' before identifier 'type' > c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2955: > 'boost::_bi::type' : use of class template requires template argument list > c:\Boost\include\boost-1_33_1\boost\bind.hpp(112) : see > declaration of 'boost::_bi::type' > c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : fatal error C1903: > unable to recover from previous error(s); stopping compilation Cheers, Freddie

2 1

Testing Program Output
by Paulo J. Matos 05 Aug '06

05 Aug '06

Hi all, Is there support in Boost for testing program output, which depends exclusively in its arguments? Briefly, my program is not-interactive and its result (to stdout) depends uniquely on its input argument. Is there anything in Boost that can help me test my program this way? I've been using the Unit Testing Framework for unit tests and for the tests I've mentioned I've only found dejagnu up until now. Another solution would be bash-scripts that would run the program and check output, but that's not nice enough for me. Anything in Boost I might use? If not, are there any other suggestions? Cheers, -- Paulo Jorge Matos - pocm at sat inesc-id pt Web: http://sat.inesc-id.pt/~pocm Computer and Software Engineering INESC-ID - SAT Group

2 2

[BGL] connected components algorithm
by Alejandro Aragon 05 Aug '06

05 Aug '06

Hello everyone. I'm trying to implement Fleury's algorithm to find an Eulerian path in a graph. Every time I erase an edge in the graph, I need to check how many connected components I have (because I can't erase an edge that is a "bridge"). Also, I was using in the beginning graphs with VertexList=VecS but it turns out that when you erase an edge all the vertex descriptors are invalidated. Thus, I had to copy my graph to another one with VertexList=listS. I was wondering if the connected components algorithm works with this type of graph. I'm having an error. It seems that the compiler does not recognize this function. /usr/include/boost/graph/connected_components.hpp:46: error: no matching function for call to ‘put(unsigned int*&, void*&, unsigned int&)’ make: *** [graph.o] Error 1 Any ideas? Thank you, aa My code is shown below: typedef adjacency_list<listS, listS, undirectedS, property<vertex_index_t, std::size_t>, no_property > graph_t; graph_traits<graph_t>::out_edge_iterator out,out_end; graph_t copy(num_vertices(*gPtr)); // obtain a property map for the vertex_index property property_map<graph_t, vertex_index_t>::type index = get(vertex_index, copy); // initialize the vertex_index property values graph_traits<graph_t>::vertex_iterator vi, vend; graph_traits<graph_t>::vertices_size_type cnt = 0; for(tie(vi,vend) = vertices(copy); vi != vend; ++vi) put(index, *vi, cnt++); for (tie(ei, ei_end) = edges(*gPtr); ei != ei_end; ++ei){ add_edge(vertex(source(*ei,*gPtr), copy), vertex(target(*ei,*gPtr), copy), copy); } graph_traits<graph_t>::vertex_descriptor Vertex; graph_traits<graph_t>::edge_iterator ei,ei_end; vertex_descriptor u,v; u = vertex(0,copy); for (tie(out, out_end) = out_edges(u,copy); out != out_end; ++out){ u = source(*out,copy); v = target(*out,copy); remove_edge(u,v,copy); std::vector<size_t> component(num_vertices(copy)); num = connected_components(copy, &component[0]);

2 2

Jim Lear is out of the office.
by Jim.Lear＠legerity.com 05 Aug '06

05 Aug '06

I will be out of the office starting 08/05/2006 and will not return until 08/12/2006. I will respond to your message when I return.

1 0

assert when using cregex_iterator
by Winson Yung 05 Aug '06

05 Aug '06

I have a very simple test program using the latest 1.33 version of regex library. As soon as I run it, it assert (crash) at the line where std::string s = (*m1)[0]. I am doing something wrong? ============== #include "stdafx.h" #include <boost/regex.hpp> const char matchpattern[] = "\\s+kitty this"; const char astring[] = "hello Kitty this is a test"; using namespace boost; int main(int argc, char* argv[]) { regex header_expr(matchpattern, regex_constants::basic | regex_constants::icase); cregex_iterator m1(astring, astring + strlen(astring), header_expr); std::string s = (*m1)[0]; <==== crash here return 0; }

2 1

boost python noobie questions
by chun ping wang 05 Aug '06

05 Aug '06

Hey I have several problem... A.) Can boost::python work with templated argument... Example: /************************************************ * rsa(p, q): * * let n = p * q * * let totient = (p-1)*(q-1) * * choose integer e between 1 and totient * * such that greatest common denominator is 1 * * d = (1 mod totient) / e * * return e, d, n * ************************************************/ template <class T> boost::tuple<T, T, T> boost::rsa_generate(const T& p, const T& q) { BOOST_STATIC_ASSERT(boost::is_integral<T>::value); assert(p != q); const T n(p*q); const T totient((p-1)*(q-1)); T e(3); for (e; EuclidBinaryGCD(e, totient) != 1; e = Random::randint(T(2), totient-1)); const T d(Inversemod(e, totient)); return boost::make_tuple(e, d, n); } BOOST_PYTHON_MODULE(rsa) { def("rsa_generate", boost::rsa_generate); } Second question.. how come lambda function don't work. COmpling this by itself..give no error. template <class T, template <typename ELEM, typename = std::allocator<ELEM> > class CONT> double MyAnn::getCondProb(const T& A, const T& B, const CONT<typename std::pair<T, T> >& DATA) { using namespace boost::lambda; typedef typename std::pair<T, T> MyPair; // gets the number of B const int numOfB ( std::count_if(DATA.begin(), DATA.end(), bind(&MyPair::second, _1) == B ) ); // gets the number of A given B. const int numOfAGivenB( std::count_if(DATA.begin(), DATA.end(), (bind(&MyPair::second, _1) == B) && (bind(&MyPair::first, _1) == A) ) ); return (numOfAGivenB*1.0)/numOfB; } now including this file.. and compling this gives error about "_1" BOOST_PYTHON_MODULE(bayesian) { def ("getCondProb", getCondProb<long long>); } Thanks for the help. If its the way i compile.. how i would i get it to work.. iam using dev-cpp 4.9

2 2

Boost.Signals example/doc_view application question
by Allen Gooch 04 Aug '06

04 Aug '06

I have a quick question regarding connecting a bound member function. In the doc_view example application signals are defined as requiring a function taking a bool and returning nothing. class Document { public: typedef boost::signal< void (bool) > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; The View abstract base class requires concrete bases to provide a concrete implementation of the refresh() member function matching the slot signature required. class View { public: virtual void refresh(bool) const = 0; // ... }; Here's my problem. If I change the signal to take no args using the preferred or portable syntax I get compilation errors: class Document { public: typedef boost::signal< void () > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; class View { public: virtual void refresh() const = 0; // ... }; Compilation output (msvc-7.1): Compiling... SignalTest.cpp c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2825: 'F::result_type': cannot form a qualified name c:\Boost\include\boost-1_33_1\boost\bind\bind_template.hpp(15) : see reference to class template instantiation 'boost::_bi::result_traits<R,F>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const ] c:\development\SignalTest\SignalTest.cpp(49) : see reference to class template instantiation 'boost::_bi::bind_t<R,F,L>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const, L=boost::_bi::list2<boost::_bi::list_av_2<View *,boost::arg<1>>::B1,boost::_bi::list_av_2<View *,boost::arg<1>>::B2> ] c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2039: 'result_type' : is not a member of 'operator``global namespace''' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2146: syntax error : missing ';' before identifier 'type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2955: 'boost::_bi::type' : use of class template requires template argument list c:\Boost\include\boost-1_33_1\boost\bind.hpp(112) : see declaration of 'boost::_bi::type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : fatal error C1903: unable to recover from previous error(s); stopping compilation Observed with boost_1_33_1 release on cygwin/gcc-3.4.4 and msvc-7.1 platforms. Any ideas? Many thanks in advance, -allen

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Paul Giaccone > Sent: Friday, August 04, 2006 7:38 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > Nat Goodspeed wrote: > > I suppose the next round would involve my arguing that it would take me > > many months to implement even part of the functionality in question > > > The answer to that would be to contact the Boost developers for all the > libraries you intend to or might use, and ask them how long it took them > to code up their respective libraries. [Nat] I'm hoping to avoid any approach that would add per-Boost-library overhead. Having to decide in advance the set of libraries I intend to use - and later facing additional internal battles to get permission to use one more -- would be discouraging. But I take your point: you're talking about an example set, not literally suggesting that I repeat the process every time I desire to incorporate another new Boost library. > Add it all up and present that > figure to your boss, pointing out that these people were at least as > competent as you or any other programmer he might care to employ. Does > he *really* want to wait a year or two for the code you are writing for > him? [Nat] Certainly he wouldn't want that. I guess I wasn't thinking clearly last night. The real problem is that nobody -- not me, not my boss, not the lawyers -- wants me to (attempt to) reimplement any Boost library. If we can't use Boost, then we must resort to the ugly hand-coded mechanisms that C++ programmers used before Boost emerged. No smart pointers? Delete the !@#? pointers yourself! No bind()? No boost::function? Quit griping and use the STL adapters! Can I make a case that the small incremental costs in coding time and reliability would add up to a bigger hit than the hypothetical risk of lawsuit? It seems doubtful, since all the factors involved in such an argument are sheer guesswork -- and every party will believe their own guesses rather than their opponents'. My boss might even be sympathetic. But my boss isn't the real problem here. > You might also want to ask your boss whether he is concerned that > Microsoft (or whoever wrote your compiler) might sue for use of their > version of C++, or whether he thinks Bjarne Stroustrup might be sending > you a writ... Of course, that would just be ridiculous, wouldn't it? ;) [Nat] Microsoft it is. I think I heard that Microsoft's licenses (purport to) protect you, the user of their products, from this kind of liability. That may be what raised this whole issue in our legal dept. in the first place.

2 1

Re: [Boost-users] Ownership of Boost IP?
by james.jones＠firstinvestors.com 04 Aug '06

04 Aug '06

From: "Nat Goodspeed" <ngoodspeed(a)solidworks.com> > As the lawyers' position is "Don't use > Boost," I can't see them making that effort, so it would be up to me (or > other interested developers) to pursue it. Which leaves me/us vulnerable > to charges of "wasting time" that could "better" be spent reinventing > Boost technologies. How about mentioning that a bunch of Boost stuff (ideas, at least) is intended for use in TR1 and, AFAIK, TR2 and TRn. And that surely standard libraries wouldn't be subject to these IP concerns? (Of course, they might reply: "Fine, once it gets into standard libraries you can use it." Which means you're waiting years.) - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

4 3

Re: [Boost-users] Ownership of Boost IP?
by Sohail Somani 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey > Sent: Friday, August 04, 2006 9:52 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > > Realistically, this situation isn't about the facts - its about > someone having authority beyond his expertise. Its a > political issue not a technical one. Boost and its developers > can only do so much. Therefore, it can all be solved with a nice lunch with the boss! Bosses are good at this stuff. Atleast the good ones :)

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Robert Ramey > Sent: Friday, August 04, 2006 11:18 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > Nat Goodspeed wrote: > > My employer's legal department has just stated that we may not use > > Boost for product development because of a hypothetical lawsuit risk. > > Hmmm - wouldn't his same concern apply to any software you > don't write yourself? Suppose you use VC 7.1. It comes with > dinkumware libraries - does your legal dept require a release > from dinkumware?. Assuming it does, how does assure itself > that some dinkumware developer didn't use some code/knowledge > from his previious job or was inspired by some snippet he found > on the net. OK so you get releases and hold harmless clauses > from all the past dinkumware developers. Now how about the > windows API - after all that's just another library. Are you going > to use calls from that? Does your legal department feel confident > that no microsoft employee or manager has incorporated code > from other sources? If it does, its pretty clear they've not aware > of all the lawsuits microsoft has had in this regard. And the fact > is that none of the lawsuits have resulted in damages to microsoft > customers or users or developers' who have leveraged on such > code. [Nat] To play devil's advocate for a moment -- I'm sure the legal dept. would say that's because Microsoft promises protection from such actions, in return for the license fee. If I could show precedent where someone attempted to sue users of (or developers who integrated) an Open Source project -- but lost -- that would be a stronger argument. > Such a decision has technical and economic implications far, far > beyond what your legal department (and probably management - if its gotten > this far) are aware of. [Nat] No argument from me there. > Maybe more practical advice would be > to suggest to your boss that he get a second legal opinion. [Nat] Interesting suggestion! I'll see if I can make anything happen along those lines.

2 1

Re: [Boost-users] shared_ptr in API
by Sohail Somani 04 Aug '06

04 Aug '06

If the pointer is meant to be owned by the caller, you could consider references (assuming the objects are required of course). > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Mikhail Kubzin > Sent: Thursday, August 03, 2006 3:45 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] shared_ptr in API > > Did you consider using weak_ptr in your API? > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

permutation_iterator: No conversion support
by Daniel Krügler 04 Aug '06

04 Aug '06

Hello, I observed this weekend, that permutation_iterator cannot provide compatible conversions, in constrast to all other iterators. The problem is due to access right violations in the "conversion" pseudo copy c'tor: template<class OtherElementIterator, class OtherIndexIterator> permutation_iterator( permutation_iterator<OtherElementIterator, OtherIndexIterator> const& r , typename enable_if_convertible<OtherElementIterator, ElementIterator>::type* = 0 , typename enable_if_convertible<OtherIndexIterator, IndexIterator>::type* = 0 ) : super_t(r.base()), m_elt_iter(r.m_elt_iter) {} This c'tor cannot be instantiated successfully, even if SFINAE has allowed that: The private member m_elt_iter cannot be accessed from another permutation_iterator<OtherElementIterator, OtherIndexIterator> and the result is a compile error. One should either provide friendship to permutation_iterator<typename, typename> or the private member should be readable via a public member function to fix this. I have provided a corresponding bug report http://sourceforge.net/tracker/index.php?func=detail&aid=1530999&group_id=7… It would be very nice, if that fix could go into boost 1.34! Many thanks and Greetings from Bremen, Daniel Krügler

2 1

MS VC2005 + Boost Setup
by Heiko Günther 04 Aug '06

04 Aug '06

Hello! I have some trouble to setup the Boost library with VC++ 2005. I am rather new to the library, so I could need some help. I have downloaded Version 1.33 and extracted the files to location A ("d:\programs\boost" in my case). Visual Studio is located in location B ("d:\programs\VS"). What is the best way to build the library files? I especially need the compiled library of the "signal" class. Since I have no experience with this bjam tool any help would be appreciated. I can't figure out how this works using the information from the project's website.. Best regards, Heiko

4 4

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of John Maddock > Sent: Friday, August 04, 2006 5:09 AM > To: boost-users > Subject: Re: [Boost-users] Ownership of Boost IP? > > Whew, of course now I feel like no one should write code, and I should go > look for another profession! But hopefully there is some ammunition in > there you can use. [Nat] Thank you!! I will certainly give it a try!

1 0

Re: [Boost-users] Ownership of Boost IP?
by Nat Goodspeed 04 Aug '06

04 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Gennaro Prota > Sent: Thursday, August 03, 2006 9:13 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ownership of Boost IP? > > On Thu, 3 Aug 2006 19:39:17 -0400, "Nat Goodspeed" wrote: > > >My employer's legal department has just stated that we may not use Boost > >for product development because of a hypothetical lawsuit risk. > > Devin Smith, the lawyer who wrote the Boost Software License, > anticipated these issues; see "Benefit of Common Software License" in: > > <http://www.boost.org/more/license_info.html> > > where he also mentions a possible way to address the problem. [Nat] I think you mean this passage? "But this can be addressed, not by trying to craft the perfect standard license, but by informing the corporations that they can, if they don't like the standard license, approach the authors to negotiate a different, perhaps even paid, license." Thank you, I hadn't previously found the cited discussion. But... If that's the best I can put forth, then I worry that our legal dept. will assert that tracking down individual library authors and negotiating with each of them will largely negate the savings in software development time. As the lawyers' position is "Don't use Boost," I can't see them making that effort, so it would be up to me (or other interested developers) to pursue it. Which leaves me/us vulnerable to charges of "wasting time" that could "better" be spent reinventing Boost technologies. I suppose the next round would involve my arguing that it would take me many months to implement even part of the functionality in question -- and the legal staff asking whether my boss should consider someone more competent instead. :-/ Any additional ammunition would be gratefully received...

4 3

How do I use regex to match two consecutive newlines?
by Tommy Li 04 Aug '06

04 Aug '06

I've tried matching like this: std::string input = filecontents; boost::regex re_paragraphs("\\n\\n"); boost::sregex_token_iterator input_token_it(input.begin(), input.end(), re_paragraphs, -1); boost::sregex_token_iterator end_token_it; for( ; input_token_it != end_token_it; input_token_it++ ) { output += "TOKEN FOUND" } return output; But this never works. It matches when I use a part of a word as a token. The problem is that it's just not matching the newlines. I've looked into the input's hex and there are indeed two newline chars consecutively. I think I'm missing something obvious. Anyone have any idea?

3 6

lexical_cast problem
by shams 04 Aug '06

04 Aug '06

Hi, Here is a sample custom string class that I am tring to get working with lexical_cast but it gives me compile errors. Can you please see what I am doing wrong here. More explanation below. OTOH if I use a custom lexical_cast using wstringstream it works fine. // main.cpp #include <string> #include <iostream> #include "boost_1_33_1/boost/lexical_cast.hpp" using namespace std; class String : public wstring { public: String() { } String(const wchar_t *str) : wstring(str) { } String& operator=(const String& Rhs) { return static_cast<String&>(wstring::operator=(Rhs)); } }; // This is commented cause lexical_cast wants bool return value. #if 0 template<class OutputStream> OutputStream& operator<<(OutputStream &o, const String &s) { return o << s.c_str(); } #endif template<class OutputStream> bool operator<<(OutputStream &o, const String &s) { o << s.c_str(); return true; } // This is commented cause lexical_cast wants bool return value. #if 0 template<class InputStream> InputStream& operator>>(InputStream &i, String &s) { wstring ws; i >> ws; s.assign(ws); return i; } #endif template<class InputStream> bool operator>>(InputStream &i, String &s) { wstring ws; i >> ws; s.assign(ws); return true; } int main() { // This line causes errors both on MSVC and GCC. wcout << boost::lexical_cast<String>(10); // These lines DONT cause errors and work ok. String s = L"hello"; wcout << s; wcout << endl; wcin >> s; wcout << s; wcout << endl; return 0; }

1 0

Subject: Serialization, text_Xarchive Why doesn't work?
by tkachenkok＠gmx.de 04 Aug '06

04 Aug '06

I've tried to write my first application with Boost.Serialization library. Here is the part of code, where the boost::text_iarchive throws an exception "boost::archive::archive_exception" "what(): stream error": [code] enum Origin { UNKNOWN=0, MEASURED, AVERAGE }; class OTCValue { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & m_value; ar & m_orig; } double m_value; Origin m_orig; ... }; ... const OTCValue val1=(*loaded.second.begin())->get_row(0)[0]; { std::ofstream ofs("test_serial.txt"); boost::archive::text_oarchive oa(ofs); oa << val1; } OTCValue val; { std::ifstream ifs("test_serial.txt"); boost::archive::text_iarchive ia(ifs); ia >> val; // here is this exceptions thrown } ... [/code] And here is a little bit different code, which works great: [code] enum Origin { UNKNOWN=0, MEASURED, AVERAGE }; class OTCValue { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & m_value; ar & m_orig; } double m_value; Origin m_orig; ... }; ... const OTCValue val1(5.5, MEASURED); { std::ofstream ofs("test_serial.txt"); boost::archive::text_oarchive oa(ofs); oa << val1; } OTCValue val; { std::ifstream ifs("test_serial.txt"); boost::archive::text_iarchive ia(ifs); ia >> val; } ... [/code] What is the problem? The construction (*loaded.second.begin())->get_row(0)[0] returns an OTCValue . I have compiled the boost-1.33.1 from the sources (www.boost.org) The project I've made is under KDevelop 3.2.2 (initially consol "Hello World" application) Operating System: SuSe Linux 10.0 Compiler: gcc version 4.0.2 I hope, that I've gave enouph information. If not, ask what aou need, you are welcome. Best regards, and thanks to all! -- Echte DSL-Flatrate dauerhaft für 0,- Euro*. Nur noch kurze Zeit! "Feel free" mit GMX DSL: http://www.gmx.net/de/go/dsl

4 4

tsp 2-approximation using triangle inequality
by Matyas W Egyhazy 04 Aug '06

04 Aug '06

Hello, I recently implemented an approximation for the traveling salesperson using the boost graph library. The interface as well as the implementation are not polished and they require improvement, mostly due to the work being part of a school homework assignment. If anyone is interested, I would like outside comments before spending (or wasting, if no one is interested) effort to fix it up. I have attached the .h,a driver .cpp, and a sample input file. The driver program will produce output files that are viewable in a neato dot renderer. I have tested this only on VC++ 2005 (8.0) although I cannot think of any specific reason why it would not compile on other compilers. The approximation algorithm runs in polynomial time and solves the TSP problem with the worst possible solution producing a path twice as long as the optimal solution. More information can be found regarding the algorithm/heuristic on page 1028 in "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein. A slightly different description can be found on Wikipedia: http://en.wikipedia.org/wiki/Traveling_salesperson_problem#Triangle_inequal… My implementation matches the Introduction to Algorithms description as I use a preorder walk of the MST without bothering to create an Euler tour. I believe the Euler tour part of the algorithm is only used to prove the limit on the length of the produced solution. Regards, Matt //tsp_2_approximation //Takes a sequence of simple_points and performs 2-approximation triangle inequality to //generate a solution for the traveling salesperson problem. //Outputs the graphs in dot format to passed ostream objects //Also returns the MST generated as part of the approximation and a predecessor map //for a tour #include <algorithm> #include <vector> #include <map> #include <string> #include <iostream> #include <complex> #include <boost/graph/graph_as_tree.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/prim_minimum_spanning_tree.hpp> #include <boost/graph/simple_point.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/iteration_macros.hpp> #include <boost/graph/graph_traits.hpp> template<typename Pt> std::istream& operator >> (std::istream& is, const boost::simple_point<Pt>& p) { return is >> boost::lexical_cast<std::string>(p.x) >> std::string(", ") >> boost::lexical_cast<std::string>(p.y); } template<typename Pt> std::ostream& operator << (std::ostream& os, const boost::simple_point<Pt>& p) { return os << boost::lexical_cast<std::string>(p.x) << std::string(",") << boost::lexical_cast<std::string>(p.y) << "!"; } //g is returned as the MST //preds is the predecessor map for the TSP approximation tour //the PositionMap is a coordinate map of the vertices represented as simple_points //the ostreams are optional, if they are provided the dot graphs are printed to them template<typename Graph, typename PositionMap, typename PredecessorMap> void tsp_2_approximation(Graph& g, const PositionMap& pos, PredecessorMap preds, std::ostream& pts_out = std::ostream(), std::ostream& mst_out = std::ostream(), std::ostream& tour_out = std::ostream()) { using namespace boost; using namespace std; typedef graph_traits<Graph>::vertex_iterator VertexItr; typedef graph_traits<Graph> GraphTraits; typedef property_map<Graph, vertex_index_t>::type IndexMap; typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef iterator_property_map<vector<Vertex>::iterator, property_map<Graph, vertex_index_t>::type> ParentMap; typedef graph_as_tree<Graph, ParentMap> Tree; typedef tree_traits<Tree>::node_descriptor Node; typedef graph_traits <Graph>::edge_descriptor Edge; typedef vector<simple_point<double> > PositionVec; typedef iterator_property_map<PositionVec::iterator, property_map<Graph, vertex_index_t>::type> PositionMap; int cnt(0); property_map<Graph, vertex_name_t>::type name_map(get(vertex_name, g)); //setup name map for the vertices IndexMap index(get(vertex_index, g)); for (pair<VertexItr, VertexItr> vp(vertices(g)); vp.first != vp.second; ++vp.first) { cnt++; name_map[*(vp.first)] = lexical_cast<string>(index[*(vp.first)]); } //print point layout to dot format if (pts_out) { dynamic_properties dp; dp.property("pos", pos); dp.property("id", get(vertex_name, g)); write_graphviz(pts_out, g, dp, string("id")); } property_map<Graph, edge_weight_t>::type weight_map(get(edge_weight, g)); graph_traits<Graph>::edge_iterator ei, ei_end; for (int q(0); q < cnt; ++q) { for (int i(q); i < cnt; ++i) { if (q != i) { //Calculate distance double weight(sqrt(pow(static_cast<double>(pos[q].x - pos[i].x), 2.0) + pow(static_cast<double>(pos[i].y - pos[q].y), 2.0))); graph_traits<Graph>::edge_descriptor e; bool inserted; tie(e, inserted) = add_edge(q, i, g); weight_map[e] = weight; } } } index = get(vertex_index, g); //extract the mst using prim's minimum spanning tree algorithm vector<Vertex> p(num_vertices(g)); prim_minimum_spanning_tree(g, &p[0]); Graph mst(cnt); vector<Vertex> parent(num_vertices(mst)); Tree t(mst, 0, make_iterator_property_map(parent.begin(), get(vertex_index, mst))); property_map<Graph, edge_weight_t>::type mst_weight_map(get(edge_weight, mst)); //build mst graph using the predecessor map from prim's mst algorithm for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { Edge e(*ei); Vertex u(source(e, g)); Vertex v(target(e, g)); if (p[v] == u || p[u] == v) { add_edge(u, v, mst); } } name_map = get(vertex_name, mst); for (tie(ei, ei_end) = edges(mst); ei != ei_end; ++ei) { Edge e(*ei); Vertex u(source(e, g)); Vertex v(target(e, g)); double weight(sqrt(pow(static_cast<double>(pos[u].x - pos[v].x), 2.0) + pow(static_cast<double>(pos[u].y - pos[v].y), 2.0))); mst_weight_map[e] = weight; preds[v] = u; name_map[u] = lexical_cast<string>(u); name_map[v] = lexical_cast<string>(v); } //print mst in dot format if (mst_out) { dynamic_properties dp; dp.property("pos", pos); dp.property("label", get(edge_weight, mst)); dp.property("id", get(vertex_name, mst)); write_graphviz(mst_out, mst, dp, string("id")); } //create tour using a preorder traversal of the mst property_map<Graph, edge_weight_t>::type tour_weight_map(get(edge_weight, mst)); PreorderTraverser<Node, Tree> vis; traverse_tree_ref(0, t, vis); const vector<Node>& v(vis.getPath()); Graph tour(cnt); //print out tour in dot format for (vector<Node>::const_iterator itr(v.begin()); itr != v.end() - 1; ++itr) { Node s(*itr); Node d(*(itr + 1)); add_edge(s, d, tour); } add_edge(*(v.end() - 1), *(v.begin()), tour); name_map = get(vertex_name, tour); for (tie(ei, ei_end) = edges(tour); ei != ei_end; ++ei) { Edge e(*ei); Vertex u(source(e, g)); Vertex v(target(e, g)); double weight(sqrt(pow(static_cast<double>(pos[u].x - pos[v].x), 2.0) + pow(static_cast<double>(pos[u].y - pos[v].y), 2.0))); tour_weight_map[e] = weight; name_map[u] = lexical_cast<string>(u); name_map[v] = lexical_cast<string>(v); } if (tour_out) { dynamic_properties dp; dp.property("pos", pos); dp.property("label", get(edge_weight, tour)); dp.property("id", get(vertex_name, tour)); write_graphviz(tour_out, tour, dp, string("id")); } g = mst; } //Recursive function that traverses a tree with a custom visttor template <class Tree, class TreeVisitor> void traverse_tree_ref(typename boost::tree_traits<Tree>::node_descriptor v, Tree& t, TreeVisitor& visitor) { visitor.preorder(v, t); typename boost::tree_traits<Tree>::children_iterator i, end; tie(i, end) = children(v, t); if (i != end) { traverse_tree_ref(*i++, t, visitor); visitor.inorder(v, t); while (i != end) { traverse_tree_ref(*i++, t, visitor); } } else { visitor.inorder(v, t); } visitor.postorder(v, t); } //Keeps track of a preorder traversal of a tree template<typename Node, typename Tree> class PreorderTraverser { private: std::vector<Node> path_; public: void preorder(Node n, Tree& t) { path_.push_back(n); } void inorder(Node n, Tree& t) {} void postorder(Node, Tree& t) {} const std::vector<Node>& getPath() { return path_; } }; //Main test harness for the tsp_2_approximation solution generator #include <iostream> #include <utility> #include <vector> #include <fstream> #include <boost/lexical_cast.hpp> #include "tsp_2_approximation.h" int main(int,char*[]) { using namespace boost; using namespace std; typedef adjacency_list<vecS, vecS, directedS, property <vertex_name_t, string>, property <edge_weight_t, double > > Graph; typedef vector<simple_point<double> > PositionVec; typedef iterator_property_map<PositionVec::iterator, property_map<Graph, vertex_index_t>::type> PositionMap; ifstream fin("graph.txt"); if (!fin) { cerr << "To run this program properly please place a file called graph.txt" << endl << "into the current working directory." << endl << "Each line of this file should be a coordinate specifying the" << endl << "location of a vertex" << endl << "For example: " << endl << "1,2" << endl << "20,4" << endl << "15,7" << endl << endl << "The output of the program will be three DOT formatted files in the" << endl << "current working directory: " << endl << "pts.dot - Only displays the points as described in graph.txt" << endl << "mst.dot - Displays an MST for the points in graph.txt" << endl << "tour.dot - Displays the TSP 2-approximation triangle inequality tour " << endl << "for the points in graph.txt" << endl << endl << "These files should be viewed with a 'neato'" << "DOT graph viewer" << endl << "as it can handle forced coordinates" << endl; return -1; } ofstream ptsOut("pts.dot"); ofstream mstOut("mst.dot"); ofstream tourOut("tour.dot"); string line; PositionVec position_vec; int n(0); while (getline(fin, line)) { simple_point<double> vertex; size_t idx(line.find(",")); string xStr(line.substr(0, idx)); string yStr(line.substr(idx + 1, line.size() - idx)); vertex.x = lexical_cast<double>(xStr); vertex.y = lexical_cast<double>(yStr); position_vec.push_back(vertex); n++; } fin.close(); Graph g(n); PositionMap pos(position_vec.begin(), get(vertex_index, g)); vector<graph_traits<Graph>::vertex_descriptor> preds(n); tsp_2_approximation(g, pos, &preds.front(), ptsOut, mstOut, tourOut); return 0; } 1,2 2,4 10,20 45,20 15,1 17,20 20,25 30,20

3 2

[program_options] very long default values make formatting go nuts
by Andy Schlaikjer 03 Aug '06

03 Aug '06

Hi all, I have an option in my options_description which has a very long default value (an absolute pathname to a data file). When I print out the usage info via: cout << desc << endl; ..the formatting of the message is really bad; The long default value makes the option description text get squished to the far right: Allowed options: -h [ --help ] produce help message -v [ --version ] print version string -D [ --database-file ] arg (=/very/long/path) specify databas e filen ame Is there any way to affect the formatting of the description? Perhaps force any default value to be printed underneath the option itself, or not require the description text for all options align on the same column? Thanks, Andy

1 0

[Graph] float/double weights and brandes_betweenness_centrality
by Ioannis Filippis 03 Aug '06

03 Aug '06

Hi, I wonder whether float/double weights may cause a bug in brandes_betweenness_centrality. In the brandes_dijkstra_visitor, in the case where edge is not relaxed, there is an equality check if (d_w == combine(d_v, w_e)) in order to find if there is equally-short path from v to w. If d_w, d_v, w_e are float/doubles, isn't there gonna be a problem with the "=="? Thanks Ioannis

2 1

filtered graph with bundled properties
by moritz Hilger 03 Aug '06

03 Aug '06

hi, i hava a problem using bundled properties with filtered graph. i've modified the example from the filtered-graph page ( http://www.boost.org/libs/graph/doc/filtered_graph.html) to use edge properties and woul like to create a filter using these bundled properties, but am experiencing problems with the types of the property_map and/or filter. since i'm quite new to c++ and boost i would aprectiate any suggestin, thanks in advance i'm using gcc-3.3.5 and boost-1.34 moritz modified code: struct myEdge { int id; int weight; }; template <typename EdgeWeightMap> struct positive_edge_weight { positive_edge_weight() { } positive_edge_weight(EdgeWeightMap weight) : m_weight(weight) { } template <typename Edge> bool operator()(const Edge& e) const { return 0 < boost::get(m_weight, e); } EdgeWeightMap m_weight; }; int main() { using namespace boost; typedef adjacency_list<vecS, vecS, directedS, //no_property, property<edge_weight_t, int> > Graph; no_property, myEdge > Graph; typedef property_map<Graph, int myEdge::*>::type EdgeWeightMap; typedef graph_traits<Graph>::edge_iterator edge_iter_t; typedef filtered_graph<Graph,positive_edge_weight<EdgeWeightMap> > f_graph_t; typedef graph_traits<Graph>::edge_descriptor Edge; enum { A, B, C, D, E, N }; const char* name = "ABCDE"; Graph g(N); Edge e; bool ins; tie(e,ins)=add_edge(A, B, g); /.../ positive_edge_weight<EdgeWeightMap> filter(get(&myEdge::weight, g)); f_graph_t fg(g, filter); std::cout << "filtered edge set: "; print_edges(fg, name); std::cout << "filtered out-edges:" << std::endl; print_graph(fg, name); return 0; } g++ output: error: no matching function for call to ` boost::bundle_property_map<main()::Graph, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, myEdge, int>:: bundle_property_map()' /homes/combi/Software/Boost/boost/graph/properties.hpp:330: error: candidates are: boost::bundle_property_map<main()::Graph, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, myEdge, int>::bundle_property_map(const boost::bundle_property_map<main()::Graph, boost::detail::edge_desc_impl<boost::directed_tag, size_t>, myEdge, int>&) /homes/combi/Software/Boost/boost/graph/properties.hpp:336: error: boost::bundle_property_map<Graph, Descriptor, Bundle, T>::bundle_property_map(Graph*, T Bundle::*) [with Graph = main()::Graph, Descriptor = boost::detail::edge_desc_impl<boost::directed_tag, size_t>, Bundle = myEdge, T = int] -- /* ICQ 291996214 */ /* MSN moritz.hilger(a)gmail.com */ /* moe1234(a)jabber.ccc.de */ /* del.icio.us/new/moritz.hilger */

2 1

astar-cities.cpp internal compile error
by bringiton bringiton 03 Aug '06

03 Aug '06

Hi, I'm trying to compile the sample from astar-cities.cpp. I however get a INTERNAL COMPILER ERROR. I'm using ms vc++ 6. Can I assume the sample does not run on the old vc++ version? Anything I can do to get around this? Test5.cpp xxx\boost\random\lagged_fibonacci.hpp(81) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Generating Code... Error executing cl.exe. Test2.exe - 1 error(s), 1 warning(s)

3 2

[bgl documentation] corrections (?) and improvements to help new users
by David Baird 03 Aug '06

03 Aug '06

Hi! I'm a new user of the BGL. I've attached a couple patches to the BGL documentaion which I think will be very helpful to new users. For example, one of the websites, http://www.boost.org/libs/graph/doc/file_dependency_example.html seems to contain a simple, but confusing (for new users) error: Graph g(N, used_by, used_by + sizeof(used_by) / sizeof(Edge)); In boost-1.33.0, the correct line AFAICT is, Graph g(used_by, used_by + sizeof(used_by) / sizeof(Edge), N); I successfully tested the new instructions in the documentation (which the attached patches apply to) with boost-1.33.0 under Gentoo Linux. If this is the wrong list to post this, please direct me toward the correct place. -David

2 1

[BGL] traversing edges in the graph
by Alejandro Aragón 03 Aug '06

03 Aug '06

Hello, I'm working with undirected graphs and I was wondering if there is an algorithm that traverses all the edges in the graph in such a way that this task is optimized. That is, if you draw a graph with a pencil, the number of times that you should lift the tip of the pencil is minimized. Can anyone give me a hint on this? Thanks, Alex

2 1

[bgl] user defined vertex_descriptor?
by timblech 03 Aug '06

03 Aug '06

hi all, i'm curious, if it's possible to change the type, that a graph uses as vertex_descriptor... i went through the examples, where usually int values are used, which seems to be the default ... for my application, i'd like to use a class pointer as vertex_descriptor, though... the problem i had with property map is, that i was only able to look up a property by vertex_descriptor, but not the other way round... it's possibly only a problem caused by my limited knowledge of the bgl, but it would be very nice, if someone could enlighten me. thanks in advance ... tim -- View this message in context: http://www.nabble.com/-bgl--user-defined-vertex_descriptor--tf2008709.html#… Sent from the Boost - Users forum at Nabble.com.

2 1

help building shared library for lib/filesystem on RHEL4 with gcc 3.4.4
by William Deegan 03 Aug '06

03 Aug '06

Greetings, When I do the following: pushd libs/filesystem/build bjam "-sTOOLS=gcc" I only end up with the /boost-1.30.2/libs/filesystem/build/bin/libboost_filesystem.a/gcc/release/runtime-link-dynamic/libboost_filesystem.a Built and no .so What am I missing? Thanks, Bill

2 3

[test] how to use register_exception_translator with auto_test?
by Jörg Becker 03 Aug '06

03 Aug '06

How can I use the the register_exception_translater with the Auto unit test framework? With boost 1.31 / VC7.1 I wrote a dummy test only containing the register_exception_translator call. This works fine, but with boost 1.33 / gcc3.3 this workaround does not work. Any Suggestions? Jörg

3 6

checking validity
by Ovanes Markarian 03 Aug '06

03 Aug '06

Hello all, I have one specific question. Which I am uncertain if it can be solved anyway. Imagine the following class structure: struct A { some_field* x; }; struct B { optional<A> a_; }; struct C { optional<B> b_; }; Now I have an instance of struct C and would like to know if x is a valid pointer. this code is really ugly: if(c.b_) if(c.b_.a_) if(c.b_.a_.x) //do smth ... This will be really unpleasent if the structure is more deep then this one. Which is the case in our project. The intention would be to write everything in one if-statement. It is not possible to implement a bool or ! operator in these structures, since these are not the only fields and these operators would not know which field should be checked... Currently I am thinking about boost parameter library, but still uncertain if this problem can be solved using it... Can some of you make a suggestion what is the best suitable way of resolving this issue and if this issue resolvable anyway. With Kind Regards, Ovanes Markarian

2 1

Re: [Boost-users] checking validity
by james.jones＠firstinvestors.com 03 Aug '06

03 Aug '06

From: "Ovanes Markarian" <om_boost(a)keywallet.com> > Now I have an instance of struct C and would like to know if x is a valid pointer. > this code is really ugly: > if(c.b_) > if(c.b_.a_) > if(c.b_.a_.x) > //do smth ... > The intention would be to write everything in one if-statement. It is not possible > to implement a bool or ! operator in these structures, since these are not the > only fields and these operators would not know which field should be checked... How about just: if(c.b_ && c.b_.a_ && c.b_.a_.x) //do smth ... Is that cheating? You can do it all in one 'if' statement this way. I suppose you could write a macro to do something like this: #define CHECK(x,y,z,w) (x.y && x.y.z && x.y.z.w) and then use it like this: if(CHECK(c, b_, a_, x)) //do smth ... And maybe you could write the macro in such a way as to take arbitrary lists of arguments. But that's the best I can come up with. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

2 1

[preprocessor] Enumerating sequence of pairs
by Roman Perepelitsa 03 Aug '06

03 Aug '06

Hello. I want to enumerate sequence of pairs but can't figure out how to do it using boost.preprocessor. Here is example. // sequence of pairs #define SEQ (a, b) (c, d) // How can I implement this macro? #define MAGIC(S) ... MAGIC(SEQ) expands to abcd. If I had possibility to convert SEQ to ((a, b)) ((c, d)) problem would be solved easily because it's standard sequence and thus can be enumerated using with BOOST_PP_SEQ_FOLD_LEFT or another boost.preprocessor algorithm. I have implemented macro which converts SEQ to ((a, b)) ((c, d)) but implementation is huge (I copy-pasted a lot of code from boost.preprocessor). Now I need to enumerate sequence of triples and I don't want to copy-paste again. Any tips? Roman Perepelitsa.

2 2

string_algo and utf8 locales
by Maik Beckmann 03 Aug '06

03 Aug '06

Hello list, this is my first post to you :) I've got a problem with handling locales and string_algo. As an example I want so make this string "hää?" uppercase (->"HÄÄ?") by using this piece of code: <code> #include <iostream> #include <locale> #include <string> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main(int argc, char** argv) { string loc_name = "de_DE.utf8"; string str("hää?"); str = to_upper_copy(str,locale(loc_name.c_str())); // ...should give "HÄÄ?" cout << str << endl; // but prints "Hää?" return 0; } </code> As you see I'm trying to use locales, but it doesn't work. What is my mistake?? Thanks in advance, Maik PS: - I'm using gentoo-linux with gcc-4.1.1 - My locales list: LANG=de_DE.utf8 LC_CTYPE="de_DE.utf8" LC_NUMERIC="de_DE.utf8" LC_TIME="de_DE.utf8" LC_COLLATE="de_DE.utf8" LC_MONETARY="de_DE.utf8" LC_MESSAGES="de_DE.utf8" LC_PAPER="de_DE.utf8" LC_NAME="de_DE.utf8" LC_ADDRESS="de_DE.utf8" LC_TELEPHONE="de_DE.utf8" LC_MEASUREMENT="de_DE.utf8" LC_IDENTIFICATION="de_DE.utf8" LC_ALL=de_DE.utf8

2 3

shared_ptr in API
by Philippe Lambert 03 Aug '06

03 Aug '06

Hello, We are a large team of C++ developers, using Boost at large. We have a philosophical issue about shared_ptr usage and I'm looking for external inputs. The 2 clans are opposed about a simple question: "Should we use shared_ptr in the API function signatures of a module (dll or else)". Both clan use a lot of Sutter/Meyers/other gurus and authors citation to support their view. 1- Pros: shared_ptr are everywhere in the current code. It is the best way to prevent resources leaks, it is easy to use, convenient, it is mostly safe. A lot of gurus are saying "use shared_ptr". Preventing them in API will means a lot of .get() in the existing code. 2- Cons: A shared_ptr in the API give the right to the called function to keep a copy (virtually permanently) of the object. It is a bad indication in the contract if the function doesn't need to keep a copy. It tell to the user "take care, I may keep a copy of this and influence his life cycle". If it is not the case, you should tell it in the signature by asking for a const reference or something like it. Also, if the caller have a stack object and want to use an API function which ask for a shared_ptr, he will need to create a copy, or create a shared_ptr with a deactivated destructor... It is not a beautiful thing, both ways. Of course, I thing that the correct solution is in between, but how to state it? If it is a real issue, I would like to read other team opinion, standard, decision algo or policy... If we are technically totally disoriented, I would like to be redirected... Thanks to all Philippe Lambert

3 2

Re: [Boost-users] replace_all_regex on c-string help
by llwaeva＠21cn.com 03 Aug '06

03 Aug '06

> > > I got the string (char*s), which is too big (>10M), from an external > > library, it's too slow to convert the raw string to std::string before > > it is handled by replace_all_regex > > Here's your fundamental problem: regex does not do in-place search and > replace. It is boost::algorithm::replace_all_regex, not boost:regex_replace

3 2

regular expression on table data
by Winson Yung 03 Aug '06

03 Aug '06

Hello all, I have a follow table: OPERATING REVENUES: publishing $ 42,419 $ 44,754 $ 46,203 collegiate marketing and production services 97 ASSOCIATION MANAGEMENT SERVICES 16 wireless 8,883 8,129 7,507 51,302 52,883 53,823 All I know is that OPERATING REVENUES: will be always there, question is how to write a regular expression to capture the total (which is 51,302 here) There might be more/less than four rows in the table. Would really appreciated if anyone has good suggestion on this. /Winson

2 5

[date_time] Warning in date_time/constrained_value.hpp
by Vsevolod Vlaskin 03 Aug '06

03 Aug '06

Hi, We run into a strange compilation warning, which we see on and off in one particular spot in our code: std::string str( /* initialized with a sane value */ ); ... double dbl( boost::lexical_cast<double>( str ) ); return dbl; The warning shows up only in release mode, NOT in debug: /usr/include/boost/date_time/constrained_value.hpp: In function int main(int, char**): /usr/include/boost/date_time/constrained_value.hpp:64: warning: year$D120988$value_ is used uninitialized in this function If we comment definition of dbl, the warning disappears. It is not a big deal, but maybe, someone could shed light on it. Best regards, Vsevolod Vlaskine __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Re: [Boost-users] (de)serializing map<const A*>
by Cheok Yan Cheng 03 Aug '06

03 Aug '06

Hi Robert, I am using VC++ 2003 I must say, the following workaround just work :) :) :) void load(Archive & ar, const unsigned int version) { void * xptr; xptr = & fiducialPairSearchRegionMap; map<FiducialPair *, vector<RectPair> > *mptr; mptr = static_cast<map<FiducialPair *, vector<RectPair> > >(xptr); ar >> *mptr; } Btw, may I know what is the reason behind of using static_cast instead of reinterpret_cast (reinterpert_cast can be compiled too)? Is it by following a thumb of rule, "use static_cast if you can and use reinterpret_cast if you have to"? Thank you very much! yccheok

2 1

boost::bind for returning a reference?
by Paul 03 Aug '06

03 Aug '06

Hi all, I understand why boost::bind() must return a const-reference or a value, but what I don't understand is, why must I do boost::bind<R&>(...) if I want it to return by reference? Why must I (the user) deduce the return type myself? Can't we have a boost::bind_return_reference(...) function that is the equivalent of boost::bind<R&>(...), so I don't have to do all the hard result_of type deduction manually? cheers Paul

2 3

Boost.Signals doc_view example application question?
by Allen Gooch 02 Aug '06

02 Aug '06

I have a quick question regarding connecting a bound member function. In the doc_view example application signals are defined as requiring a function taking a bool and returning nothing. class Document { public: typedef boost::signal< void (bool) > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; The View abstract base class requires concrete bases to provide a concrete implementation of the refresh() member function matching the slot signature required. class View { public: virtual void refresh(bool) const = 0; // ... }; Here's my problem. If I change the signal to take no args using the preferred or portable syntax I get compilation errors: class Document { public: typedef boost::signal< void () > signal_t; // ... void append(const char* s) { m_text += s; m_sig(true); } // ... }; class View { public: virtual void refresh() const = 0; // ... }; Compilation output (msvc-7.1): Compiling... SignalTest.cpp c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2825: 'F::result_type': cannot form a qualified name c:\Boost\include\boost-1_33_1\boost\bind\bind_template.hpp(15) : see reference to class template instantiation 'boost::_bi::result_traits<R,F>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const ] c:\development\SignalTest\SignalTest.cpp(49) : see reference to class template instantiation 'boost::_bi::bind_t<R,F,L>' being compiled with [ R=boost::_bi::unspecified, F=void (__thiscall View::* )(void) const, L=boost::_bi::list2<boost::_bi::list_av_2<View *,boost::arg<1>>::B1,boost::_bi::list_av_2<View *,boost::arg<1>>::B2> ] c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2039: 'result_type' : is not a member of 'operator``global namespace''' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2146: syntax error : missing ';' before identifier 'type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : error C2955: 'boost::_bi::type' : use of class template requires template argument list c:\Boost\include\boost-1_33_1\boost\bind.hpp(112) : see declaration of 'boost::_bi::type' c:\Boost\include\boost-1_33_1\boost\bind.hpp(63) : fatal error C1903: unable to recover from previous error(s); stopping compilation Observed with boost_1_33_1 release on cygwin/gcc-3.4.4 and msvc-7.1platforms. Any ideas? Many thanks in advance, -allen

1 0

boost::filesystem::ifstream and .eof()
by pktao＠uwm.edu 02 Aug '06

02 Aug '06

Dear Boost users --I have a simple question about how to test for eof. I usually use: std::ifstream inputDataStream("path to file"); and test for EOF by: inputDataStream.eof() I tried the same thing using: boost::filesystem::basic_ifstream<char> inputDataStream("path to file", std::ios_base::in); and test for EOF by: inputDataStream.eof() but its not working. Am I using the .eof() correctly in the boost version of basic_ifstream? Here is the broken code using the boost version of basic_ifstream: int main() { boost::filesystem::path dataPath("/tao/data"); if ( !exists(dataPath) ) { std::cerr << "Path does not exist!"; return EXIT_FAILURE; }; for (boost::filesystem::directory_iterator fileIterator(dataPath); fileIterator != boost::filesystem::directory_iterator(); fileIterator++) { const boost::filesystem::path InputFileName = dataPath/fileIterator -> leaf(); boost::filesystem::basic_ifstream<char> inputDataStream(InputFileName, std::ios_base::in); int i = 1; int previousIterator = 0; trialOnsetWrite(); while ( !inputDataStream.eof() ) { if ( (previousIterator + 3) == i) { immobileWrite(i); previousIterator = previousIterator + 3; } else { dataStructureWrite(i); }; i++; }; trialOffsetWrite(i); }; return (0); }; Very appreciative, Patrick

2 1

Lack of release() in scoped_ptr and scoped_array
by Milutin Jovanovic 02 Aug '06

02 Aug '06

I finally decided to switch to boost from my own implementation of some helper classes, and I noticed that scoped_ptr and scoped_array in boost lack the release method(). I had to fall back to std::auto_ptr. However, this seems like such a basic and fundamental problem that I have started to fear that I am missing something obvious... The usage I got used to was something like this: { scoped_ptr<A> temp( new A() ); verify( temp.get() ); // might throw store_in_a_very_special_place( temp.get() ); // might throw; and I should keep ownership if thrown temp.release(); } I though this was good practice to make code exception safe. Sure I could do it with try-catch but that gets messy if I allocate multiple instances etc. So the question is: 1) is there something wrong with the concept of release()? 2) if release() is not evil, is there any other reason why is it not in boost::scoped_*? Regards, Milutin Jovanovic

3 2

boost::mpl::if_
by Noel Yap 02 Aug '06

02 Aug '06

I'd like to do something like: typedef typename boost::mpl::if_< typename base::is_container<T>::type, typename T::element_type, T>::type ElementType_; such that T may be a primitive type. The above doesn't work since, for example, there's no such thing as int::element_type. Is there a simple way (eg don't have to do template specialization for all container types) to do the above? Thanks, Noel

2 1

enable_if problem
by Imre 02 Aug '06

02 Aug '06

Hi I have some non-compiling code, and I'd like to know if it's a compiler bug, or something I'm doing wrong. In the following code (it's a simplified version of the real code where I met the problem) the call to F<int> instantiates S<int>. I think the compiler should choose the specialized version of S<>, but it seems to use the primary template instead, leading to an invalid non-lvalue int -> int& conversion. Strangely, if I explicitly instantiate S<int> (uncomment the commented line), then it compiles fine. I also tried implementing enable_if and is_fundamental myself, and came to the exact same results. Also tested that version (with the custom enable_if and is_fundamental) with the online Comeau compiler, and it compiled fine. So, I'd like to know whether this stuff should work according to the standard, and if not, why; and if anyone could suggest a workaround that works with VC++ 7.1. Thanks, Imre Here's the code: #include <boost/type_traits.hpp> #include <boost/type_traits/is_fundamental.hpp> #include <boost/utility/enable_if.hpp> template <typename T, typename Enable = void> struct S { typedef T& type; }; template <typename T> struct S<T, typename boost::enable_if_c<boost::is_fundamental<T>::value>::type> { typedef T type; }; //template struct S<int>; // Compiles fine with VC if this line is uncommented template <typename T> typename S<T>::type F() { return 0; } int main(int argc, char* argv[]) { F<int>(); return 0; }

1 0

regex_constants::perl
by Winson Yung 02 Aug '06

02 Aug '06

Hello, I saw the following thread talking about how to set regex to work in perl extended mode: http://groups.google.com/group/boost-list/browse_thread/thread/4d5588fb7021… I am using 1.28.0 and has coded something like this already: boost::RegEx expr(is10k ? keywords_10k[i].m_Key : keywords_10q[i].m_Key, true); // Pass callback, strings to RegEx library unsigned int result = expr.Grep(cb, pBuf); question is how do I set this boost::regex_constants::perl like the follow example: boost::regex rxBlah("([a-z](?:_?[a-z0-9])*)_dvs", boost::regex_constants::perl | boost::regex_constants::icase); /Winson

2 3

replace_all_regex on c-string help
by llwaeva＠21cn.com 02 Aug '06

02 Aug '06

Hi there, I am using in-place replacement with replace_all_regex replace_all_regex( source, boost::regex("(%f)"), "(?1 xxx)", format_all); where source is of type std::string. But for some reason, I need to perform replacement on a C-string (char *), is replace_all_regex safe to do so? Will replace_all_regex handle memory issue for us? Thanks.

3 2

Re: [Boost-users] replace_all_regex on c-string help
by llwaeva＠21cn.com 02 Aug '06

02 Aug '06

>> But for some reason, I need to perform replacement on a >> C-string (char *), is replace_all_regex safe to do so? Will replace_all_regex handle memory >> issue for us? >Of course this would be impossible. Boost.Regex can't know how the >memory was allocated (e.g. malloc or new or some custom allocator), or >even if it *was* allocated. >Why do you need to operate on raw char*'s? Why can't you operate on >an std::string? I got the string (char*s), which is too big (>10M), from an external library, it's too slow to convert the raw string to std::string before it is handled by replace_all_regex

2 1

[shmem] problem retrieving objects from map
by Pataki Szilard 02 Aug '06

02 Aug '06

Hello, I have a problem retrieving objects from a map placed in shared memory. I have two processes: proc#1: creates the shared memory, puts a map into it and populates it with objects proc#2: connects to the shared memory and tries to read out the objects from the map Whenever I try to read out the objects from the map, I get zeroes for the internal members (a, b). The class definition for the objects: -------------------------------------------------- class ShmNode { private: int a; int b; public: ShmNode(); ShmNode(int newa, int newb); ~ShmNode(); void set(int newa, int newb); int getA(); int getB(); }; -------------------------------------------------- I'm posting the source codes for the two programs. I removed the synchronization stuff with semaphores for the sake of clarity: Proc#1: -------------------------------------------------- #include <boost/shmem/named_shared_object.hpp> #include <boost/shmem/allocators/allocator.hpp> #include <boost/shmem/containers/vector.hpp> #include <boost/shmem/containers/map.hpp> #include <boost/shmem/sync/named_semaphore.hpp> #include <iostream> #include "../shmem/ShmNode.hpp" typedef std::pair< const int, ShmNode*> MyPair; typedef boost::shmem::allocator < MyPair, boost::shmem::named_shared_object::segment_manager> MyAlloc; typedef boost::shmem::map< const int, ShmNode*, std::less<const int>, MyAlloc> MyMap; int main() { boost::shmem::named_shared_object segment; segment.create("/myshmem", 20000); MyAlloc nodesAlloc(segment.get_segment_manager()); std::less<const int> comparator; MyMap *table = segment.construct<MyMap>("table")(comparator, nodesAlloc); MyPair myPair1(1, new ShmNode(1,2)); MyPair myPair2(2, new ShmNode(3,4)); MyPair myPair3(3, new ShmNode(5,6)); table->insert(myPair3); table->insert(myPair1); table->insert(myPair2); return 0; } -------------------------------------------------- Proc#2 -------------------------------------------------- /* same includes */ /* same typedefs */ int main() { boost::shmem::named_shared_object segment; segment.open("/myshmem"); MyMap *table = segment.find<MyMap>("table").first; std::cout << "table size: " << table->size() << std::endl; MyMap::iterator iter; for (iter = table->begin(); ; iter++) { if (iter == table->end()) break; std::cout << iter->second->getA() << " " << iter->second->getB() << std::endl; } return 0; } -------------------------------------------------- The problem once again: in proc#2, iter->second->getA() and iter->second->getB() return 0. If I put the same loop into proc#1, the correct values are returned. As a further hint, the size of the map object in proc#2 is returned correctly (=3). What am I doing wrong? Regards, Szilard

3 3

[format] bind_arg with empty string
by Edson Tadeu 01 Aug '06

01 Aug '06

Boost.format bind_arg with an empty string is not working for Boost 1.33.1(it used to work in 1.32). The offending code is this one: format f("%s%-.32s:%|40t|%|.6|%|54t|%25s\n"); f.bind_arg(1,""); It crashes because of a null pointer in a buffer (buf_).

2 1

boost unit test compilation problem
by Minkoo Seo 01 Aug '06

01 Aug '06

Hi list. I'm trying to compile and run simple unit test, but only to fail: #include <boost/test/unit_test.hpp> using namespace std; using namespace boost::unit_test; using namespace boost; void force_division_by_zero() { BOOST_CHECKPOINT("About to force division by zero!"); int i = 1, j = 0; i = i / j; } test_suite* init_unit_test_suite(int, char*) { test_suite* test = BOOST_TEST_SUITE("Unit test example2"); test->add(BOOST_TEST_CASE(&force_division_by_zero), 1); return test; } This does not compile though this is the program shown in the document. The errors are: /usr/lib/gcc/x86_64-redhat-linux/4.0.2/../../../../lib64/crt1.o (.text+0x20): In function `_start': : undefined reference to `main' /tmp/ccytTZBu.o(.text+0x8f): In function `force_division_by_zero()': backoff_ngram_lm_test.cpp: undefined reference to `boost::test_tools::tt_detail::check_impl(boost::test_tools:: predicate_result const&, boost::basic_wrap_stringstream<char>&, boost::unit_test::basic_cstring<char const>, unsigned long, boost::test_tools::tt_detail::tool_level, boost::test_tools::tt_detail::check_type, unsigned long, ...)' /tmp/ccytTZBu.o(.text+0x173): In function `init_unit_test_suite(int, char*)': backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::test_suite::test_suite(boost::unit_test:: basic_cstring<char const>)' /tmp/ccytTZBu.o(.text+0x1e8):backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::test_suite::add(boost::unit_test::test_unit*, unsigned long, unsigned int)' /tmp/ccytTZBu.o(.gnu.linkonce.t._ZN5boost9unit_test14make_test_case ERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstringIKcEE [boost::unit_test::make_test_case(boost::unit_test::callback0 <boost::unit_test::ut_detail::unused> const&, boost::unit_test::basic_cstring<char const>)]+0x35): In function `boost::unit_test::make_test_case(boost::unit_test::callback0 <boost::unit_test::ut_detail::unused> const&, boost::unit_test::basic_cstring<char const>)': backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::ut_detail::normalize_test_case_name(boost:: unit_test::basic_cstring<char const>)' /tmp/ccytTZBu.o(.gnu.linkonce.t._ZN5boost9unit_test14make_test_ caseERKNS0_9callback0INS0_9ut_detail6unusedEEENS0_13basic_cstring IKcEE[boost::unit_test::make_test_case(boost::unit_test::callback0 <boost::unit_test::ut_detail::unused> const&, boost::unit_test::basic_cstring<char const>)]+0x65):backoff_ngram_lm_test.cpp: undefined reference to `boost::unit_test::test_case::test_case(boost::unit_test::basic_ cstring<char const>, boost::unit_test::callback0<boost::unit_test::ut_detail:: unused> const&)' collect2: ld returned 1 exit status I'm compiling the sorce like g++ filename.cpp. My environments: $ g++ -v Using built-in specs. Target: x86_64-redhat-linux Configured with: ../configure --prefix=/usr --mandir=/usr/share/man --infodir=/usr/share/info --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --disable-libunwind-exceptions --enable-libgcj-multifile --enable-languages=c,c++,objc,java,f95,ada --enable-java-awt=gtk --with-java-home=/usr/lib/jvm/java-1.4.2-gcj-1.4.2.0/jre --host=x86_64- redhat-linux Thread model: posix gcc version 4.0.2 20051125 (Red Hat 4.0.2-8) Any idea? Sincerely, Minkoo Seo

4 6

[regex] Thread safety patch.
by John Maddock 01 Aug '06

01 Aug '06

With apologies to all concerned, and thanks to Aleksey Sanin for tracking down the problem, there is a const-correctness bug in Boost.Regex-1.33.x that strikes only in multithreaded programs on Unix platforms, if: * Multiple threads construct regexes concurrently, or * Multiple threads perform search and replace operations concurrently. There are two possible fixes: * Apply the attached patch (this has just gone into cvs along with an updated test case that detects the issue). Or, * define BOOST_REGEX_USE_C_LOCALE in boost/user.hpp and rebuild everything. Regards, John Maddock.

2 2

boost::threads
by Noel Yap 01 Aug '06

01 Aug '06

I was just wondering what the status of boost::threads is. It looks like it hasn't been released since last year. Is there an ETA for the next release? Thanks, Noel

1 0

Re: [Boost-users] (de)serializing map<const A*>
by Cheok Yan Cheng 01 Aug '06

01 Aug '06

Hmmm - I think the map size is already saved to disk. If you just copy the current templated implementation for map loading and instantiate a specialized version for your case, I would think that would handle the job. Robert Ramey ------------------------------------------------------- I am sorry. However, I do not quite understand. Let me more specific to my case. I have a data structure: map<const FiducialPair *, vector<RectPair> > fiducialPairSearchRegionMap; Both FiducialPair and RectPair can be serialized with boost no problem. I try to serialize the whole map by void save(Archive & ar, const unsigned int version) const { ar & fiducialPairSearchRegionMap; } void load(Archive & ar, const unsigned int version) { ar & fiducialPairSearchRegionMap; } I would get the following error: C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(487): error C2440: 'reinterpret_cast' : cannot convert from 'typef *__w64 ' to 'void ** ' C:\Boost\include\boost-1_33_1\boost\archive\detail\iserializer.hpp(493): error C2664: 'T *boost::archive::detail::load_pointer_type<Archive,Tptr>::pointer_tweak<const FiducialPair>(const boost::serialization::extended_type_info &,void *,T &)' : cannot convert parameter 2 from 'typef ' to 'void *' with [ T=const FiducialPair, Archive=boost::archive::text_iarchive, Tptr=typef ] Conversion loses qualifiers May I know how I can apply ur suggested solution to my case? Thank you. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

bjam issues
by Daniel Krügler 01 Aug '06

01 Aug '06

Hello! Regrettably my posting "Labeling patched Boost versions" from 2006-07-21 got no response :-(( - so I would like to manipulate the boost bjam on my own to reach the effect that the build libraries will have a fixed character sequence suffix (aka "build id") but I got lost, when I tried this. My assumption was that I only need to modify Jamfile.v2 in the root directory where I found the promising rules beginning with line 92: # This rule is called by Boost.Build to determine the name of # target. We use it to encode build variant, compiler name and # boost version in the target name rule tag ( name : type ? : property-set ) { if $(type) in STATIC_LIB SHARED_LIB IMPORT_LIB { if $(layout) = versioned { name = [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set) ] ; local version-tag = [ MATCH "^([^.]+)[.]([^.]+)" : $(BOOST_VERSION[1]) ] ; version-tag = $(version-tag:J="_") ; # On NT, library with version suffix won't be recognized # by linkers. On CYGWIN, we get strage duplicate symbol # errors when library is generated with version suffix. # On OSX, version suffix is not needed -- the linker expets # libFoo.1.2.3.dylib format. # AIX linkers don't accept version suffixes either. if [ $(property-set).get <os> ] in NT CYGWIN MACOSX AIX { return $(name:B)-$(version-tag)$(name:S) ; } else { return $(name:B)-$(version-tag)$(name:S).$(BOOST_VERSION) ; } } else { return [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set) ] ; } } } Naively I just tried to add a fixed string to the returned name, e.g. # This rule is called by Boost.Build to determine the name of # target. We use it to encode build variant, compiler name and # boost version in the target name rule tag ( name : type ? : property-set ) { if $(type) in STATIC_LIB SHARED_LIB IMPORT_LIB { if $(layout) = versioned { name = [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set) ] ; local version-tag = [ MATCH "^([^.]+)[.]([^.]+)" : $(BOOST_VERSION[1]) ] ; version-tag = $(version-tag:J="_") ; # On NT, library with version suffix won't be recognized # by linkers. On CYGWIN, we get strage duplicate symbol # errors when library is generated with version suffix. # On OSX, version suffix is not needed -- the linker expets # libFoo.1.2.3.dylib format. # AIX linkers don't accept version suffixes either. if [ $(property-set).get <os> ] in NT CYGWIN MACOSX AIX { return $(name:B)-$(version-tag)$(name:S)."A" ; } else { return $(name:B)-$(version-tag)$(name:S).$(BOOST_VERSION)."B" ; } } else { return [ stage.add-variant-and-compiler $(name) : $(type) : $(property-set)."C" ] ; } } } but that did not influence the resulting names of a new bjam build at all. Could someone please help a dump bjam beginner to reach the wanted effect, e.g. to attach a given fixed string constant like "M20060801" to all created libraries?? Thank you very much for your patience, Daniel Krügler

2 1

Re: [Boost-users] [multi_index] illegal indirection compile error
by JOAQUIN LOPEZ MU?Z 01 Aug '06

01 Aug '06

----- Mensaje original ----- De: Themistoklis Bourdenas <themis(a)ics.forth.gr> Fecha: Lunes, Julio 31, 2006 4:47 pm Asunto: [Boost-users] [multi_index] illegal indirection compile error > Could you help me understand what I'm doing wrong in the code > below? I'm > trying to setup a multi_index structure of class B. > > class A > { > const std::string& ID(void) const; > ... > }; > > class B : public A > { > ... > }; > > typedef boost::multi_index::multi_index_container< > B*, > boost::multi_index::indexed_by< > boost::multi_index::ordered_unique< > boost::multi_index::const_mem_fun<A, const > std::string&, &A::ID> > > > > > > BSet; > > However when I compile VS2005 returns me an "illegal indirection" > compile error. Any thoughts? Hello Themistoklis, You've found a limitation in Boost.MultiIndex (as of Boost 1.33.1) by which one cannot specifiy a key in a given base class and pass derived classes as elements. This is solved in what will become Boost 1.34, please read bullet 3 of Boost.MultiIndex release notes at: http://boost- consulting.com/boost/libs/multi_index/doc/release_notes.html#boost_1_34 Until this release is out, you can use the following workarond: simply define a custom key extractor like this (warning, I haven't compiled it, beware typos): struct pB_ID_extractor { typedef std::string result_type; const std::string& operator()(const B* pb)const { return pb->ID(); } }; typedef boost::multi_index::multi_index_container< B*, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< pB_ID_extractor > > > BSet; Does this help? Thank you for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

[boost ::threads] Different behaviour between packaged and compiled version.
by Thierry Dumont 01 Aug '06

01 Aug '06

My code (a very small piece of code) uses boost:threads; It performs perfectly with the Debian Sarge version of boost,but segfaults with the version I installed myself (using bjam "-sTOOLS=gcc"). The Boost version I installed is: 1_33_1; Debian Sarge version is 1_32_06. I tried to runs the tests from inside the compiled 1_33_1 version: it works perfectly; but when I copy, say tennis.cpp, in an other directory, and compile and link it with version 1_33_1 (the one I compiled), it segfaults. I think it's only a question of compiler options. ->My options (which makes the program crash): -DBOOST_HAS_THREADS -DBOOST_HAS_PTHREADS -D_REENTRANT What is false? This works with Debian installed version. ->what are the options used by bjam when compiling the tests? I need a personnal version of boost (not the debian one) because I want to use the property tree library... yours t.d. -- Thierry Dumont. Institut Camille Jordan -- Mathematiques-- Univ. Lyon I,43 Bd du 11 Novembre 1918, 69622 - Villeurbanne Cedex - France. Thierry.Dumont(a)maply.univ-lyon1.fr web: http://maply.univ-lyon1.fr/~tdumont

3 3

in_edges inconsitency
by Louis Lavery 01 Aug '06

01 Aug '06

p219 of the BGL book says that in_edges(...) is available for bidirectional graphs but that in_degree(...) is not. Shouldn't both or neither be available? Louis.

2 1

boost.program_options gives ./first: free(): invalid pointer with g++ 4.0.3 and 4.1.0
by William Lederer 01 Aug '06

01 Aug '06

In compiling and testing the 'first.cpp' program from the example directory of the program_options directory, the program fails with the message: *** glibc detected *** ./first: free(): invalid pointer: 0x00000000005104e8 *** I built g++ version 4.1.0 and received the same result. The hardware is AMD opteron 64 bit, the OS is Linux fedora core 4. I had upgraded the compiler earlier to 4.0.3, and all other compiles/execution work fine and also tried 4.1.0 gcc. Nonetheless, I cannot shake the notion that this might be related to the compiler. Are there any ideas regarding what I might try next? Thanks -- William Lederer <wgl(a)ciexinc.com> CIEX, Incorporated

2 1

Re: [Boost-users] performance of template expression
by Sohail Somani 01 Aug '06

01 Aug '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > divyank shukla > Sent: Monday, July 31, 2006 8:06 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] performance of template expression > > snip.... > > My question is does the performance penalty still > exist with g++(4.1) compilers as against boost::lambda > functions. Where are your performance results (hard numbers)? Have you measured them as compared to the rest of your algorithm? For example, if you do the general QR decomposition, chances are that's going to be the slow part. One should usually profile after coding, rather than optimizing prematurely. Generally it's the algorithm that is slow.

2 1

TR: [Serialisation] error with xml_iarchive
by Bruno Poinas 31 Jul '06

31 Jul '06

Hello, I just recently began using the boost library, I want to write and read string to serialized objects with the function 'xml_oarchive' and 'xml_iarchive'. When I execute this code (with visual c++.net v. 7.1) : std::ofstream ofs("C:\\Save.xml"); const wchar_t * ptr; ptr=m_strEdit.GetBuffer(); assert(ofs.good()); boost::archive::xml_oarchive oa(ofs); oa.save(ptr); wchar_t str[512]; std::ifstream ifs("C:\\Save.xml"); boost::archive::xml_iarchive ia(ifs,0); ia.load(str); ifs.close(); the programm failed : Thanks and regards, Bruno POINAS ActiCM S.A. 122, rue du Rocher de Lorzier - Centr'Alp - 38430 - MOIRANS

2 1

[multi_index] illegal indirection compile error
by Themistoklis Bourdenas 31 Jul '06

31 Jul '06

Could you help me understand what I'm doing wrong in the code below? I'm trying to setup a multi_index structure of class B. class A { const std::string& ID(void) const; ... }; class B : public A { ... }; typedef boost::multi_index::multi_index_container< B*, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< boost::multi_index::const_mem_fun<A, const std::string&, &A::ID> > > > BSet; However when I compile VS2005 returns me an "illegal indirection" compile error. Any thoughts? Thanks

2 1

Implementing copy_if using boost::lambda
by Minkoo Seo 31 Jul '06

31 Jul '06

Hi list. I'm trying to implment copy_if using boost::lambda: #include <iostream> #include <string> #include <vector> #include <algorithm> #include <iterator> #include <map> #include <boost/lambda/lambda.hpp> #include <boost/lambda/if.hpp> #include <boost/format.hpp> #include <boost/lambda/bind.hpp> #include <boost/lambda/algorithm.hpp> using namespace std; using namespace boost::lambda; int main() { vector<int> vi; vi.push_back(1); vi.push_back(2); vi.push_back(3); vi.push_back(4); vi.push_back(5); vector<int> vi2; for_each(vi.begin(), vi.end(), if_then(_1 == 1, vi2.push_back(_1))); return EXIT_SUCCESS; } This fails with the errors: lambda_test.cpp: In function 'int main()': lambda_test.cpp:30: error: no matching function for call to 'std::vector<int, std::allocator<int> >::push_back(const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >&)' /usr/lib/gcc/x86_64-redhat-linux/4.0.2/../../../../include/c++ ]/4.0.2/bits/stl_vector.h:602: note: candidates are: void std::vector<_Tp, _Alloc>::push_back(const _Tp&) [with _Tp = int, _Alloc = std::allocator<int>] Does anybody know how to push _1 into vi2? I've tried bind( ), but no luck. Sincerely, Minkoo Seo

2 1

boost::bind question
by Surya Kiran Gullapalli 31 Jul '06

31 Jul '06

Hi, I've a std::map with the following structure. std::map < int, tuple<std::string, std::string> > mapTuple ; typedef map < int, tuple<string, string> > mapTuple ; Now i've say 10 elements in this container. Now i'd like to iterate thru this container and find a specific element which matches a certain criteria. Right now I'm doing this. MapIntTuple::iterator iter ; for (iter = mymap.begin(); iter != mymap.end(); ++iter) { if (iter->second.get<0>() == current_field) break ; } I'd like to iterate thru the container and find the element whose first string in the tuple matches with my search string. How can i do this using boost::lamdba::bind and std::find_if. May be that will help me in understanding boost::bind better. iter = find_if (mymap.begin(), mymap.end(), ???) ; Thanks in advance, Surya

1 0

g++ warning: comparing floating point with == or != is unsafe
by cybernet＠interia.pl 31 Jul '06

31 Jul '06

In: /usr/include/boost/test/floating_point_comparison.hpp inside: template<typename FPT> inline FPT safe_fpt_division( FPT f1, FPT f2 ){ the warning is cause by the code: // Avoid underflow. if( f1 == static_cast<FPT>(0) || f2 > static_cast<FPT>(1) && f1 < f2 * (std::numeric_limits<FPT>::min)() ) return static_cast<FPT>(0); Could someone modify the code to allow it to compile without warnings on g++? Latest CVS version still has this problem. I'm too dumb to think of a reasonable patch to submit - sorry. ---------------------------------------------------------------------- PS. Fajny portal... >>> http://link.interia.pl/f196a

4 4

FW: BOOST_CHECK vs. BOST_CHECK_EQUAL, checking equality of wchar_ts
by Tan Zhi 31 Jul '06

31 Jul '06

According to the document, BOOST_CHECK is the same as BOST_CHECK_EQUAL. However,I found an exception. Which is listed below, where m_mmf.SetLngGetString(1033, 1) returns a const wchar_t* type. Interestingly, the first two tests fail, while the last two pass. BOOST_CHECK(L"A" == m_mmf.SetLngGetString(1033, 1)); BOOST_CHECK(m_mmf.SetLngGetString(1033, 1) == L"A" ); BOOST_CHECK_EQUAL(L"A", m_mmf.SetLngGetString(1033, 1)); BOOST_CHECK_EQUAL(m_mmf.SetLngGetString(1033, 1), L"A"); Can any one please help to explain it? Thanks

3 4

Problems Building Boost 1.33.1 on Ubuntu 5.10 x86 From Scratch
by kfjethro 30 Jul '06

30 Jul '06

I know that there are probably packages available for this platform but for several reasons I need to build Boost 1.33.1 from scratch. I have no problems with compiliing from scratch on Ubuntu 6.06. After unpacking the source files and placing the precompiled bjam executable in the boost source directory, I run the following: cd ./boost_1_33_1 ./bjam -sTOOLS=gcc –-prefix=/usr/local/boost-1.33.1 install My /usr/local/boost-1.33.1 is owned by me and writeable. Any suggestions ? Thanks. The truncated bjam output is : Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). --------------------------------------------------------------------- *** If you don't need Boost.Python, you can ignore this section *** *** pass --without-python to suppress this message in the future *** skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "/usr/include/python2.4" You can configure the location of your python installation by setting: PYTHON_VERSION - The 2-part python Major.Minor version number (e.g. "2.2", NOT "2.2.1") - currently "2.4" PYTHON_ROOT - currently "/usr" The following are automatically configured from PYTHON_ROOT if not otherwise set: PYTHON_LIB_PATH - path to Python library object; currently "/usr/lib/python2.4/config" PYTHON_INCLUDES - path to Python #include directories; currently "/usr/include/python2.4" --------------------------------------------------------------------- Jamfile:278: in load-jamfiles *** argument error * rule stage ( name : sources + : requirements * : local-build * ) * called with: ( : /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/cwchar /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/csignal /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/climits /home/lawrence/boost_1_33_1/boost/compatibility/cpp_c_headers/cfloat /home/lawrence/boost_1_33_1/b <<<< middle truncated >>>>>> r_traits.hpp /home/lawrence/boost_1_33_1/boost/pending/bucket_sorter.hpp /home/lawrence/boost_1_33_1/boost/pending/fibonacci_heap.hpp /home/lawrence/boost_1_33_1/boost/pending/iterator_tests.hpp /home/lawrence/boost_1_33_1/boost/pending/detail/int_iterator.hpp /home/lawrence/boost_1_33_1/boost/pending/detail/property.hpp /home/lawrence/boost_1_33_1/boost/pending/detail/disjoint_sets.hpp : <locate>/usr/local <tree-subdirs>/home/lawrence/boost_1_33_1 <target>install : ) * missing argument name /home/lawrence/boost_1_33_1/tools/build/v1/boost-base.jam:2330:see definition of rule 'stage' being called /home/lawrence/boost_1_33_1/tools/build/v1/bootstrap.jam:21: in boost-build /home/lawrence/boost_1_33_1/boost-build.jam:16: in module scope

3 3

basic_string literals
by Johan Råde 30 Jul '06

30 Jul '06

Does Boost offer any facility for declaring basic_string literals in templates, i.e. something like basic_string<CharType> s = BOOST_STRING("foo"); Thank you, Johan Råde

4 6

Re: [Boost-users] g++ warning: comparing floating point with == or!= is unsafe
by Nat Goodspeed 30 Jul '06

30 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of David Abrahams > Sent: Saturday, July 29, 2006 5:15 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] g++ warning: comparing floating point with == > or!= is unsafe > > > the warning is cause by the code: > > > > // Avoid underflow. > > if( f1 == static_cast<FPT>(0) || > > f2 > static_cast<FPT>(1) && f1 < f2 * > > (std::numeric_limits<FPT>::min)() ) > > return static_cast<FPT>(0); > > > > Could someone modify the code to allow it to compile without warnings on > > g++? > > Try replacing > > f1 == static_cast<FPT>(0) > > with > > f1 [Nat] Maybe (! f1) instead?

1 0

boost::bind question / bug(?)
by Michael Nicolella 30 Jul '06

30 Jul '06

Having trouble compiling this code. Only tested in VC8: Removing 'const' from only the static class function seems to allow it to compile. Below is the error messages... #include <boost/bind.hpp> #include <boost/function.hpp> struct A { static void foo( const int ) { } }; void bar( const int ) { } int main() { boost::bind( &A::foo, _1 ) ; boost::bind( &bar, _1 ) ; } ------------- 1>------ Rebuild All started: Project: test_vc8, Configuration: Debug Win32 ------ 1>Deleting intermediate and output files for project 'test_vc8', configuration 'Debug|Win32' 1>Compiling... 1>main6.cpp 1>c:\projects\test_vc8\test_vc8\main6.cpp(17) : error C2665: 'boost::bind' : none of the 2 overloads could convert all the argument types 1> c:\projects\boost\boost\bind.hpp(1400): could be 'boost::_bi::bind_t<R,F,L> boost::bind<void(*)(int),boost::arg<I>>(F,A1)' 1> with 1> [ 1> R=boost::_bi::unspecified, 1> F=void (*)(int), 1> L=boost::_bi::list1<boost::arg<1>>, 1> I=1, 1> A1=boost::arg<1> 1> ] 1> c:\projects\boost\boost\bind\bind_cc.hpp(26): or 'boost::_bi::bind_t<R,F,L> boost::bind<void,int,boost::arg<I>>(R (*)(B1),A1)' 1> with 1> [ 1> R=void, 1> F=void (*)(int), 1> L=boost::_bi::list1<boost::arg<1>>, 1> I=1, 1> B1=int, 1> A1=boost::arg<1> 1> ] 1> while trying to match the argument list '(void (*)(const int), boost::arg<I>)' 1> with 1> [ 1> I=1 1> ] 1>Build log was saved at "file://c:\projects\test_vc8\test_vc8\Debug\BuildLog.htm" 1>test_vc8 - 1 error(s), 0 warning(s) ========== Rebuild All: 0 succeeded, 1 failed, 0 skipped ==========

3 2

seeking a better way of regex replacing!
by llwaeva＠21cn.com 30 Jul '06

30 Jul '06

Hi there, boost:regex is powerful in string replacing. I am working with a complicate case which need a faster method in replacing substring. Here is my problem. I have a big string contains some pattern %K{xxx}, where xxx is a filename which may vary from place to place. e.g. BIG_STRING = ... ... %K{abc.txt} ... ... ... ... %K{foo.ini} ... ... OK, what complicated is that: I must retrieve the filename from %K{xxx}, load the content of the file and then replace %K{xxx} with the content. I search the code with a loop string::const_iterator start, end; string filename, content; boost::regex re("%K\\{(.*)\\}"); boost::match_results<std::string::const_iterator> what; boost::match_flag_type flags = boost::match_default; start = BIG_STRING.begin(); end = BIG_STRING.end(); while ( regex_search(start, end, what, re, flags) ) { if (what[1].first!=what[1].second) { filename = string(what[1].first, what[1].second); } content = LoadFile(filename); // transform the const_iterator to iterator string::iterator sbegin(BIG_STRING.begin()), send(BIG_STRING.begin()); std::advance(sbegin, distance<string::const_iterator>(sbegin, what[0].first)); std::advance(send, distance<string::const_iterator>(send, what[0].second)); // replace the content BIG_STRING.replace( sbegin, send, content ); // reset the current position of the source string to search the next pattern start = what[1].second; // I copy the code from the document of boost, don't know what the following code for flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } The second approach is to retrieve the filename and load the content seperately, build the substitute format and replace all the patterns with replace_all_regex, e.g. string& escape_format( string& input ) { replace_all( input, "$", "$$" ); replace_all( input, "\\", "\\\\" ); replace_all( input, ":", "\\:" ); replace_all( input, "?", "\\?" ); replace_all( input, "(", "\$" ); replace_all( input, ")", "\$" ); return input; } stringstream reformat; string regex_text; int n=0; while ( regex_search(start, end, what, re, flags) ) { if (what[1].first!=what[1].second) { filename = string(what[1].first, what[1].second); } content = LoadFile(filename); regex_text += string(what[0].first, what[0].second); reformat << "(?" << ++n << " " << escape_format( content ) << ")"; // reset the current position of the source string to search the next pattern start = what[1].second; // I copy the code from the document of boost, don't know what the following code for flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } // replace the whole string at last replace_all_regex( BIG_STRING, boost::regex(regex_text), reformat.str(), format_all ); But this approach cause exception!!! Any better idea for my problem? Thanks in advance.

2 1

BOOST_CHECK problem!
by 袁晓辉 30 Jul '06

30 Jul '06

The doc says "It(BOOST_CHECK) also increments an error count<http://www.boost.org/libs/test/doc/components/minimal_testing/index.html>", but it seems not: #include <boost/test/included/unit_test_framework.hpp> using boost::unit_test::test_suite; void test1() { BOOST_CHECK(false); } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Unit test ); test->add( BOOST_TEST_CASE( &test1), 1); return test; } Output: ----------------------------------------------------- Running 1 test case... xxx.cpp(171): error in "test1": check false failed *** No errors detected ----------------------------------------------------- ps. I am using boost-1_33_1.

2 4

replace_all_regex help
by llwaeva＠21cn.com 30 Jul '06

30 Jul '06

Hi there, I wrote a piece of code to handle MIME header based on boost. The program subsitite the MIME header (from, to, subject, etc.) into a template with specific macro. Because the macro may occur everywhere in the template once or more, so I apply replace_all_regex. First of all, I need to transform the substitute string to escape special characters // input is a substitute string that will replace the macro string& escape_format( string& input ) { replace_all( input, "$", "$$" ); replace_all( input, "\\", "\\\\" ); replace_all( input, ":", "\\:" ); replace_all( input, "?", "\\?" ); replace_all( input, "(", "\$" ); replace_all( input, ")", "\$" ); return input; } There are some macros definied, some of them are listed below %s represents the subject (e.g. Re: hi philip!) %S represents the subject without prefix "Re:" (e.g hi philip!) %f represents the "form" (e.g. tom(a)hotmail.com) %t represents the "to" (e.g. philip(a)hotmail.com) ... With regex, I can replace all the macros with the help of format, something like replace_all_regex( source, boost::regex("(%f)|(%t)|(%s)|(%S)"), "(?1 xxx)(?2 yyy)(?3 aaa)(?4 bbb)", format_all ); In order to get the subject without prefix "Re:", I use erase_regex as follow string& deRe(string& input) { boost::regex regexp("^[[:space:]]*Re:[[:space:]]*"); erase_regex( input, regexp ); return input; } So simple!!! However, the order and number of macro will be changed sometimes. So I need a better way to build regex and format. I've got a function to do that // rformat is a stringstream for building a format // text is a substitute string // re_text is a string for building a regular expression // re is a string or regular expression, i.e. the macro // format_num is an global integer to hold the current number of format items (initialize to zero) void format_text(stringstream& rformat, string& text, string& re_text, const string& re) { format_num++; rformat << "(?" << format_num << " " << escape_format(text) << ")"; if (format_num>1) re_text += "|"; re_text += "(" + re + ")"; } Now, it's ready to build the regular expression and subsitiude formation dynamically. Here is an example, string regex_text; stringstream reformat; string source; // source is a string containing text and macros // spHeader is char* which is obtained from MIME parser. // if (spHeader) { format_text( reformat, string(spHeader), regex_text, "%s" ); // for %s format_text( reformat, deRe(string(spHeader)), regex_text, "%S" ); // for %S // Suppose spHeader is "Re: hi philp!", then // regex_text = "(%s)|(%S)" // reformat.str() = "(?1 Re: hi philip!)(?2 hi philip!)" replace_all_regex( source, boost::regex(regex_text), reformat.str(), format_all ); } Everything is fine except that there are some meaningless characters at the end of the output string (still source). By checking the code carefully, I found that the problem maybe caused by the format_text for %S. Hiding the second format_text solve the problem. However, just hiding the first format_text also solve the problem. It is confusing me! Someone please give me a direction. Thanks.

1 0

[Regex]Converting from old style to new style
by John Grabner 29 Jul '06

29 Jul '06

I used to be able to write this : void LineTracker::Analyse(const std::string &Buffer) { std::string::const_iterator start, end; start = Buffer.begin(); end = Buffer.end(); boost::regex_grep(std::bind1st(std::mem_fun(&LineTracker::grep_callback), this), start, end, expression); } to get the regex to call back into my class. With the change to the new style using iterator I can do this. void LineTracker::Analyse(const std::string &Buffer) { boost::sregex_iterator m1(Buffer.begin(), Buffer.end(), expression); boost::sregex_iterator m2; std::for_each(m1, m2, *this); } However for_each makes a copy of my class, so at the end it does not update the current instance with the results. What do I need to do to have the the current instance receive the call back from regex? John.

3 2

Re: [Boost-users] Problem with boost::multi_index
by JOAQUIN LOPEZ MU?Z 29 Jul '06

29 Jul '06

René ha escrito: > Joaquín ha escrito: > > * What happens if you fully qualify mem_fun, i.e. if > you write ::boost::multi_index::mem_fun? > > Well, when I tried this option it worked! > > It looks like gcc missed the "using boost::multi_index" > declaration. > > In order to gain experience: If you have any idea what > was the problem it will be appreciated. Not really :( Maybe the compiler gets confused by the presence of the template function std::mem_fun (does your "Item.h" explicitly or implicitly include <functional>?), but this is only a wild guess. In any case, this is a compiler bug, likely to solve if you upgrade your GCC copy. Sorry I can't give a more conclusive answer. > Thanks again. > > René Good luck with your project, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[mpl] Collapsing sequences of integer constants
by Eric Lemings 29 Jul '06

29 Jul '06

Greetings, I'm trying to come up with an algorithm that will "collapse" a sequence of integer constants by adding like elements together. For example, typedef vector_c< int, 1,1,1,3,5,5,7,10,10 > input; would become: typedef vector_c< int, 3, 3, 10, 7, 20 > result; You can assume the sequence is already sorted. Would appreciate any tips. Thanks, Eric.

2 1

Re: [Boost-users] Problem with boost::multi_index
by JOAQUIN LOPEZ MU?Z 28 Jul '06

28 Jul '06

Rene Tarantino wrote: > Hi : > > I'm just starting to use boost utility library and it > seems very promising. I am trying to define a new > multi_index type and gcc it's giving me error messages. > > First I properly added the includes for boost::multi_index : > > #include <boost/multi_index_container.hpp> > #include <boost/multi_index/mem_fun.hpp> > #include <boost/multi_index/hashed_index.hpp> > > then the includes for "Item" and "ObjectId" declarations: > > #include "Item.h" > > following that appears this: > > typedef multi_index_container< > Item*, > indexed_by< > hashed_unique<mem_fun<Item, ObjectId, &Item::getId> > > > > > ItemsContainer; > > When I try to compile this code gcc reports the following errors: > > error: 'mem_fun' was not declared in this scope > error: template argument 1 is invalid > error: type/value mismatch at argument 3 in template parameter > list for 'template<class Arg1, class Arg2, class Arg3, class Arg4> > struct boost::multi_index::hashed_unique' > error: expected a type, got '&emedia::lumiere::Item::getId' > error: template argument 1 is invalid > error: template argument 2 is invalid > error: expected unqualified-id before '>' token > > It seems that I'm forgetting something. It's very strange because > all ready compilled this code in another project but I can't find > any difference with this one. Hello René, I really can't reproduce the problem you describe. The attached file tries to mimic your scenario (with a dummy Item definition) and here everything works OK. Could you please try it in your environment? I guess the problem is not in what you describe, but in what you don't, I mean, sorrounding details that you're taking for granted. Things to check: * Are you using some using directive? Which one? * Are you doing some funny thing with the "mem_fun" identifier inside "Item.h"? * What happens if you fully qualify mem_fun, i.e. if you write ::boost::multi_index::mem_fun? I hope some of the above rings a bell for you. Please report back. Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Problem with boost::multi_index
by Rene Tarantino 28 Jul '06

28 Jul '06

Hi : I'm just starting to use boost utility library and it seems very promising. I am trying to define a new multi_index type and gcc it's giving me error messages. First I properly added the includes for boost::multi_index : #include <boost/multi_index_container.hpp> #include <boost/multi_index/mem_fun.hpp> #include <boost/multi_index/hashed_index.hpp> then the includes for "Item" and "ObjectId" declarations: #include "Item.h" following that appears this: typedef multi_index_container< Item*, indexed_by< hashed_unique<mem_fun<Item, ObjectId, &Item::getId> > > > ItemsContainer; When I try to compile this code gcc reports the following errors: error: 'mem_fun' was not declared in this scope error: template argument 1 is invalid error: type/value mismatch at argument 3 in template parameter list for 'template<class Arg1, class Arg2, class Arg3, class Arg4> struct boost::multi_index::hashed_unique' error: expected a type, got '&emedia::lumiere::Item::getId' error: template argument 1 is invalid error: template argument 2 is invalid error: expected unqualified-id before '>' token It seems that I'm forgetting something. It's very strange because I all ready compilled this code in another project but I can't find any difference with this one. Any idea. Thanks in advance. René

1 0

[license] Why is the Boost license not an official Open Source license?
by Stephen Toledo-Brown 28 Jul '06

28 Jul '06

I'm wondering why the Boost license is not listed at http://www.opensource.org/licenses/index.html (And is there any idea to submit it for inclusion there?)

7 10

Question about program_options
by Drumheller, Michael 28 Jul '06

28 Jul '06

Regarding boost::program_options: I would like to parse (and then store) some command-line options that potentially contain unregistered flags, and I understand from <<http://www.boost.org/doc/html/program_options/howto.html#id2716386>> that the way to do this is: basic_command_line_parser<char> parser(argc, argv); basic_parsed_options<char> parsed(parser.options(options).allow_unregistered().run()); Indeed this works--for parsing. But how do I store the resulting parsed options (in a way that ignores the unregistered ones)? Simply calling store(parsed, vm); throws a boost::program_options::unknown_option exception. I can take the (brute force) step of erasing from parsed.options all elements for which the unregistered attribute is true, and then calling store(parsed, vm). That seems to work, but it so clumsy that it makes me think I'm using the system in a way that was not intended. Can anyone help? Thank you. MD P.S. There is a bug in the doc: "collect_arguments(...)" on the last line of the above link should be collect_unrecognized(...); similarly, in the source code parsers.hpp (line 158) there is a mention of the nonexistent function "collect_unregistered"). Michael Drumheller Boeing Phantom Works Mathematics and Engineering Analysis 425.865.3520 michael.drumheller(a)boeing.com This email may contain proprietary information. If you are not the intended recipient please delete it and notify the sender that you received it in error.

1 1

(de)serializing map<const A*>
by Cheok Yan Cheng 28 Jul '06

28 Jul '06

By refering to message http://groups.google.com/group/boost-list/browse_frm/thread/79dba906901d039… I am also facing similar problem. I need to iterate through the content of map, and remove the constantness before deserialization. Due to this, I need to save the map size into disk as well. I know that there is no obvious fix for this. However, I was wondering whether is there any much better workaround? Thank you very much! yccheok

2 1

Re: [Boost-users] XML Serialization Traits Question
by William Bardon 28 Jul '06

28 Jul '06

Robert, I forced a crude solution by defining a custom XML output archive and defining My_Archive::save_override(const nvp<T>&, int) as below. This would double the class information in some objects, so I also set the BOOST_CLASS_IMPLEMENTATION to object_serializable for my serialized classes. It is crude, but seems to give me the results I need. class My_Archive : public boost::archive::xml_oarchive_impl<OArchive_Versioned> { ... template<class T> void save_override( #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif ::boost::serialization::nvp<T> & t, int) { save_start(t.name()); if (boost::serialization::implementation_level<T>::value >= boost::serialization::object_serializable) { write_attribute("version", boost::serialization::version<T>::value, "=\""); } boost::archive::save(* this->This(), t.const_value()); save_end(t.name()); } // redeclared fall thru versions of all specialized versions of save_override omitted for space }; By examining the library's source code, I have determined that the tracking of class traits in serialization occurs in basic_oarchive_impl::save_object, defined in basic_oarchive.cpp. It uses the class cobject_type to track classes it has seen. Because basic_archive_impl and cobject_type are completely defined within basic_archive.cpp, the ability to customize XML attributes is limited. Perhaps future versions of Serialization could look into making the XML optionally generate an XML schema for interoperation with other XML-based applications. Thanks, Bill -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey Sent: Wednesday, July 26, 2006 5:57 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] XML Serialization Traits Question I would have to go back and study the code again to give a good answer and I'm not up to this right now. But I can offer a suggestion in the short term. I use VC 7.1 debugger. Set a trap at save_override(const version ... When the program traps in the debugger. examine the stack trace to see the chain of overrides and specializations whch got you there. Robert Ramey William Bardon wrote: > Robert, > > Thanks for the example; it helped clear up some uncertainty about the > template arguments in the derived class. > > Regarding save_override, I see where specialized versions for the > different trait types are defined in basic_xml_oarchive.ipp. I also > see that save_override is called from the operator<< redefinition in > interface_oarchive.hpp. What I'm missing is the link between > serializing a user-defined class object and the traits of that object. > > template<class Archive> > BOOST_ARCHIVE_OR_WARCHIVE_DECL(void) > basic_xml_oarchive<Archive>::save_override(const version_type & t, > int) { > int i = t.t; // extra .t is for borland > write_attribute(VERSION(), i); > } > > This function already displays a version attribute in the XML. How do > I make sure this is called for every element? I'm sorry, but I can't > figure out how to modify chain of control to force output of class > traits. > > Starting in oserializer.hpp, boost::archive::save<Archive,T> calls > static save_non_pointer_type<Archive, T>::invoke calls serialize_adl > calls boost::serialization::serialize<Archive, T> calls > access::serialize calls myClass::serialize<Archive> (Archive& ar, > unsigned int version) > > There is also a function oserializer<Archive,T>::save_object_data that > calls serialize_adl, but I can't find anything that calls it. > > The struct save_non_pointer_type<Archive, T> in oserializer.hpp may be > the key, but I'm not sure how it works. > > In oserializer.hpp, struct > save_non_pointer_type<Archive,T>::save_standard::invoke calls > Archive::save_object, but I do not see an implementation of the > function anywhere: > > $ find /usr/include/boost -type f -exec grep -H save_object {} \;| > grep -v save_object_ | more > /usr/include/boost/archive/polymorphic_oarchive.hpp: virtual void > save_object( > /usr/include/boost/archive/detail/oserializer.hpp: > ar.save_object(& t, oserializer<Archive, T>::instantiate()); > /usr/include/boost/archive/detail/basic_oarchive.hpp: void > save_object( > /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: > virtual void save_object( > /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: > ArchiveImplementation::save_object(x, bos); > > I'd appreciate any suggestions. Am I even looking in the right place? > > Thanks in advance, > Bill > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey > Sent: Wednesday, July 26, 2006 12:14 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] XML Serialization Traits Question > > > "William Bardon" <wbardon(a)cabcds.org> wrote in message > news:C73E689C9FCF884B9A550ECFADA0721C087D3E@exchange.cab-cds.org... > I have read both the Boost Serialization online documentation and the > archives of the Boost-Users mailing list looking for guidance, but I > haven't found anything relevant. I see how to use > BOOST_CLASS_TRACKING and BOOST_CLASS_IMPLEMENTATION to remove version > tracking attributes from the XML tags. > > Usage of these macros does a lot more than remove attributes from the > tags. > > I want to go in the opposite direction. I notice that the class_id > and version attributes only appear the first time an object of a > particular class is serialized. I want to force the version attribute > to appear in every object's attribute list. > > Do I need to derive a custom archive to do this? > > yes > > I have looked at the source code for serialization, but I have trouble > plowing through all of the macros, template expansions, and overloaded > functions to locate the specific part that controls whether class > traits are stored as attributes in a particular XML tag. > > I sympathize - its hard to follow. And I wrote it. Here are some > hints: > > a) look at demo_fast_archive.cpp to see a model of how one can derive > from an existing archive. > b) You'll want to derive from xml_oarchive_impl<...> to create > my_xml_oarchive > c) add a "save_override" function to my_xml_oarchive which replaces > the "save_override" function in > basic_xml_oarchive.ipp. Implement this using functions defined > basic_xml_oarchive.ipp > > Good luck - > > Robert Ramey > > > Thanks in advance, > Bill > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

regex problem in multithreading...
by yogendra karki 28 Jul '06

28 Jul '06

Hello all, i am using boost regex to check the syntax of a URL. the regex is as :- static const char *URLSYNTAXREGEX = "^((file|https?|ftp)://)?(([-a-zA-Z0-9_]+[.]{1})+(([-a-zA-Z0-9]+))([:]{1}([0-9]+)){0,1})([?/][^[:space:]]*)?" the function for evaluation is:- bool URLHandler::EvaluateRegex(const char *regularexp,std::string url){ boost::smatch what; boost::regex exp(regularexp,boost::regex::extended); boost::regex_search(url,what,exp); std::string search=(std::string)what[0]; if(search.length() == url.length()) { return true; } else { return false; } } when i am running this code with single thread it is running fine. But when i am integrating this code with a multithreaded application it is giving this error:- terminate called after throwing an instance of 'boost::regex_error' what(): Invalid content of repeat range Aborted Can you please help me in this. Its very urgent for me. Thanks. Yogendra --------------------------------- Do you Yahoo!? Everyone is raving about the all-new Yahoo! Mail Beta.

2 3

regular expression for random word wrap to multiple line
by Winson Yung 28 Jul '06

28 Jul '06

Hi all, I am not sure this is an old topic or not, but I cannot seem to find an answer for this. I have a table, because of the table column width restriction, some of the line in a table row/field gets wrapped around to second/third lines. Here is a simple illustrated the issue: sales and marketing (excludes stock-based compensation of $817, $369 and $113 for 2005, 2004 AND 2003, RESPECTIVELY) 74,823 36,000 21,162 As you can see the description txt gets break down into three lines. If I write something like this "^sales and marketing (excludes stock-based compensation of", it's not gonna capture the entire line that ended with numbers. The exact location where the line gets wrapped around is not known, so it's impossible to craft the regular expression like this beforehand. Is there a way to write *ONE* regular expression to handle this? /Winson.

2 3

Re: [Boost-users] default copy constructors
by Andrew McDonald 28 Jul '06

28 Jul '06

> I have a specific c++ question, and was wondering whether someone > could offer some advice. It is probably better to post such questions to comp.lang.c++ or comp.lang.c++.moderated > ie is it safe to assume that Test's copy constructor will call the > copy constructor of all the above attributes. >From the C++ standard ISO/IEC 14882:1998(E) Section 12.8.8; The implicitly defined copy constructor for class X performs a memberwise copy of its subobjects. The order of copying is the same as the order of initialization of bases and members in a user defined constructor (see 12.6.2). Each subobject is copied in the manner appropriate to its type: - if the subobject is of class type, the copy constructor for the class is used; - if the subobject is an array, each element is copied, in the manner appropriate to the element type; - if the subobject is of scalar type, the builtin assignment operator is used. Virtual base class subobjects shall be copied only once by the implicitly defined copy constructor (see 12.6.2). regards, Andrew McDonald System Architect Norwood Systems Australia Pty Ltd Level 1, 71 Troy Terrace PO Box 1281 Subiaco, WA 6904 Tel +61 8 9380 7766 Fax +61 8 9380 7733 The information in this email, and any attachments, may contain confidential information and is intended solely for the attention and use of the named addressee (s). It must not be disclosed to any person(s) without authorization. If you are not the intended recipient, or a person responsible for delivering it to the intended recipient, you are not authorized to, and must not, disclose, copy, distribute, or retain this message or any part of it. If you have received this communication in error, please notify the sender immediately.

2 1