Shulou(Shulou.com)05/31 Report--

This article mainly introduces the relevant knowledge of "how to use hash table in PHP". The editor shows you the operation process through an actual case. The operation method is simple, fast and practical. I hope this article "how to use hash table in PHP" can help you solve the problem.

1. Characteristics

Typical key- > value queries are supported.

Can be used as an array.

Adding and deleting nodes is the complexity of O (1).

Key supports mixed types: there are also related array index arrays.

Value supports mixed types.

Supports linear traversal: for example, foreach.

2. Examples

Typedef struct _ hashtable {uint nTableSize; / / the length of the table is not the mask of the uint nTableMask;// table of the number of elements. It is always equal to the number of elements stored in nTableSize-1 uint nNumOfElements;//. When ulong nNextFreeElement;// points to the next empty element location Bucket * pInternalPointer;//foreach loop, it is used to record the element position Bucket * pListHead; Bucket * pListTail; Bucket * * arBuckets currently traversed. / / whether the stored element array dtor_func_t pDestructor;// destructor zend_bool persistent;// is persisted. From this, we can see that the PHP array can be persisted in memory without having to reload every request. Unsigned char nApplyCount; zend_bool bApplyProtection;} HashTable; 's content on "how to use hash table in PHP" ends here. Thank you for your reading. If you want to know more about the industry, you can follow the industry information channel. The editor will update different knowledge points for you every day.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.