Subject: [Boost-bugs] [Boost C++ Libraries] #13016: small buffer optimization for bool vector or dynamic_bitset
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2017-05-08 12:26:58
#13016: small buffer optimization for bool vector or dynamic_bitset
------------------------------+--------------------------
Reporter: gast128@⦠| Owner: igaztanaga
Type: Feature Requests | Status: new
Milestone: To Be Determined | Component: container
Version: Boost 1.64.0 | Severity: Optimization
Keywords: |
------------------------------+--------------------------
The small_vector addition (#9165) is great. However using this with
Booleans gives space overhead. The std has anticipated this with the
vector<bool> concept though not everybody is enthusiastic about this
optimization. Unfortunately this one always allocates its data on the
heap. What I need is the optimization of vector<bool> (or a
dynamic_bitset) with the small buffer optimization.
The use case is that I keep bool (or a bit postion) for every connected
pin which goes from 0 to max pins. 99% of the use cases the maximum pins
are less than 10 though I do not want to set a maximum on it beforehand
(so e.g. use of std::bitset with 32 values would rule this out, since that
one is topped to 32).
see also http://stackoverflow.com/questions/7760678/is-there-a-bitset-
class-thats-sized-at-instantiation-time-but-avoids-boostdy
-- Ticket URL: <https://svn.boost.org/trac/boost/ticket/13016> Boost C++ Libraries <http://www.boost.org/> Boost provides free peer-reviewed portable C++ source libraries.
This archive was generated by hypermail 2.1.7 : 2017-05-08 12:29:57 UTC