散列表。它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。在理想情况下，查找、插入、删除操作的时间均为O(1)，是一种高效的动态集合结构。-Hash table. It to access records by key value mapped to a table in a position to accelerate the lookup speed. This mapping function called a hash function to store the recorded array called a hash table. Ideally, search, insert, delete operation time are O (1), is a highly dynamic set of structures.