ANTLR3_INT_TRIE_struct(3)

📦 version 3.4, in fedora 43

✨ ANTLR3_INT_TRIE_struct — the vibe check 💅

okay bestie, gather round, because today we're talking about ANTLR3_INT_TRIE_struct from the ANTLR3C manual (section 3, the library-functions girlies 🫶). This is the struct that literally defines an ANTLR3_INT_TRIE, no cap.

🌸 SYNOPSIS 🌸

#include <antlr3collections.h>

🎀 Data Fields 🎀

  • ANTLR3_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 Description 💖

So the whole plot of this struct is: it defines an ANTLR3_INT_TRIE. That's the main character arc. ✨

For this particular implementation, as you might expect, the key gets turned into a "string" by peeking at bit(key, depth) of the integer key. And the way that using 64 bit keys gives us a depth limit of 64 (or bit 0..63) and potentially a huge trie?? it's giving iconic, honestly. This is the algorithm for a Patricia Trie. Also note that this trie [can] accept multiple entries for the same key, which makes it a kind of elastic bucket patricia trie. obsessed.

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. Like, go off, queen 👑. 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 — respect the ancestors, bestie 🙏.

— 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::allowDups

Referenced by intTrieAdd().

ANTLR3_UINT32 ANTLR3_INT_TRIE_struct::count

Referenced by antlr3IntTrieNew(), intTrieAdd(), and intTrieGet().

pANTLR3_INT_TRIE_NODE ANTLR3_INT_TRIE_struct::current

(this one's just out here living its best life, no references listed, we respect the mystery 🙈)

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::root

Referenced by antlr3IntTrieNew(), intTrieAdd(), intTrieDel(), intTrieFree(), and intTrieGet().

🌈 Author 🌈

Generated automatically by Doxygen for ANTLR3C from the source code. (not a human, just a very diligent robot 💀✨)

fr fr, that's the whole page. every field, every reference, nothing skipped. periodt. 💅

okay bye bestie, this was Version 3.3.1, dated Tue Jul 29 2025 00:00:00, and it's the ANTLR3_INT_TRIE_struct(3) page from the ANTLR3C manual. slay 🎀🦋💖

📦 where this page comes from