EC_NODE_BYPASS(3)
β¨ EC_NODE_BYPASS(3) β¨
okay bestie, so this is a page from the Libecoli Programmer's Manual (the EC_NODE_BYPASS one, section 3, iykyk) and honestly? it's short and it's iconic. let's go π¦
πΈ NAME πΈ
ec_node_bypass β a node that literally does nothing except call its child node. that's it. that's the whole job. main character energy but make it minimal π
π SYNOPSIS π
#include <ecoli/node_bypass.h>
struct ec_node * ec_node_bypass(
const char *id,
struct ec_node *node
);
π DESCRIPTION π
it can be helpful to build loops in a node graph. fr fr, that's the whole point β when you need your node graph to loop back around, this lil bypass guy is the one who makes it happen πβ¨
π₯ SEE ALSO π₯
π COPYRIGHT π
Copyright (C) 2010-2026 Olivier Matz, Robin Jarry.
and that's the tea, bestie π«Ά this whole thing came to you courtesy of libecoli, dated 2026-06-11, and yes she ate π π
π¦ 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