C++26 adds a new container to the standard library: std::hive. It is meant to occupy the ground between std::vector and std::list. Like a vector, it keeps its elements in contiguous blocks of memory, so scanning it does not require you to chase a pointer for every element. Like a list, it never moves an element … Continue reading How fast is C++26’s std::hive?
  • Speiser0@feddit.orgEnglish
    2·
    1 month ago

    Sorry, but that blog post has severe quality issues. Is the skipfield now an counter per block or a bitfield? Why didn’t they add std::deque to the comparison? Why is iterating through std::hive slower than std::list? They talk about SIMD and say “we can check this”, but then it’s about locality. Why didn’t they measure iteration speed and memory overhead after random element removal?