- Boost-users - lists.boost.org

[coroutine] errors compiling with clang 3.2
by Marco Craveiro 14 Nov '12

14 Nov '12

Hi boost-users, As reported by Eugene Yakubovich[1], I am seeing problems compiling boost coroutine with clang 3.1 on debian testing. I got my sources from git://gitorious.org/boost-dev/boost-dev.git at commit c083660c54b88ca1ce9a940f4a71bc6c3ab89003. The error I get is: /boost/coroutine/detail/coroutine_object.hpp:54:46: error: expected expression Context * ctx( hldr->data.get().get< 0 >() ); ^ The same code compiles and runs fine with gcc 4.7. In both cases I'm using C++11. I just want to double-check that this is some kind of problem with clang - since 3.2 is on the wings I was wondering if this would be resolved by the upgrade. If anyone has managed to get it working with 3.1 I'd appreciate some pointers. Many thanks for your time, Marco -- So young, and already so unknown -- Pauli blog: http://mcraveiro.blogspot.com [1] http://boost.2283326.n4.nabble.com/Review-Coroutine-reviewstarts-today-Sept…

2 6

boost asio: boost::asio::deadline_timer blocking ?
by Avi Bahra 14 Nov '12

14 Nov '12

Answers: 1. I doubt this is really an issue is with deadline_timer accuracy. 2. Are you double-scheduling the same timer? Or are you just doing some extra work, every time a single expiry event crosses a minute boundary? I wouldn't double-schedule the same timer, if that's what you're doing. >> No. I record the next minute boundary, when the timer fires, I check the current >> time against the minute boundary. So no double scheduling. 3. The timer may be susceptible to time changes on your system. It needn't be, but don't assume that means it's not. It might be worth looking at the implementation, to make sure. >> The problem occurs independent of the time change. 4. Slow disk could be an issue, but only if your io_service thread(s) are blocking on disk activity (either direct disk access or page faults). The file descriptors you're talking about have nothing to do with disk files, in this case. >> The current server is single threaded, so my this was my first suspect. >> I log every client request to a log file. I had suspected that a slow >> file system, would block when logging the client request, and affect the timer. >> I added extra instrumentation to time the logging. However this was not the cause 5. Depends on your accuracy needs and the load on the rest of the system. On a system under moderate loads, I'd expect no problems using ASIO to perform processing on a one-second granularity. Just be sure to compute the next expiry based the current time, rather than sleeping for 1 second. If you want to make this resilient to time change, you can use a monotonic timebase. Matt ================================================================ The client is designed to cancel long running connection to the server.. ( > 20seconds) This timeout is based on boost asio example: http://www.boost.org/doc/libs/1_47_0/doc/html/boost_asio/example/timeouts/a… What I have noticed is that the 1 second timer in the server does not fire, *when* client request have been cancelled. It appears that some of chain of async handlers that are being called in the server, during this process, cause the timer to hang ? For example if the client cancels after 20 seconds, then something in the server must been blocking, for that period ? When the client cancels, the server::handle_write(..), closes both end of the socket. So I see the following message logged: shutdown: Transport endpoint is not connected Here is the async' functions in the server: void server::start_accept() { connection_ptr new_conn( new connection( io_service_ ) ); acceptor_.async_accept( new_conn->socket(), boost::bind( &server::handle_accept, this, boost::asio::placeholders::error, new_conn ) ); } void server::handle_accept( const boost::system::error_code& e, connection_ptr conn ) { if (!acceptor_.is_open()) { if (serverEnv_.debug()) cout << " server::handle_accept: acceptor is closed, returning\n"; return; } if ( !e ) { conn->async_read( inbound_request_, boost::bind( &server::handle_read, this, boost::asio::placeholders::error,conn ) ); } else { if (e != boost::asio::error::operation_aborted) { // An error occurred. Log it LogToCout toCoutAsWell; LOG(Log::ERR, " server::handle_accept error occurred " << e.message()); } } start_accept(); } void server::handle_read( const boost::system::error_code& e,connection_ptr conn ) { if ( !e ) { try { // Service the in bound request, handling the request will populate the outbound_response_ // Note:: Handle request will first authenticate outbound_response_.set_cmd( inbound_request_.handleRequest( this ) ); } catch (exception& e) { outbound_response_.set_cmd( PreAllocatedReply::error_cmd( e.what() )); } // *Reply* back to the client: conn->async_write( outbound_response_, boost::bind(&server::handle_write, this, boost::asio::placeholders::error, conn ) ); } else { LOG(Log::ERR, "server::handle_read error occurred : " << e.message()); } } void server::handle_write( const boost::system::error_code& e, connection_ptr conn ) { boost::system::error_code ec; conn->socket().shutdown(boost::asio::ip::tcp::socket::shutdown_both,ec); if (ec) { ecf::LogToCout logToCout; LOG(Log::ERR,"server::handle_write: socket shutdown both failed: " << ec.message()); return; } } I had noticed that I was not checking error code in the server::handle_write(..) but I'm not sure if this would account, for why the timer does not fire temporarily. Ta, Avi

1 0

[msm] Why does it take so many bytes to represent a state machine?
by ☂Josh Chia (谢任中) 13 Nov '12

13 Nov '12

Hi, I'm using msm to store the state of many small objects. Each one is around 24 bytes on its own. However, I just found out from experimentation that a MSM state machine takes many bytes to store. For the following program, the print out is: entering: State1 104 48 This indicates that the very simple one-state, no-transition, machine is 104 bytes, and takes 48 bytes even to serialized. The front::state_machine_def, however, is only 1 byte, though I suspect thet real state is stored only in the 104-byte back::state_machine. Even the SimpleTutorial.cpp example, when I adapt it to print the size, shows 128 bytes. Theoretically, all this information take no more than a few bits to store, and one byte is generous. What's the internal representation of a state machine and how can I optimize the size of the representation? This matters for my use case because I have many small objects for which I want to maintain state, that are only ~20 bytes each. I thought perhaps I could mitigate this size problem by storing the serialized bytes but even the serialized bytes are many. I'm using boost 1.51 and gcc 4.7.2 on 64-bit Linux. Josh #include <iostream> #include <strstream> #include <boost/archive/text_oarchive.hpp> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/functor_row.hpp> #include <boost/msm/front/state_machine_def.hpp> using namespace std; namespace mpl = boost::mpl; namespace msm = boost::msm; using namespace msm::front; struct Event { }; struct state_ : public msm::front::state_machine_def<state_> { struct State1 : public msm::front::state<> { // optional entry/exit methods template <class Event,class FSM> void on_entry(Event const&, FSM& f) { std::cout << "entering: State1" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) { std::cout << "leaving: State1" << std::endl; } }; typedef State1 initial_state; struct transition_table : mpl::vector< > {}; }; typedef msm::back::state_machine<state_> State; int main() { State state; state.start(); cout << sizeof(state) << endl; ostrstream os; { boost::archive::text_oarchive oa(os); oa << state; } cout << os.pcount() << endl; return 0; }

2 4

[msm] How to cause no_transition for cases of guard returning false?
by ☂Josh Chia (谢任中) 13 Nov '12

13 Nov '12

Hi, I want no_transition() to be called whenever no row matches, even if there is a row that does not match only because the guard returns false. How can I achieve this? I want to be strict about the input events. I can probably workaround this by putting guardless rows at the top whose action is to call no_transition(), but I'm hoping to find a cleaner solution. If I get this behavior in msm, then the following code should output "no transition..." as its last line. Right now, with boost 1.51, it doesn't. It just prints "entering State1". Josh #include <iostream> #include <boost/msm/back/state_machine.hpp> #include <boost/msm/front/functor_row.hpp> #include <boost/msm/front/state_machine_def.hpp> using namespace std; namespace mpl = boost::mpl; namespace msm = boost::msm; using namespace msm::front; struct Event { Event(bool data) : data(data) { } bool data; }; struct state_ : public msm::front::state_machine_def<state_> { struct MyGuard { template <class EVT, class FSM, class SourceState, class TargetState> bool operator()(EVT const& e, FSM&, SourceState&, TargetState&) { return e.data; } }; struct State1 : public msm::front::state<> { // optional entry/exit methods template <class Event,class FSM> void on_entry(Event const&, FSM& f) { std::cout << "entering: State1" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) { std::cout << "leaving: State1" << std::endl; } }; struct State2 : public msm::front::state<> { // optional entry/exit methods template <class Event,class FSM> void on_entry(Event const&, FSM& f) { std::cout << "entering: State2" << std::endl; } template <class Event,class FSM> void on_exit(Event const&,FSM& ) { std::cout << "leaving: State2" << std::endl; } }; typedef State1 initial_state; struct transition_table : mpl::vector< Row< State1, Event , State2, none, MyGuard > > {}; template <class FSM, class Event> void no_transition(Event const& e, FSM&, int state) { std::cout << "no transition from state " << state << " on event " << typeid(e).name() << std::endl; } }; typedef msm::back::state_machine<state_> State; int main() { State state; state.start(); state.process_event(Event(false)); return 0; }

2 2

[Locale] MinGW + ICU + cross compiling = wchar errors?
by Jookia 13 Nov '12

13 Nov '12

Hello! I'm trying to compile Boost.Locale 1.51.0 with ICU 1.50 support in x86_64 MinGW-w64 4.7.2. So to start off, I have a structure of all my libs, includes and whatnot at /home/jookia/Programming/mingw64. I've built ICU using this command and installed it: CXXFLAGS=-fpermissive ../configure --prefix=/home/jookia/Programming/mingw64/ --host x86_64-w64-mingw32 --with-cross-build=/home/jookia/Programming/local/icu/source/build --enable-static --enable-shared --with-data-packaging=archive --with-library-bits=64 Building Boost uses this user-config: using gcc : 4.7 : x86_64-w64-mingw32-g++ : <rc>x86_64-w64-mingw32-windres <archiver>x86_64-w64-mingw32-ar <compileflags>-I/home/jookia/Programming/mingw64/include/ <linkflags>-L/home/jookia/Programming/mingw64/lib/ ; and this command: bjam threadapi=win32 target-os=windows variant=release threading=multi link=shared runtime-link=shared --prefix=/home/jookia/Programming/mingw64 --user-config=user-config.jam --without-python --without-mpi --layout=tagged -sNO_BZIP=1 -sNO_ZLIB=1 install In order to try and build Boost.Locale I've patched its Jamfile to remove the shared libstdc++ stuff as MinGW doesn't seem to support it, and also rename all of the searched-lib <name>s to their MSVC equivalents so I can find those. The command it used to build is this (stuff omitted to save space): "x86_64-w64-mingw32-g++" "-Wl,--out-implib,bin.v2/libs/locale/build/.../libboost_locale-mt.dll.a" -o "bin.v2/libs/locale/build/.../libboost_locale-mt.dll" -Wl,-h -Wl,libboost_locale-mt.dll -shared -Wl,--start-group ... -Wl,-Bstatic -Wl,-Bdynamic -licuuc -licuin -licudt -liconv -Wl,--end-group -L/home/jookia/Programming/mingw64/lib/ -mthreads Compiling works fine up until linking, where it gives a few errors like this (paths and mangled names omitted to save sapce): bin.v2/.../formatter.o:formatter.cpp:(... undefined reference to `icu_50::UnicodeString::UnicodeString(wchar_t const*, int)' Is there any solution to this or is this something to do with MinGW's lack of support for wchars? Thanks, Jookia.

1 1

boost::variant compile error
by Georg.Kellerer＠lfu.bayern.de 13 Nov '12

13 Nov '12

Hi, i'd like to build a heterogenous container based on the boost::variant datastructure. My code looks like this: // forward-Deklarationen: class fExport FB_Ordered; class fExport FB_Dictionary; // Typedefs typedef boost::variant<int, std::string> keydicttype; typedef boost::variant< int, std::string, date, ptime, boost::recursive_wrapper<FB_Dictionary>, boost::recursive_wrapper<FB_Ordered>> valuedicttype; typedef boost::container::map<keydicttype, valuedicttype> basedict; C:\dev\boost_1_52_0\boost/checked_delete.hpp(32) : error C2027: use of undefined Type "FB_Ordered" what i want to do is to create a container fb_dictionary which can hold datatypes that are listed in the valuedicttype and which can accept keyvalues of int and string (see above). fb_ordered is another container defined in a diferent header file so i need the forward declarations. Could anybody please give me a hint in the right direction? I am using vs2008. Thanks for help, Georg

3 3

Threading and Asio
by Gonzalo Garramuno 12 Nov '12

12 Nov '12

I started playing with asio server/client model and I run into a problem. I have a thread for the server, another for the client and another for the send/receive message. This results in: write: Socket operation on non-socket as the send thread is not made aware of the socket initialized in the client thread. I'm wondering what is the solution to have the send in a separate thread.

2 1

[statechart] history not saved
by Ilya Orlov 11 Nov '12

11 Nov '12

I have following code: // from A11 and A12 and back struct Ev1 : sc::event < Ev1 >{}; struct Ev2 : sc::event < Ev2 >{}; // from A to B and back struct Ev3 : sc::event < Ev3 >{}; struct Ev4 : sc::event < Ev4 >{}; // from A1 to A2 and back struct Ev5 : sc::event < Ev5 >{}; struct Ev6 : sc::event < Ev6 >{}; struct StateA; struct StateA1; struct StateA11; struct StateA12; struct StateA2; struct StateA21; struct StateA22; struct StateB; struct Machine : sc::state_machine < Machine, StateA > {}; struct StateA : sc::simple_state < StateA, Machine, mpl::list < sc::deep_history < StateA1 > >, sc::has_deep_history > { typedef sc::transition < Ev3, StateB > reactions; }; struct StateA1 : sc::simple_state < StateA1, StateA, mpl::list < sc::deep_history < StateA11 > >, sc::has_deep_history > { typedef sc::transition < Ev5, StateA2 > reactions; }; struct StateA11 : sc::simple_state < StateA11, StateA1 > { typedef sc::transition < Ev1, StateA12 > reactions; }; struct StateA12 : sc::simple_state < StateA12, StateA1 > { typedef sc::transition < Ev2, StateA11 > reactions; }; struct StateA2 : sc::simple_state < StateA2, StateA, mpl::list < sc::deep_history < StateA21 > >, sc::has_deep_history > { typedef sc::transition < Ev6, StateA1 > reactions; }; struct StateA21 : sc::simple_state < StateA21, StateA2 > {}; struct StateA22 : sc::simple_state < StateA22, StateA2 > {}; struct StateB : sc::simple_state < StateB, Machine > { typedef sc::custom_reaction < Ev4 > reactions; sc::result react(const Ev4&) { std::cout << "react" << std::endl; return transit < sc::deep_history < StateA11 > >(); } }; I am sending events like this: Machine m; m.initiate(); std::cout << "Ev5" << std::endl; m.process_event(Ev5()); std::cout << "Ev3" << std::endl; m.process_event(Ev3()); std::cout << "Ev4" << std::endl; m.process_event(Ev4()); After Ev5 machine goes to A2 -> A21 state. After Ev3 machine leaves state A with history and goes to state B. After Ev4 machine leaves state B and should go back to A2 -> A21 but actually goes to A -> A1 -> A11 - default states. How I can fix it? Thanks, Ilya

2 6

Review Wizard Report for November 2012
by Ronald Garcia 11 Nov '12

11 Nov '12

============================================== Review Wizard Status Report for November 2012 ============================================== News ==== 1. ODEInt Reviewed 2. Boost 1.52.0 Released. No New Libraries. Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. * Coroutine - reviewed September 2012; review manager: Hartmut Kaiser. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Atomic - accepted July 2011; author Helge Bahmann. * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Lockfree - accepted August 2011; author: Tim Blechmann. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Polygon: Voronoi Extensions * Coroutine * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Polygon: Voronoi Extensions --------------------------- :Author: Andril Sydorchuk :Review Manager: Lucanus Simonson :Download: http://svn.boost.org/svn/boost/sandbox/gtl/ :Description: This library extends Boost.Polygon with the following features: - Robust and efficient implementation of the sweepline algorithm that allows to construct Voronoi diagram, Delaunay triangulation and medial axis of a set of points and line segments. - Coordinates of the output geometries are computed within the 64 machine epsilon relative error (6 mantissa bits). - Voronoi diagram data structure that allows efficient traversal and data association with the output Voronoi graph. - No 3rd party dependencies (e.g. GMP, MPFR), all the required multiple precision types are implemented as part of the library. - The input and output coordinate type domains are configurable via coordinate type traits, thus allowing to compute coordinates of the Voronoi vertices within any required precision. - The full construction of the Voronoi diagram of 100 000 points takes only 0.27 seconds (see benchmarks). Coroutine --------- :Author: Oliver Kowalke :Review Manager: Hartmut Kaiser :Download: http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine :Description: This library is an implementation of coroutines and generators using Boost.Context. Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

smart_ptr/enable_shared_from_raw
by Andreas Beisler 09 Nov '12

09 Nov '12

Hi, it's known that calling shared_from_this() in a constructor doesn't work. It seems that whenever this issue arises, people resort to creating a factory that first constructs the object and then calls an init function in which the user is free to call shared_from_this(). It seems though that there is a perfectly working enable_shared_from_raw class in the trunk since a couple of years now that allows the developer to call shared_from_raw(this) in a constructor. Are there plans of merging this into a release sometime? If not, is it safe to throw out the smart_ptr stuff of a release (I'm using 1.48.0 still) and replace it with the version from the trunk? Thanks, Andreas

1 0