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

[Test] Running individual test cases
by Sohail Somani 17 Jul '06

17 Jul '06

Hi, I recall a thread about running individual test cases by name. Might even have been yesterday. Anyway, I'd like to put in a "me too" vote for that and also ask what I can currently do to continue using the auto registration capability but perhaps modify it to only register certain functions? Would I need to create my own test suite? By the way, boost test has been really great to me so far, its been very useful while testing my latest project. Keep up the good work! Thanks, Sohail

2 1

[thread] Keeping leak detectors still...
by Daniel Krügler 17 Jul '06

17 Jul '06

Hello!, Its a well-known issue, that Boost-Thread users on Windows machines have observed that popular leak reporting tools loudly notify a missing delete for the dynamically allocated mutex in tss_hooks.cpp. A good overview for this discussion can be found in: http://groups.google.de/group/boost-list/browse_thread/thread/f5788746e458d… While I don't want to heat up the discussion whether this is actually a "leak" or not, many code style guides of companies give very bad points on such behaviour, so I would like to ask whether it is possible to ensure a proper clean-up of this by code (before the system does), to keep those detector programs quiet... Simple question of a non-expert: Couldn't one simply change the current impl of on_process_exit in tss_hooks.cpp to extern "C" BOOST_THREAD_DECL void on_process_exit(void) { { // Wrap into scope boost::call_once(init_threadmon_mutex, once_init_threadmon_mutex); boost::mutex::scoped_lock lock(*threadmon_mutex); BOOST_ASSERT(attached_thread_count == 0); //Free the tls slot if one was allocated. if (tls_key != invalid_tls_key) { TlsFree(tls_key); tls_key = invalid_tls_key; } } delete threadmon_mutex; // Shouldn't that be the last point of access?? threadmon_mutex = 0; // For those who prefer a defined value... } OK, I see that the docs for this function says: "Must not be omitted; may be called multiple times." Question is: Does there exist at least the guarantee, that there is always the same number of on_process_enter and on_process_exit calls? If yes: Wouldn't a simply reference counting scheme using one of the atomic integer incrementing/decrementing functions (also provided by boost via interlocked.hpp) allow a thread-save deletion of that mutex object? Thanks for your patience, Daniel Krügler

2 6

[filesystem] Is it a bug or not
by Ovanes Markarian 17 Jul '06

17 Jul '06

Hi! On my Windows computer I have cygwin installed and it created the following file names in directory c:\ %backup%~ .emacs .emacs~ .tcltcinfo.txt The last file was created by some cygwin app. Now if I try to iterate through this directory: for(fs::directory_iterator dir_itr( full_path ), end_iter; dir_itr != end_iter; ++dir_itr) { try { if(!fs::is_directory(*dir_itr)) { std::pair<std::string, std::string> file_name( fs::basename(dir_itr->leaf()), fs::extension(dir_itr->leaf()) ); std::cout << "fname: " << file_name.first << ", extension: " << file_name.second << std::endl; } } catch(std::exception const& ex ) { std::cout << dir_itr->leaf() << " " << ex.what() << std::endl; } } Exceptions are thrown: %backup%~ boost::filesystem::path: invalid name "%backup%~" in path: "%backup%~" .emacs boost::filesystem::path: invalid name ".emacs" in path: ".emacs" .emacs~ boost::filesystem::path: invalid name ".emacs~" in path: ".emacs~" .tcltcinfo.txt boost::filesystem::path: invalid name ".tcltcinfo.txt" in path: ".tcltcinfo.txt" I know that it is impossible to create these file manually, but software is allowed to do this. Therefore I don't think these exceptions are correct. With Kind Regards, Ovanes Markarian

2 1

bjam w/ minggc g++-3.4.5-20060117: undefined reference
by Jeffrey Chang 17 Jul '06

17 Jul '06

Hi, I'm building boost_1_33_1 on mingw win32 environment via: boost-jam-3.1.3-1-ntx86/bjam.exe -sTOOLS=mingw stage Everything goes fine and most libraries are built and run without problems, except for link-time errors of "undefined references" for the following functions: "boost::filesystem::detail::system_error_code()" "boost::filesystem::filesystem_error::~filesystem_error()" "boost::filesystem::filesystem_error::filesystem_error(...)" "vtable for boost::filesystem::filesystem_error" "boost::archive::ARCHIVE_VERSION()" "boost::archive::ARCHIVE_SIGNATURE()" "boost::signals::trackable::signal_connected(...)" It seems some of the object files doesn't get picked up while building their corresponding libraries; for example, ARCHIVE_VERSION() and ARCHIVE_SIGNATURE() are defined in libs/serialization/src/basic_archive.cpp file, which are compiled correctly into basic_archive.obj, yet somehow the bjam link process cannot find it while building the Serialization library. If I inline the definition of ARCHIVE_VERSION() and ARCHIVE_SIGNATURE() into its declaration header file of boost/archive/basic_archive.hpp, the the Serialization library is built without problem. This shows that I'm probably missing something for the above build command. Also, in my mingw win32 build output of stage/lib directory, the corresponding libraries with the above "undefined references" (libboost_filesystem-mgw-*, libboost_serialization-mgt-*, and libboost_signals-mgw-*) are generated as a result of the above bjam build command, even though mingw's ld.exe doesn't recognize these lib files. Is this a bug in bjam logic? Here's my mingw win32 environment: * MSYS-1.0.11-2004.04.30-1 * msysDTK-1.0.1 * binutils-2.16.91-20060119-1 * gcc-core-3.4.5-20060117-1 * gcc-g++-3.4.5-20060117-1 * w32api-3.7 * mingw-runtime-3.10 * mingw-utils-0.3 Attached is the excerpt of above undefined reference errors. I'm not familiar with bjam; it'd be great if someone can shed lights on what's wrong. (please cc me as I'm not subscribed to the list) ------------- begin: bjam build output ------------ FileClone stage\lib\boost_date_time-mgw-mt-d-1_33_1.lib gcc-Link-action bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.dll bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\boost_filesystem-mgw-d-1_33_1.lib bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj: In function `ZN5boost10filesystem6detail12dir_itr_initERNS_10shared_ptrINS1_11dir_itr_impEEERKNS0_4pathE':c:/e2e/win32/ref/boost/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::detail::system_error_code()' :c:/e2e/win32/ref/boost/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::filesystem_error(std::string const&, boost::filesystem::path const&, int)' :c:/e2e/win32/ref/boost/boost_1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::filesystem_error::~filesystem_error()' .... :c:/e2e/win32/ref/boost/boost_1_33_1/boost/iterator/iterator_facade.hpp:(.text$_ZN5boost10filesystem16filesys tem_errorC1ERKS1_[boost::filesystem::filesystem_error::filesystem_error(boost::filesystem::filesystem_error const&)]+0x4c): undefined reference to `vtable for boost::filesystem::filesystem_error' .... "g++" "-Wl,--enable-auto-image-base" "-Wl,--exclude-symbols,_bss_end__:_bss_start__:_data_end__:_data_start__" "-Wl,--out-implib,bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.lib" -mthreads -s -shared -Wl,--allow-multiple-definition -mno-cygwin -o "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.dll" -L"" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\exception.obj" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\operations_posix_windows.obj" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\path_posix_windows.obj" "bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\convenience.obj" ...failed gcc-Link-action bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.dll bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.lib... ...removing bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\release\threading-multi\boost_filesystem-mgw-mt-1_33_1.lib ...skipped <@boost!lib>boost_filesystem-mgw-mt-1_33_1.dll for lack of <@boost!libs!filesystem!build\boost_filesystem.dll\mingw\release\threading-multi>boost_filesystem-mgw-mt-1_33_1.dll... ...skipped <@boost!lib>boost_filesystem-mgw-mt-1_33_1.lib for lack of <@boost!libs!filesystem!build\boost_filesystem.dll\mingw\release\threading-multi>boost_filesystem-mgw-mt-1_33_1.lib... FileClone stage\lib\boost_program_options-mgw-d-1_33_1.lib FileClone stage\lib\boost_program_options-mgw-mt-d-1_33_1.lib FileClone stage\lib\boost_python-mgw-d-1_33_1.lib FileClone stage\lib\boost_python-mgw-mt-d-1_33_1.lib FileClone stage\lib\boost_python-mgw-1_33_1.lib FileClone stage\lib\boost_python-mgw-mt-1_33_1.lib FileClone stage\lib\boost_regex-mgw-d-1_33_1.lib FileClone stage\lib\boost_regex-mgw-mt-d-1_33_1.lib FileClone stage\lib\boost_regex-mgw-1_33_1.lib gcc-Link-action bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\boost_serialization-mgw-d-1_33_1.dll bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\boost_serialization-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\boost_serialization-mgw-d-1_33_1.lib bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\basic_iarchive.obj: In function `ZSt38__copy_backward_output_normal_iteratorIPN5boost7archive6detail19basic_iarchive_impl10cobject_idEN9__gnu_cxx17__normal_iteratorIS5_St6vectorIS4_SaIS4_EEEEET0_T_SD_SC_11__true_type':c:/e2e/win32/ref/boost/boost_1_33_1/libs/serialization/build/../src/basic_iarchive.cpp:(.text$_ZN5boost7archive6detail19basic_iarchive_implC1Ej[boost::archive::detail::basic_iarchive_impl::basic_iarchive_impl(unsigned int)]+0x52): undefined reference to `boost::archive::ARCHIVE_VERSION()' ..... ' bin\boost\libs\serialization\build\boost_serialization.dll\mingw\debug\binary_iarchive.obj: In function `ZN5boost7archive20binary_iarchive_implINS0_15binary_iarchiveEE13load_overrideINS0_13tracking_typeEEEvRT_i':c:/e2e/win32/ref/boost/boost_1_33_1/boost/archive/binary_iarchive.hpp:(.text$_ZN5boost7archive21basic_binary_iarchiveINS0_15binary_iarchiveEE4initEv[boost::archive::basic_binary_iarchive<boost::archive::binary_iarchive>::init()]+0x6e): undefined reference to `boost::archive::ARCHIVE_SIGNATURE()' ..... "g++" "-Wl,--enable-auto-image-base" "-Wl,--exclude-symbols,_bss_end__:_bss_start__:_data_end__:_data_start__" "-Wl,--out-implib,bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.lib" -mthreads -s -shared -Wl,--allow-multiple-definition -mno-cygwin -o "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.dll" -L"" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_archive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_archive_impl.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_iserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_oserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_pointer_iserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_pointer_oserializer.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_serializer_map.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_text_iprimitive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_text_oprimitive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\basic_xml_archive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\binary_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\binary_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\extended_type_info.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\extended_type_info_no_rtti.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\extended_type_info_typeid.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\polymorphic_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\polymorphic_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\stl_port.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\text_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\text_oarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\void_cast.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\xml_grammar.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\xml_iarchive.obj" "bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\xml_oarchive.obj" ...failed gcc-Link-action bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.dll bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.lib... ...removing bin\boost\libs\serialization\build\boost_serialization.dll\mingw\release\threading-multi\boost_serialization-mgw-mt-1_33_1.lib ...skipped <@boost!lib>boost_serialization-mgw-mt-1_33_1.dll for lack of <@boost!libs!serialization!build\boost_serialization.dll\mingw\release\threading-multi>boost_serialization-mgw-mt-1_33_1.dll... ...skipped <@boost!lib>boost_serialization-mgw-mt-1_33_1.lib for lack of <@boost!libs!serialization!build\boost_serialization.dll\mingw\release\threading-multi>boost_serialization-mgw-mt-1_33_1.lib... gcc-Link-action bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\boost_signals-mgw-d-1_33_1.dll bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\boost_signals-mgw-d-1_33_1.lib Creating library file: bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\boost_signals-mgw-d-1_33_1.lib bin\boost\libs\signals\build\boost_signals.dll\mingw\debug\slot.obj: In function `ZN5boost7signals6detail9slot_base17create_connectionEv':c:/e2e/win32/ref/boost/boost_1_33_1/libs/signals/build/../src/slot.cpp:47: undefined reference to `boost::signals::trackable::signal_connected(boost::signals::connection, boost::signals::detail::bound_object&) const' collect2: ld returned 1 exit status ...... ...failed gcc-Link-action bin\boost\libs\signals\build\boost_signals.dll\mingw\release\threading-multi\boost_signals-mgw-mt-1_33_1.dll bin\boost\libs\signals\build\boost_signals.dll\mingw\release\threading-multi\boost_signals-mgw-mt-1_33_1.lib... ...removing bin\boost\libs\signals\build\boost_signals.dll\mingw\release\threading-multi\boost_signals-mgw-mt-1_33_1.lib ...skipped <@boost!lib>boost_signals-mgw-mt-1_33_1.dll for lack of <@boost!libs!signals!build\boost_signals.dll\mingw\release\threading-multi>boost_signals-mgw-mt-1_33_1.dll... ...skipped <@boost!lib>boost_signals-mgw-mt-1_33_1.lib for lack of <@boost!libs!signals!build\boost_signals.dll\mingw\release\threading-multi>boost_signals-mgw-mt-1_33_1.lib... FileClone stage\lib\boost_thread-mgw-mt-d-1_33_1.lib HardLink stage\lib\boost_date_time-mgw-mt-d.lib ...skipped <@boost!lib>boost_filesystem-mgw-d.lib for lack of <@boost!lib>boost_filesystem-mgw-d-1_33_1.lib... ...skipped <@boost!lib>boost_filesystem-mgw-mt-d.lib for lack of <@boost!lib>boost_filesystem-mgw-mt-d-1_33_1.lib... ...skipped <@boost!lib>boost_filesystem-mgw.lib for lack of <@boost!lib>boost_filesystem-mgw-1_33_1.lib... ...skipped <@boost!lib>boost_filesystem-mgw-mt.lib for lack of <@boost!lib>boost_filesystem-mgw-mt-1_33_1.lib... HardLink stage\lib\boost_program_options-mgw-d.lib HardLink stage\lib\boost_program_options-mgw-mt-d.lib HardLink stage\lib\boost_python-mgw-d.lib HardLink stage\lib\boost_python-mgw-mt-d.lib HardLink stage\lib\boost_python-mgw.lib HardLink stage\lib\boost_python-mgw-mt.lib HardLink stage\lib\boost_regex-mgw-d.lib HardLink stage\lib\boost_regex-mgw-mt-d.lib HardLink stage\lib\boost_regex-mgw.lib ...skipped <@boost!lib>boost_serialization-mgw-d.lib for lack of <@boost!lib>boost_serialization-mgw-d-1_33_1.lib... ...skipped <@boost!lib>boost_serialization-mgw-mt-d.lib for lack of <@boost!lib>boost_serialization-mgw-mt-d-1_33_1.lib... ...skipped <@boost!lib>boost_serialization-mgw.lib for lack of <@boost!lib>boost_serialization-mgw-1_33_1.lib... ...skipped <@boost!lib>boost_serialization-mgw-mt.lib for lack of <@boost!lib>boost_serialization-mgw-mt-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw-d.lib for lack of <@boost!lib>boost_signals-mgw-d-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw-mt-d.lib for lack of <@boost!lib>boost_signals-mgw-mt-d-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw.lib for lack of <@boost!lib>boost_signals-mgw-1_33_1.lib... ...skipped <@boost!lib>boost_signals-mgw-mt.lib for lack of <@boost!lib>boost_signals-mgw-mt-1_33_1.lib... HardLink stage\lib\boost_thread-mgw-mt-d.lib ...failed updating 24 targets... ...skipped 36 targets... ...updated 22 targets... ------------- end: bjam build output ------------ Thanks, --- Jeffrey

1 0

asio and boost
by bringiton bringiton 17 Jul '06

17 Jul '06

I'm just wondering when the asio networking library will become part of the boost library. I read in the link below that the library has been accepted. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1974.html

2 2

Re: [Boost-users] [iterator] reverse_iterator from iterators thatreturn references to data in self.
by Seb Martel 17 Jul '06

17 Jul '06

"David Abrahams" <dave(a)boost-consulting.com> wrote in message news:<uwtafgdi0.fsf(a)boost-consulting.com>... > "Seb Martel" <smartel(a)real.com> writes: > > > Hello, > > > > given something like: > > > > class ProxyIterator > > : public boost::iterator_facade<ProxyIterator, Costly, boost::random_access_traversal_tag> > > { > > public: > > ProxyIterator(FactoryOfCostly* pF, int i ) : m_pFactory( pF ), m_index( i ) > > {} > > private: > > friend class boost::iterator_core_access; > > void decrement() {--m_index;} > > // ... and others > > > > Costly& dereference() const > > { > > m_value = m_pFactory->MakeCostlyAtIndex( m_index ); > > return m_value; > > } > > private: > > FactoryOfCostly* m_pFactory; > > int m_index; > > mutable Costly m_value; > > }; > > You might need to do something to prevent this from being reported as > a valid random access (or even forward) iterator. 24.1.3: > > --- If a and b are both dereferenceable, then a == b if and only if *a > and *b are the same object. > As in &(*a) == &(*b) ? That's just cruel. But then again, vector<bool> comes to mind... Which reminds me: Is http://boost.org/libs/iterator/doc/new-iter-concepts.html making any progress ? > > You could build a reverse_iterator like the one you propose by storing > the inner iterator within a boost::optional wrapper, and only > initializing it upon dereference. > I might just name it the DamnYou2413ReverseIterator. Tx! -seb

2 1

Macro to contruct/allocate a shared_ptr?
by bringiton bringiton 17 Jul '06

17 Jul '06

I'm trying to define a MACRO that creates a shared_ptr and hides memory allocation. Here is what i have so far: #define NEW0(T) boost::shared_ptr<T>(new T()); #define NEW1(T, p1) boost::shared_ptr<T>(new T(p1)); #define NEW2(T, p1, p2) boost::shared_ptr<T>(new T(p1, p2)); #define NEW3(T, p1, p2, p3) boost::shared_ptr<T>(new T(p1, p2, p3)); --------------------------------- Example of usage for the type Test: class Test { public: Test() {;} Test(int p1) {;} Test(int p1, char p2) {;} Test(int p1, char p2, std::string p3) {;} }; boost::shared_ptr<Test> p0 = NEW0(Test); boost::shared_ptr<Test> p1 = NEW1(Test, 100); boost::shared_ptr<Test> p2 = NEW2(Test, 100, 'a'); boost::shared_ptr<Test> p3 = NEW3(Test, 100, 'a', "hello"); --------------------------------- Is there a better way to do this? I would prefer to use a function instead of a MACRO. But I don't think it is possible because it is not know how many paramaters are in T's constructor. // not sure how to do this (or whether possible) // i am not sure how to implement the variable parameters // (hense the .. in my syntax) template <class T> boost::shared_ptr<T> New(...) { boost::shared_ptr<T> p(new T(...)); return p; } Any ideas? I often have problems with the c++ syntax when creating my own containers because i want to allocate T within the implementation (instead of passing pointers and having the user manage the memory).

6 13

Regex build problem using g++ under cygwin
by Nindi Singh 16 Jul '06

16 Jul '06

Hi Darren .... I had problems with Boost Python which i think which were similar to yours .... i managed to get around them .... take a look at the subject 'Boost Python not linking under Cygwin' posted 16 Jul 14:16 let me know if indeed it is the same problem .. and if the soltuion works for you N

1 0

Fw: [regex]How to get Content-Type's parameter pairs using boost.regex?
by Mockey Chen 16 Jul '06

16 Jul '06

Hi, experts, I using boost.regex parse the content-type header's value in MIME. A typical content-type's BNF like following: Content-Type = "Content-Type:" SP media-type media-type = type "/" subtype *( ";" gen-param ) type = token subtype = token gen-param = pname [ "=" pval ] pname = token pval = token / quoted-string An example content-type as following: multipart/mixed; boundary="theboundary" ;id=33 There may be zero or one more parameters in content-type. My parse code as following: #include <boost/regex.hpp> #include <iostream> #include <string> #define COUT(x) std::cout << x << std::endl #define VAR(v) std::cout << #v << ": " << v << std::endl #define TOKEN "[a-zA-Z0-9]+" #define TYPE "(" TOKEN ")" #define SUBTYPE "(" TOKEN ")" #define PNAME "(" TOKEN ")" #define PVALUE "(" TOKEN ")" #define PARAM "(;" PNAME "=" PVALUE ")" #define CONTENT_TYPE_EXPRESS TYPE "/" SUBTYPE PARAM "*" int main() { std::string ct("multipart/mixed;boundary=theboundary;id=33"); COUT(CONTENT_TYPE_EXPRESS); boost::regex regex_content_type(CONTENT_TYPE_EXPRESS); boost::smatch result; if (boost::regex_match(ct, result, regex_content_type)) { VAR(result.size()); for (unsigned int i=0; i<result.size(); ++i) { if (result[i].matched) { COUT("result[" << i << "] = " << result[i]); } } } else { COUT("match failed."); } return 0; } /** output: ([a-zA-Z0-9]+)/([a-zA-Z0-9]+)(;([a-zA-Z0-9]+)=([a-zA-Z0-9]+))* result.size(): 6 result[0] = multipart/mixed;boundary=theboundary;id=33 result[1] = multipart result[2] = mixed result[3] = ;id=33 result[4] = id result[5] = 33 */ I want to get the parameter "boundary" and its value. Any way to do it? Sebastian Redl said: Not really. Regex doesn't support getting each submatch in a repeated expression. Xpressive does, but in this case, I think you'd be better off modelling the content-type grammar in Spirit and using that. Anyway, this question should have gone to boost-users, so I forward this to boost-users. Thanks in advance. -- Regards. Mockey Chen

2 1

Boost Python not linking uder Cygwin
by Nindi Singh 16 Jul '06

16 Jul '06

Apologies for resending this email ... but for some reason my last email ended up as a reply for a completely disconnected subject.... TWICE. I am able to build my Python Extension Module under MSVC 7.1, MSVC 8.0 and GCC (LINUX). However I cannot seem to build it under Cygwin gcc. The output of uname is CYGWIN_NT-5.1 The output of gcc -v is : Reading specs from /usr/lib/gcc/i686-pc-cygwin/3.4.4/specs Configured with: /gcc/gcc-3.4.4/gcc-3.4.4-1/configure --verbose --prefix=/usr --exec-prefix=/usr --sysconfdir=/etc --libdir=/usr/lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/ info --enable-languages=c,ada,c++,d,f77,java,objc --enable-nls --without-included-gettext --enable-version-specific-runtime-libs --without-x --enable-libgcj --disable-java-awt --with-system-zlib ble-interpreter --disable-libgcj-debug --enable-threads=posix --enable-java-gc=boehm --disable-win32-registry --enable-sjlj-exceptions --enable-hash-synchronization --enable-libstdcxx-debug : (r gured) Thread model: posix gcc version 3.4.4 (cygming special) (gdc 0.12, using dmd 0.125) My compile command line is : g++ -o /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/PythonPapa.dll -shared /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/main.os /cygdrive/c/Build/cygwin/gcc/3. .4/Debug/Intermediate/PythonPapa/StdVector.os -L/cygdrive/c/Build/cygwin/gcc/3.4.4/Debug -L/usr/local/lib -L/lib/python2.4/config -lPapaGateWay -lboost_python-gcc-mt-d-1_33_1 -lpython2.4 -lPapaGa eWay Then there are ALOT of errors .. here are the last few lines : /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIdSaIdEES5_ED1Ev[boost::python::objects::pointer_holder<std::vector< double, std::allocator<double> >*, std::vector<double, std::allocator<double> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holderD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIdSaIdEES5_ED0Ev[boost::python::objects::pointer_holder<std::vector< double, std::allocator<double> >*, std::vector<double, std::allocator<double> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holderD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorImSaImEES5_ED1Ev[boost::python::objects::pointer_holder<std::vector< unsigned long, std::allocator<unsigned long> >*, std::vector<unsigned long, std::allocator<unsigned long> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holde rD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorImSaImEES5_ED0Ev[boost::python::objects::pointer_holder<std::vector< unsigned long, std::allocator<unsigned long> >*, std::vector<unsigned long, std::allocator<unsigned long> > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holde rD2Ev' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIN17__papa__namespace16pTemplateVariantINS4_14pTemplateArrayIdEENS4_ 15pTemplateMatrixIdEEEESaISA_EESC_ED1Ev[boost::python::objects::pointer_holder<std::vector<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMa trix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> > > >*, std::vector<__papa__namespace::pTemplat eVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__ namespace::pTemplateMatrix<double> > > > >::~pointer_holder()]+0x16): undefined reference to `__imp___ZN5boost6python15instance_holderD2Ev' /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/StdVector.os:/usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderI PSt6vectorIN17__papa__namespace16pTemplateVariantINS4_14pTemplateArrayIdEENS4_15pTemplateMatrixIdEEEESaISA_EESC_ED0Ev[boost::python::objects::pointer_holder<std::vector<__papa__namespace::pTemplateVar iant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__name space::pTemplateMatrix<double> > > >*, std::vector<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__n amespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> > > > >::~pointer_holder()]+0x16): more undefined references to `__imp___ZN5boost6pytho n15instance_holderD2Ev' follow /cygdrive/c/Build/cygwin/gcc/3.4.4/Debug/Intermediate/PythonPapa/StdVector.os: In function `_ZN5boost6python7objects17make_ptr_instanceIN17__papa__namespace16pTemplateVariantINS3_14pTemplateArrayIdEEN S3_15pTemplateMatrixIdEEEENS1_14pointer_holderIPS9_S9_EEE9constructISB_EEPSC_PvP7_objectRT_': /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIN17__papa__namespace16pTemplateVariantINS4_14pTemplateArrayIdEENS4_ 15pTemplateMatrixIdEEEESaISA_EESC_E5holdsENS0_9type_infoEb[boost::python::objects::pointer_holder<std::vector<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__nam espace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> > > >*, std::vector<__papa__ namespace::pTemplateVariant<__papa__namespace::pTemplateArray<double>, __papa__namespace::pTemplateMatrix<double> >, std::allocator<__papa__namespace::pTemplateVariant<__papa__namespace::pTemplateArra y<double>, __papa__namespace::pTemplateMatrix<double> > > > >::holds(boost::python::type_info, bool)]+0xea): undefined reference to `__imp___ZN5boost6python7objects17find_dynamic_typeEPvNS0_9type_info ES3_' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorImSaImEES5_E5holdsENS0_9type_infoEb[boost::python::objects::pointer_ holder<std::vector<unsigned long, std::allocator<unsigned long> >*, std::vector<unsigned long, std::allocator<unsigned long> > >::holds(boost::python::type_info, bool)]+0xea): undefined reference to ` __imp___ZN5boost6python7objects17find_dynamic_typeEPvNS0_9type_infoES3_' /usr/local/include/boost-1_33_1/boost/python/object/make_ptr_instance.hpp:(.text$_ZN5boost6python7objects14pointer_holderIPSt6vectorIdSaIdEES5_E5holdsENS0_9type_infoEb[boost::python::objects::pointer_ holder<std::vector<double, std::allocator<double> >*, std::vector<double, std::allocator<double> > >::holds(boost::python::type_info, bool)]+0xea): undefined reference to `__imp___ZN5boost6python7obje cts17find_dynamic_typeEPvNS0_9type_infoES3_' collect2: ld returned 1 exit status Also I expected to see an import library build for the boost_python.dll, but i can't see that it is .. this is the contents of my /usr/local/lib libboost_python-gcc-1_33_1.a libboost_python-gcc-d-1_33_1.dll libboost_python-gcc-mt-1_33_1.dll libboost_python-gcc-mt-d.a libcppunit.a libboost_python-gcc-1_33_1.dll libboost_python-gcc-d.a libboost_python-gcc-mt-d-1_33_1.a libboost_python-gcc-mt.a libcppunit.la libboost_python-gcc-d-1_33_1.a libboost_python-gcc-mt-1_33_1.a libboost_python-gcc-mt-d-1_33_1.dll libboost_python-gcc.a I cannot see any .dll.lib or .dll.a I would appricate any comments on this problems. Thanx Ninds

2 2

[shmem] error while closing the segment
by Sascha Lumma 16 Jul '06

16 Jul '06

Hi, I get an error when I try to close the shared memory segment. My destructor calls simply mysegm.close(). I get the message below, but I can't interpret it so that I can do anything with it. It happens only if before a child process, that works in this segment too, is terminated erroneous and subsequently a faultless run was done. But to close the segment should be possible after errors too and at any time. When I restart my application without deleting the segment by hand it hangs in the constructor and I can wait forever, without any message. Thanks a lot, Sascha boost/shmem/detail/segment_manager.hpp:698: bool boost::shmem::detail::segment_manager<CharType, MemoryAlgorithm, IndexType>::priv_generic_named_destroy(const CharT*, typename boost::shmem::detail::segment_manager<CharType, MemoryAlgorithm, IndexType>::index_traits<CharT>::index_type&) [with T = std::pair<int, int>, CharT = char, CharType = char, MemoryAlgorithm = boost::shmem::simple_seq_fit<boost::shmem::shared_mutex_family, boost::shmem::offset_ptr<void, boost::shmem::offset_1_null_ptr> >, IndexType = boost::shmem::flat_map_index]: Assertion `0' failed. Program received signal SIGABRT, Aborted. [Switching to Thread 1076082048 (LWP 6141)] 0xffffe410 in ?? () (gdb) backtrace #0 0xffffe410 in ?? () #1 0xbfffead0 in ?? () #2 0x00000006 in ?? () #3 0x000017fd in ?? () #4 0x4014d7a1 in raise () from /lib/tls/libc.so.6 #5 0x4014ef79 in abort () from /lib/tls/libc.so.6 #6 0x40146fe3 in __assert_fail () from /lib/tls/libc.so.6 #7 0x41b6f53e in priv_generic_named_destroy<std::pair<int, int>, char> (this=0x30000008, name=Variable "name" is not available. ) at lock.hpp:85 #8 0x41b64c45 in ~Mosilapy (this=Variable "this" is not available. ) at segment_manager.hpp:432

4 12

templates for class member functions
by bringiton bringiton 15 Jul '06

15 Jul '06

sorry this is not a boost question, but wondering whether you guys could help with templates. I want to place template parameters on a class's member function. however it does not work: class Test { public: template <class T> void DoTest(T t) { cout << t; } }; Test t; t.DoTest<int>(2); //error C2062: type 'int' unexpected is it possible to do this?

4 4

enable thread safety
by Winson Yung 15 Jul '06

15 Jul '06

Hello, I am building boost regex using VC6, and I am not sure BOOST_HAS_THREADS is enabled by default or not. Reading http://www.boost.org/libs/regex/doc/thread_safety.html, it doesn't tell me which file to look, and how to enable it under VC6 if disabled by default. Could somebody help me on this please? Thanks! /Winson

1 0

Linking libboost...
by Martin Kardigen 15 Jul '06

15 Jul '06

Hello, I'm using test test libraries from boost to testing my code. I want to create Makefile.am rules for my project but I don't know how to define needed libboost libraries because all of boost libraries have -gcc suffix. What I have to do if I want to have code that would be compiled and linked in other compilers then gcc ??? Where can I find some clues about linking BOOST?

2 2

[mpl] Help with simple algorithm needed
by Stephan Tolksdorf 15 Jul '06

15 Jul '06

Hi I'm trying to build a mpl::vector which looks like [(a,1),(a,2),...,(a,a),(a+1,1),...,(b,b)], where a < b are int's and (x,y) stands for mpl::pair< int_<x>, int_<y> >. The following code does not compile with MSVC 8. Could somebody tell me what's wrong with my code? Does someone have an idea how to solve this problem more elegantly with MPL? Any help is much appreciated. Code snippet with the vector named "ListofNMPairs": template <typename N> struct NPush : mpl::lambda< mpl::push_front< mpl::_1, mpl::pair<N, mpl::_2> > >::type { }; template <typename S> struct MyRange : mpl::reverse_fold< mpl::range_c<int, 1, S::value + 1>, mpl::vector< >, NPush<S> >::type { }; typedef mpl::reverse_fold< mpl::range_c<int, 16, 66>, // a=16, b=65 mpl::vector< >, mpl::insert_range< mpl::_1, mpl::begin<mpl::_1>, MyRange<mpl::_2> > >::type ListofNMPairs; Regards, Stephan

2 2

[iterator] reverse_iterator from iterators that return references to data in self.
by Seb Martel 15 Jul '06

15 Jul '06

Hello, given something like: class ProxyIterator : public boost::iterator_facade<ProxyIterator, Costly, boost::random_access_traversal_tag> { public: ProxyIterator(FactoryOfCostly* pF, int i ) : m_pFactory( pF ), m_index( i ) {} private: friend class boost::iterator_core_access; void decrement() {--m_index;} // ... and others Costly& dereference() const { m_value = m_pFactory->MakeCostlyAtIndex( m_index ); return m_value; } private: FactoryOfCostly* m_pFactory; int m_index; mutable Costly m_value; }; I cannot use this ProxyIterator with a boost::reverse_iterator adaptor because the implementation of reverse_iterator's dereference dereferences a temporary: // from reverse_iterator.hpp typename super_t::reference dereference() const { return *boost::prior(this->base()); } and in ProxyIterator, this dereference returns a reference to an internal member, m_value, that will immediately vanish out of existence. Bummer. What if reverse_iterator carried as member the decremented iterator instead of decrementing to a temporary on a dereference? In the current reverse_iterator implementation, decrement must behave properly on an end iterator, but not on a begin iterator. Can a begin iterator be decremented and still used for comparison purposes? -seb

2 1

force inline
by Artem Alimarine 15 Jul '06

15 Jul '06

Hi all, Is there a macro in boost for something like MSVC __forceinline. Currently I have in the project: #if defined __GNUC__ #define FORCE_INLINE __attribute__((always_inline)) #define NO_INLINE __attribute__((noinline)) #elif defined _MSC_VER #define FORCE_INLINE __forceinline #define NO_INLINE __declspec(noinline) #else //#error "no inlines" #define FORCE_INLINE inline #define NO_INLINE #endif I am wondering whether I can get rid of it and use boost for it? Artem

3 3

boost::lambda performance
by Aleksey Loginov 15 Jul '06

15 Jul '06

Where I can find benchmark sources for boost::lambda?

1 0

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by David Klein 15 Jul '06

15 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > Hi Dave. That code went over the top of my head. Do you mind > giving me an example of the usage? > > On 7/14/06, David Klein <d.klein(a)ascaron.com> wrote: >> [snip] >> >>> I just have a problem with having the user manage the memory. >>> ie I'd rather do the following: >>> >>> shared_ptr<Test> p(1, 'a', "hello"); >>> or: >>> shared_ptr<Test> p = newptr<Test>(1, 'a', "hello"); >>> >>> instead of: >>> >>> shared_ptr<Test> p(new p(1, 'a', "hello")); >>> >>> but i guess that's a limitation of the language. to get >> >> hi, >> >> have a look at shared_new.zip in the vault. >> >> http://tinyurl.com/khd8v >> >> -- >> HTH dave well, i just tried to compile the shared_new_test.cc, but it failed using vc71 and vc8 (boost 1.33.1). anyway, its quite similiar to the code Roman Perepelitsa posted. a short example using his newptr: struct X { X( int _x, double _y, const std::string & _z ) { ... } } shared_ptr<X> x = newptr<X>(42, 42.0, "hello world");

2 1

stlport?
by bringiton bringiton 14 Jul '06

14 Jul '06

i'm porting my app so that it now uses stl and boost. can someone please give advise on what stl i should be using? i hear about stlport all the time, but not sure why it is used? ie is it better that the version that comes with the compilers? im using ms vc++ 6 at the moment and plan to upgrade to 7.1. should i use the default stl, or install stlport?

3 5

Spirit based shell command interpreter
by George M. Garner Jr. 14 Jul '06

14 Jul '06

Has anyone implemented a shell command interpreter using the boost spirit library? Yes, I am aware of jam/bjam. There is also a calculator example available on the web and the process doesn't seem all that difficult. I just want to see whether this specific application has already been done (before I reinvent the wheel). Regards, George.

1 0

Re: [Boost-users] Boost Test usage
by Matt Schuckmann 14 Jul '06

14 Jul '06

Actually right now we are using 1.32.0, I've downloaded 1.33.1 but I'll have to convince the rest of my group that it's worth it to update to 1.33.1 or I maybe able to use 1.33.1 just for the test library, I don't know yet. IMO Example 3 doesn't really show building a multilevel hierarchy it just shows how to derive from test_suite and add that to the master test_suite. Yes you could create multiple test_suites and add them together in interesting ways but what does that buy you? Now that I see the detailed report level I see some use for hierarchy's, maybe the documentation should mention this and provide some example output. It took me a while to find the command line documentation you might consider making it stand out more in the documentation and maybe even add a standard "-h --help" option so that the test executables are self documenting, if your using boost::program_options this is pretty easy. Thanks for quick feedback I'll see what I can do. I really hate creating a bunch of executables (especially in MS .NET 2003) but I also don't really want to always run all my tests I'll watch for version 1.35. Thanks Matt S.

1 0

A question about shared_ptr
by Zhuo Hao 14 Jul '06

14 Jul '06

In file <boost/shared_ptr.hpp>, I find the following function: /begin quote template<class Y, class D> shared_ptr(Y * p, D d): px(p), pn(p, d) { detail::sp_enable_shared_from_this( pn, p, p ); } /end quote If I use it as follows:"boost::shared_ptr<Investment> pInv(0,getRidOfInvestment)",it will not compile.But when I use:"boost::shared_ptr<Investment> pInv(static_cast<Investment*>(0),getRidOfInvestment)",it can be compiled. The constructor's first parameter is Y*,i.e.,a pointer to Y.And 0 can be interpreted as a pointer to Y,too. Why can't zero be treated as a pointer to Y here? I will be appreciative if anyone can give me some suggestions.Thank you! hzhuo July,14th

3 2

Re: [Boost-users] serialization-lib add user info to XML format
by Eduardo Ferro Aldama 14 Jul '06

14 Jul '06

Hi! Thank very much for the help I am study the lib implementation, and trying to extend xml_oarchive (as you suggest)... Bye >I don't know that I can offer you a good solution. But here is what I can >come up with. > >First a couple of relevant facts about the serialization library. > >a) generally it saves in the archive only that information absolutely >required >to be able to recover the data. This is basad on design/efficiency >considerations. > >b) In some cases it stores "optional" information. That it is, the archive >may be written to save and recover this information. Normally these >are just stubbed out as no ops. > >c) In xml archives, information about object and class id and their >references is included in the xml. I'm don't remember whether its done >in the "optional" types or not. > >c) class name was not considered as one of these optional types > i) it wasn't deemed necessary > ii) it is not always available. Many types (e.g. primitives) are >serialized >without calling the library code. For these cases the "optional" data >is not called. > >So back to your situation. > >What is really needed for you is the following: > >a) some sort reflection for C++ so that you can write something like >t.name(). >b) derive from xml_oarchive to invoke t.name() and insert it into >the xml stream output. Examples of deriving from one archive >type to produce another are in the documentation. > >So the problem is "reduced" to making/finding something like t.name() >which returns a text string which can be inserted into the output stream. > >This already exists on one form - the RTTI implementation uses >type_id(t).name to return a pointer to a name. This may be sufficient >for your needs. The only problem with it is that > >a) the name will be mangled to a unique C++ name. This may not always >be user friendly. >b) the name will be mangled differently for each compiler. > >If you can work with the above limitations - perhaps by massaging the >mangled name to something readable - this can probably be made to work >for you. > >If not - you can use the name passed by BOOST_CLASS_EXPORT which >was "invented" to address the issues above. The only problem is that >BOOST_CLASS_EXPORT might not bedefined for all your types. > >You should have enough here to craft a solution to your problem. > >Good Luck > >Robert Ramey > Ce message ?lectronique et tous les fichiers attach?s sont confidentiels et destin?s exclusivement ? l'usage de la personne ? laquelle ils sont adress?s. Si vous n'?tes pas le destinataire de ce message, merci d'avertir ou de le retourner ? son ?metteur et d?truire ce message ?lectronique et tous les fichiers attach?s de votre syst?me informatique. La publication, l'usage, la distribution, l'impression ou la copie non autoris?e de ce message et des attachements qu'il contient sont strictement interdits. This e-mail and any attachment are confidential and intended solely for the use of the individual to whom it is addressed. If you are not the intended recipient, please telephone or email the sender and delete this message and any attachment from your system. Unauthorized publication, use, dissemination, forwarding, printing or copying of this e-mail and its associated attachments is strictly prohibited. Este correo electr?nico y todos los ficheros adjuntos son confidenciales y destinados exclusivamente al uso de la persona a la cual han sido remitidos. Si Usted no es el destinatario del mensaje, agradecemos advierta al remitente y elimine el mensaje y sus adjuntos de su sistema. La publicaci?n, distribuci?n, impresi?n o copia no autorizada de este mensaje y de sus adjuntos queda estrictamente prohibida.

1 0

Installation on Macintosh
by John Christopher 14 Jul '06

14 Jul '06

Hello I am trying to install boost on a macintosh (Tiger). I downloaded the boost-jam-3.1.13-1-macosxppc.tgz file and uncompressed it in a folder: /Developer/Libraries/boost there I installed bjam and in the Terminal I typed: ./bjam "-sTOOLS=darwin" install everything things run smoothly until I get a lot of error messages like: ...skipped <@boost!include!boost-1_33_1!boost!wave!util>symbol_table.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... ...skipped <@boost!include!boost-1_33_1!boost!wave!util>time_conversion_helper.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... ...skipped <@boost!include!boost-1_33_1!boost!wave!util>transform_iterator.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... ...skipped <@boost!include!boost-1_33_1!boost!wave!util>unput_queue_iterator.hpp for lack of <directory-grist>/usr/local/include/boost-1_33_1/boost/wave/util... and the installation process ends with ...failed updating 8 targets... ...skipped 3649 targets... ...updated 709 targets... Any idea on what I am doing wrong? Thanks in advance

1 1

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by Perepelitsa Roman 14 Jul '06

14 Jul '06

> Thanks Roman. > > so is this how i would use your implementation? > > boost::shared_ptr<Test> t = newptr<int, char, std::string>(1, 'a', "hello"); > > that is getting a lot closer to what i need. and is far better that a > MACRO. declaring the types may annoying however. > > the good thing about this approach it that is will also be exception > safe: ie i dont need to declare a variable for the shared_ptr. and > will be cleaned up if g() fails > > // exception safe > fn(newptr<int, char, std::string>(1, 'a', "hello"), g()); You can omit all but the first template parameters because they can be deduced by compiler. shared_ptr<Test> t = newptr<Test>(1, 'a', "hello"); which is equivalent to shared_ptr<Test> t = shared_ptr<Test>(new Test(1, 'a', "hello")); HTH, Roman Perepelitsa.

1 0

Re: [Boost-users] Macro to contruct/allocate a shared_ptr?
by David Klein 14 Jul '06

14 Jul '06

[snip] > I just have a problem with having the user manage the memory. > ie I'd rather do the following: > > shared_ptr<Test> p(1, 'a', "hello"); > or: > shared_ptr<Test> p = newptr<Test>(1, 'a', "hello"); > > instead of: > > shared_ptr<Test> p(new p(1, 'a', "hello")); > > but i guess that's a limitation of the language. to get hi, have a look at shared_new.zip in the vault. http://tinyurl.com/khd8v -- HTH dave

2 1

library to workig with ip-addresses & ranges
by Alex Ott 14 Jul '06

14 Jul '06

Hallo all Is anybody knows a library to manipulate IP-addresses and their ranges. for example, to look ip address N.N.N.N in network specified by X.X.X.X/27, etc. -- With best wishes, Alex Ott Jet Infosystems, Head of software development group, MBA +7 (495) 411 76 01 http://www.jetsoft.ru/

1 0

bug in documentation
by Ovanes Markarian 14 Jul '06

14 Jul '06

Hi! there is currently a bug in boost::lambda documentation ( <http://www.boost.org/doc/html/lambda/s03.html> http://www.boost.org/doc/html/lambda/s03.html) Current version: template <class T> : public binary_function<T, T, T> struct plus { T operator()(const T& i, const T& j) const { return i + j; } }; should be: template <class T> struct plus : public binary_function<T, T, T> { T operator()(const T& i, const T& j) const { return i + j; } }; With Kind Regards, Ovanes

2 1

problem building boost's bjam for boost-1.32.0 on solaris with gcc
by William Deegan 14 Jul '06

14 Jul '06

Greetings, Here's whats happening: bash ./build.sh ### ### Using 'gcc' toolset. ### rm -rf bootstrap.gcc mkdir bootstrap.gcc gcc -o bootstrap.gcc/jam0 command.c compile.c execnt.c execunix.c execvms.c expand.c filent.c fileos2.c fileunix.c filevms.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c ./bootstrap.gcc/jam0 -f build.jam --toolset=gcc --toolset-root= build.jam:66: in module scope *** argument error * rule toolset ( name command : opt.out + : opt.define + : release-flags * : debug-flags * : linklibs * ) * called with: ( cc /eng/tools/cm/solaris/bin/gcc -m64 : -o : -D : -s -O : -g : ) * extra argument build.jam:39:see definition of rule 'toolset' being called This is run via script. If I run it interactively it builds fine. I'm trying to script up building boost+ many other third party packages for many platforms. Any idea why it fails when run via a script? Thanks, Bill

2 5

boost regex seg fault, can't run a single example....
by paulo.fernando.silva＠sapo.pt 13 Jul '06

13 Jul '06

Greetings I've just emerged (I'm using gentoo) boost, once using bjam and another time without it. In both cases (not that it could make a difference) I just can't get the boost_regex to work. It blows... After compiling a few examples (captures_example, and grep) in both my home and work pc. I get the same result... segmentation fault. While running captures_example in the line std::cout << " $" << i << " = \"" << what[i] << "\"\n"; After doing some debug, I was able to find only the consequence. (I didn't search that hard...) In sub_match.hpp:73 result.append(1, *i); the value of i is 0x1<address out of bounds>. the line match_results.hpp:123 supposly returns const boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::string> > &) @0x804ded8: {<std::pair<__gnu_cxx::__normal_iterator<char const*, std::string>, __gnu_cxx::__normal_iterator<char const*, std::string> >> = { first = {<std::iterator<std::random_access_iterator_tag, char, int, char const*, char const&>> = {<No data fields>}, _M_current = 0x1 <Address 0x1 out of bounds>}, second = {<std::iterator<std::random_access_iterator_tag, char, int, char const*, char const&>> = {<No data fields>}, _M_current = 0x804d067 "eeeeeeee"}}, matched = 111, m_captures = {ptr = 0x1}} strangely enough, in the debuger, after returning from line match_results.hpp:123 the execution jumps to match_results.hpp:125 and return return m_null; but the cpu registers don't change... the truth is that I get this Program received signal SIGSEGV, Segmentation fault. 0x0804a6d6 in boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::string> >::str ( this=0x804ded8) at sub_match.hpp:73 73 result.append(1, *i); for no apparent reason. Any ideas? I'm using gcc 4.1 in my home pc and gcc 3.3.6 in my office pc. PIII800MHz and PIV1.5GHz both with 512MB ram. ___________________________________________________________________ O SAPO já está livre de vírus com a Panda Software, fique você também! Clique em: http://antivirus.sapo.pt

2 2

vector vs list speed test
by bringiton bringiton 13 Jul '06

13 Jul '06

I'm just wondering what your thoughts are on my findings. I need a container that meets the following: - forward iteration only - insert to end only - no random access - delete from any position - average size of list will be 64 items I would first say use list over vector. because no random access and delete from any position. I ran some performance tests, which proved otherwise. The test builds a list by inserting to end. And then removes all items from the front until size == 0. (note: removing from index [0] should provide worst case linear complexity for vector) Here are my finding for containers of size 64, 256 and 1024. first result uses vector, 2nd uses list. i ran the test in release mode in ms vc++ 6. Test build/remove 64 0.062 0.234 Test build/remove 256 0.422 0.938 Test build/remove 1024 5.844 3.75 - it seems vector is best for smaller lists. even at 256 items, the vector is twice as fast at building at contant time and deleting and worst case linear time. - is this strange behaviour? is my test correct or do i have a bug? - i am also curious to how this runs on other compilers (esp later version of ms vc++) For those curious, here is my code. feel free to pick at it ;) void TestVectBuildDelete(int redoCount, int listSize) { boost::timer t; for (int i = 0; i < redoCount; i++) { // build the list std::vector<int> vect; for (int j = 0; j < listSize; j++) { vect.push_back(j); //vect.insert(vect.begin(), j); //.push_front(j); } // remove all elements in list while (!vect.empty()) { vect.erase(vect.begin()); } } std::cout << t.elapsed() << std::endl; } void TestListBuildDelete(int redoCount, int listSize) { boost::timer t; for (int i = 0; i < redoCount; i++) { // build the list std::list<int> vect; for (int j = 0; j < listSize; j++) { vect.push_back(j); } // remove all elements in list while (!vect.empty()) { vect.pop_front(); } } std::cout << t.elapsed() << std::endl; } void Test() { std::cout << "Test build/remove 64" << std::endl; TestVectBuildDelete(10000, 64); TestListBuildDelete(10000, 64); std::cout << "Test build/remove 256" << std::endl; TestVectBuildDelete(10000, 256); TestListBuildDelete(10000, 256); std::cout << "Test build/remove 1024" << std::endl; TestVectBuildDelete(10000, 1024); TestListBuildDelete(10000, 1024); }

6 10

boost windows installer problem
by Ovanes Markarian 13 Jul '06

13 Jul '06

Hello, is there any way to specify the proxy server to the installer provided by boost-consulting? At work I can access inet via some proxy server only. Now I have to rebuild the entire boost lib again... May be boost-consulting should offer big old monolithic single file installations for vc8.0 or vc7.1 for those who cannot easily access network and still require all libs. With Kind Regards, Ovanes Markarian

4 5

Boost::Spirit - Just enough to match a term?
by Eric Hill 13 Jul '06

13 Jul '06

I'm past the initial learning curve with Spirit, but would like to see how the pros handle this problem. I have the following simple command structure: show queues show users show processes start process foo queue user bar to process foo ...etc I would like to parse these commands with Spirit. Easy enough. Since this is being entered from a keyboard, it would be nice to short-circuit the parser so you only have to enter enough of the command for the parser to reliably figure out what you want. e.g. "sh qu" would parse as "show queues", and "st pr foo" would parse as "start process foo". I can easily model the whole "show queues" command word with: str_p("show") >> str_p("queues") But how do I match "just enough" instead of "whole word" without doing it manually? TIA, Eric

3 4

serialization-lib add user info to XML format
by Eduardo Ferro Aldama 13 Jul '06

13 Jul '06

Hi! We are trying the boost's serialization-lib to serialize C++ objets to send them throw the network. Initialy, we are use xml-serialization to facilitate the inspect the comunications. We are trying to develop a little tool to work/inspect this messages (xml-serializated) but we need to develop this tool in another languaje (in this case python) and We want that this tool don't need to know nothing about the original C++ clases.... In order to develop this tool we need add to the output xml string information about the names of the class that we are serializing -Is possible to configure something to add the class name in the xml output format? -Can we add any other information to taht format without disturb the deserialization process?? Some hint/tipo/doc to add this functionality without changing the boost-lib source? Thanks in advance Please accept my apologies for my poor english -- Eduardo Ferro Aldama Desarrollo TPVs (Gestión Stock) Tlf 91 5142101 Ext:2101 Ce message électronique et tous les fichiers attachés sont confidentiels et destinés exclusivement à l'usage de la personne à laquelle ils sont adressés. Si vous n'êtes pas le destinataire de ce message, merci d'avertir ou de le retourner à son émetteur et détruire ce message électronique et tous les fichiers attachés de votre système informatique. La publication, l'usage, la distribution, l'impression ou la copie non autorisée de ce message et des attachements qu'il contient sont strictement interdits. This e-mail and any attachment are confidential and intended solely for the use of the individual to whom it is addressed. If you are not the intended recipient, please telephone or email the sender and delete this message and any attachment from your system. Unauthorized publication, use, dissemination, forwarding, printing or copying of this e-mail and its associated attachments is strictly prohibited. Este correo electrónico y todos los ficheros adjuntos son confidenciales y destinados exclusivamente al uso de la persona a la cual han sido remitidos. Si Usted no es el destinatario del mensaje, agradecemos advierta al remitente y elimine el mensaje y sus adjuntos de su sistema. La publicación, distribución, impresión o copia no autorizada de este mensaje y de sus adjuntos queda estrictamente prohibida.

2 1

[regex] matchinf info with merged regex
by Line Oddskool 13 Jul '06

13 Jul '06

Hi boost.regex gurus, I'm stuck with a problem dealing with some kind of regex merging (using boost 1.33). I don't know if the way I took is viable, so any ideas and advice will be appreciated. To give you some insight, i have a set of a hundred matching (ei) and formating (ri) "rules" e.g. e1 : (a)(?=ll) r1 : (?1o) e1/r1 should mean "matching 'a' of some string like 'all' should be replaced by 'o'" I merge all my e/r into one big regex using regex_merge (for performance), so the resulting matching/formating regex is like : e : e1|e2|...|en r: r1r2...rn I'm getting weird behaviour with this, as the resulting string is sometimes filled with sequences like 'u4u5u6u7u8u9u' or other "trash". So to debug this, I'd like to know which rule (i.e. which ei) matched on what part of the string. I'm unsure if it's possible to get some kind of iterator on the rules that have matched using regex_merge ? I also looked at the match_results returned by the simpler method regex_match(), but I can't figure out how to know which part of my matching regex matched (i.e. which ei) ? Otherwise, is there a way to analyse or dump the matching/replacing behaviour of such a complex regex ? Thanks Line.

2 3

[Iterator] const and an iterator's value_type
by Daniel Mitchell 13 Jul '06

13 Jul '06

In the documentation of iterator_facade it is stated that: "The C++ standard requires an iterator's value_type not be const-qualified, so iterator_facade strips the const from its Value parameter in order to produce the iterator's value_type. Making the Value argument const provides a useful hint to iterator_facade that the iterator is a constant iterator, and the default Reference argument will be correct for all lvalue iterators." and "when defining a constant lvalue iterator, the user can pass a const-qualified version of the iterator's value_type as iterator_facade's Value parameter and omit the Reference parameter which follows." Am I to understand from this that iterator_facade<Derived,T const,Category> is equivalent to iterator_facade<Derived,T,Category,T const&>, and likewise for iterator_adaptor? D.

1 0

Re: [Boost-users] c array parameter in resize method of multi_array
by Manuel.Yguel＠inrialpes.fr 13 Jul '06

13 Jul '06

I think that any container that have the proper size would be ok. I would like to know too, if there are some compile flags that will prevent me to do: void outOfBound() { typedef boost::multi_array<double, 3> array_type; array_type A( boost::extents[3][4][2] ); A[12][3][43] = 8.0; printf( "Value: %f\n", A[12][3][43] ); } either at compile-time or at run time.

1 0

[lambda] ->* vs. bind
by Christian Rössel 13 Jul '06

13 Jul '06

Hello, assume I want to do a std::find_if on a container of A* with struct A { int foo; }; Now I have two ways of writing the predicate for find_if: 1. find_if (cont.begin (), cont.end (), _1 ->* &A::foo == 42); 2. find_if (cont.begin (), cont.end (), bind (&A::foo, _1) == 42); They both perform as expected. Are there any differences that make one of them preferrable? Thanks, Christian

1 0

__fastcall warning when compiling boost in managed c++
by ChuMing 13 Jul '06

13 Jul '06

Hi, I am handling some project which mixes managed and unmanaged C++ code. With boost 1.33 I’m hitting problems with the header is_mem_fun_pointer_tester.hpp. There are warnings popping up due to the use of __fastcall calling convertion in boost and its incompatible with compiling some of our code with the /clr flag turned on. Managed C++ is incompatible with the __fastcall calling convention because what it does is it preloads certain registers with the function parameters but for /clr compilation it is compiling to MSIL so this cannot be done and upon encountering any __fastcall the Managed C++ compiler will change it to __stdcall. Does anyone know the implications of disabling these warnings and whether it is safe to do that? I did not get these warnings with the previous versions of boost though. Thanks and regards, Chu-Ming

2 3

Regex build problem using g++ under cygwin
by Darren.Moore＠csiro.au 13 Jul '06

13 Jul '06

Hi, I've just started trying to use the Regex library with g++ 3.4.4 under cygwin. I am using the boost 1_33_1 libraries that are installed by cygwin's setup program. For some reason that I cannot figure out, building fails for this simple program test-regex.cpp : #include <boost/regex.hpp> using namespace boost; int main() { regex re; re.assign("hey"); } My build command is: g++ -I/usr/include/boost-1_33_1 -lboost_regex-gcc-mt-s test-regex.cpp Compilation is ok, but during linking I get: /cygdrive/d/temp/ccrjdFg7.o:test-regex.cpp:(.text$_ZN5boost11basic_regex IcNS_12regex_traitsIcNS_16cpp_regex_traitsIcEEEEE6assignEPKcS7_j[boost:: basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)]+0x22): undefined reference to `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned int)' collect2: ld returned 1 exit status I cannot figure out how to solve this problem, and would be grateful if anyone can offer any help. Thanks, Darren Moore.

4 3

[thread] TSS locking?
by Cory Nelson 13 Jul '06

13 Jul '06

Hello! The documentation doesn't seem to mention this. Does thread_specific_ptr have any guarantees about locking (mutex etc) when you call get() or reset()? I'd like to use it in a library but if locks I'll have to roll my own. Thanks! -- Cory Nelson http://www.int64.org

1 0

Seg faults when using boost::regex_replace in multiple threads
by mailinglist＠kamba.net.nz 12 Jul '06

12 Jul '06

Hello, I'm having a few problems with boost::regex_replace seg faulting when used in a multithreaded program. The problem seems to be identical to the one described in http://lists.boost.org/boost-users/2006/06/20235.php, with a seg fault on line 133 of regex_format.hpp, though I have linked against the multithreaded version of libboost_regex.so and the problem is still happening. Unfortunately, I never saw any definitive answer for what was causing the original poster's problems. =========================================== Stack trace: =========================================== Program received signal SIGSEGV, Segmentation fault. [Switching to Thread -584664144 (LWP 28385)] 0x080520e0 in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_ite rator<std::string>, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > >::format_all (this=0xdd26b8d0) at regex_format.hpp:133 133 switch(*m_position) (gdb) where #0 0x080520e0 in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_ite rator<std::string>, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > >::format_all (this=0xdd26b8d0) at regex_format.hpp:133 #1 0x080518be in boost::re_detail::basic_regex_formatter<boost::re_detail::string_out_ite rator<std::string>, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > >::format (this=0xdd26b8d0, p1=0xd55005dc "$1", p2=0xd55005de "", f=format_all) at regex_format.hpp:123 #2 0x08051073 in boost::re_detail::regex_format_imp<boost::re_detail::string_out_iterator <std::string>, char const*, std::allocator<boost::sub_match<char const*> >, char, boost::regex_traits_wrapper<boost::regex_traits<char, boost::cpp_regex_traits<char> > > > (out= {<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, m=@0xd5500518, p1=0xd55005dc "$1", p2=0xd55005de "", flags=format_all, t=@0x8064140) at regex_format.hpp:569 #3 0x08050710 in format<boost::re_detail::string_out_iterator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > > (this=0xd5500518, out={<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, fmt=@0xdd26b990, flags=format_all, re=@0x805f6ec) at match_results.hpp:170 #4 0x0804fe35 in boost::regex_replace<boost::re_detail::string_out_iterator<std::string>, char const*, boost::regex_traits<char, boost::cpp_regex_traits<char> >, char> (out= {<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, first=0xd550048c "abcdefgh", last=0xd5500494 "", e=@0x805f6ec, fmt=0x805a2a9 "$1", flags=format_all) at regex_replace.hpp:53 #5 0x0804f7e1 in boost::regex_replace<boost::regex_traits<char, boost::cpp_regex_traits<char> >, char> (s=@0xdd26ba80, e=@0x805f6ec, fmt=0x805a2a9 "$1", flags=format_all) at regex_replace.hpp:84 #6 0x0804f3c4 in test_fn () at regexTest.C:32 #7 0xf63e5dec in start_thread () from /lib/tls/libpthread.so.0 #8 0xf6385a2a in clone () from /lib/tls/libc.so.6 (gdb) print *this $1 = {m_traits = @0x8064140, m_results = @0xd5500518, m_out = {<std::iterator<std::output_iterator_tag, char, int, char*, char&>> = {<No data fields>}, out = 0xdd26ba70}, m_position = 0xd44ff5d6 <Address 0xd44ff5d6 out of bounds>, m_end = 0xd55005de "", m_flags = format_all, m_state = output_copy, m_have_conditional = false} ========================================== GCC version is 3.2.3 20030502 (Red Hat Linux 3.2.3-42), with Boost 1.33.1, on a 4 CPU machine. We're using the STL from RogueWave, though since the post from a couple of weeks ago had the same problem with both GCC and STLport libraries I don't think that's the problem. This problem also occurs with version 1.33.0, but not with 1.32 or earlier. Does anyone know if there is a known problem with using these new versions of boost::regex_replace in multiple threads? If it's helpful, I have a very simple test program that demonstrates the problem. Any help on this would be greatly appreciated. Kind regards, Alistair Potts

3 2

serialization with hash_map problem
by Van Kincaid 12 Jul '06

12 Jul '06

Hi, I just started learning to use serialization and having problems with compiling for hash_map (map/deque/etc all work fine for me). I found your discussion a while ago relating to this http://thread.gmane.org/gmane.comp.lib.boost.user/12609/focus=12609 So I built my test program with g++ -D__GLIBCPP__ -DBOOST_HAS_HASH -DBOOST_STD_EXTENSION_NAMESPACE=__gnu_cxx -c test.cpp -o test.o And I still have the following compile errors saying that serialize function for hash_map is not defined. I also looked at the preprocessor output and did find the definition for hash_map serialize() function. It doesn't make sense to me why this happens. Any help is greatly appreciated. The test file is attached at the end. /usr/local/include/boost/serialization/access.hpp: In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]': /usr/local/include/boost/serialization/serialization.hpp:81: instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]' /usr/local/include/boost/serialization/serialization.hpp:140: instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]' /usr/local/include/boost/archive/detail/oserializer.hpp:148: instantiated from 'void boost::archive::detail::oserializer<Archive, T>::save_object_data(boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::archive::text_oarchive, T = __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >]' test.cpp:157: instantiated from here /usr/local/include/boost/serialization/access.hpp:109: error: 'class __gnu_cxx::hash_map<int, boost::shared_ptr<DaoData>, __gnu_cxx::hash<int>, std::less<int>, std::allocator<boost::shared_ptr<DaoData> > >' has no member named 'serialize' ----------------------------------- test.cpp #include <fstream> #include <map> #include <iostream> #include <ext/hash_map> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/map.hpp> #include <boost/serialization/hash_map.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/serialization.hpp> using namespace std; using namespace __gnu_cxx; using namespace boost; using namespace boost::serialization; template<typename DataType, typename KeyType, typename CompareType> class DAO { friend class serialization::access; public: typedef shared_ptr<DataType> DataTypePtr; typedef pair<KeyType, DataTypePtr> KeyDataPair; #if 0 typedef map<KeyType, DataTypePtr> DataTypeMap; #else typedef hash_map<KeyType, DataTypePtr, hash<KeyType>, CompareType> DataTypeMap; #endif typedef typename DataTypeMap::iterator DataTypeMapIter; typedef typename DataTypeMap::const_iterator DataTypeMapConstIter; DAO() {} ~DAO() {} template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & m_dataTypeMap; } void insertData( DataTypePtr dataPtr ) { m_dataTypeMap.insert( KeyDataPair( dataPtr->getKey(), dataPtr ) ); } void display() const { DataTypeMapConstIter iter = m_dataTypeMap.begin(); while ( iter != m_dataTypeMap.end() ) { iter->second->display(); iter++; } } void save_binary( const char* filename ) { ofstream ofs(filename); archive::text_oarchive oa(ofs); oa & *this; } bool load_binary( const char* filename ) { try { ifstream ifs( "test.dat", ios::binary ); archive::text_iarchive ia( ifs ); ia & *this; display(); return true; } catch ( exception& e ) { cerr << "Exception caught: " << e.what() << endl; return false; } } private: DataTypeMap m_dataTypeMap; }; class DaoData { public: int m_key; string m_keyStr; DaoData() {} DaoData( int key, const string& keyStr ) : m_key( key ), m_keyStr( keyStr ) { } DaoData( DaoData& daoData ) { m_key = daoData.m_key; m_keyStr = daoData.m_keyStr; } ~DaoData() {} int getKey() const { return m_key; } void display() const { cout << "key = " << m_key << endl; cout << "keyStr = " << m_keyStr << endl; } template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & m_key; ar & m_keyStr; } }; void test_dao_serialize() { DAO<DaoData, int, less<int> > myDao; shared_ptr<DaoData> dataPtr( new DaoData( 1, "ONE" ) ); myDao.insertData( dataPtr ); shared_ptr<DaoData> dataPtr2( new DaoData( 2, "TWO" ) ); myDao.insertData( dataPtr2 ); myDao.save_binary( "test.dat" ); //myDao.load_binary( "test.dat" ); } int main() { test_dao_serialize(); return 0; }

1 0

Re: [Boost-users] shared_ptr implicit dynamic cast
by Andrew Holden 12 Jul '06

12 Jul '06

Scott McMurray wrote > My apologies, I didn't know that. Certainly a very nice feature as it > means that even without the virtual destructor both would be safe. > > Promises to double-check the documentation before replying next time, No worries. It wasn't exactly a highly advertised feature. Besides, the note implied that older versions of shared pointer didn't do that, so I just figured you learned about shared pointers before they added it. Andrew

1 0

Re: [Boost-users] shared_ptr implicit dynamic cast
by Andrew Holden 12 Jul '06

12 Jul '06

foo = boost::shared_ptr<Foo>(new Bar); foo = boost::shared_ptr<Bar>(new Bar); Scott McMurray wrote: > > The important difference is in the default deleter. shared_ptr<Foo>'s > default deleter will call delete on a Foo* while shared_ptr<Bar>'s > default deleter will call it on a Bar*. Since your base class's > destructor is virtual, it doesn't make any difference in the example. > If your destructor were non-virtual, then you'd have to use > shared_ptr<Bar>(new Bar) to get the correct destructors called. (But > without any virtual functions, the dynamic casting wouldn't compile.) Are you sure about that? A check of the documentation lists the signature for that constructor as template<class Y> explicit shared_ptr(Y * p); The explanation is given as follows: [This constructor has been changed to a template in order to remember the actual pointer type passed. The destructor will call delete with the same pointer, complete with its original type, even when T does not have a virtual destructor, or is void. The reset function has a similar signature.

2 1

shared_ptr implicit dynamic cast
by eric 12 Jul '06

12 Jul '06

hello given the following class hierarchy class Foo { protected: virtual ~Foo() {} }; class Bar : public Foo {}; and declaration boost::shared_ptr<Foo> foo; is there any difference between the two assignment statements below? foo = boost::shared_ptr<Foo>(new Bar); foo = boost::shared_ptr<Bar>(new Bar); in other words, when you assign a value to a shared_ptr, does it make any difference what class you specify for that value, as long as the class of the underlying object can be dynamically cast to the class that was used to declare the shared_ptr? kind regards, eric

3 2

Boost tests
by kirill.sukhonosenko 12 Jul '06

12 Jul '06

Hello, Are there any ready-to-use tests for boost which can be ran after build to prove consistency of the built libraries? I've tried to build several versions of Boost for TI DaVinci chip (ARM core) and failed. Both 1-31 & 1-33 versions failed. Some libraries has got built, some - not. How can one be assured that built libraries work properly? Thanks, Kirill

3 2

boost [C++ database development library]
by Sundaram Ramasamy 12 Jul '06

12 Jul '06

Hi, Can someone help me to locate cross-platform (platform independant) and cross-database C++ database development BOOST library? Thanks and regards, Sundaram Ramasamy Sundaram.Ramasamy(a)saama.com

3 2

fs::exists() question
by Simon Lacroix 11 Jul '06

11 Jul '06

Hello all, I started using the file system about a week ago in order to port a Windows application using win API calls to manipulate folders and file on Linux. So far it works great but I am having one issue, the fs::exists() function seems to throw an exception when I try to look for directory containing special characters like ./test[0] ./test<1> etc. Is this normal ? I can create directory with these characters using mkdir in Linux so it should be legal names. Any ideas ? Thanks for your time Simon

2 1

c array parameter in resize method of multi_array
by Manuel.Yguel＠inrialpes.fr 11 Jul '06

11 Jul '06

Hi, is there any reason to refuse a resize method for multi_array that accept a C array as parameter ? As long as the resize method just works if the boost::extents parameter has the same dimension as the array to be resized a call like that: typedef boost::multi_array<double, 3> array_type; array_type A( boost::extents[3][4][2] ); ---> A.resize( {6;5;2} ); could be understood as: A.resize( boost::extents[6][5][2] ); without any ambiguity, am I wrong ?

3 2

[graph] remove_if algorithm
by Loïc Joly 11 Jul '06

11 Jul '06

Hello, I'm new to the graph library, but I'm missing some algorithms that I believe are quite low level, and that I expected to find. For instance, I'd like to be able to remove nodes from a graph that meet some criterion. The closest I could find to remove_if was : - Iterate on each node manually: for (tie(vi, viend) = boost::vertices(myGraph) ; vi != viend; ++vi) { if (criterion(vi) { clear_vertex(*vi, myGraph); remove_vertex(*vi, myGraph); } } But I'm afraid of iterator invalidity - Filter, copy, swap: Graph tempGraph; { filtered_graph<Graph, keep_all, Criterion> fg (myGraph, criterion); copy_graph(fg, tempGraph); } copy_graph(tempGraph, myGraph); Will one of my attempts work ? Is there any other solution I missed ? Best regards, -- Loïc

1 0

Re: [Boost-users] erase and iterators
by David Klein 11 Jul '06

11 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > On 7/11/06, David Klein <d.klein(a)ascaron.com> wrote: >> you can use Boost.Lambda for this >> >> #include <boost/lambda/lambda.hpp> >> >> using namespace boost::lambda; >> >> std::vector<int> v; >> ... >> v.erase(std::remove_if(v.begin(), v.end(), 5 == _1)); >> > Shouldn't it be > v.erase( std::remove_if(v.begin(), v.end(), 5 == _1), v.end() > ); as you want to erase the range, not just the single element? > > ~ SWMc > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users <blush> of course, my bad (... actually i blame the heat in our office ;) ) </> -- dave

1 0

Re: [Boost-users] erase and iterators
by David Klein 11 Jul '06

11 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > On Tue, Jul 11, 2006 at 10:19:05AM +0000, Roman Neuhauser wrote: >> # kneeride(a)gmail.com / 2006-07-11 17:31:23 +1000: >>> On 7/11/06, Michael Nicolella <boost(a)mike-n.com> wrote: >>>> vec.erase( std::remove_if( vec.begin(), vec.end(), >>>> some_condition_functor >>>> ) ); >>> >>> Mike, I do like your remove_if example. >>> >>> i am not familar with this approach, can you please give me an >>> example of defining a some_condition_functor? for example when the >>> value == 5. > > What about this? > > Let's assume the vector contains ints > > class condition_functor { > > public: > > bool operator()(int elem) > { > return elem==5 > } > }; > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users you can use Boost.Lambda for this #include <boost/lambda/lambda.hpp> using namespace boost::lambda; std::vector<int> v; ... v.erase(std::remove_if(v.begin(), v.end(), 5 == _1)); -- HTH dave

3 2

[serialization] skipping data
by Joel de Guzman 11 Jul '06

11 Jul '06

Hi, Here's a use case that I can't seem to find a way to do using boost.serialization. Say with version 1, I want to serialize X Y and Z. These are hierarchical and expensive data structures. Now, with version 2, I do not need to create Y objects anymore. Yet, I still have to open version 1 files for backward compatibility. So, when loading version 1 files, I want to skip reading Y objects. How do I do that without having to create a temporary Y object that will be discarded later? (I'm particularly interested with XML archives. If I had control over the xml parser, that would simply mean ignoring everything from the current tag until the next matching tag is found). Regards, -- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net

5 25

[BGL] bipartite graphs
by Heiko Bauke 11 Jul '06

11 Jul '06

Hello, how can I deal with bipartite graphs and BGL? In particular I have the problem that my graph has two kinds of nodes with different kinds of vertex properties. Any suggestions? Heiko -- -- Es gibt vielerlei Lärm. Aber es gibt nur eine Stille. -- (Kurt Tucholsky, dt. Schriftsteller, 1890-1935) -- Cluster Computing @ http://www.clustercomputing.de -- Heiko Bauke @ http://www.uni-magdeburg.de/bauke

2 1

Serialization of boost::any
by Sliwa, Przemyslaw (London) 11 Jul '06

11 Jul '06

Does it exist somewhere? Is it planned at all? Thanks for help Kind regards Pshemek Przemyslaw Sliwa Global Foreign Exchange FX Risk Engine Development Merrill Lynch ( +44 (0)20 7995 4182 ) +44 (0)79 6325 2319 * Email: przemyslaw_sliwa(a)ml.com -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

2 1

[BGL] conflict with call of boost::source
by Lars Monecke 11 Jul '06

11 Jul '06

Hi, i have reduced my problem to the following lines. I want to install a own edge property to a graph. The property as a template argument with then name "source". Here is my try: ---> code starts here <--- #include <boost/graph/adjacency_list.hpp> namespace Foo { class source { }; } namespace Bar { template <class Source> class Edge { }; } typedef Bar::Edge<Foo::source> tMyEdge; struct edge_impl_t { typedef boost::edge_property_tag kind; }; typedef boost::property <edge_impl_t, tMyEdge> edge_property_t; typedef boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS, boost::no_property, edge_property_t> tGraph; int main(int /* argc */, char* /* argv[] */) { tGraph stGraph1; tGraph stGraph2; stGraph1 = stGraph2; } ----> code ends here <--- When compiling the above code with gcc 4.1.1, i get these errors: main.cpp: In member function 'void boost::vec_adj_list_impl<Graph, Config, Base>::copy_impl(const boost::vec_adj_list_impl<Graph, Config, Base>&) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>::config, Base = boost::undirected_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>::config>]': /usr/local/gcc-4.1.1/boost-1.33.1/boost/graph/detail/adjacency_list.hpp:1990: instantiated from 'boost::vec_adj_list_impl<Graph, Config, Base>& boost::vec_adj_list_impl<Graph, Config, Base>::operator=(const boost::vec_adj_list_impl<Graph, Config, Base>&) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>, Config = boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>::config, Base = boost::undirected_graph_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>, boost::vecS, boost::listS, boost::undirectedS, boost::no_property, boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, boost::no_property, boost::listS>::config>]' /usr/local/gcc-4.1.1/boost-1.33.1/boost/graph/adjacency_list.hpp:373: instantiated from 'boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>& boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::operator=(const boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with OutEdgeListS = boost::listS, VertexListS = boost::vecS, DirectedS = boost::undirectedS, VertexProperty = boost::no_property, EdgeProperty = boost::property<edge_impl_t, Bar::Edge<Foo::source>, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS]' main.cpp:42: instantiated from here main.cpp:7: error: 'class Foo::source' is not a function, /usr/local/gcc-4.1.1/boost-1.33.1/boost/graph/adjacency_list.hpp:464: error: conflict with 'template<class Directed, class Vertex, class OutEdgeListS, class VertexListS, class DirectedS, class VertexProperty, class EdgeProperty, class GraphProperty, class EdgeListS> Vertex boost::source(const boost::detail::edge_base<Directed, Vertex>&, const boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&)' /usr/local/gcc-4.1.1/boost-1.33.1/boost/graph/detail/adjacency_list.hpp:2051: error: in call to 'source' I know the easiest way is to rename Foo::source but this class came from another library. Is there a chance to use this class anyway? Thanks in advance, Lars

1 0

Re: [Boost-users] interested to know your opinion on possible feature
by Ovanes Markarian 11 Jul '06

11 Jul '06

On Tue, July 11, 2006 01:26, Sebastian Redl wrote: > Ovanes Markarian wrote: > >>In my current project is a need to implement an optional type, this type is considered to be >> lazy. >>I am wondering why C++ or Boost do not offer this possibility. >> >> > In what way does Boost.Optional fail to meet your needs? > > Sebastian Redl > > Thanks for your reply. I will take a look at this class in a more detailed manner. I saw it already, but thought it is not what I need. After some inspection I start to realize, that it is indeed what I might need. Thanks again. With Kind Regards, Ovanes Markarian

1 0

erase and iterators
by bringiton bringiton 11 Jul '06

11 Jul '06

is this common practise for using an interator with erase? what i wish to do is interate through each item and delete the item if some condition is true. when i delete, i need to move back a step so that i dont miss an item. for (std::vector<int>::iterator it = vect.begin(); it != vect.end(); it++) { if ((*it) == 5) { // some condition vect.erase(it); it--; // step back } } or would it be best to use a reverse iterater? (or possible?) for (std::vector<int>::reverse_iterator it2 = vect.rbegin(); it2 != vect.rend(); it2++) { if ((*it) == 5) { // i'm not actually sure how to erase with a reverse iterator??? vect.erase(it2); } }

4 4

weak_ptr, shared_ptr and dynamic libraries
by Kyle Girard 10 Jul '06

10 Jul '06

Hello, I was fooling around with the boost::shared_ptr and boost::weak_ptr library and dynamic libraries and I received a segmentation fault which I do not fully understand and I am hoping someone can shed some light on the situation. I am playing around with having objects in a dynamic library which are managed by shared_ptr's return weak_ptrs to the application My problem arises when the weak_ptrs aren't destroyed before the plugin is unloaded. I was hoping that the weak_ptr would become invalid when the shared_ptr it points to is unloaded but instead it causes a segmentation fault. I'm just starting to play around with dynamic libraries and shared_ptrs and stuff so I don't fully understand all the caveats that go with the territory so any information would be appreciated. Here's a small linux example which generates the error: main.cc == Application foo.cc/foo.hh == Dynamic Library make sure to set LD_LIBRARY_PATH to the appropriate directory main.cc ======= #include <iostream> #include <dlfcn.h> #include <boost/weak_ptr.hpp> #include "Foo.hh" using namespace std; int main() { typedef boost::weak_ptr<Foo> (*DoStuff) (void); void *hndl = dlopen("libFoo.so", RTLD_NOW); void *doStuff = dlsym(hndl, "doStuff"); // { //if I comment this in then the error goes away boost::weak_ptr<Foo> wpFoo = ((DoStuff)(doStuff))(); // } //if I comment this in then the error goes away dlclose(hndl); cerr << "Yay Finished" << endl; return 0; } Foo.hh ====== #ifndef FOO_HH #define FOO_HH #include <boost/weak_ptr.hpp> class Foo { }; extern "C" { boost::weak_ptr<Foo> doStuff(); } #endif //FOO_HH Foo.cc ====== #include "Foo.hh" #include <vector> #include <boost/shared_ptr.hpp> std::vector<boost::shared_ptr<Foo> > Foos; extern "C" { boost::weak_ptr<Foo> doStuff() { Foos.push_back(boost::shared_ptr<Foo>(new Foo)); return Foos[0]; } } Makefile ======== CC = g++ LIBS = -ldl .cc.o: $(CC) -ggdb -c $< default: make all OBJS = main.o test: main.o $(CC) -rdynamic -o test main.o $(LIBS) libfoo.so: Foo.o g++ -shared -Wl,-soname,libFoo.so -o libFoo.so Foo.o all: test libfoo.so clean: rm -f *.so *.o test === end of example thanks Kyle

2 1

interested to know your opinion on possible feature
by Ovanes Markarian 10 Jul '06

10 Jul '06

Hello all, I have one issue, which I would like to discuss here. In my current project is a need to implement an optional type, this type is considered to be lazy. I am wondering why C++ or Boost do not offer this possibility. These are just some thoughts which are really not perfect, but an opinion and interest would be highly appreciated: template<class Type, class Allocator /*some other policies like threading etc.*/> class lazy_type { public: //constructors must be considered which //should it be possible to copy this type etc. //destuctor, must be considered how the object should be deallocated in regards of owning and non-owning policies operator bool()const { return ptr_!=NULL; } Type* operator->() { if(!ptr_) { //allocate ptr_ and instantiate it using an allocator or another policy type ... } return ptr_; } private: Type* ptr_; }; This type can be a mix of reference counted ptr (shared_ptr) and allocator on request. All comments and thoughts are HIGHLY appreciated. With Kind Regards, Ovanes Markarian

2 1

Linking errors while using the test library (for a very basic program)
by Josh 10 Jul '06

10 Jul '06

I have a very simple program ******************************************************************** #include <iostream> #include <boost/test/unit_test.hpp> using boost::unit_test::test_suite; void MyTest() { BOOST_CHECK(2==2); } test_suite * init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Simple test" ); test->add(BOOST_TEST_CASE( &MyTest ), 0); return test; } **************************************************************************************** I am trying to compile it using the following commands g++ -c BoostTest.cpp -I~/boost/include/boost-1_33_1/ g++ -o BT BoostTest.o -I/home/josh/boost/include/boost-1_33_1/ /home/josh/boost/lib/libboost_unit_test_framework-gcc-s.a The first step completes without a problem, the linking stage gives the following errors BoostTest.o(.text+0x15b): In function `MyTest()': : undefined reference to `boost::test_tools::tt_detail::test_and_continue_impl(bool, boost::basic_wrap_stringstream<char>&, boost::unit_test::basic_cstring<char const>, unsigned int, bool, boost::unit_test::log_level)' BoostTest.o(.text+0x258): In function `init_unit_test_suite(int, char**)': : undefined reference to `boost::unit_test::test_suite::add(boost::unit_test::test_case*, unsigned long, int)' BoostTest.o(.gnu.linkonce.t._ZN5boost9unit_test16create_test_caseEPFvvESs+0x12): In function `boost::unit_test::create_test_case(void (*)(), std::basic_string<char, std::char_traits<char>, std::allocator<char> >)': : undefined reference to `boost::unit_test::ut_detail::normalize_test_case_name(std::basic_string<char, std::char_traits<char>, std::allocator<char> >&)' BoostTest.o(.gnu.linkonce.t._ZN5boost9unit_test18function_test_caseC1EPFvvENS0_13basic_cstringIKcEE+0x1b): In function `boost::unit_test::function_test_case::function_test_case(void (*)(), boost::unit_test::basic_cstring<char const>)': : undefined reference to `boost::unit_test::test_case::test_case(boost::unit_test::basic_cstring<char const>, bool, unsigned long, bool)' BoostTest.o(.gnu.linkonce.r._ZTVN5boost9unit_test18function_test_caseE+0x10): undefined reference to `boost::unit_test::test_case::size() const' BoostTest.o(.gnu.linkonce.t._ZN5boost9unit_test9test_caseD2Ev+0xc): In function `boost::unit_test::test_case::~test_case()': : undefined reference to `vtable for boost::unit_test::test_case' BoostTest.o(.gnu.linkonce.r._ZTIN5boost9unit_test18function_test_caseE+0x8): undefined reference to `typeinfo for boost::unit_test::test_case' ************************************************************* PLEASE HELP! Josh --------------------------------- Want to be your own boss? Learn how on Yahoo! Small Business.

4 6

Re: [Boost-users] std::vector< boost::shared_ptr<int> >::pop_back()
by Andrew Holden 10 Jul '06

10 Jul '06

You would manually call destructors when you do your own memory management (like std::vector). In this case, you would also need to manually call constructors too. Here is a modified version of your test program that doesn't double-destruct the object. class A { public: A() { counter = 0; } ~A() { counter++; std::cout << "~A(): " << counter << std::endl; } int counter; }; int main(int argc, char* argv[]) { A *a; //Allocate memory using C functions, which do not call constructors a = (A*) malloc (sizeof (A)); cout << a << ' ' << a->counter << std::endl; //Manually call the constructor. The (a) tells the compiler which pointer we are initializing new (a) A (); cout << a << ' ' << a->counter << std::endl; //Manually call the destructor a->~A(); cout << a << ' ' << a->counter << std::endl; //Free memory using C functions, which do not call destructors free (a); return 0; } _____ From: bringiton bringiton [mailto:kneeride@gmail.com] Sent: Monday, July 10, 2006 10:28 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] std::vector< boost::shared_ptr<int> >::pop_back() holy! you learn something every day. you can call the destructor of an object (before destruction) this is a trap for me because i dont clean up my variables in destructors. class A { public: A() { counter = 0; } ~A() { counter++; std::cout << "~A(): " << counter << std::endl; } int counter; }; int main(int argc, char* argv[]) { A a; a.~A(); return 0; } NOTE: destructor gets called twice. (so it's probably a good idea to NULL pointers in destructors) On 7/11/06, bringiton bringiton <kneeride(a)gmail.com> wrote: >>just look at the include files: i looked at the header, but got a little confused. i don't see how you can call a destruct of a a memory space that still exists. ie a C version of a vector. shared_ptr<int> list[1024]; int n = 0; // add an item shared_ptr<int> newItem(new int(1)); list[n++] = newItem; // remove the tail item n--; // destructor never called is it possible to call a destructor of an object that exists? what then happens then the object goes out of scope? the destructor will be called twice. (or maybe i am completely missing the point) BTW: not sure if above code compiles (did it in my head) On 7/10/06, Boris Breidenbach < Boris.Breidenbach(a)physik.uni-erlangen.de <mailto:Boris.Breidenbach@physik.uni-erlangen.de> > wrote: On Mon, Jul 10, 2006 at 03:58:19PM +1000, bringiton bringiton wrote: > This question is based on curiosity. How does std::vector::pop_back() call > the destructor of the item getting removed? > > i understood std::vector to be a contigious array of memory, therefore an > item's memory does not go out of scope when being popped. ie the item goes > out of scope when the entire array goes out of scope. just look at the include files: bits/stl_vector.h says: void pop_back() { --this->_M_impl._M_finish; std::_Destroy(this->_M_impl._M_finish); } so the destructor is called in std::_Destroy. Which can be found in bits/stl_construct.h: /** * @if maint * Destroy the object pointed to by a pointer type. * @endif */ template<typename _Tp> inline void _Destroy(_Tp* __pointer) { __pointer->~_Tp(); } It just calls the destructor. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 2

Re: [Boost-users] std::vector< boost::shared_ptr<int> >::pop_back()
by Andrew Holden 10 Jul '06

10 Jul '06

True. I would not expect a guarantee that malloc/free would be suitable for objects, since they came from a language that doesn't have objects. I was merely looking for a way to demonstrate manually calling both the constructor and destructor without calling either twice, and that happened to work on my platform, and I think will probably work on most. Well, that and I didn't know you could use operator new and operator delete like this. We all learn something new every day. _____ From: Michael Nicolella [mailto:boost@mike-n.com] Sent: Monday, July 10, 2006 2:54 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] std::vector< boost::shared_ptr<int> >::pop_back() I would avoid malloc() and prefer the global operator new... I'm not sure if the standard guarantees that memory allocated with malloc is suitable for constructing an object in. My guess is there's no such guarantee, but there is that guarantee for operator new. Or maybe I'm off my rocker.

1 0

[serialization] save_construct_data problem
by Hugh Hoover 10 Jul '06

10 Jul '06

I have a structure I'm trying to serialize that contains an STL vector of pointers to an abstract base type. When I serialize it, the save_construct_data free function is NOT called - the inline default version is always used. On de-serializing, the load_construct_data IS called! but, of course, fails because the data for it isn't there (although it throws archive_exception (archive_exception::unregistered_class) when it fails). I'm using declarations only for all serialization code, with all definitions in .s.cpp files along with explicit instantiations. Not sure if that affects the problem here. Just in case, I've tried all combinations of save_construct_data with (const)? (Base|Derived) (*|&), and none of them are called. I've also tried putting my declarations before and after the serialization.hpp header with the default declaration/definition. I'm using gcc4 currently. Any notion what might be wrong here?

3 5

Missing example in boost::graph doc
by Loïc Joly 10 Jul '06

10 Jul '06

Hello, In boost::graph doc, I can read (http://www.boost.org/libs/graph/doc/file_dependency_example.html) > A compilation system such as make has to be able to answer a number of questions: > > 1. If we need to compile (or recompile) all of the files, what order should that be done it? > 2. What files can be compiled in parallel? > 3. If a file is changed, which files must be recompiled? > 4. Are there any cycles in the dependencies? (which means the user has made a mistake and an error should be emitted) > I'd like to do something related to the point #3, and looked in the doc, but could not find it. Since I'm not at all a graph expert, I'd like to know whether there is a basic graph algorithm that can be used to remove from a graph all nodes who are not marked as modified and whose all dependencies (recursively) are not marked as modified either. -- Loïc

1 0

memory leaks with signal::connect()
by Elisabeth Benoit 10 Jul '06

10 Jul '06

Hello, I'm sending this message a second time (I didn't receive any response and still have this problem) I'm using boost::bind and boost::signal with VC6. VC6 is detecting some memory leak for a certain type of signal.connect(). I've done a little test program to check if the problem was due to some bug or special configuration in my main program, but the memory leaks are still detected in the test situation. Let me explain the structure of my test program. I have a main, and in the main, an object CCloneAppRecipe named clone. The class CCloneAppRecipe contains a member m_PtrTestMem (a shared pointer, but a raw point or an object does the same thing) of the class CTestMem. CTestMem contains 3 instances of the class CTestTab, and the class CTestTab contains a boost signal typedef boost::signal0<void> TypeSignalTest; TypeSignalTest m_SignalTest; In my main, I invoke clone.connectPtrTestMem(). clone.connectPtrTestMem() then invokes CTestMem::ConnectSignalTriplePtrTab(boost::bind(&CloneAppRecipe::test, this)); ConnectSignalTriplePtrTab() then invokes ConnectSignal(TypeSignalTest::slot_type slot) for each of the 3 instances of the class it contains. ConnectSignal then calls m_SignalTest.connect(slot). And I have a memory leak: 2 blocks of 16 bytes. If I connect only one instance of CTestTab, no leak. Two instances, one leak of 16 bytes. Three, two leaks of 16 bytes, and so on. I connect the m_SignalTest with a CCloneAppRecipe's slot. If I connect it to a CTestMem slot, I have no leak. Or if I place 3 instances of CTestTab directly in the CCloneAppRecipe class (so I don't use CTestMem anymore), I have no leak. But that's not what I need to do. I've tested plenty of variations (shared_pointer or object, etc.) Does anybody have a clue. Thanks #include "stdafx.h" #include "CloneAppRecipe.h" #ifdef _DEBUG #define new DEBUG_NEW #undef THIS_FILE static char THIS_FILE[] = __FILE__; #endif int main() { CloneAppRecipe t; // cree un leak t.connectPtrTestMem(); getchar(); return 0; } void CloneAppRecipe::connectPtrTestMem() { //m_ptrTestMem is a boost::shared_ptr m_ptrTestMem->ConnectSignalTriplePtrTab(boost::bind(&CloneAppRecipe::test, this)); } void CloneAppRecipe::test() const { } void CTestMem::ConnectSignalTriplePtrTab(const TypeSignaTest::slot_type& slot) { //m_ptrTestTab are boost::shared_ptr m_ptrTestTab1->ConnectSignal(slot); m_ptrTestTab2->ConnectSignal(slot); m_ptrTestTab3->ConnectSignal(slot); } void CTestTab::ConnectSignal(const TypeSignalTest::slot_type& slot) { m_SignalTest->connect(slot); } CTestTab::~CTestTab() { m_SignalTest->disconnect_all_slots(); }

2 5

std::vector< boost::shared_ptr<int> >::pop_back()
by bringiton bringiton 10 Jul '06

10 Jul '06

This question is based on curiosity. How does std::vector::pop_back() call the destructor of the item getting removed? i understood std::vector to be a contigious array of memory, therefore an item's memory does not go out of scope when being popped. ie the item goes out of scope when the entire array goes out of scope. example code: the reference count is decremented when the item is popped from the vector. boost::shared_ptr<int> item1(new int(1)); std::vector< boost::shared_ptr<int> > vect1; vect1.push_back(item1); std::cout << item1.use_count() << std::endl; vect1.pop_back(); std::cout << item1.use_count() << std::endl;

3 5

vc-8_0-stlport target : Building Boost with VS2005 & STLPort 5 ?
by Sagnes, Frederic 10 Jul '06

10 Jul '06

Hello, Now that STLPort works for VS2005, I'd like to know if a BJam target for Visual Studio 2005 and STLPort 5.0.2 is available (as a patch for the 1.33 Boost distribution). Is STLPort 5.0 too young for inclusion, or is this target to be available only in the 1.34 version of the Boost libraries distribution? Regards _______________________________________________ Frédéric Sagnes, A&D AS RD DH K3 Siemens AG Karlsruhe

1 0

[boost.python] use of multi_array in python
by Sebastien Fortier 10 Jul '06

10 Jul '06

I'm having some problems with the use of multi_array's with python. What I'm trying to do is to export some functions that create multi_array's and pass these multi_array's to other functions that will extract other array's from them and display them. Lets say I have this as an example. //ArrayRef2D.h typedef for a 2D multi_array of doubles #ifndef ARRAYREF2D_H_ #define ARRAYREF2D_H_ #include <boost/multi_array.hpp> typedef boost::const_multi_array_ref < double, 2 > const_array_type2D_ref_d_t; typedef boost::multi_array < double, 2 > array_type2D_d_t; #endif /*ARRAYREF2D_H_*/ //Fstd.h 2D multi_array generator #ifndef FSTD_H_ #define FSTD_H_ #include "ArrayRef2D.h" #include <string> using namespace std; class Fstd { public: Fstd(string filename) : filename_(filename){} array_type2D_d_t get2Dfield() { array_type2D_d_t matrix(boost::extents[2][2]); matrix[0][0] = 0; matrix[0][1] = -1; matrix[1][0] = 20; matrix[1][1] = -30; return matrix; } private: string filename_; }; #endif /*FSTD_H_*/ //MatrixAlgorithm2D.h provides methods for displaying and manipulating matrices #ifndef MATRIXALGORITHM2D_H_ #define MATRIXALGORITHM2D_H_ #include "ArrayRef2D.h" #include <cassert> #include <cmath> #include <iostream> using namespace std; class MatrixAlgorithm2D { public: static array_type2D_d_t windChill(const_array_type2D_ref_d_t TT, const_array_type2D_ref_d_t UV) { assert((TT.shape()[0] == UV.shape()[0]) && (TT.shape()[1] == UV.shape()[1])); array_type2D_d_t RE(boost::extents[TT.shape()[0]][TT.shape()[1]]); for (unsigned int x = 0; x < TT.shape()[0]; x++) { for (unsigned int y = 0; y < TT.shape()[1]; y++) { if ((TT[x][y] <= 0.0) && (UV[x][y] >= 5.0)) { RE[x][y] = ( 13.1200 + 0.6215 * (TT[x][y]) + (0.3965 * (TT[x][y]) - 11.3700) * (pow((UV[x][y]),0.16))); } else { RE[x][y] = (TT[x][y]); } } } return RE; } static void display_d(const_array_type2D_ref_d_t a) { for (unsigned int x = 0; x < a.shape()[0]; x++) { for (unsigned int y = 0; y < a.shape()[1]; y++) { cout << a[x][y]; if(y < a.shape()[1] - 1) { cout << ", "; } } cout<<endl; } } }; #endif /*MATRIXALGORITHM2D_H_*/ //matrix.cpp boost.python interface file generated with pyste // Boost Includes ============================================================== #include "boost/python.hpp" #include "boost/cstdint.hpp" // Includes ==================================================================== #include "Fstd.h" #include "MatrixAlgorithm2D.h" // Using ======================================================================= using namespace boost::python; // Module ====================================================================== BOOST_PYTHON_MODULE(matrix) { class_< Fstd >("Fstd", init< const Fstd& >()) .def(init< std::string >()) .def("get2Dfield", &Fstd::get2Dfield) ; class_< MatrixAlgorithm2D >("MatrixAlgorithm2D", init< >()) .def(init< const MatrixAlgorithm2D& >()) .def("windChill", &MatrixAlgorithm2D::windChill) .def("display_d", &MatrixAlgorithm2D::display_d) .staticmethod("windChill") .staticmethod("display_d") ; } I generated my so file with bjam and then Python 2.3.5 (#2, Sep 4 2005, 22:01:42) [GCC 3.3.5 (Debian 1:3.3.5-13)] on linux2 Type "help", "copyright", "credits" or "license" for more information. >>> import matrix >>> dir(matrix) ['Fstd', 'MatrixAlgorithm2D', '__doc__', '__file__', '__name__'] >>> m = matrix.Fstd("HELLO") >>> l = m.get2Dfield() Traceback (most recent call last): File "<stdin>", line 1, in ? TypeError: No to_python (by-value) converter found for C++ type: boost::multi_array<double, 2, std::allocator<double> > So you see I can't use my code, what am I doing wrong? I would have liked to declare 2 arrays with get2Dfield() and pass these array to my windChill function to get another 2d matrix which I could then display with my display_d function. -- Sébastien Fortier

2 8

[shmem] Bug I can't workaround
by Berenguer Blasi 10 Jul '06

10 Jul '06

Hi, first of all congratulations to Ion for this great library. I am trying to use shmem for a very large project and I have stumbled several bugs (you can read about them at the sourceforge bugtracker) I have workarounded so far, but there's one I can't workaround. Maybe somebody has found a solution? How to reproduce: 1- Any sample code will do (you can use the sample source at 'Quick Guide for the Impatient' -> 'Using STL containers and mapping the memory at a fixed address') 2- Change to a fixed_named segment, if it isn´t so already in your sample, and increase the segment size to 104857600. I guess it's not a matter of this specific size but something that happens for large segments. 3- Leave process A running in the background, run process B and you get a segmentation fault... 4- You won't have the problem for sizes: 1048576 or 10485760. Has anybody experienced something similar? Thanks in advance. It's driving me crazy! and I am so close to finishing my code. Only this bug pending! Environment: FC 5, gcc4.1.1-1

1 0

[variant].[apply_visitor] Binary visitation: Build related problem.
by Prashant Thakre 10 Jul '06

10 Jul '06

Hi, Compiler instantiates the second Binary visitor instead of the first one even though the template parameters are same. regards, Prashant --------------------------------------------------------------------------- struct add_tuple_visitor: public boost::static_visitor<bool> { // Expected this to be instantiated by the compiler. // 1. template <typename T> bool operator()( T & lhs, const T & rhs) const { lhs += rhs ; return true; } // Compiler considers this as an appropriate fit .. // 2. template <typename T, typename U> bool operator()( T & lhs, const U & rhs) const { lhs += rhs ; return true; } }; struct agg_calc { public: template <typename T> bool operator () ( T & lhs, const T & rhs ) const { for( std::size_t curr_oper = 0; curr_oper < num_operations; ++v ) { switch( agg_operators.at(curr_oper) ) { case '+' : boost::apply_visitor( agg_visitor, lhs.at(curr_oper), //vector of variants rhs.at(curr_oper) //vector of variants ); break; default: break; }; } // for loop return true; } //Store the aggregation operators agg_types agg_operators; std::size_t num_operations; // Create visitor objects for delayed form of apply_visitor add_tuple_visitor agg_visitor; }; ---------------------------------------------------------------------------

1 0

[variant] apply_visitor to rvalue variant
by Marc Mutz 10 Jul '06

10 Jul '06

Hi, My gcc 4.0 doesn't let me call apply_visitor on an rvalue variant. This is due to the Variant argument being a non-const reference, I guess. Is this a deliberate design decision (if so, the rationale should be documented), an oversight (in that case, it should be fixed), or a compiler bug (highly unlikely, since all of gcc 3.2 through 4.1 would then have it). Testcase (== usecase) attached. Thanks, Marc -- Marc Mutz -- marc(a)klaralvdalens-datakonsult.se, mutz(a)kde.org Klarälvdalens Datakonsult AB, Platform-independent software solutions

1 0

Problems trying to use boost book
by Robert Ramey 10 Jul '06

10 Jul '06

I'm interested in setting up quickbook/boostbook/docbook for my windows NT machine. To that end I've religously followed the instructions in http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boostbook/g… (Not including installing Java) I get to "Running Boost Book". Following the instructions there I invoke bjam --v2 and get: the following response $ bjam --v2 warning: Python location is not configured warning: the Boost.Python library won't be built 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). warning: no toolsets are configured. warning: you won't be able to build C++ programs. warning: please consult the documentation at warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html I've verified the current directory $ pwd C:/BoostHead/doc and that xsltproc is in my path $ xsltproc Usage: xsltproc [options] stylesheet file [file ...] Options: --version or -V: show the version of libxml and libxslt used --verbose or -v: show logs of what's happening --output file or -o file: save to a given file --timing: display the time used --repeat: run the transformation 20 times --debug: dump the tree of the result instead --dumpextensions: dump the registered extension elements and functions t o stdout --novalid skip the Dtd loading phase --nodtdattr do not default attributes from the DTD --noout: do not dump the result --maxdepth val : increase the maximum depth --maxparserdepth val : increase the maximum parser depth --html: the input document is(are) an HTML file(s) --param name value : pass a (parameter,value) pair value is an UTF8 XPath expression. string values must be quoted like "'string'" or use stringparam to avoid it --stringparam name value : pass a (parameter, UTF8 string value) pair --path 'paths': provide a set of paths for resources --nonet : refuse to fetch DTDs or entities over network --nowrite : refuse to write to any file or resource --nomkdir : refuse to create directories --writesubtree path : allow file write only with the path subtree --catalogs : use SGML catalogs from $SGML_CATALOG_FILES otherwise XML Catalogs starting from file:///etc/xml/catalog are activated by default --xinclude : do XInclude processing on document intput --load-trace : print trace of all external entites loaded --profile or --norman : dump profiling informations Project libxslt home page: http://xmlsoft.org/XSLT/ To report bugs and get help: http://xmlsoft.org/XSLT/bugs.html Same goes for doxygen $ doxygen Doxyfile not found and no input file specified! Doxygen version 1.4.7 Copyright Dimitri van Heesch 1997-2006 You can use doxygen in a number of ways: 1) Use doxygen to generate a template configuration file: doxygen [-s] -g [configName] If - is used for configName doxygen will write to standard output. 2) Use doxygen to update an old configuration file: doxygen [-s] -u [configName] 3) Use doxygen to generate documentation using an existing configuration file: doxygen [configName] If - is used for configName doxygen will read from standard input. 4) Use doxygen to generate a template style sheet file for RTF, HTML or Latex. RTF: doxygen -w rtf styleSheetFile HTML: doxygen -w html headerFile footerFile styleSheetFile [configFile] LaTeX: doxygen -w latex headerFile styleSheetFile [configFile] 5) Use doxygen to generate an rtf extensions file RTF: doxygen -e rtf extensionsFile If -s is specified the comments in the config file will be omitted. If configName is omitted `Doxyfile' will be used as a default. ************ I don't get any .html files created in the html directory. So now I'm stuck. Please help. FYI - a couple of comments on getting/started.html (very strange name!) Its not altogether clear from reading the documentation whether things like DOCBOOK_XSL_DIR should be an exported environmental variable with the value set to the appropriate directory or if the actual directory name should be substitued where DOCBOOK_XSL_DIR appears in the example. I presumed the former. I've double checked this like so: $ ls "$DOCBOOK_XSL_DIR" AUTHORS RELEASE-NOTES.txt javahelp BUGS RELEASE-NOTES.xml lib COPYING TODO manpages ChangeHistory.xml.zip VERSION params ChangeLog.xml catalog.xml profiling INSTALL common slides LOG eclipse template NEWS extensions test.sh NEWS.html fo tools NEWS.xml html uninstall.sh README htmlhelp website RELEASE-NOTES.html images wordml RELEASE-NOTES.pdf install.sh xhtml $ ls "$DOCBOOK_DTD_DIR" ChangeLog catalog.xml dbhierx.mod docbook.cat soextblx.dtd README dbcentx.mod dbnotnx.mod docbookx.dtd calstblx.dtd dbgenent.mod dbpoolx.mod ent $ So what am I missing? Robert Ramey

3 6

trouble with bind+signals
by Brendan Miller 10 Jul '06

10 Jul '06

I'm relatively new to the boost library and I'm having a problem with boost::signals and bind. I've reproduced the problem I'm hitting here. c++: typedef boost::signal <LRESULT (ISigSource &, LPCREATESTRUCT)> SigWMCreate; SigWMCreate sig; LPARAM x; boost::bind(boost::ref(sig), boost::ref(*this), _1)((LPCREATESTRUCT)(x)); The above function application generates the following warning on msvc 8/vs2005: Error 1 error C2664: '__w64 long boost::_bi::bind_t<R,F,L>::operator ()<LPCREATESTRUCT>(A1 &) const' : cannot convert parameter 1 from 'LPCREATESTRUCT' to 'LPCREATESTRUCT &' c:\documents and settings\catphive\my documents\visual studio 2005\projects\game\game\mainfrm.cpp 20 Now, this problem goes away if x is of type LPCREATESTRUCT to start with instead of another type converted to LPCREATESTRUCT within the parentheses of the function application. This seems a bit odd to me. Also, I'd like to avoid changing how the function application is performed and get to the root of the problem since in my *actual* code, the application is performed in a system macro, and I'd like to avoid changing external headers (and having to remember what I changed in case of an update to the headers) if possible. My guess is that performing the cast creates an intermediary result that I'm not allowed to take a reference of. Is this the case? Does this happen on other compilers with analogous types? Is there a way to work around this? Thanks

2 2

[parameter] Interface questions
by Cromwell Enage 09 Jul '06

09 Jul '06

1. Will BOOST_PARAMETER_IMPL(name) expand to the name of the function that actually "owns" the main body of code? 2. Will there be a way to define a Boost.Parameterized member function outside the class definition? Or should we let the compiler decide whether or not to inline such a function? Cromwell D. Enage __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 4

uint_t<bits>::value where bits is a template parameter fails to compile
by Phil Endecott 07 Jul '06

07 Jul '06

Dear All, I am having trouble using the integer library. The following fails to compile: #include <boost/integer.hpp> template <int bits> void fn(void) { //typedef boost::uint_t<8>::least t; typedef boost::uint_t<bits>::least t; t var; } int main(int argc, char* argv) { fn<8>(); } With g++ 4.0.0 on Linux and Boost 1.32, I get: boost_int_test.cc: In function â€˜void fn()â€™: boost_int_test.cc:7: error: expected initializer before â€˜tâ€™ boost_int_test.cc:8: error: â€˜tâ€™ was not declared in this scope boost_int_test.cc:8: error: expected `;' before â€˜varâ€™ The problem seems to occur when I use a template parameter - "bits" in this case - as the template parameter to uint_t. If I use a constant (as in the commented-out line) it works. Is this a C++ feature, or a bug somewhere? Can anyone suggest a workaround? Thanks, Phil.

2 1

[spirit] working with end_p
by james.jones＠firstinvestors.com 07 Jul '06

07 Jul '06

From: Neil Hunt <boost(a)thehunts.id.au> > Hello all, > > Given a simple spirit grammar (simplified from my real grammer and > untested) such as: > > file = *line; > line = sensible_line >> ending >> *comment; > sensible_line = confix_p( '\"', *c_escape_ch_p, '\"' ); > comment = !( ch_p(';') >> ( anychar_p - eol_p ) ) >> ending; > ending = *blank_p >> ( eol_p | end_p ); > > > Note: any given line can be legitimately terminated by the end of the > file or end of line > > And there can be arbitrary numbers of comment lines between sensible lines. > > However since 'comment' is terminated with 'ending', the parser ends up > in an infinite loop matching the kleene star on end_p because it returns > zero length (doesn't advance the scanner). At least I think this is the > problem. Indeed. You can fix it by adjusting your grammar thus: line = sensible_line >> (ending >> comment)* >> ending; sensible_line ... as before comment = !( ch_p(';') >> ( anychar_p - eol_p ) ); ending ... as before - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

[serialization] Facets for writing and reading infinity and nan to text streams
by Johan Råde 07 Jul '06

07 Jul '06

Following a suggestion of Robert Ramey's, I have put together facets for writing and reading non-finite floating point numbers, such as infinity and nan, to text streams, in a consistent and portable way. This is useful when serializing to text archives, but should have other applications as well. I have attached a zip file. It contains three files: 1. the actual code: non_finite_num_facets.hpp 2. documentation: non_finite_num_facets_doc.txt 3. tests: non_finite_num_facets_test.cpp The code handles char and wchar_t. It handles float, double and long double. The code has been tested with VC++ 7.1 but should work with other compilers as well. Any feedback is wellcome. --Johan Råde (rade(a)maths.lth.se)

2 3

std::find_if, boost::mem_fn and boost::not1
by Pete Hodgson 06 Jul '06

06 Jul '06

Hi All, I'm just getting into using boost and stl algorithms, and I'm getting some indecipherable compiler errors that I'd like some help understanding. Here's some sample code: <------------------------SNIP------------------------> #include <boost/shared_ptr.hpp> #include <boost/functional.hpp> #include <boost/bind.hpp> class CEgg { public: bool IsHatched() const; }; typedef std::vector< boost::shared_ptr<CEgg> > tEggsVector; //this function compiles with no problems bool SomeEggsHaveHatched() { tEggsVector basketOfEggs; tEggsVector::const_iterator it = std::find_if( basketOfEggs.begin(), basketOfEggs.end(), boost::mem_fn( &CEgg::IsHatched ) ); bool bSomeEggsHaveHatched = ( it != basketOfEggs.end() ); return bSomeEggsHaveHatched; } //this function doesn't compile, //presumably because of the boost::not1 usage bool AllEggsHaveHatched() { tEggsVector basketOfEggs; tEggsVector::iterator it = std::find_if( basketOfEggs.begin(), basketOfEggs.end(), boost::not1( boost::mem_fn( &CEgg::IsHatched ) ) ); bool bSomeEggsHaventHatched = ( it != basketOfEggs.end() ); return !bSomeEggsHaventHatched; } <------------------------SNIP------------------------> When I try and compile this in Visual C++ 2003 I get the following compile errors for AllEggsHaveHatched(): c:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\algorithm(64) : error C2664: 'bool boost::unary_negate<Predicate>::operator ()(const boost::call_traits<T>::param_type) const' : cannot convert parameter 1 from 'std::allocator<_Ty>::value_type' to 'const boost::call_traits<T>::param_type' with [ Predicate=boost::_mfi::cmf0<bool,CEgg>, T=boost::unary_traits<boost::_mfi::cmf0<bool,CEgg>>::argument_type ] and [ _Ty=boost::shared_ptr<CEgg> ] and [ T=boost::unary_traits<boost::_mfi::cmf0<bool,CEgg>>::argument_type ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called c:\WORK\4DCapture_Soln\VideoCapture\PixelinkCaptureFacade.h(46) : see reference to function template instantiation '_InIt std::find_if<std::vector<_Ty>::iterator,boost::unary_negate<Predicate>>(_InIt,_InIt,_Pr)' being compiled with [ _InIt=std::vector<boost::shared_ptr<CEgg>>::iterator, _Ty=boost::shared_ptr<CEgg>, Predicate=boost::_mfi::cmf0<bool,CEgg>, _Pr=boost::unary_negate<boost::_mfi::cmf0<bool,CEgg>> ] Any idea why boost::not1 seems to be causing problems? Should I be using std::not1? or boost::mem_fun instead of boost:mem_fn? Cheers and TIA, Pete

3 6

Boost compile fails on Visual C++ 6, warnings on VS8
by Sagnes, Frederic 06 Jul '06

06 Jul '06

Hello, I'm using the Boost libraries for my project (archive, threads, program_options, date_time) and these are really helpful, saved me a lot of time and the great designs make them easy to use. I'm compiling my project with Visual Studio 2005 (8.0) and gcc 4.0.1. Both work quite well, I only have warnings on VS8 because it seems to render integer operation in 64 bit and no cast is being done (a static cast would fix this), some deprecation warning which are normal, and the GCC build works well. But the VC++ 6 compilation is a real pain, here is the command line for BJam: bjam "-sTOOLS=msvc" "-sMSVC_ROOT=C:\Programme\Microsoft Visual Studio\VC98" "-sVISUALC=C:\Programme\Microsoft Visual Studio\VC98" --prefix=D:\ALM\Boost\msvc install I get a lot of compilation errors, including internal compiler errors which are quite alarming. I thought Boost libraries were meant to be portable and compile on VS6. The archive library for instance fails to build. Is there a workaround to build Boost libraries on VS6? Did I miss a switch or setting? Is VS6 that bad that it can't render complex but standard C++ code? Where can I check with which compiler Boost libraries are compatible? Best regards _______________________________________________ Frédéric Sagnes, A&D AS RD DH K3 Siemens AG Karlsruhe

2 1

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

06 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

[date_time] unused parameter warnings with gcc
by Brian Neal 05 Jul '06

05 Jul '06

Just a suggestion: We like to compile with lots of warning turned on and try to strive for warning free builds. Under gcc, with the -Wall -W options, we get a lot of "warning: unused parameter" warnings with the date_time library. For example, /usr/include/boost-1_33/boost/date_time/time_facet.hpp:202: warning: unused parameter 'a_ref' It looks like a lot of these could be fixed by /* commenting out */ the unused parameter names; e.g. explicit time_facet(::size_t /* a_ref */ = 0) ... Thanks.

1 0

Re: [Boost-users] [boost] [Announce] Boost Installer for Visual C++ 7.1/8.0
by Trent Nelson 05 Jul '06

05 Jul '06

> Boost Consulting is pleased to announce the availability of a Windows > installer for the current Boost release (1.33.1). See: > > http://www.boost-consulting.com/download.html Any plans to make the .nsi file you're using public? There may be a few of us out there that have experience with Nullsoft and could contribute to the installer in some way, shape or form. Trent.

4 4

vectors with multiindex
by Adán Cosgaya 05 Jul '06

05 Jul '06

hi, i am new using the multiindex library, and I need to do the following. I have a set of d-dimensional points (e.g (3,5,8,9,5) is a 5-dimensional point), and I need to sort the points on each of the coordinates. I want to store the points in a vector, and use multiindex to have all the points (vectors in this case) sorted in each of the coordinates. E.g. sorted by x: x y z w ----------- 0 0 0 0 1 2 7 4 2 3 1 1 3 1 3 3 4 5 2 9 sorted by y: 0 0 0 0 3 1 3 3 1 2 7 4 2 3 1 1 4 5 2 9 etc... would you mind pointing me in the right direction with an example of how to do it with multiindex library? thanks

3 3

[mpl] a few questions about set and map
by Yuval Ronen 05 Jul '06

05 Jul '06

I spent some time reading the mpl docs, and I have a few questions about mpl::set and mpl::map. 1. The docs assert there is a 'front' algorithm for set and map. This sounds weird to me, as the order of the types is them unspecified. But if I'm wrong, and 'front' is in place, then where is 'back'? 2. Where's multiset and multimap? In the boost/mpl directory I see something about multiset, but no real boost/mpl/multiset.hpp header, and there's absolutely nothing about multimap. 3. The docs say that the size of joint_view is the arithmetic sum of the sizes of the sequences of which it's composed. Is that true also in the case of set/map? For an mpl newbie it sounds reasonable that it will removed duplicates and might end up with a size that is smaller than the sum of its components. If it's not, then it sounds quite useless to use it for set/map. Thanks, Yuval

4 20

How to find ancestor nodes in a graph, thanks
by sean yang 05 Jul '06

05 Jul '06

Hi folks, I want to find all the nodes that can reach a specific node 'target_n'. Let's say, an example graph looks like this: G= (V, E), where V={A, B, C, target_1, target_2, D, E, F}, and E= { (A-->B), (B-->target_1), (C-->target_2), (A-->target_2), (D-->E), (E-->F), (F-->D), } In this example, I want to find out(say print them out) 'A', 'B', 'C'. Now, I have a graph representation like the following one . ------------------------------ typedef adjacency_list<vecS, vecS, bidirectionalS, VertexNameProperty > Graph; Graph travel; --------------------------------- And I have already read in the above information to the Graph travel. One way I am thinking of to achieve the above goal is: reverse the direction of edges in G, i.e., getting a G', first; and then do BFS from target_n nodes. My question is: (1) is there an easy (some API, sorry I am not familar with the library) way to reverse edge direction? (2) is there an easy way to add a 'printf()' during BFS? Thanks, Sean _________________________________________________________________ FREE pop-up blocking with the new MSN Toolbar get it now! http://toolbar.msn.click-url.com/go/onm00200415ave/direct/01/

2 1

[serialization] infinite floating point values
by Johan Råde 05 Jul '06

05 Jul '06

I just replaced the binary archives by text archives in an app, to make sure that the archives will be portable between 32 and 64 bit platforms. But when I use text archives, the app crashes. The problem is: Text archives do not handle infinite values of type float and double. --- Example ---------------------------------------------------------- #include <iostream> #include <limits> #include <sstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/format.hpp> int main() { std::stringstream ss; { boost::archive::text_oarchive oa(ss); double inf1 = std::numeric_limits<double>::infinity(); std::cout << boost::format("Save: %1%\n") % inf1; oa << inf1; } { boost::archive::text_iarchive ia(ss); double inf2; ia >> inf2; std::cout << boost::format("Load: %1%\n") % inf2; } } --- Output ---------------------------------------------------------- Save: 1.#INF Load: 1 --------------------------------------------------------------------- There are two infinite values of type double, std::numeric_limits<double>::infinity() and -std::numeric_limits<double>::infinity(). These could be represented as "inf" and "-inf" in the archive. I would be very useful for me if this functionality were added to the serialization library. (Otherwise I will have to do a lot of code rewriting, or stick binary archives.) One could also consider handling nan (not a number), but that is maybe a lower priority. --Johan Råde rade(a)maths.lth.se

2 4

[spirit] working with end_p
by Neil Hunt 05 Jul '06

05 Jul '06

Hello all, Given a simple spirit grammar (simplified from my real grammer and untested) such as: file = *line; line = sensible_line >> ending >> *comment; sensible_line = confix_p( '\"', *c_escape_ch_p, '\"' ); comment = !( ch_p(';') >> ( anychar_p - eol_p ) ) >> ending; ending = *blank_p >> ( eol_p | end_p ); Note: any given line can be legitimately terminated by the end of the file or end of line And there can be arbitrary numbers of comment lines between sensible lines. However since 'comment' is terminated with 'ending', the parser ends up in an infinite loop matching the kleene star on end_p because it returns zero length (doesn't advance the scanner). At least I think this is the problem. By using: ending = *blank_p >> eol_p ; the parser runs to completion, but any given line must be terminated by an end of line sequence. Any suggestions on how to fix this problem? Thanks for any help offered, Neil Hunt

2 1

error using lambdas: conversion from 'x' to non-scalar type 'y'
by klaus triendl 05 Jul '06

05 Jul '06

Hi, I'm rather new to lambdas. I wanted to use them to stream objects into a special stream (not a stl stream). the following code outlines the situation: ---- #include <iostream> #include <list> #include <algorithm> #include <boost/ref.hpp> #include <boost/shared_ptr.hpp> #include <boost/lambda/lambda.hpp> using namespace std; using namespace boost; using boost::lambda::_1; class MyStream { public: MyStream() {} }; class MySubStream: public MyStream { public: MySubStream(MyStream*) {} }; MyStream& operator <<(MyStream& os, const int&) { return os; } int main() { list<shared_ptr<int> > cont; MyStream osTop; MySubStream osSub(&osTop); for_each(cont.begin(), cont.end(), ref(osSub) << *_1); return 0; } ---- g++ outputs error: '/usr/include/boost/lambda/detail/operator_lambda_func_base.hpp:212: error: conversion from 'MyStream' to non-scalar type 'MySubStream' requested'. MS VC 2003.net says: boost\lambda\detail\operator_lambda_func_base.hpp(212) : error C2664: 'MySubStream::MySubStream(MyStream *)' : cannot convert parameter 1 from 'MyStream' to 'MyStream *'. The question is whether my code is correct at all and how I could use lambdas the right way. Thanks! Klaus Triendl

2 4

Re: [Boost-users] shared_ptr + const_cast woes
by Evan Drumwright 04 Jul '06

04 Jul '06

Hi guys, Thanks for your help, in particular Stefan's reworked code fragment. I actually did read the documentation for shared_ptr (in particular, the section on const_pointer_cast), but got confused by the counterexample (I thought that it was saying not to use a temporary). Thanks again, Evan >Message: 5 >Date: Wed, 28 Jun 2006 10:33:19 -0400 >From: me22 <me22.ca(a)gmail.com> >Subject: Re: [Boost-users] shared ptr + const_cast woes >To: boost-users(a)lists.boost.org >Message-ID: <fa28b9250606280733u5125fa01p92da87e1e8f9ad0f(a)mail.gmail.com> >Content-Type: text/plain; charset=UTF-8; format=flowed >Take a closer look at what this is doing: >> boost::shared_ptr<const int> y(const_cast<const >int*>(x.front().get())); >To be more explicit, it's the same as > int *ip = x.front().get(); > int const *cip = ip; > boost::shared_ptr<const int> y( cip ); >At y you're creasing another shared_ptr to the same address that >doesn't share ownership with the one in x.front(). > >What you really want is const_pointer_cast : >http://boost.org/libs/smart_ptr/shared_ptr.htm#const_pointer_cast > >From the documentation for the above-mentioned const_pointer_cast: >Notes: the seemingly equivalent expression >shared_ptr<T>(const_cast<T*>(r.get())) >will eventually result in undefined behavior, attempting to delete the same >object twice. >Which is exactly your problem. > >~ Scott McMurray ------------------------------ >Message: 6 >Date: Wed, 28 Jun 2006 11:59:12 -0230 >From: Stefan Tarrant <stefan.tarrant(a)c-core.ca> >Subject: Re: [Boost-users] shared ptr + const_cast woes >To: boost-users(a)lists.boost.org >Message-ID: <44A29238.9040800(a)c-core.ca> >Content-Type: text/plain; charset=ISO-8859-1; format=flowed >When you use get() all bets are off. You are basically taking >responsibility for the ownership of the returned pointer yourself, which is >generally a bad idea. Use a const_pointer_cast<T> instead. >Here is my re-worked example: > >#include <vector> >#include <iostream> >#include <boost/shared_ptr.hpp> > >int main() >{ > std::vector<boost::shared_ptr<int> > x; > x.push_back(boost::shared_ptr<int>(new int)); > *x.front() = 4; > std::cout << "use count: " << x.front().use_count() << std::endl; > boost::shared_ptr<const int> y = x.front(); > std::cout << "use count: " << x.front().use_count() << std::endl; > std::cout << "use count: " << y.use_count() << std::endl; > boost::shared_ptr<int> z = boost::const_pointer_cast<int>(y); > std::cout << "use count: " << z.use_count() << std::endl; > std::cout << "use count: " << y.use_count() << std::endl; > x.pop_back(); > std::cout << *y << std::endl; > std::cout << "use count: " << z.use_count() << std::endl; > std::cout << "use count: " << y.use_count() << std::endl; > > y.reset(); > std::cout << "use count: " << z.use_count() << std::endl; > std::cout << "use count: " << y.use_count() << std::endl; >} > >And the output: > >use count: 1 >use count: 2 >use count: 2 >use count: 3 >use count: 3 >4 >use count: 2 >use count: 2 >use count: 1 >use count: 0 >Press any key to continue . . . > >-- >Stefan Tarrant >Senior Project Engineer >C-CORE >Captain Robert A. Bartlett Building >Morrissey Road >St. John's, NL >Canada A1B 3X5

1 0

boost pool
by michelle Tchicaya 04 Jul '06

04 Jul '06

Hello, I am very new to C++. And I want to use Boost thread and Boost Pool to create a multithreaded application which will handle real time messages. I need ONE Boost Pool. But I dont know how to combine it with thread Thank a lot for your help mimi

1 0

Re: [Boost-users] [boost] Convert function pointer type to function type
by Peter Soetens 04 Jul '06

04 Jul '06

Quoting Peter Dimov: > Peter Soetens wrote: >> Hi, >> >> I'm desperately seeking for doing this conversion using the boost >> libraries. User code often provides a function pointer, while library >> code often works with function types. [...] > > One obvious way is > > template<class F> boost::function<F> function_wrapper( F * pf ) > { > return boost::function<F>( pf ); > } > > but a more interesting question is why do you need a function_wrapper at > all. Everything that you could do with the returned function<F> (call it) is > also possible with pf itself. Looking at the simplicity of that answer, this was clearly a boost-users question :-]. Sorry. This was a minimalistic example, removing the context. The big picture uses boost::function<F> to store partially bound objects, since this is a way to store the result of boost::bind for later use in a not templated class. I got confused by the boost::function_traits<T>, which only takes a "function type" and not a "function pointer type." I assumed one was not convertible to the other. I tried using boost::remove_pointer<F>, which didn't work and confirmed back then my assumption (confusingly, is_pointer<F> did work, but I could not remove it using type_traits...) My books write about function pointer types but do not mention 'function types'. These concepts appear to me underdocumented in standard C++ works. *Thanks a lot*. Peter -- www.fmtc.be ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

1 0

Re: [Boost-users] [BGL] All Possible Matchings (Hossein Haeri)
by Grégoire Dooms 04 Jul '06

04 Jul '06

boost-users-request(a)lists.boost.org wrote: Message: 9 Date: Mon, 3 Jul 2006 16:46:55 +0100 (BST) From: Hossein Haeri <powerprogman(a)yahoo.com> Subject: [Boost-users] [BGL] All Possible Matchings To: boost-users(a)lists.boost.org Message-ID: <20060703154655.35182.qmail(a)web53405.mail.yahoo.com> Content-Type: text/plain; charset=iso-8859-1 > Dear all, > > I have a bipartite graph, and want to generate all its > possible matchings. Any suggestions? > You should have a look at Constraint Programming and the Alldifferent constraint. In CP, the task of filtering for a constraint over some integer variables amounts to partitioning, for each of its variables, the potential values into three categories: the values participating in all solutions (obviously at most one per variable), the values participating in some solutions, and the values participating in no solutions. In the case of the Alldifferent constraint, it can be reinterpreted in graph matching terms: Build a bipartite variable-value graph. A solution to the Alldifferent constraint is a maximum matching covering all variables in this graph. Hence filtering can be done by identifying edges which belong to some/all/no max matching. In a nutshell, the following property of matchings is used [Peterson] [Berge] : M1 (+) M2 = P M1 (+) P = M2 where P is an alternating path (for instance, look at the LEDA book for a good exposition of this property and matching algorithms). This property is used in matching algorithms with P an augmenting alternating path. If you consider "maintaining" paths (eg. non-augmenting and non-decreasing -- even length, starting at a free node and ending at a covered node, or an alternating cycle) and apply them on a max matching you get another max matching. Here are a few references: Ref. to the original paper : http://citeseer.ist.psu.edu/context/210815/0 A survey on this subject: http://citeseer.ist.psu.edu/579391.html (or http://www.cs.cornell.edu/~vanhoeve/papers/alldiff.pdf for a more recent/in progress version) Slides by JC Regin: http://www.constraint-programming.com/people/regin/papers/GraphAndCP.pdf Finally, an open-source implementation: http://www.gecode.org/gecode-doc-latest/distinct_2dom_8icc-source.html Hope this helps, -- Grégoire Dooms.

1 0

When to use thread.join()
by Simon Reye 04 Jul '06

04 Jul '06

My apologies if this has been covered. I am new to boost and have been working with the boost thread class. I assume that the join() function waits for the thread to finish execution. But what if the thread has already finished executing? Can I still call join() and have it not wait for infinity? Simon

2 2

[Spirit] puts namespace std into the global scope
by Johan Råde 04 Jul '06

04 Jul '06

It seems that the header boost/spirit.hpp puts the entire namespace std into the global scope. That is not very nice! --- Example 1 -------- #include <string> #include <sstream> #include <fstream> #include <vector> #include <boost/spirit.hpp> void f() { string s; istringstream iss; ofstream ofs; vector<int> v; } ---------------------- Example 1 should not compile (undefined symbols), but does compile. If the line #include <boost/spirit.hpp> is removed, then Example 1 does not compile. --- Example 2 -------- #include <boost/filesystem/path.hpp> #include <boost/filesystem/fstream.hpp> #include <boost/spirit.hpp> using boost::filesystem::path; using boost::filesystem::ifstream; void g() { path p; ifstream ifs(p); } ---------------------- Example 2 should compile but does not. The compiler complains that the symbol ifstream is ambigous. If the line #include <boost/spirit.hpp> is removed, then Example 2 does compile. I´m using Boost 1.33.1 and MSVC 7.1 on a Windows XP computer. --Johan Råde rade(a)maths.lth.se

3 3

auto-diff expression templates-> MPL
by Russell L. Carter 03 Jul '06

03 Jul '06

Greetings, This is a beginner question about the MPL. I'm building a general purpose simulation program which will have an optimization module as well as an internal ODE solver which requires derivatives of the implemented algorithm in various forms. Around 1998-2002 there was a lot of enthusiasm for generating the derivatives automatically using expression templates. I'm not quite through with an exhaustive review of the literature but it appears the various efforts ran to ground on the compilation memory and cpu requirements that evaluating expression templates in their original form required. So 1st question, has anybody done something like this with mpl/fusion sequences and algorithms? Has there been an improvement in compile time performance? Do you have any pointers to trivial examples? I've read Alexandrescu, and Abrahams & Gurtovoy and it's not clear to me how to map the expression templates as described in the earlier efforts onto mpl sequences and algorithms. That's probably enough for now. Thanks for any help. Russell

1 0

[shmem] and kernel 2.4 / linuxthreads
by Sascha Lumma 03 Jul '06

03 Jul '06

Hi all, I noticed that kernel 2.6 is a requirement for shmem on linux. Is it possible to get shmem to run - maybe with constraints - together with kernel 2.4 and the older pthread version (linuxthreads)? A start on a kernel 2.4 box produces a segmentation fault in shared_memory.hpp. To reach most users as possible, it would be nice to be compatible or if not possible to get as a minimum a normal termination. Sascha Lumma

2 2

[BGL] python bindings build graph from edge list
by John Reid 03 Jul '06

03 Jul '06

Hi, I was trying to build a graph from an edge list and ran into some problems. The following code throws an exception on write_graphviz(). I think it is because there's no property map called node_id in the graph. import boost.graph as bgl edges = [ ( 'a', 'b' ), ( 'b', 'c' ), ( 'c', 'a' ) ] g = bgl.Graph( edges ) g.write_graphviz( 'bind-copy.dot' ) I get the following: Traceback (most recent call last): File "<stdin>", line 1, in ? KeyError: 'node_id' I couldn't manage to generate the node_id property map automatically. So after you have built the graph with the edge list constructor how do you know which vertex is which? I ended up using the following code to create the graph: def build( edges ): # Create a graph to build g = bgl.Graph() # Construct some property maps node_ids = g.vertex_properties[ 'node_id' ] = g.vertex_property_map( 'string' ) color = g.vertex_properties[ 'color' ] = g.vertex_property_map( 'string' ) centrality = g.vertex_properties[ 'centrality' ] = g.vertex_property_map( 'float' ) weight = g.edge_properties[ 'weight' ] = g.edge_property_map( 'float' ) length = g.edge_properties[ 'len' ] = g.edge_property_map( 'float' ) # create the edges and vertices name_2_vertex = { } for ( name1, name2 ) in edges: if not name_2_vertex.has_key( name1 ): v1 = name_2_vertex[ name1 ] = g.add_vertex() node_ids[ v1 ] = name1 else: v1 = name_2_vertex[ name1 ] if not name_2_vertex.has_key( name2 ): v2 = name_2_vertex[ name2 ] = g.add_vertex() node_ids[ v2 ] = name2 else: v2 = name_2_vertex[ name2 ] e = g.add_edge( v1, v2 ) weight[ e ] = 0.1 length[ e ] = 4 # Color articulation points red for v in bgl.biconnected_components( g ): color[ v ] = 'red' # Assign centrality values to property map bgl.brandes_betweenness_centrality( g, centrality ) return g This code seems to works fine. So I thought I'd post this just to see if I was missing something obvious and/or in the hope someone else might find it useful. Best, John.

3 6