ANTLR3_INT_TRIE_struct - Online Linux Manual PageSection : 3
Updated : Tue Jan 26 2021
Source : Version 3.3.1
Note : ANTLR3C
NAMEANTLR3_INT_TRIE_struct − Structure that defines an ANTLR3_INT_TRIE.
SYNOPSIS
#include <antlr3collections.h>
Data FieldsANTLR3_BOOLEAN(* add )(struct ANTLR3_INT_TRIE_struct *trie, ANTLR3_INTKEY key, ANTLR3_UINT32 type, ANTLR3_INTKEY intVal, void *data, void(ANTLR3_CDECL *freeptr)(void *))
ANTLR3_BOOLEAN allowDups
ANTLR3_UINT32 count
pANTLR3_INT_TRIE_NODE current
ANTLR3_BOOLEAN(* del )(struct ANTLR3_INT_TRIE_struct *trie, ANTLR3_INTKEY key)
void(* free )(struct ANTLR3_INT_TRIE_struct *trie)
pANTLR3_TRIE_ENTRY(* get )(struct ANTLR3_INT_TRIE_struct *trie, ANTLR3_INTKEY key)
pANTLR3_INT_TRIE_NODE root
Detailed DescriptionStructure that defines an ANTLR3_INT_TRIE. For this particular implementation, as you might expect, the key is turned into a 'string' by looking at bit(key, depth) of the integer key. Using 64 bit keys gives us a depth limit of 64 (or bit 0..63) and potentially a huge trie. This is the algorithm for a Patricia Trie. Note also that this trie [can] accept multiple entries for the same key and is therefore a kind of elastic bucket patricia trie. If you find this code useful, please feel free to 'steal' it for any purpose as covered by the BSD license under which ANTLR is issued. You can cut the code but as the ANTLR library is only about 50K (Windows Vista), you might find it easier to just link the library. Please keep all comments and licenses and so on in any version of this you create of course. Jim Idle.
Field Documentation
ANTLR3_BOOLEAN(* ANTLR3_INT_TRIE_struct::add) (struct ANTLR3_INT_TRIE_struct *trie, ANTLR3_INTKEY key, ANTLR3_UINT32 type, ANTLR3_INTKEY intVal, void *data, void(ANTLR3_CDECL *freeptr)(void *))Referenced by antlr3IntTrieNew(), getRuleMemoization(), and memoize().
ANTLR3_BOOLEAN ANTLR3_INT_TRIE_struct::allowDupsReferenced by intTrieAdd().
ANTLR3_UINT32 ANTLR3_INT_TRIE_struct::countReferenced by antlr3IntTrieNew(), intTrieAdd(), and intTrieGet().
pANTLR3_INT_TRIE_NODE ANTLR3_INT_TRIE_struct::current
ANTLR3_BOOLEAN(* ANTLR3_INT_TRIE_struct::del) (struct ANTLR3_INT_TRIE_struct *trie, ANTLR3_INTKEY key)Referenced by antlr3IntTrieNew().
void(* ANTLR3_INT_TRIE_struct::free) (struct ANTLR3_INT_TRIE_struct *trie)Referenced by antlr3IntTrieNew(), freeBR(), and reset().
pANTLR3_TRIE_ENTRY(* ANTLR3_INT_TRIE_struct::get) (struct ANTLR3_INT_TRIE_struct *trie, ANTLR3_INTKEY key)Referenced by antlr3IntTrieNew(), getRuleMemoization(), and memoize().
pANTLR3_INT_TRIE_NODE ANTLR3_INT_TRIE_struct::rootReferenced by antlr3IntTrieNew(), intTrieAdd(), intTrieDel(), intTrieFree(), and intTrieGet().
AuthorGenerated automatically by Doxygen for ANTLR3C from the source code. 0
Johanes Gumabo
Data Size : 15,014 byte
man-ANTLR3_INT_TRIE_struct.3Build : 2024-12-05, 20:55 :
Visitor Screen : x
Visitor Counter ( page / site ) : 2 / 171,588
Visitor ID : :
Visitor IP : 3.15.142.42 :
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.