TFIND(3POSIX)

🎀 PROLOG 🎀

okay bestie, before we even get into it — this page is part of the POSIX Programmer's Manual. that's the lore. but heads up: the Linux implementation of this interface may differ (so pls go consult the corresponding Linux manual page for the deets on Linux behavior, fr), or honestly the interface might just not be implemented on Linux at all. vibe check accordingly. 💅

✨ NAME ✨

tfind — search binary search tree 🌳

🦋 SYNOPSIS 🦋

#include <search.h>

void *tfind(const void *key, void *const *rootp,
    int (*compar)(const void *, const void *));

🌸 DESCRIPTION 🌸

so like… refer to tdelete(). that's it, that's the whole description. she's brief, she's iconic, she contains multitudes. 👑

💜 COPYRIGHT 💜

Portions of this text are reprinted and reproduced in electronic form from IEEE Std 1003.1-2017, Standard for Information Technology -- Portable Operating System Interface (POSIX), The Open Group Base Specifications Issue 7, 2018 Edition, Copyright (C) 2018 by the Institute of Electrical and Electronics Engineers, Inc and The Open Group. In the event of any discrepancy between this version and the original IEEE and The Open Group Standard, the original IEEE and The Open Group Standard is the referee document. The original Standard can be obtained online at http://www.opengroup.org/unix/online.html .

Any typographical or formatting errors that appear in this page are most likely to have been introduced during the conversion of the source files to man page format. To report such errors, see https://www.kernel.org/doc/man-pages/reporting_bugs.html .

no cap, if the two ever disagree, the original Standard wins. she's the referee, periodt. 📜

and that's the whole page, bestie!! this lil cutie was brought to you by IEEE/The Open Group, dated 2017, and she lives at TFIND(3POSIX). slay, go touch some search.h 💖✨🫶