SC_EAVLMMAP(3)

✨ NAME ✨

sc::EAVLMMap< K, T > — okay bestie, this is a page straight out of the Library Functions Manual, and it's the whole class reference for sc::EAVLMMap< K, T >. That's it, that's the name. No long description, no little tagline, just the class itself sitting there with main character energy. 👑

---

🌸 SYNOPSIS 🌸

🦋 Classes 🦋

• class iterator — yes, there's a nested class, and it's literally called iterator. She's iconic, she's inside the map, we love her. 🫶

💅 Public Member Functions 💅

Okay so here's the entire roster, copied exactly as it appears, because we do not paraphrase function signatures in this house:

T *& rlink (T *n) const
T * rlink (const T *n) const
T *& llink (T *n) const
T * llink (const T *n) const
T *& uplink (T *n) const
T * uplink (const T *n) const
int & balance (T *n) const
int balance (const T *n) const
K & key (T *n) const
const K & key (const T *n) const
int compare (T *n, T *m) const
int compare (T *n, const K &m) const
EAVLMMap (EAVLMMapNode< K, T > T::*node)
void initialize (EAVLMMapNode< K, T > T::*node)
void clear_without_delete ()
void clear ()
void insert (T *)
void remove (T *)
T * find (const K &) const
int height (T *node)
int height ()
void check ()
void check_node (T *) const
T * start () const
void next (const T *&) const
void next (T *&) const
iterator begin ()
iterator end ()
void print ()
int length () const
int depth (T *)

vibe check: notice how many of these come in little matched pairs — one taking T *n, one taking const T *n; one handing back a reference like T *& or int & or K &, one handing back a plain pointer. Overload besties. They do everything together. 🧚

A couple of cuties to point out, because look at them:

• The constructor EAVLMMap (EAVLMMapNode< K, T > T::*node) and void initialize (EAVLMMapNode< K, T > T::*node) both take a pointer-to-member of type EAVLMMapNode< K, T > T::*node. That syntax is giving "I know exactly which field I want" and honestly, slay.
• int height (T *node) and int height () are the same name twice — one takes a node, one takes nothing at all. She contains multitudes.
• void next (const T *&) const and void next (T *&) const — again, the const/non-const twin situation.
• int compare (T *n, T *m) const and int compare (T *n, const K &m) const — comparing a node against another node, or against a key. Two flavours, zero judgement.
• iterator begin () and iterator end () — the classic duo. Periodt. 🔥

No description text, no parameters explained, no return values spelled out, no caveats in the original — so I'm not out here inventing lore for you. What you see is what the page gives. No cap. 💀

---

🎀 Author 🎀

Generated automatically by Doxygen for MPQC from the source code. 🦋 So no human author to thank, it's just the robot doing robot things, and we respect the robot's hustle. 💜

---

And that's the whole page, bestie — it came to you from MPQC, Version 2.3.1, and the footer was just the class name waving goodbye: sc::EAVLMMap< K, T >(3). Go forth and map your little hearts out. 🌈⭐💖