This is the mail archive of the libstdc++@gcc.gnu.org mailing list for the libstdc++ project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: Implementation of forward_list (and compressed_pair)


Hi Ion,
> And it will surely work for also for stl_tree.h changing just
> _Rb_tree_node and in _M_create_node. Of course, same for unordered
> containers.
Excellent. I'll take care of that.
> Off-side comment: The approach of creating allocators on the fly
> instead of storing them is also an option but for some stateful
> allocators (like some shared memory node pools) constructing a related
> allocator is not trivial and it might require a name lookup or similar
> to get a pointer to the "singleton" pool (e.g. Boost.Interprocess pool
> allocators). With heap allocators the linker/loader does this job but
> for shared memory it must be done when the allocator is constructed.
Thanks about the details, indeed that's why we were looking for viable
strategies to avoid on the fly constructions, basing of course on past
discussions with other implementors.

Paolo.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]