EC_NODE_SUBSET_GET_MIN(3)
π NAME π
ec_node_subset_get_min β bestie, this one just tells you the minimum number of children that must match. That's it, that's the whole gig. β¨
π SYNOPSIS π
okay so first you gotta pull in the header, like so:
#include <ecoli/node_subset.h>
and then the function itself is giving very much:
unsigned int ec_node_subset_get_min(
const struct ec_node *node /* The subset node. */
);
that node argument is the subset node, she's a const struct ec_node * and she's not getting modified, periodt. π
πΈ RETURN VALUE πΈ
so it hands you back the minimum number, no cap. π«Ά
but listen β if the node is not a subset? you get 0. zero. nada. that's your little tell. π
π¦ SEE ALSO π¦
the whole subset friend group, go say hi:
iykyk, they all vibe together. π
π COPYRIGHT π
Copyright (C) 2010-2026 Olivier Matz, Robin Jarry.
ngl this page was living in the Libecoli Programmer's Manual the whole time, dated 2026-06-11, and it's libecoli coded through and through. π slay, go read the whole subset saga, mwah πβ¨
π¦ where this page comes from
- fedora 44: libecoli-devel 0.11.7-1.fc44 Β· BSD-3-Clause AND LicenseRef-Fedora-Public-Domain
- fedora 44: libecoli-devel 0.11.7-1.fc44 Β· BSD-3-Clause AND LicenseRef-Fedora-Public-Domain
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms