start a new mark

return a mark's cost in milliseconds

get partitioner of this walk engine

get edge's partition

* Construct a @ref locked_table object that owns all the locks in the * table. * * @return a \ref locked_table instance */

* Returns the allocator associated with the map * * @return the associated allocator */

* Returns the hashpower of the table, which is log<SUB>2</SUB>(@ref * bucket_count()). * * @return the hashpower */

get all self vertex's view

* Removes all elements in the table, calling their destructors. */

* @brief getter * @return */

* Reserve enough space in the table for the given number of elements. If * the table can already hold that many elements, the function will shrink

* Returns the function that compares keys for equality * * @return the key comparison function */

* Resizes the table to the given hashpower. If this hashpower is not larger * than the current hashpower, then it decreases the hashpower to the

* Returns the number of elements in the table. * * @return number of elements in the table */

* Returns the function that hashes the keys * * @return the hash function */

* Sets the maximum hashpower the table can be. If set to @ref * LIBCUCKOO_NO_MAXIMUM_HASHPOWER, there will be no limit on the hashpower. * Other

* Sets the minimum load factor allowed for automatic expansions. If an * expansion is needed when the load factor of the table is lower than this

* move walker to a new vertex * * \param v_i vertex-id to send to * \param walker walker wait to move * * */

keep footprint in current partition

* @brief getter * @return */