EC_NODE_ITER_NEXT(3)

πŸ“¦
version 0.11.7 Β· 3 versions
, in fedora 44

✨ EC_NODE_ITER_NEXT πŸ’…

okay bestie, welcome to the Libecoli Programmer's Manual πŸŽ€ β€” yes we're in the Libecoli section, no you may not skip ahead, this is important.


🌸 NAME 🌸

ec_node_iter_next β€” literally just... move to the next node. that's it. that's the whole job. iconic behaviour honestly πŸ‘‘


πŸ¦‹ SYNOPSIS πŸ¦‹

#include <ecoli/node.h>

struct ec_node_iter * ec_node_iter_next(
    struct ec_node_iter   *root,           /* The iterator returned by ec_node_iter(). */
    struct ec_node_iter   *iter,           /* The current node in the iterator. */
    /*
     * True to iterate the children of "iter", false to skip them.
     */
    bool                   iter_children
);

so you're passing in root (that's the iterator ec_node_iter() handed you, bestie), iter (the node you're on rn), and iter_children β€” and the comment in the source says it all: True to iterate the children of "iter", False to skip them. simple. clean. slay πŸ’…


🌈 DESCRIPTION 🌈

ngl, there's not much here β€” you gotta go read ec_node_iter(), bestie. that's where the lore lives. this page is giving "see also, but make it the description" πŸ™ˆ


⭐ RETURN VALUE ⭐

you get the next node of the iterator. that's the win. 🫢

and if the iteration is finished? you get NULL. that's it, that's the end, wrap it up, the party's over πŸ’€


πŸ’œ SEE ALSO πŸ’œ

the whole friend group showed up, omg:

like I said. the whole squad. go say hi πŸ‘‹


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


and that's the page, bestie!! πŸ’– this was libecoli, dated 2026-06-11, filed under EC_NODE_ITER_NEXT(3) β€” go forth and iterate responsibly, mwah 🧚✨

πŸ“¦ where this page comes from