Improve support for large objects (more than 960 keys, usually used as hash table)

[be5invis]

No description provided.

[kgabis]

I don't want to change the way keys are stored and accessed right now. The implementation is simple and adding a key is an O(1) operation (ignoring a possible reallocation). If you need a hash table with O(1) access time then using parson is not the right choice. You can parse an object using parson and then put all key/value pairs into an actual hash table.

[kgabis]

So what I wrote 5 years ago is incorrect. Adding a key is O(n) because it first checks if given key already exists (linear search). I'm currently working on using hash tables in json objects.