Moving the hash_node_t to improve locality of reference

While performing a search, hash_table_t reads a key and a pointer to the next node. Code will work faster if both fields reside in the same cache line.

This issue was created to find inefficient hash_table_t usage and fix it by reordering fields in classes.

NFC