EC_NODE_MANY(3)

✨ EC_NODE_MANY(3) ✨

okay so bestie, welcome to EC_NODE_MANY(3) from the Libecoli Programmer's Manual 💖 this is the one where we make a node that just... does the same thing over and over again. iconic behaviour honestly 🎀

---

🌸 NAME 🌸

ec_node_many — bestie, this builds a many node, and a many node is literally a node that matches its child multiple times. that's the whole vibe. no cap. 💅

---

🦋 SYNOPSIS 🦋

#include <ecoli/node_many.h>

struct ec_node * ec_node_many(
    const char       *id,     /* The node identifier. */
    /*
     * The child node. It is consumed and will be freed when the parent is
     * freed, or immediately on error.
     */
    struct ec_node   *child,
    /*
     * Minimum number of repetitions. Use 0 for no minimum.
     */
    unsigned int      min,
    /*
     * Maximum number of repetitions. Use 0 for no maximum.
     */
    unsigned int      max
);

---

👑 DESCRIPTION 👑

so here's the tea on the args, one by one, because we do not skip details in this house 🫶

• id — the node identifier. that's it, that's the whole job 🎀
• child — the child node. important bestie, listen up: it is consumed — meaning it gets freed when the parent is freed, or immediately on error. so do not go freeing it yourself afterwards, that's giving double-free energy 💀
• min — minimum number of repetitions. use 0 for no minimum ✨
• max — maximum number of repetitions. use 0 for no maximum ✨

---

💅 RETURN VALUE 💅

you get the node back 🌈 ... or NULL on error, in which case errno is set. check it, bestie, don't just rawdog the return value 😭

---

🍓 SEE ALSO 🍓

• ec_node_many_set_params(3) — go read it, iykyk 💜

---

🧚 COPYRIGHT 🧚

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

---

and that's the page!! 🦋 this was libecoli, dated 2026-06-11, and you absolutely ate it bestie 💖 periodt ✨