QuickHashStringIntHash::delete

(No version information available, might only be in Git) This method deletes am entry from the hash public bool QuickHashStringIntHash::delete ( string $key ) This method deletes an entry from the hash, and returns whether the entry was deleted or not. Associated memory structures will not be freed immediately, but rather when the hash itself is freed. Elements can not be deleted when the hash is used in an iterator. The m

QuickHashStringIntHash::__construct

(No version information available, might only be in Git) Creates a new QuickHashStringIntHash object public QuickHashStringIntHash::__construct ( int $size [, int $options = 0 ] ) This constructor creates a new QuickHashStringIntHash. The size is the amount of bucket lists to create. The more lists there are, the less collisions you will have. Options are also supported. Parameters:

QuickHashStringIntHash::add

(No version information available, might only be in Git) This method adds a new entry to the hash public bool QuickHashStringIntHash::add ( string $key, int $value ) This method adds a new entry to the hash, and returns whether the entry was added. Entries are by default always added unless QuickHashStringIntHash::CHECK_FOR_DUPES has been passed when the hash was created. Parameters:

QuickHashIntHash::update

(PECL quickhash >= Unknown) This method updates an entry in the hash with a new value public bool QuickHashIntHash::update ( int $key, int $value ) This method updates an entry with a new value, and returns whether the entry was update. If there are duplicate keys, only the first found element will get an updated value. Use QuickHashIntHash::CHECK_FOR_DUPES during hash creation to prevent duplicate keys from being part of

QuickHashIntHash::set

(PECL quickhash >= Unknown) This method updates an entry in the hash with a new value, or adds a new one if the entry doesn't exist public bool QuickHashIntHash::set ( int $key, int $value ) This method tries to update an entry with a new value. In case the entry did not yet exist, it will instead add a new entry. It returns whether the entry was added or update. If there are duplicate keys, only the first found element w

QuickHashIntHash::saveToString

(PECL quickhash >= Unknown) This method returns a serialized version of the hash public string QuickHashIntHash::saveToString ( void ) This method returns a serialized version of the hash in the same format that loadFromString() can read. Returns: This method returns a string containing a serialized format of the hash. Each element is stored as a four byte value in the Endianness that the curre

QuickHashIntHash::saveToFile

(PECL quickhash >= Unknown) This method stores an in-memory hash to disk public void QuickHashIntHash::saveToFile ( string $filename ) This method stores an existing hash to a file on disk, in the same format that loadFromFile() can read. Parameters: filename The filename of the file to store the hash in. Returns: No value is returned.

QuickHashIntHash::loadFromString

(PECL quickhash >= Unknown) This factory method creates a hash from a string public static QuickHashIntHash QuickHashIntHash::loadFromString ( string $contents [, int $options ] ) This factory method creates a new hash from a definition in a string. The file format consists of 32 bit signed integers packed together in the Endianness that the system that the code runs on uses. For each element there are two 32 bit signed i

QuickHashIntHash::loadFromFile

(PECL quickhash >= Unknown) This factory method creates a hash from a file public static QuickHashIntHash QuickHashIntHash::loadFromFile ( string $filename [, int $options ] ) This factory method creates a new hash from a definition file on disk. The file format consists of a signature 'QH\0x11\0', the number of elements as a 32 bit signed integer in system Endianness, followed by 32 bit signed integers packed together in

QuickHashIntHash::getSize

(PECL quickhash >= Unknown) Returns the number of elements in the hash public int QuickHashIntHash::getSize ( void ) Returns the number of elements in the hash. Parameters: key The key of the entry to add. Returns: The number of elements in the hash. Examples: QuickHashIntHash::get