* @brief ge buffer * @return */

* @brief * @return */

* @brief * @return */

* @brief * @return */

* @brief * @return */

* @brief * @return */

* get edge's partition * * \param src source vertex id * \param dst destination vertex id * * \return partition_id **/

* get edge's partition * * \param src source vertex id * \param dst destination vertex id * * \return partition_id **/

get edge's partition

get edge's partition

* @brief getter and forward * @return */

* @brief * @return */

hashmask returns the bitmask for the buckets array corresponding to a given hashpower.

* @return the hashpower we were trying to expand to */

hashsize returns the number of buckets corresponding to a given hashpower.

* Open a connection to the filesystem. The default arguments * should be sufficient for most uses */

* @brief no copy constructor */

* @brief getter * @return */

* @brief index getter * @return index_ */

index_hash returns the first possible bucket that the given hashed key could be.

* @brief decoder * @param output - result * @param s_input - input string * @return is success */

This is just here to avoid compiler warnings with macro constants and boolean literals

Whether or not the data is nothrow-move-constructible.

true if the key is small and simple, which means using partial keys for lookup would probably slow us down