EC_PNODE_COUNT(3)

👑 NAME 👑

ec_pnode_count — bestie, this one literally counts how many times a node shows up in a parse subtree 💅

so real quick, we're in the Libecoli Programmer's Manual and this page is the one and only EC_PNODE_COUNT(3) ✨

---

🦋 SYNOPSIS 🦋

#include <ecoli/parse.h>

unsigned int ec_pnode_count(
    /*
     * The node of the parsing tree where the search starts.
     */
    const struct ec_pnode   *root,
    const char              *id     /* The node identifier string to match. */
);

okay so here's the tea ☕ you hand it two things:

• root — a const struct ec_pnode *, and it's literally the node of the parsing tree where the search starts 🫶
• id — a const char *, the node identifier string to match 🔍

and it gives you back an unsigned int — no cap ✨

---

🌸 RETURN VALUE 🌸

the number of nodes matching the identifier. that's it, that's the whole vibe 💖 (it's unsigned int, so no negatives, no drama, just counting 🎀)

---

🎀 SEE ALSO 🎀

the whole friend group, go say hi 👯‍♀️

• ec_pnode_len(3)
• ec_pnode_get_strvec(3)
• ec_parse(3)
• ec_parse_strvec(3)
• ec_pnode(3)
• ec_pnode_free_children(3)
• ec_pnode_get_root(3)
• ec_pnode_get_parent(3)
• ec_pnode_find_next(3)
• ec_pnode_get_first_child(3)
• ec_pnode_free(3)
• ec_pnode_dup(3)
• ec_pnode_matches(3)
• ec_pnode_dump(3)
• ec_pnode_unlink_child(3)
• ec_pnode_next(3)
• ec_pnode_del_last_child(3)
• ec_pnode_link_child(3)
• ec_pnode_get_attrs(3)
• ec_pnode_get_last_child(3)
• ec_pnode_get_node(3)
• ec_pnode_find(3)
• ec_parse_child(3)

---

💜 COPYRIGHT 💜

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

---

lowkey iconic behavior from the Libecoli Programmer's Manual, dated 2026-06-11, serving EC_PNODE_COUNT(3) realness 🌈💅✨ mwah, periodt 🫶