#include <iostream>
#include <memory>
#include <vector>
class SmallObject {
public:
int data[16]; // Small object with fixed size
};
class ObjectPool {
private:
std::vector<SmallObject> pool;
size_t index;
public:
ObjectPool(size_t size) : pool(size), index(0) {}
SmallObject* allocate() {
if (index < pool.size()) {
return &pool[index++];
}
return nullptr; // No more objects available
}
void deallocate(SmallObject* obj) {
// Logic for deallocation if needed
// In this simple example, we do nothing
}
};
int main() {
ObjectPool pool(10); // Pool for 10 small objects
SmallObject* obj1 = pool.allocate();
if (obj1) {
std::cout << "Allocated SmallObject at " << obj1 << std::endl;
}
// Use obj1...
pool.deallocate(obj1); // Deallocate if required
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?