KJS::HashTable Struct Reference

#include <lookup.h>

Public Attributes

const HashEntryentries
int hashSize
int size
int type

Detailed Description

A hash table Usually the hashtable is generated by the create_hash_table script, from a .table file.

The implementation uses an array of entries, "size" is the total size of that array. The entries between 0 and hashSize-1 are the entry points for each hash value, and the entries between hashSize and size-1 are the overflow entries for the hash values that need one. The "next" pointer of the entry links entry points to overflow entries, and links overflow entries between them.

Definition at line 74 of file lookup.h.

Member Data Documentation

◆ entries

const HashEntry* KJS::HashTable::entries

pointer to the array of entries Mind that some entries in the array are null (0,0,0,0).

Definition at line 89 of file lookup.h.

◆ hashSize

int KJS::HashTable::hashSize

the maximum value for the hash.

Always smaller than size.

Definition at line 93 of file lookup.h.

◆ size

int KJS::HashTable::size

size is the total number of entries in the hashtable, including the null entries, i.e.

the size of the "entries" array. Used to iterate over all entries in the table

Definition at line 84 of file lookup.h.

◆ type

int KJS::HashTable::type

type is a version number.

Currently always 2

Definition at line 78 of file lookup.h.

The documentation for this struct was generated from the following file:
This file is part of the KDE documentation.
Documentation copyright © 1996-2023 The KDE developers.
Generated on Mon May 8 2023 03:51:05 by doxygen 1.8.17 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.