@brief Get an iterator to the first element. @return An iterator to the first element.

* @brief read one request from trace file * * @param reader * @param req * @return 0 if success, 1 if end of file */

remove the object from the built-in doubly linked list * * @param head * @param tail * @param cache_obj */

@brief Get an iterator to the past-the-last element. @return An iterator to the past-the-last element.

* allocate a new request_t struct and fill in necessary field * @return */

* @brief this function is called by all eviction algorithms to initialize the * cache * * @param ccache_params common cache parameters * @param in

* @brief this function is called by all eviction algorithms to free the cache * * @param cache */

NOLINTNEXTLINE(modernize-use-nodiscard)

* free the memory used by req * @param req */

* @brief this function is called by all eviction algorithms * it performs the following logic * * ``` * if obj in cache: * update_metadata *

@brief Construct a new type_error object with an error message and a node type. @param[in] msg An error message. @param[in] type The type of a source

end user facing functions init, free, get * @brief initialize a LRU cache * * @param ccache_params some common cache parameters * @param cache_sp

* @brief this function is called by all eviction algorithms that * need to remove an object from the cache, it updates the cache metadata, * because

* copy the cache_obj to req_dest * @param req_dest * @param cache_obj */

reserves space for the specified number of elements. Makes sure the old data fits. Exactly the same as rehash(c). Use rehash(0) to shrink to fit.

@brief Get the number of lines already processed. @return uint32_t The number of lines already processed.

* prepend the object to the head of the doubly linked list * the object is not in the list, otherwise, use move_obj_to_head * @param head * @param

* @brief initialize a ARC cache * * @param ccache_params some common cache parameters * @param cache_specific_params ARC specific parameters, shoul

* @brief this function is called by all eviction algorithms in the eviction * function, it updates the cache metadata. Because it frees the object st

* @brief this function is called by all caches to * insert an object into the cache, update the hash table and cache metadata * this function assume

@brief Get the beginning position of a last token. @return uint32_t The beginning position of a last token.

conversion from malloc headers to user pointers, and back

Treat space at ptr +/- offset as a chunk

* @brief this function is called by eviction algorithms that use * the hash table to find whether an object is in the cache * * @param cache * @pa

@brief Get the iterator to the past-the-end element. (Always constant) @return The iterator to the past-the-end element.

@brief Set YAML directive properties to the given node. @param node A basic_node_type object to be set YAML directive properties.

Clears all data, without resizing.

* generate pseudo rand number, taken from LHD simulator * random number generator from Knuth MMIX * @return */

This is the normal insert routine, used by the outside world

@brief A wrapper function to call std::unreachable() (since C++23) or similar compiler specific extensions. @note This function is implemented only fo

@brief Construct a new exception object with an error message. @param[in] msg An error message. @sa https://fktn-k.github.io/fkYAML/api/exception/cons

* @brief initialize a Clock cache * * @param ccache_params some common cache parameters * @param cache_specific_params Clock specific parameters as

@brief Constructs a new basic_node Value object for null types.

@brief Get the iterator to the first element. (Always constant) @return The iterator to the first element.

Returns 1 if key is found, 0 otherwise.

Iterator functions ------------------

OK, we'll let you resize one of these puppies

* @brief whether the request can be inserted into cache * * @param cache * @param req * @return true * @return false */

Check if (alleged) mstate m has expected magic field

We let you see if a bucket is non-empty without retrieving it -------------------------------------------------------------

@brief Checks if `byte` is a valid 1-byte UTF-8 character. @param[in] byte The byte value. @return true if `byte` is a valid 1-byte UTF-8 character, f

* This is a fast avalanche stage, * suitable when input bits are already partially mixed */

@brief Set YAML node properties (anchor and/or tag names) to the given node. @param node A node type object to be set YAML node properties.

This takes the specified elements out of the group. This is "undefining", rather than "clearing". TODO(austern): Make this exception safe: handle exc

@brief Finds the beginning position of `sv` characters in this referenced character sequence. @param sv The character sequence to compare with. @param

We also may want to know how many *used* buckets there are

* DISCLAIMER: There are known *seed-dependent* multicollisions here due to * multiplication by zero, affecting hashes of lengths 17 to 240. * * How

@brief Get the next lexical token by scanning the left of the input buffer. @return lexical_token The next lexical token.

replace all matching char in a string */

top_foot_size is padding at the end of a segment, including space that may be needed to place segment records and fenceposts when new noncontiguou

Constructs a basic_str_view object.

extract the data name from the datapath Args: datapath: path to the data file Return: dataname: the name of the data

* move an object to the head of the doubly linked list * @param head * @param tail * @param cache_obj */

this is the same function as setup_reader */