container
container copied to clipboard
boostorg
STL-like containers from Boost
It was recently discussed on [the cpplang Slack](https://cpplang.slack.com/archives/C2PQKRWJU/p1699903321902899) that Boost implements a lot of class types that are "Platonically trivially relocatable" without being _known to the compiler_ to be trivially...
This PR definitely isn't ready for prime time, but I figured I might as well exploit Cunningham's Law here. The idea is that when the compiler supports `__cpp_impl_trivially_relocatable` (P1144's proposed...
I have a VM/mmap abstracting library (https://github.com/psiha/vm) and recently I tried to leverage it in conjuction with Boost.Container to create persisting STL-like containers (at least ones with contiguous storage). First...
and/or simply deduce it automatically to the smallest required integer (based on the static size and/or size/alignment of T).
Hello, I noticed that inserting elements in ```flat_map``` is around 2 times slower going from version boost-1.79.0 to boost-1.80.0. I've found the relevant commit, [0d5068](https://github.com/boostorg/container/commit/0d5068a0cc8b9aa74776bfc256759b0e8096eb71). Sample code that is 2x...
Hi everyone! g++ v13.1.0, v13.2.0, boost v1.82, MSYS2 MINGW64_NT-10.0-19044. Discussion links: https://github.com/msys2/MINGW-packages/issues/17977 https://github.com/msys2/MINGW-packages/issues/17977#issuecomment-1668114318 The following example has different behavior depending on compiler optimization flags: ```C++ #include #include #include #include int...
E.g. `boost::movelib::iterator_to_raw_pointer(seq.end())` in flat_tree.hpp [asserts at runtime when used with checked/'secure' containers](https://github.com/boostorg/container/issues/260).
Hello all, tried to debug our startup code and get a lot of hits in initialization code of Boost.Container due to some global static variables: - static const vector_uninitialized_size_t vector_uninitialized_size...
["Piece tree"](https://cdacamar.github.io/data%20structures/algorithms/benchmarking/text%20editors/c++/editor-data-structures/) is a "**multiple buffer piece table with red-black tree, optimized for line model**" [proposed by the team behind vscode](https://code.visualstudio.com/blogs/2018/03/23/text-buffer-reimplementation) i.e. an efficient data structure **for text editors**. -...
We never allocate so everything can easily be done in `constexpr`, or do I miss something?
