|
Boost Users : |
Subject: Re: [Boost-users] Container with insertion order
From: Mateusz Åoskot (mateusz_at_[hidden])
Date: 2011-11-23 10:52:40
On 23 November 2011 15:47, Claude <clros_at_[hidden]> wrote:
> C++11 std::unordered_map store elements with no insertion order but based on
> a hash function...
Yes, but you can easily combine it with sequential container
that tracks order, but maps gives mapping, without sorting 'overhead'.
Best regards,
-- Mateusz Loskot, http://mateusz.loskot.net
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net