This is the size of the memory allocation requested by the user. The memory range [getMemory(), getMemory() + getSize()) is usable.

Insert a key->value mapping into the pool. Returns true if the insertion was successful, false otherwise. This will not overwrite existing data, and s

@param capacity number of maximum entries for the hash table @return bytes required for the hashtable to fit

Returns the unique index.

Get the total size of all cached objects in bytes.

maps the segment into the address for the segment's current length. If the segment is invalid or deleted, returns false and does nothing. @param add

returns the number of allocations that can be made out of a Slab.

Returns the region id.

returns the poolId of this memory pool.

Return true if data is nullptr

Returns the current open status.

number of slabs in this class id

@return key as StringPiece

Returns the 64-bit offset.

throws error on any failure. */

Adds a 64-bit offset to the existing offset and returns the new @AbsAddress. @param ofs the 64-bit offset to be added

get n random allocation sizes which are at least minSize bytes long.

fetch the allocation size for the pool id and class id. @param pid the pool id @param cid the allocation class id @return the allocation size corr

* Get the actual bytes indexes that we need to return for the request. * Returns folly::none if no or invalid range provided. */

For nano second granularity, std::chrono::steady_clock seems to do a fine job.

track latency by taking the value of duration directly.

Get the current L1 entries number limit.

Return end of the data

Return true iff item handle is ready to use. Empty handles are considered ready with it_ == nullptr.

Invalidates this iterator