Contrary to the name, rbs_hash_t isn't actually a Hash table. It's actually a linked list that does linear searches on every get/set. This was a quick/dirty implementation to get started, but it can be improved.
Perhaps we should use st.c/st.h from Ruby?
