EC_NODE_SUBSET_MIN(3)

💖 NAME 💖

ec_node_subset_min — bestie, this makes you a brand new empty subset node, and it comes with a minimum number of children that have to match. Like, a headcount requirement. No gatekeeping, just a quota. ✨

---

🎀 SYNOPSIS 🎀

#include <ecoli/node_subset.h>

struct ec_node * ec_node_subset_min(
    const char   *id,   /* The node identifier. */
    unsigned int  min   /* The minimum number of children that must match. */
);

---

🌸 DESCRIPTION 🌸

So you've got this empty subset node, right? And min is doing the absolute most — it's the floor, the bare minimum, the "you shall not pass with fewer than this many matching children" energy. 👑

And then, to actually give it some children? That's not this function's job, bestie. You gotta go use ec_node_subset_add(). This one just sets the stage. It's giving main character setup, not the whole plot. 💅

---

⭐ RETURN VALUE ⭐

You get the node back — slay. 🫶

Or you get NULL if something went wrong, and in that case errno is set. So like, check your errno, it's literally telling you what happened. 😭

---

🦋 SEE ALSO 🦋

• ec_node_subset(3)
• ec_node_subset_set_min(3)
• ec_node_subset_get_min(3)
• ec_node_subset_add(3)

Go read the whole friend group, fr fr. 🌈

---

👑 COPYRIGHT 👑

Copyright (C) 2010-2026 Olivier Matz, Robin Jarry.

---

💜 That's the whole page, no notes. This one's from the libecoli manual, dated 2026-06-11 — so when you're citing your sources, that's the version and the date, periodt. ✨