26 using topology_storage = array_buffer<T>;
    33   const offset_t operator[](
size_t i)
 const {
    37   void add_count(uint32_t count) {
    43   void add_end(
size_t end) {
    45     add_count(static_cast<uint32_t>(end - start_));
    48   std::pair<size_t, size_t> range(
size_t i)
 const {
    61   const auto & storage()
 const {
    83     bool operator==(
const iterator & itr) {
    87     bool operator!=(
const iterator & itr) {
   113     assert(
false && 
"invalid operation");
   117     assert(
false && 
"invalid operation");
   128   void resize(
size_t n) {
   132   size_t capacity()
 const {
   136   template<
typename... Args>
   137   void assign(Args &&...) {
   138     assert(
false && 
"invalid operation");
   141   template<
typename... Args>
   142   void insert(Args &&...) {}
   144   void reserve(
size_t) {
   145     assert(
false && 
"invalid operation");
 Definition: entity_storage.hh:28
offset represents an offset range (a start index plus a count of elements) in a single uint64_t...
Definition: offset.hh:34
Definition: array_buffer.hh:71
Definition: index_space.hh:1711
Definition: entity_storage.hh:75
Definition: entity_storage.hh:78
Definition: control.hh:31