ANTLR3_INT_TRIE_NODE_struct(3)

📦 version 3.4, in fedora 43

💖 ANTLR3_INT_TRIE_NODE_struct(3) 💖

okay so bestie, welcome to the ANTLR3C manual, section 3, and today's main character is ANTLR3_INT_TRIE_NODE_struct. she's a struct. she's a whole vibe. let's get into it 🦋

✨ NAME ✨

ANTLR3_INT_TRIE_NODE_struct — the structure that defines an element/node in an ANTLR3_INT_TRIE. that's it, that's her job. iconic behavior honestly 💅

🌸 SYNOPSIS 🌸

#include <antlr3collections.h>

🎀 Data Fields 🎀

  • ANTLR3_UINT32 bitNum — this is the left/right bit index for traversal along the nodes. literally the little compass that tells you which way to go, no cap 🧭
  • pANTLR3_TRIE_ENTRY buckets — this is the data bucket(s) that the key indexes, which may be NULL. so like, it might be there, it might not, she's mysterious ✨
  • ANTLR3_INTKEY key — this is the actual key that the entry represents if it is a terminal node. the moment she's terminal, this is the receipts 🫶
  • struct ANTLR3_INT_TRIE_NODE_struct * leftN — pointer to the left node from here when sKey & bitNum = 0. go left bestie 👈
  • struct ANTLR3_INT_TRIE_NODE_struct * rightN — pointer to the right node from here when sKey & bitNum, = 1. and when that bit says otherwise, go right 👉

💫 Detailed Description 💫

Structure that defines an element/node in an ANTLR3_INT_TRIE. periodt. that's the whole description and she said what she said 💜

🔥 Field Documentation 🔥

⭐ ANTLR3_UINT32 ANTLR3_INT_TRIE_NODE_struct::bitNum

This is the left/right bit index for traversal along the nodes.

Referenced by antlr3IntTrieNew(), freeIntNode(), intTrieAdd(), and intTrieGet(). so basically everybody in the friend group knows her 😭

⭐ pANTLR3_TRIE_ENTRY ANTLR3_INT_TRIE_NODE_struct::buckets

This is the data bucket(s) that the key indexes, which may be NULL.

Referenced by freeIntNode(). just the one bestie, but a solid one 🫶

⭐ ANTLR3_INTKEY ANTLR3_INT_TRIE_NODE_struct::key

This is the actual key that the entry represents if it is a terminal node.

ngl, this field has no "Referenced by" line in the original, so don't come for me — I'm not inventing lore. she's lowkey keeping to herself 🙈

⭐ struct ANTLR3_INT_TRIE_NODE_struct* ANTLR3_INT_TRIE_NODE_struct::leftN

Pointer to the left node from here when sKey & bitNum = 0.

Referenced by antlr3IntTrieNew(), freeIntNode(), intTrieAdd(), and intTrieGet(). the way she's in everyone's business 💀

⭐ struct ANTLR3_INT_TRIE_NODE_struct* ANTLR3_INT_TRIE_NODE_struct::rightN

Pointer to the right node from here when sKey & bitNum, = 1.

Referenced by antlr3IntTrieNew(), freeIntNode(), and intTrieAdd(). three callers, not four — I'm counting, because accuracy is the whole vibe check ✅

👑 Author 👑

Generated automatically by Doxygen for ANTLR3C from the source code. so yeah, no human author to thank, just Doxygen doing her thing, and honestly? she ate 🤖✨

okay that's the whole page bestie!! Version 3.3.1, dated Tue Jul 29 2025 💖 this was ANTLR3C's documentation for ANTLR3_INT_TRIE_NODE_struct(3), brought to you by Doxygen, and you read the entire thing which is genuinely so slay of you 🎀🦋🌸💅

📦 where this page comes from