The QuickHashIntStringHash class

&reftitle.intro; This class wraps around a hash containing integer numbers, where the values are strings. Hashes are also available as implementation of the ArrayAccess interface. Hashes can also be iterated over with foreach as the Iterator interface is implemented as well. The order of which elements are returned in is not guaranteed.

&reftitle.classsynopsis; QuickHashIntStringHash QuickHashIntStringHash &Constants; const int QuickHashIntStringHash::CHECK_FOR_DUPES 1 const int QuickHashIntStringHash::DO_NOT_USE_ZEND_ALLOC 2 const int QuickHashIntStringHash::HASHER_NO_HASH 256 const int QuickHashIntStringHash::HASHER_JENKINS1 512 const int QuickHashIntStringHash::HASHER_JENKINS2 1024 &Methods;

&reftitle.constants; QuickHashIntStringHash::CHECK_FOR_DUPES If enabled, adding duplicate elements to a set (through either QuickHashIntStringHash::add or QuickHashIntStringHash::loadFromFile) will result in those elements to be dropped from the set. This will take up extra time, so only used when it is required. QuickHashIntStringHash::DO_NOT_USE_ZEND_ALLOC Disables the use of PHP's internal memory manager for internal set structures. With this option enabled, internal allocations will not count towards the memory_limit settings. QuickHashIntStringHash::HASHER_NO_HASH Selects to not use a hashing function, but merely use a modulo to find the bucket list index. This is not faster than normal hashing, and gives more collisions. QuickHashIntStringHash::HASHER_JENKINS1 This is the default hashing function to turn the integer hashes into bucket list indexes. QuickHashIntStringHash::HASHER_JENKINS2 Selects a variant hashing algorithm.