- Boost - lists.boost.org

[assign][multi_array] possible problem with both libs together?
by JOAQUIN LOPEZ MU?Z 29 Jul '04

29 Jul '04

I thought I'd bring this mail from the users list to your attention: http://lists.boost.org/MailArchives/boost-users/msg07311.php Joaquín M López Muñoz Telefónica, Investigación y Desarrollo Original message To: boost-users@xxxxxxxxxxxxxxx Subject: [Boost-users] Assign and MultiArray conflict with precompiledheaders From: Bruno Martínez Aguerre <br1@xxxxxxxxxxxxxxx> Date: Wed, 28 Jul 2004 16:49:42 -0300 Reply-to: boost-users@xxxxxxxxxxxxxxx Sender: news <news@xxxxxxxxxxxxx> User-agent: Opera M2/7.51 (Win32, build 3798) -------------------------------------------------------------------------------- Hi. I'm trying out the recently accepted Assign library, and also the MultiArray library, which is new to me. I'm in VC7.1, and using the post review version of Assign. Depending on the order I include the libraries in my precompiled header, the linker complains about double definition of MultiArray's extents object. Here are the files that reproduce the problem. //stdafx.h #pragma once #include "boost/multi_array.hpp" #include "boost/assign.hpp" //main.cpp #include "stdafx.h" int main() { boost::multi_array<int, 2> t(boost::extents[3][4]); } I couldn't find relation between the two libraries. Thanks in advance, Bruno Martínez

1 0

Re:Re: Re:Javascript Tree Control [was: Serialization Menu
by Robert Ramey 29 Jul '04

29 Jul '04

Jonathan Turkanis >I agree with all of this. But I think that having a tree control component >is still useful: I didn't mean to suggest otherwise. My experience with this was a) fiddling around with Javascript and DOM (IE and Netscape) to get things to work. b) making my own tree by hand. Basically both of these were hacks and I'm happy to see a) done in a professional way. b) was really tedious and I saw the need to automate this process which seemed very much in the spirit of Boost Book (which I havn't spent any time with either) Basically we've got a) we need a)+b). I'm happy to leave the details to you guys as you know much more about it and it seems that there is broad agreement on the basic idea. Robert Ramey

2 1

Re: [boost] Re: Javascript Tree Control [was: Serialization Menu]
by Reece Dunn 29 Jul '04

29 Jul '04

Jeff Garland wrote: >On Wed, 28 Jul 2004 09:41:22 -0600, Jonathan Turkanis wrote > > "Jeff Garland" <jeff(a)crystalclearsoftware.com> wrote in message > > news:20040728115709.M55567@crystalclearsoftware.com... > > > On Tue, 27 Jul 2004 21:19:38 -0600, Jonathan Turkanis wrote > > > (I was able to do it with right mouse on the right pane, open in new > > > window/tab). However, is there a way to get the address bar to > > point to the > > > right frame instead of the left pane so that the current URL is > > immediately > > > accessible? My major objection to frames is that I can't see and > > grab the > > > current URL... > > > > I agree. See http://tinyurl.com/3sdu6. > >Thanks, for the pointer on sync. I didn't read all the rationale. I wish I >could come up with a more intuitive name -- it didn't hit me at first what >sync was for. Anyway, I was using Firefox 0.9.1 on Linux. I tested a >couple >more browsers: Galeon 1.3.12 and Epiphany 1.0.7 automatically sync -- very >cool! Konqueror 3.2.0 does not :( Would it be possible to do the sync automatically via the JavaScript control? It could be possible to do something like: <a href = "javascript:tree.load('id.1.2')">Chapter 1.2: Cool Stuff!</a> With load performing the URL redirection and synchronisation. I am not sure how portable this would be, but having it done automatically would mean that there would be less confusion and a simpler interface. >Oh, and I'm of course in support of boost-book initiatives to generate >these >capabilties -- after all, transformation to various forms is the whole >point >of getting the docs into xml... Exactly. Regards, Reece _________________________________________________________________ Use MSN Messenger to send music and pics to your friends http://www.msn.co.uk/messenger

2 1

property map, boost::identity_property_map
by Val Samko 29 Jul '04

29 Jul '04

Hi, is there any reason, why boost::identity_property_map implementation in <boost\property_map.hpp> is completely different from how it is documented in http://www.boost.org/libs/property_map/identity_property_map.html ? As mentioned in the implementation, boost::identity_property_map is a property map that applies the identity function to integers. On the other hand, documentation clearly states that one can use identity_property_map with any types. Valentin Samko http://val.samko.info

2 1

BOOST_MPL_AUX_AGLORITHM_NAMESPACE_END in wrong place
by Jonathan Wakely 29 Jul '04

29 Jul '04

In boost/mpl/if.hpp the BOOST_MPL_AUX_AGLORITHM_NAMESPACE_BEGIN macro is inside a test for BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION, but the corresponding BOOST_MPL_AUX_AGLORITHM_NAMESPACE_END is after the #endif that matches the test. This doesn't cause an error, since those macros only expand to anything meaningful for GCC3, which enters the first branch of the #if, so the begin/end macros are balanced - but it ain't right. Bug was found due to an error with missing #endif, which made GCC3 take a different path through that file and error. Note also those macros are spelled "AGLORITHM" not ALGORITHM. Untested patch attached. jon -- "Faith strikes me as intellectual laziness." - Robert Heinlein

2 2

Python / extract.cpp: disable warning
by Stefan Slapeta 29 Jul '04

29 Jul '04

This warning in the extract test case should also be disabled for Intel 8: ..\libs\python\test\extract.cpp(59): warning #473: returning reference to local temporary return extract<std::string const&>(x); ^ BTW, is this a compiler defect? S.

5 10

libboost_regex, FreeBSD problems
by Steve Bobrowski 29 Jul '04

29 Jul '04

Hi, I did some development with libboost_regex-gcc.so (1.31.0) on a Linux platform: no problems. However, when I try to compile on FreeBSD, I get the following errors: g++ -o myprog Unit1.o Unit2.o /usr/local/lib/libboost_regex-gcc.so /usr/local/lib/libboost_regex-gcc.so: undefined reference to 'pthread_mutex_unlock' /usr/local/lib/libboost_regex-gcc.so: undefined reference to 'pthread_mutex_destroy' /usr/local/lib/libboost_regex-gcc.so: undefined reference to 'pthread_mutex_lock' /usr/local/lib/libboost_regex-gcc.so: undefined reference to 'pthread_mutex_init' I've installed Boost on the FreeBSD platform using both the ports package available from freebsd.org and the source from boost.org. Both yield the same results. Any ideas appreciated, as I am not that experienced with C++, Boost, and cross-platform deployment. Thanks, Steve

4 5

Normalizing file names in bcp
by Daniel James 29 Jul '04

29 Jul '04

Hi, When bcp is searching for files to copy, it doesn't normalize the path, so if a file is referenced from two different locations using relative paths it doesn't work. This happens when it is used on the preprocessor library. The following patch fixes this by normalizing the path in bcp_implementation::add_path. It also updates bcp's Jamfile.v2. Daniel Index: Jamfile.v2 =================================================================== RCS file: /cvsroot/boost/boost/tools/bcp/Jamfile.v2,v retrieving revision 1.1 diff -u -r1.1 Jamfile.v2 --- Jamfile.v2 29 Aug 2003 07:51:22 -0000 1.1 +++ Jamfile.v2 27 Jul 2004 18:55:59 -0000 @@ -4,9 +4,9 @@ : add_path.cpp bcp_imp.cpp copy_path.cpp file_types.cpp fileview.cpp main.cpp path_operations.cpp scan_cvs_path.cpp licence_info.cpp scan_licence.cpp output_licence_info.cpp - ../../libs/filesystem/build//boost_filesystem - ../../libs/regex/build//boost_regex - ../../libs/test/build//prg_exec_monitor + /boost/filesystem//boost_filesystem + /boost/regex//boost_regex + /boost/test//boost_prg_exec_monitor : <define>BOOST_REGEX_NO_LIB=1 : Index: add_path.cpp =================================================================== RCS file: /cvsroot/boost/boost/tools/bcp/add_path.cpp,v retrieving revision 1.6 diff -u -r1.6 add_path.cpp --- add_path.cpp 14 Jul 2004 10:59:37 -0000 1.6 +++ add_path.cpp 27 Jul 2004 18:56:00 -0000 @@ -21,10 +21,13 @@ void bcp_implementation::add_path(const fs::path& p) { - if(fs::exists(m_boost_path / p) && fs::is_directory(m_boost_path / p)) - add_directory(p); + fs::path normalized_path = p; + normalized_path.normalize(); + if(fs::exists(m_boost_path / normalized_path) + && fs::is_directory(m_boost_path / normalized_path)) + add_directory(normalized_path); else - add_file(p); + add_file(normalized_path); } void bcp_implementation::add_directory(const fs::path& p)

2 1

redefinition of BOOST_WINDOWS in filesystem/path_posix_windows.cpp error
by Toon Knapen 29 Jul '04

29 Jul '04

When compiling boost/libs/filesystem/src/path_posix_windows.cpp on windows, a compilation error occurs because BOOST_WINDOWS is redefined. path_posix_windows.cpp has its own definition of BOOST_WINDOWS but this symbol is also defined in win32.hpp which is included by config.hpp. IMMO the definition of BOOST_WINDOWS should be removed and boost/config.hpp should be included instead. toon PS, how it is possible that the regression tests on windows show success for all filesystem tests is a mistery to me. It does not compile on my machine anyway.

2 1

std::sort(zip_iterator...) does not compile
by Gunter Winkler 29 Jul '04

29 Jul '04

Hello, I tried to use boost::zip_iterator to sort 2 parallel arrays. Unfortunatly gcc does not compile the appended example because it can not convert boost::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::random_access_traversal_tag> to either std::bidirectional_iterator_tag or std::random_access_iterator_tag. Thus it cannot dispatch the correct stl::__copy_backward() procedure. Is sort() not yet supported? mfg Gunter PS: please CC your replies to my eMail. 8<-----------part of error log--------------- /usr/include/c++/3.3/bits/stl_algobase.h: In static member function `static _BidirectionalIter2 std::__copy_backward_dispatch<_BidirectionalIter1, _BidirectionalIter2, _BoolType>::copy(_BidirectionalIter1, _BidirectionalIter1, _BidirectionalIter2) [with _BidirectionalIter1 = boost::zip_iterator<boost::tuples::tuple<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >, _BidirectionalIter2 = boost::zip_iterator<boost::tuples::tuple<__gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int> > >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >, _BoolType = __false_type]': [...] /usr/include/c++/3.3/bits/stl_algobase.h:392: error: no matching function for call to `__copy_backward( boost::zip_iterator<...>&, boost::zip_iterator<...>&, boost::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::random_access_traversal_tag>)' /usr/include/c++/3.3/bits/stl_algobase.h:360: error: candidates are: _BidirectionalIter2 std::__copy_backward(_BidirectionalIter1, _BidirectionalIter1, _BidirectionalIter2, std::bidirectional_iterator_tag) /usr/include/c++/3.3/bits/stl_algobase.h:371: error: _BidirectionalIter std::__copy_backward(_RandomAccessIter, _RandomAccessIter, _BidirectionalIter, std::random_access_iterator_tag) 8<-----------zip_iter.cpp------------ // sort 2 parallel arrays #include <boost/iterator.hpp> #include <boost/iterator/zip_iterator.hpp> #include <boost/tuple/tuple.hpp> #include <boost/tuple/tuple_comparison.hpp> #include <vector> #include <iostream> int main(int argc, char *argv[]) { typedef std::vector<int> VEC; typedef boost::zip_iterator< boost::tuple<VEC::iterator, VEC::iterator> > zip_iter; VEC v1(10); VEC v2(10); zip_iter iter( boost::make_tuple(v1.begin(), v2.begin()) ); zip_iter iter_end( boost::make_tuple(v1.end(), v2.end()) ); std::sort(iter, iter_end); return EXIT_SUCCESS; }

3 14