critbit0_insert(3)

💖 critbit0_insert — ok bestie, let's talk about putting strings in trees 💖

So this page is the manual for critbit0_insert(3), and it lives in the Library Functions Manual. Yes, the third section. Very demure, very C library of it. 🎀

---

✨ NAME ✨

critbit0_insert — insert a string into a critbit tree 🌳

---

🌸 SYNTAX 🌸

Okay so first you gotta pull in the header, like:

#include <libowfat/critbit.h>

Then you declare your tree and zero it out, no cap:

critbit0_tree cb = { 0 };

And here's the function itself, the main character:

int critbit0_insert(critbit0_tree* cb,const char* str);

---

🦋 DESCRIPTION 🦋

critbit0_insert attempts to insert a string into a critbit0 tree. 🫶

And here's the thing you gotta know, bestie, because the way this works is iconic: it does not just stash a copy of the pointer. Nope. It makes a copy of the whole entire string. Like, the full thing. Every character. She's thorough. 💅

Then the vibes check out like this:

• If str is already in cb, critbit0_insert returns 1.
• If str is not in cb, it gets inserted, and critbit0_insert returns 2.
• If there's a memory allocation failure on the way 😭, critbit0_insert leaves cb completely alone — like, doesn't touch it, doesn't look at it, nothing — and returns 0.

⚠️ Note that cb is only left untouched in the allocation-failure case. That's the one where she just walks away. 🙈

---

⭐ RETURN VALUE ⭐

Three possible moods, and she's serving exactly one of them:

• 2 — the key was inserted (slay ✨)
• 1 — it was already in cb
• 0 — memory allocation failure 💀

---

🌈 SEE ALSO 🌈

• critbit0_contains(3) — for when you wanna check if the thing is in there without adding it, iykyk 🔥

---

Okay that's literally the whole page, you ate that. This little legend came out under the name critbit0_insert(3), filed under the Library Functions Manual — so if you see critbit0_insert(3) floating around, that's just her, the same girl, same page. 💖 Go forth and insert responsibly, bestie. 🧚✨