QB_TRIE_CREATE(3)

πŸ’– QB_TRIE_CREATE πŸ’–

okay bestie, so this is a page from the libqb Programmer's Manual (that's the libqb crew's own little doc set, mwah 😘) and it's all about one single, tiny, iconic function. let's get into it πŸ¦‹


✨ NAME ✨

qb_trie_create β€” Create a sorted map using a Patricia trie or "Radix tree".

no fr, that's the whole thing. it makes you a sorted map, and the data structure under the hood is a Patricia trie, aka a "Radix tree". yes both names, she answers to both πŸ’…


✨ SYNOPSIS ✨

#include <qb/qbmap.h>

qb_map_t * qb_trie_create(
    void
);

so you pull in qb/qbmap.h, and then you call qb_trie_create() with no arguments at all β€” void, she takes nothing β€” and she hands you back a qb_map_t *. that's it, that's the whole contract πŸŽ€


✨ DESCRIPTION ✨

okay so… the original page literally has nothing here. like, the DESCRIPTION heading is there and then it's just vibes and silence πŸ™ˆ. so i'm not gonna make anything up, bestie β€” no cap, there is no description text on this page. the name up top and the synopsis are doing all the talking. slay, i guess?? 😭

fr fr, don't let me invent behaviour for you. everything this page actually tells you is in NAME and SYNOPSIS. that's it.

✨ SEE ALSO ✨

the girlies she hangs out with πŸ‘‘ β€” go read these too, they're all part of the same little map/trie/iterator friend group:


Copyright (C) 2010-2020 Red Hat, Inc.

that's the legal tea, keep it cute, keep it intact 🌸


and that's the page!! πŸ’œ this one came from the LIBQB manual set, dated 2025-09-16, and it's filed under QB_TRIE_CREATE(3). go forth and build your sorted map, main character 🧚✨ bye bestie!! 🫢

πŸ“¦ where this page comes from