others/vector_pool.hpp

• View this file on GitHub
• Last update: 2025-04-05 12:46:42+09:00
• Include: #include "others/vector_pool.hpp"

Required by

• 赤黒木の基本クラス (bbst/base/red_black_tree_base.hpp)
• bbst/lazy_red_black_tree.hpp
• bbst/red_black_tree.hpp
• data_structure/ordered_set.hpp

Verified with

• verify/yosupo_ds/ds_dynamic_sequence_range_affine_range_sum.test.cpp
• verify/yosupo_ds/ds_ordered_set_max_right.test.cpp
• verify/yosupo_ds/ds_ordered_set_min_left.test.cpp
• verify/yosupo_ds/ds_point_set_range_composite_2.test.cpp

Code

#ifndef KK2_OHTERS_VECTOR_POOL_HPP
#define KK2_OHTERS_VECTOR_POOL_HPP 1

#include <vector>

namespace kk2 {

template <typename T> struct VectorPool {
    std::vector<T> pool;
    std::vector<T *> ptrs;
    int pos = 0;

    VectorPool() = default;

    VectorPool(int n) : pool(n), ptrs(n) {}

    inline T *alloc() { return ptrs[pos++]; }

    inline void free(T *ptr) { ptrs[--pos] = ptr; }

    void clear() {
        for (size_t i = 0; i < pool.size(); i++) ptrs[i] = &pool[i];
        pos = 0;
    }

    T &operator[](int i) { return pool[i]; }
};

} // namespace kk2

#endif // KK2_OHTERS_VECTOR_POOL_HPP

#line 1 "others/vector_pool.hpp"



#include <vector>

namespace kk2 {

template <typename T> struct VectorPool {
    std::vector<T> pool;
    std::vector<T *> ptrs;
    int pos = 0;

    VectorPool() = default;

    VectorPool(int n) : pool(n), ptrs(n) {}

    inline T *alloc() { return ptrs[pos++]; }

    inline void free(T *ptr) { ptrs[--pos] = ptr; }

    void clear() {
        for (size_t i = 0; i < pool.size(); i++) ptrs[i] = &pool[i];
        pos = 0;
    }

    T &operator[](int i) { return pool[i]; }
};

} // namespace kk2

Back to top page