- Boost - lists.preview.boost.org

Re: [boost] [Boost-commit] svn:boost r65594 - in trunk: boost/config/platform boost/config/stdlib libs/config/doc libs/config/doc/html libs/config/doc/html/boost_config libs/config/test libs/config/test/all
by Jürgen Hunold 27 Sep '10

27 Sep '10

Hi John, this commit broke the boost tests. On Sunday, 26. September 2010 11:30:45 john(a)johnmaddock.co.uk wrote: >Added: > trunk/libs/config/test/boost_no_limits_lowest.ipp > Modified: trunk/libs/config/test/all/Jamfile.v2 > +test-suite "BOOST_NO_NUMERIC_LIMITS_LOWEST" : > +[ run ../no_limits_lowest_pass.cpp ] > +[ compile-fail ../no_limits_lowest_fail.cpp ] ; error: Unable to find file or target named error: '../no_limits_lowest_fail.cpp' error: referred from project at error: '/home/hunold/src/devel/boost/libs/config/test/all' It seems you forgot to add one file. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

1 0

[config] check for std::numeric_limits<T>::lowest() availability
by vicente.botet 26 Sep '10

26 Sep '10

Hi, I would like to use std::numeric_limits<T>::lowest() when the standard library provides it. As this is a specific function on C++0X, I was looking for a macro on Boost.Config that allows to use it conditionally, unfortunatelly I have not found any. What will be the right way to do that? Any chance <boost/limmits.hpp> manage with that? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

3 6

[chrono] version 0.6 uploaded
by vicente.botet 26 Sep '10

26 Sep '10

Hi, I have uploaded the version 0.6 of Boost.Chrono which includes New Features: * Added experimental chrono_io from Howard Hinnant. Provides I/O for duration and time_point. Builds on <boost/ratio/ratio_io.hpp> to provide readable and flexible formatting and parsing for types in <boost/chrono.hpp>. The duration unit names can be customized through a new facet: duration_punct. Fixes: * Fix duration values min implementation. Test: * Adapted a lot of tests from libc++/chrono making the lib much more robust. Getting the library. You can get more information from http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Chrono Is designed to be generic and useful in a lot of areas of C++ programming, in particular it is absolutely needed to adapt Boost.Thread to the forthcomming C++0x recomendation and the to be review Boost Stopwatches library. The Beman's initial version contained some additional classes to measure and report the elapsed time. These classes are included yet in the package, but have been deprecated. The usefulness of these features has been the motivartion of Boost.Stopwatches, which provide similar facilities in a generic and integrated way. Best regards, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

1 0

[Boost-users] [BGL] Stoer–Wagner min-cut algorithm
by Daniel Trebbien 26 Sep '10

26 Sep '10

> The usual idiom for that in BGL algorithms is to use an > iterator_property_map on the graph's vertices, built using a vector and > indexed by the vertex_index property map of the graph. You can also use a > shared_array_property_map, which manages its storage internally. If you > are doing a generic algorithm, the logic to manage these maps correctly is > somewhat difficult. One place to look for a template of what to do is the > distance map handling at the bottom of > <boost/graph/dijkstra_shortest_paths.hpp>, particularly > dijkstra_shortest_paths() and detail::dijkstra_dispatch1(). The basic > logic is to look at the named parameter structure that the user passes is > and see if there is an assignment map there. If so, use it; otherwise, > look for a vertex_index map in the named parameter structure, defaulting > to get(vertex_index, g), then use the found vertex_index map to create an > iterator_property_map or shared_array_property_map. Now that compilers > are more compliant, there are probably simpler ways to implement the logic > than to use multiple dispatch functions, but the approach in > dijkstra_shortest_paths.hpp is known to work. > > When you get this algorithm done, you may want to contribute it to BGL to > be added to Boost. We are always interested in new algorithms. > > -- Jeremiah Willcock Hello Jeremiah, I would very much like to contribute my implementation of the Stoer–Wagner min-cut algorithm to BGL. In preparation for this, I have attached a "pre-release" version to this e-mail which has everything needed to build the test case with g++ and GNU Make. Before I add in all of the template code to support "default" template parameters and other niceties, I figured that it would be good to have a review of the code to make sure that I am headed in the right direction. Also, I have tested my code against the example from Stoer & Wagner (1997). It appears to be working correctly, but there might be bugs. I think that it would be good to have more testing. Would someone please review my code? Also, is anyone aware of good examples for testing min-cut implementations? Daniel

4 57

Re: [boost] [B-tree] Continuing development
by Brian Wood 25 Sep '10

25 Sep '10

Beman Dawes: > I'm going to attack variable-length keys/data in several steps. > > 1) Via a very simple string class that has a fixed maximum length, and has a > sizeof() that maximum length + 1. Although this wouldn't be suitable for > really demanding applications, it should be fine for a lot of every day > programming. It is totally non-invasive, so is available right now. See > http://github.com/Beman/Boost-Btree/blob/master/boost/btree/detail/fixstr.h…, > or use your own if you've already got such an animal. Just fyi, I've been experimenting with a similar string -- http://webEbenezer.net/misc/lil_string.hh . If an operation would result in a string with length more than 255, an exception is thrown. This allows the length of the string to be marshalled with one byte. As you mention this limitation is not a problem in many circumstances. I'd quibble a little with it not being suitable for demanding applications. I think it is fine to use it in that context, but that you might need to also use other string classes. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

2 1

[B-tree] Continuing development
by Beman Dawes 24 Sep '10

24 Sep '10

There was enough positive response to the "Interest in B-tree library for Boost?" thread that I plan to continue development. * The immediate action items for the next few weeks are to get the library working with more compilers, to move the timer and endian stuff to detail, and to begin testing on Linux and other Unix-like platforms. Also try to extend the test cases to uncover more bugs. * Variable length keys and data, particularly strings, are a very high priority. * Development will be hosted at http://github.com/Beman/Boost-Btree - I'm liking Git quite a lot and using it is the best way for me to learn more. For those who want to follow along, the git equivalent to an svn checkout is: mkdir btree cd btree git clone git://github.com/Beman/Boost-Btree.git . and the git equivalent to svn update is: cd btree git pull * Please give the library a try. I need feedback based on actual use. Thanks, --Beman

3 3

[conversion] version 0.5.0 available
by vicente.botet 24 Sep '10

24 Sep '10

Hi, I have uploaded the version 0.5 of Boost.Conversion which includes respect ot the preceding version New Features: * Added a pack funcrion able to pack the Source and the Target constructor arguments in one parameter used (to convert vectors). * Added conversion between std::vector of explicitly convertible types. Fixes: * Port to more recent compilers * Warning removal You can get more information from http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Conve…. Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

1 0

[type_traits] conditional transformation
by vicente.botet 24 Sep '10

24 Sep '10

Hi, In 20.7.6.6 Other transformations [meta.trans.other] C++0x introduce a conditional template that is equicalent to mpl::if_c template <bool B, class T, class F> struct conditional; If B is true, the member typedef type shall equal T. If B is false, the member typedef type shall equal F. Could this be added to the Boost.TypeTraits? Thanks, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 3

Fwd: [test] inconsistent dll linkage warnings and BOOST_TEST_DECL and unit_test_main.ipp
by Felipe Magno de Almeida 24 Sep '10

24 Sep '10

Hello, Since I didn't receive any replies in boost-users list, I'm forwarding here. ---------- Forwarded message ---------- From: Felipe Magno de Almeida <felipe.m.almeida(a)gmail.com> Date: Wed, Sep 22, 2010 at 1:03 PM Subject: [test] inconsistent dll linkage warnings and BOOST_TEST_DECL and unit_test_main.ipp To: boost-users(a)lists.boost.org Hi, When I compile /boost//unit_test_framework as a dependency in a boost.build project I get errors with BOOST_TEST_DECL with some definitions in .ipp files. It seems BOOST_TEST_DECL is suppose to be used in functions that aren't defined for the user and that must be exported/imported depending if included by test's source or the user's source files. But .ipp files use BOOST_TEST_DECL which are included by the user with msvc-8.0 compiler and then it gives errors about that __declspec(dllimport) doesn't allow definition. To fix it I just changed BOOST_TEST_DECL for BOOST_TEST_CALL_DECL in the .ipp files. It works correctly with gcc in linux though. Regards, -- Felipe Magno de Almeida

1 0

aligned_storage in unions
by dherring＠ll.mit.edu 24 Sep '10

24 Sep '10

Hi, While C++0x promises to change things (see draft spec section 9.5), C++ currently does not allow unions to contain members having a nontrivial constructor, operator=, or destructor. This excludes std::string, std::complex, structures containing either, etc. The "standard" workaround is to allocate your own memory and use manual type casting. Boost::aligned_storage can be used to maintain proper alignment, but it cannot be placed inside a union due to the default ctor, dtor, and noncopyable functions. Thus I am forced to use part of boost::detail. Here is a simple example. #include <boost/type_traits/aligned_storage.hpp> // define a union-safe wrapper template <class T> struct UnWrap { boost::detail::aligned_storage::aligned_storage_imp< sizeof(T), boost::alignment_of<T>::value> space; T * get() const { return static_cast<T *>(space.address()); } T * operator->() const { return get(); } T & operator*() const { return *get(); } }; union U { UnWrap<std::string> s; int x; }; U u; new (u.s.get()) std::string; *u.s="hi"; Questions: - Is there a better way to do this? - Am I doing something blatantly wrong? - Could aligned_storage_impl be exposed for such uses? (AIUI, the detail namespace contains unsupported internals.) Thanks, Daniel

10 41

[ratio] 0.2 Review version uploaded
by vicente.botet 24 Sep '10

24 Sep '10

Hi, I have uploaded the version of the Boost Ratio library to be review. What is Boost.Ratio? =============== Boost.Ratio is a portable implementation of the C++0x Standard Library's compile-time rational arithmetic working on C++03 and C++0x compilers. Boost.Ratio provides: * A class template, ratio, for specifying compile time rational constants such as 1/3 of a nanosecond or the number of inches per meter. ratio represents a compile time ratio of compile time constants with support for compile time arithmetic with overflow and division by zero protection * A textual representation of boost::ratio<N, D> in the form of a std::basic_string. Other types such as boost::duration will use these strings to aid in their I/O. This library is header-only and is designed to be generic and useful in a lot of areas of C++ programming, in particular it is absolutely needed to Boost.Chrono and Boost.Stopwatches. Boost.Units contain a similar class: static_rational. You can get more complete information from http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Ratio Best regards, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

1 0

Re: [boost] Is there any interest in a smart pointer facade class?
by Krzysztof Czainski 23 Sep '10

23 Sep '10

> > Stefan Strasser <strasser(a)uni-bremen.de>: > >> Recently I wrote two smart pointer classes, and felt the need for such a >>>> class. I would like to write such a class, and if everything goes well, >>>> perhaps add it to the Boost library. >>>> >>> >>> It is supposed to be something like a more powerful intrusive_ptr? >>> Can you give a usage example? >>> >> >> I think the general idea is that this would be closer to a policy-based >> smart pointer. >> >> > I think it`s neither, but a CRTP class implementing the "pointer concept": > > struct my_ptr > : smart_ptr_facade<my_ptr,...>{ > void set(T *rhs){ ptr=rhs; } > T *get() const{ return ptr; } > T *ptr; > }; > > => my_ptr has ptr semantics, including operator->, operator=, ... > > iterator_facade simplifies implementing iterators a lot, so could this > class for pointers, and other facades, e.g. a vector_facade that implements > the std::vector interface in terms of 3 or 4 user-supplied functions. > Yes, this is what I have in mind. In a simplified case, smart_ptr_facade would require from my_ptr to provide a T* get() const;, and smart_ptr_facade would provide operator*, operator->, operator==, operator< (in order to be able to keep my_ptr in std::set).

1 0

[serialization] incompatible archives from 1.43 to 1.44
by Löw, Tobias (Evonik Energy Services GmbH) 23 Sep '10

23 Sep '10

Hi, I'm trying to read a binary archive with version 1.44 that was written with version 1.43. When loading I'm getting an exception in basic_binary_iarchive.ipp line 91 as the read library-version is higher than the boost-archive-version. The reason for that is that in line 80 * this->This() >> input_library_version; now two bytes are read whereas in prior boost-versions only one byte was read. There seems to be missing a load_override-function for library_version_type. Tobias

4 12

Is there any interest in a smart pointer facade class?
by Krzysztof Czainski 22 Sep '10

22 Sep '10

Is there any interest in a smart pointer facade class? I have in mind a class, that works similarily to boost::iterator_facade for developers of smart pointers instead of iterators. template < class Derived, class Pointee > class smart_ptr_facade; Recently I wrote two smart pointer classes, and felt the need for such a class. I would like to write such a class, and if everything goes well, perhaps add it to the Boost library. Regards Krzysztof Czainski

4 3

[serialization] feedback on a possible port of the XML archive grammar to Qi
by Bryce Lelbach aka wash 22 Sep '10

22 Sep '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've recently started working on porting Boost.Serialization's XML parser from Spirit Classic to Spirit Qi (I've got some free time on my hands, and I heard that there was some interest in this task). Before I start putting more time into this, I'd love to get some feedback/suggestions and make sure someone else isn't already working on this. My understanding is that porting the parser from Spirit Classic to Spirit Qi will not only speed up XML serialization, but would also increase portability (on some compilers, Serialization only works with Spirit 1.6, which is not shipped with the latest Boost release). My current plan is to rewrite the grammar in Qi, and modify the existing XML archive classes to use the new parser without changing the interface or the outputted XML. - Bryce Lelbach -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkx9e9oACgkQO/fqqIuE2t4IRwCdGOUqHtLhWeVIK3ruTipf4jHu +j8AoIP7CUssPlkBpLTWLHYRcPls0/ZJ =ki/H -----END PGP SIGNATURE-----

2 11

[Regex] Building Boost.Regex with ICU
by Artyom 22 Sep '10

22 Sep '10

Hello, I'm trying to build some basic Boost.Locale Jam file on base of Boost.Regex one, however... I can't even build Boost.Regex with ICU at all. Version 1.43 ------------ Debian, ICU 3.8 installed in regular place /usr/lib/libicu*.so Build: bjam -d+2 -sHAVE_ICU=1 stage Shows that the build is done with ICU (i.e. -DBOOST_HAS_ICU=1 in command line of gcc) However when afterward I check ldd stage/lib/libboost_regex.so It shows no evidence of linking with ICU. Version 1.44 ------------ Build: bjam -d+2 -sHAVE_ICU=1 stage Shows that the build is done without ICU! i.e. -DBOOST_HAS_ICU=1 in command line of gcc is NOT defined. And of course ldd shows the same Even if I specify bjam -d+2 -sHAVE_ICU=1 -sICU_PATH=/usr stage Or try to use ICU4.4 installed on other location bjam -d+2 -sHAVE_ICU=1 -sICU_PATH=/opt/icu44 stage Same result. I don't understand how can I actually get the library (especially recent) built with ICU. Artyom

11 32

[preprocessor] macro #definition order
by Lorenzo Caminiti 21 Sep '10

21 Sep '10

Hello all, I have a curiosity about the preprocessor: In the following example, is there any difference if `CONCAT()` is #defined before or after `CONCAT_D()`? Example 1: #define CONCAT(a, b) CONCAT_D(a, b) #define CONCAT_D(a, b) a ## b Example 2: #define CONCAT_D(a, b) a ## b #define CONCAT(a, b) CONCAT_D(a, b) In other words, are example 1 and 2 completely equivalent? Or, is there is a functional difference (proper expansion order, portability, etc)? Or, is there a performance difference (number of macro expansions, preprocessing time, etc)? I am asking because I would like to understand *in general* if the order in which I #define my macros when I program the preprocessor using Boost.Preprocessor might make a difference either functionally or for performance. Thank you very much. -- Lorenzo

2 1

[config] additions for gcc 4.0.1 and IBM V11.1.0.0 due to MSM compile errors
by Christophe Henry 21 Sep '10

21 Sep '10

Hi, I'm trying to see how far I can bring more compilers to compile MSM and I noticed that these 2 compilers might have a chance to work: - On gcc 4.0.1, most regression tests (for example: http://www.boost.org/development/tests/trunk/developer/output/Sandia-darwin…) fail because in msm/back/state_machine.hpp, the nested struct add_state cannot access the private function set_containing_sm. IIUC this should be BOOST_NO_NESTED_FRIENDSHIP. Correct? If yes, could we add this macro for gcc 4.0.1 (unfortunately, no idea about 4.0.1 - 4.2 but I suppose this will concern all 4.0.x)? - Again on the regression tests, the IBM compiler shows the same problem and furthermore does not accept that the struct: template <class Fsm,class Stt, class Event, class Compile> friend struct dispatch_table can have access to a private method of the befriended class. Again, IIUC, this seems to me to be BOOST_NO_MEMBER_TEMPLATE_FRIENDS. I don't find a file for this compiler in config/compiler. Am I missing something? Frankly, I'm slightly wary of changing myself the config files so I'd really appreciate some help here. Thanks, Christophe

2 1

Re: [boost] [filesystem] Link errors on Linux/MacOS with v3
by cheesy4poofs 21 Sep '10

21 Sep '10

>>... ?When I attempt to build boost >> on Mac/Linux with -DBOOST_FILESYSTEM_VERSION=3 ... > >Whoa! That may be the problem. > >When you compile your program it needs -DBOOST_FILESYSTEM_VERSION=3, >but when you compile that boost libraries, you should not define >anything special. > >What does the bjam command you are using for building the boost >libraries look like? > >--Beman I have discovered the issue. My apologies for wasting your time. My coworker built boost 1.44 (on Mac/Linux) with the CMake version of boost builds and the CMake version has a bug in that they don't include the v3 source in the final libraries. Once I modified CMakeLists.txt to add all the v3 source files for filesystem, everything is linking fine. BTW, I built boost on windows with bjam, which is why I never encountered the problem. Thanks again for the help. --Scott

1 0

[filesystem] Link errors on Linux/MacOS with v3
by cheesy4poofs 21 Sep '10

21 Sep '10

I've gone thru the exercise of converting all our code to use filesystem v3. Everything worked fine on Windows, but when I tried to compile on Linux and Mac, I get link errors with gcc. I have set my compiler flags to -DBOOST_FILESYSTEM_VERSION=3 and everything compiles fine. All the link errors come from filesystem3: ../NwUtils/libNwUtils.a(FileStream.cpp.o): In function `boost::filesystem3::path& boost::filesystem3::path::append<char [12]>(char const (&) [12], std::codecvt<wchar_t, char, __mbstate_t> const&)': FileStream.cpp:(.text._ZN5boost11filesystem34path6appendIA12_cEERS1_RKT_RKSt 7codecvtIwc11__mbstate_tE[boost::filesystem3::path& boost::filesystem3::path::append<char [12]>(char const (&) [12], std::codecvt<wchar_t, char, __mbstate_t> const&)]+0x30): undefined reference to `boost::filesystem3::path::m_append_separator_if_needed()' FileStream.cpp:(.text._ZN5boost11filesystem34path6appendIA12_cEERS1_RKT_RKSt 7codecvtIwc11__mbstate_tE[boost::filesystem3::path& boost::filesystem3::path::append<char [12]>(char const (&) [12], std::codecvt<wchar_t, char, __mbstate_t> const&)]+0x59): undefined reference to `boost::filesystem3::path::m_erase_redundant_separator(unsigned long)' Am I supposed to compile boost with a different setting to use filesystem v3? I didn't do anything special on windows. When I attempt to build boost on Mac/Linux with -DBOOST_FILESYSTEM_VERSION=3, the boost build fails with errors about BOOST_FILESYSTEM_VERSION != 2. Any help would be greatly appreciated as I'm at my wit's end! Thanks, Scott

2 2

[B-tree] Preliminary timings
by Beman Dawes 20 Sep '10

20 Sep '10

See http://mysite.verizon.net/beman/btree/preliminary_timings.html Notice that under some test conditions, some operations are faster on a btree_map than a std::map. But do be aware that these timings are preliminary. Bugs in either the test code or the implementation code could be skewing results. The test program can be viewed at http://github.com/Beman/Boost-Btree/blob/master/libs/btree/tools/bt_time.cpp Comments appreciated! --Beman

1 0

[chrono] Split into Stopwatches, Chrono, Ratio and TypeTraits.ext
by vicente.botet 20 Sep '10

20 Sep '10

Hi, As requested in this ML I have splited Boost.Chrono into 4 libraries * Boost.TypeTraits.Ext: contains the C++0x common_type and add_rvalue reference traits classes and the declval utility function * Boost Ratio: contains the C++0x ratio class * Boost.Chrono: contains the C++0x chrono library + process and thread clocks * Boost.Stopwatches: time measure and reporting More information on these libraries can be found in https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Type… https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Ratio https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Chro… https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Stop… Please let me know if you prefer separated reviews for each library. Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

6 14

Connection refused after close then open
by Doak, Roger (GE Healthcare) 20 Sep '10

20 Sep '10

Hi I'm trying to limit the connections made to the server. So after creating the acceptor and accepting MAX connections I closed the acceptor. If there is a better way please let me know. Further connections are properly rejected. However after one of the connections is closed by the client I attempt to re-open the acceptor but further connections are still rejected? Create and open: m_acceptor(m_ioService, m_endpoint = resolve(m_ioService, host, port), true) Async accept: m_acceptor.async_accept(connection->socket(), boost::bind(&IpServer::handleAccept, this, aph::error, connection)); Close after max connections: m_acceptor.close(); Reopen when a connection is available: m_acceptor.open(m_endpoint.protocol()); m_acceptor.set_option(boost::asio::ip::tcp::acceptor::reuse_address(true )); m_acceptor.bind(m_endpoint); m_acceptor.listen(); m_acceptor.async_accept(connection->socket(), boost::bind(&IpServer::handleAccept, this, aph::error, connection)); Thank you for your time. Roger

1 0

[Locale] Link errors
by Alexander Lamaison 20 Sep '10

20 Sep '10

I'm getting link errors with the latest Boost.Locale (v2.91) when trying to use the Win32 backend: [ 34%] Building CXX object CMakeFiles/boost_locale.dir/libs/locale/src/win32/win _backend.cpp.obj win_backend.cpp Linking CXX shared library boost_locale.dll Creating library boost_locale.lib and object boost_locale.exp win_backend.cpp.obj : error LNK2019: unresolved external symbol "unsigned int __ cdecl boost::locale::impl_win::locale_to_lcid(class std::basic_string<char,struc t std::char_traits<char>,class std::allocator<char> > const &)" (?locale_to_lcid @impl_win@locale@boost@@YAIABV?$basic_string@DU?$char_traits@D@std@@V?$allocator @D@2@@std@@@Z) referenced in function "public: __thiscall boost::locale::impl_wi n::winlocale::winlocale(class std::basic_string<char,struct std::char_traits<cha r>,class std::allocator<char> > const &)" (??0winlocale@impl_win@locale@boost@@Q AE@ABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@Z) boost_locale.dll : fatal error LNK1120: 1 unresolved externals I configured CMake as such: boost_locale_v2.91>cmake -G "NMake Makefiles" -DDISABLE_ICU=ON -DDISABLE_STD_BACKEND=ON -DCMAKE_INCLUDE_PATH="C:\boost" Where Boost is version 1.42. This is on Windows 7 32-bit. Any ideas? Alex -- Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

2 4

[Review] Formal Review: Boost.Move
by OvermindDL1 19 Sep '10

19 Sep '10

Greetings Boost Developers and Users, It's my pleasure to announce that the review of Ion Gaztañagas' Move library starts May 10th and lasts until May 24th, 2010, unless an extension occurs. What is it? =========== The Boost.Move library would supply an emulated C++1x Move semantics interface, aka RValue References, allowing for a wide variety of easy to use and easy to add in optimization abilities. The most used function it would add would be: val_b = boost::move( val_a ); Which would move val_a to val_b; val_a should not be used after this line. This semantic allows for a vast amount of optimizations, especially in regards to temporaries, see the documentation for further examples and use. Other patterns emulated are && rvalue references for functions/members and constructors. There are also a number of STL containers in the sandbox that support move semantics using this library for higher efficiency. Getting the library =================== The latest version of this library may be downloaded from SVN: http://svn.boost.org/svn/boost/sandbox/move/ and the docs may be viewed here Docs: http://igaztanaga.drivehq.com/libs/move/doc/html/index.html and do note, this library is header-only and is designed to be absolutely generic to be useful in all areas of C++ programming. Writing a review ================ If you feel this is an interesting library, then please submit your review to the developer list (preferably), or to the review manager. Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick - reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Special considerations ====================== If you want or need a primer on the subject, please look at the working draft for C++1x. This linked site has also been shown to be quite useful in describing move usefulness: Want Speed? Pass by Value.: http://cpp-next.com/archive/2009/08/want-speed-pass-by-value/ Move It With Rvalue References: http://cpp-next.com/archive/2009/09/move-it-with-rvalue-references/ And there are further links in that series, but those two will get you started in the domain. Best regards, OvermindDL1, Review Manager (Boost.Move)

15 78