#include <peglib.h>
|
| | PackratCache (size_t expected_entries) |
| bool | find (size_t key, size_t &len, std::any &val) const |
| void | insert_or_assign (size_t key, size_t len, const std::any &val) |
| void | erase (size_t key) |
|
| static size_t | mix (size_t key) |
|
| static constexpr size_t | kEmpty = static_cast<size_t>(-1) |
| static constexpr size_t | kTombstone = static_cast<size_t>(-2) |
◆ PackratCache()
| peg::PackratCache::PackratCache |
( |
size_t | expected_entries | ) |
|
|
inlineexplicit |
◆ erase()
| void peg::PackratCache::erase |
( |
size_t | key | ) |
|
|
inline |
◆ find()
| bool peg::PackratCache::find |
( |
size_t | key, |
|
|
size_t & | len, |
|
|
std::any & | val ) const |
|
inline |
◆ grow()
| void peg::PackratCache::grow |
( |
| ) |
|
|
inlineprivate |
◆ insert_or_assign()
| void peg::PackratCache::insert_or_assign |
( |
size_t | key, |
|
|
size_t | len, |
|
|
const std::any & | val ) |
|
inline |
◆ mix()
| size_t peg::PackratCache::mix |
( |
size_t | key | ) |
|
|
inlinestaticprivate |
◆ initial_capacity_
| size_t peg::PackratCache::initial_capacity_ = 1024 |
|
private |
◆ kEmpty
| size_t peg::PackratCache::kEmpty = static_cast<size_t>(-1) |
|
staticconstexprprivate |
◆ kTombstone
| size_t peg::PackratCache::kTombstone = static_cast<size_t>(-2) |
|
staticconstexprprivate |
◆ slots_
| std::vector<Slot> peg::PackratCache::slots_ |
|
private |
◆ used_
| size_t peg::PackratCache::used_ = 0 |
|
private |
◆ vals_
| std::vector<std::any> peg::PackratCache::vals_ |
|
private |
The documentation for this class was generated from the following file:
- libcockatrice_utility/libcockatrice/utility/peglib.h