The hashtable object
The key
The length of key
The value
If a value with the given key already exists, its value is replaced with the new value. Value is "stealed" in the sense that hashtable doesn't increment its refcount but decreases the refcount when the value is no longer needed.
0 on success, -1 on failure (out of memory).
Add/modify value in hashtable