ANTLR3_HASH_ENTRY_struct - Online Linux Manual PageSection : 3
Updated : Tue Jan 26 2021
Source : Version 3.3.1
Note : ANTLR3C

NAMEANTLR3_HASH_ENTRY_struct − Internal structure representing an element in a hash bucket​.

SYNOPSIS
#include <antlr3collections​.h>

Public Member Functionsvoid (ANTLR3_CDECL *free)(void *data)
Pointer to routine that knows how to release the memory structure pointed at by data​.

Data Fieldsvoid * data
Pointer to the data for this particular entry​.
ANTLR3_HASH_KEY keybase
Key that created this particular entry​.
struct ANTLR3_HASH_ENTRY_struct * nextEntry
Pointer to the next entry in this bucket if there is one​.

Detailed DescriptionInternal structure representing an element in a hash bucket​. Stores the original key so that duplicate keys can be rejected if necessary, and contains function can be supported​. If the hash key could be unique I would have invented the perfect compression algorithm ;-)

Member Function Documentation

ANTLR3_HASH_ENTRY_struct::void (ANTLR3_CDECL * free)Pointer to routine that knows how to release the memory structure pointed at by data​. If this is NULL then we assume that the data pointer does not need to be freed when the entry is deleted from the table​.

Field Documentation

void* ANTLR3_HASH_ENTRY_struct::dataPointer to the data for this particular entry​. Referenced by antlr3EnumNext(), antlr3HashDelete(), antlr3HashDeleteI(), antlr3HashFree(), antlr3HashGet(), antlr3HashGetI(), antlr3HashPut(), antlr3HashPutI(), and antlr3ListRemove()​.

ANTLR3_HASH_KEY ANTLR3_HASH_ENTRY_struct::keybaseKey that created this particular entry​. Referenced by antlr3EnumNext(), antlr3HashFree(), antlr3HashGet(), antlr3HashGetI(), antlr3HashPut(), antlr3HashPutI(), antlr3HashRemove(), and antlr3HashRemoveI()​.

struct ANTLR3_HASH_ENTRY_struct* ANTLR3_HASH_ENTRY_struct::nextEntryPointer to the next entry in this bucket if there is one​. Sometimes different keys will hash to the same bucket (especially if the number of buckets is small)​. We could implement dual hashing algorithms to minimize this, but that seems over the top for what this is needed for​. Referenced by antlr3EnumNextEntry(), antlr3HashFree(), antlr3HashGet(), antlr3HashGetI(), antlr3HashPut(), antlr3HashPutI(), antlr3HashRemove(), and antlr3HashRemoveI()​.

AuthorGenerated automatically by Doxygen for ANTLR3C from the source code​.
0
Johanes Gumabo
Data Size   :   11,370 byte
man-ANTLR3_HASH_ENTRY_struct.3Build   :   2024-12-05, 20:55   :  
Visitor Screen   :   x
Visitor Counter ( page / site )   :   4 / 173,954
Visitor ID   :     :  
Visitor IP   :   3.149.242.223   :  
Visitor Provider   :   AMAZON-02   :  
Provider Position ( lat x lon )   :   39.962500 x -83.006100   :   x
Provider Accuracy Radius ( km )   :   1000   :  
Provider City   :   Columbus   :  
Provider Province   :   Ohio ,   :   ,
Provider Country   :   United States   :  
Provider Continent   :   North America   :  
Visitor Recorder   :   Version   :  
Visitor Recorder   :   Library   :  
Online Linux Manual Page   :   Version   :   Online Linux Manual Page - Fedora.40 - march=x86-64 - mtune=generic - 24.12.05
Online Linux Manual Page   :   Library   :   lib_c - 24.10.03 - march=x86-64 - mtune=generic - Fedora.40
Online Linux Manual Page   :   Library   :   lib_m - 24.10.03 - march=x86-64 - mtune=generic - Fedora.40
Data Base   :   Version   :   Online Linux Manual Page Database - 24.04.13 - march=x86-64 - mtune=generic - fedora-38
Data Base   :   Library   :   lib_c - 23.02.07 - march=x86-64 - mtune=generic - fedora.36

Very long time ago, I have the best tutor, Wenzel Svojanovsky . If someone knows the email address of Wenzel Svojanovsky , please send an email to johanes_gumabo@yahoo.co.id .
If error, please print screen and send to johanes_gumabo@yahoo.co.id
Under development. Support me via PayPal.