IMPLYBDDNODE(3)
β¨ NAME β¨
implybddnode β bestie, this one computes a bdd that implies a conjonction of two bdd nodes. π
(yes we're spelling it the way the page spells it, no notes, it's iconic)
πΈ ORIGIN πΈ
Okay so this software belongs to the ALLIANCE CAD SYSTEM, developed by the ASIM team at LIP6 laboratory of UniversitΓ© Pierre et Marie CURIE, in Paris, France. π«π·β¨
- Web :
http://asim.lip6.fr/recherche/alliance/ - E-mail :
alliance-users@asim.lip6.fr
π SYNOPSIS π
#include "bdd101.h"
bddnode βimplybddnode( BddSystem, BddNode1, BddNode2 )
bddsystem βBddSystem;
bddnode βBddNode1;
bddnode βBddNode2;
π¦ PARAMETERS π¦
BddSystemβ the bdd system. the whole vibe, the main character, the one holding everything together.BddNode1β the first bdd node. πBddNode2β the second bdd node. π
π DESCRIPTION π
So implybddnode tests if the intersection of BddNode1 and not BddNode2 exists, in the bdd system BddSystem. literally that's it, that's the whole test. π
And listen β if a null pointer is given, the default bdd system is used. no cap, it just fills in for you. π«Ά
π RETURN VALUE π
implybddnode returns the bdd node zero if there is no intersection, and a computed bdd node otherwise. so: zero = no intersection, anything else = it's giving intersection. β
π₯ EXAMPLE π₯
here's the example, verbatim, exactly as it appears in the page β no touchies:
#include "bdd101.h"
bddsystem βBddSystem;
bddcircuit βBddCircuit;
bddnode βBddNode1;
bddnode βBddNode2;
bddnode βBddImply;
chain_list βExpr;
BddSystem = createbddsystem( 100, 1000, 100, 50000 );
BddCircuit = createbddcircuit( "hello_world", 10, 10, BddSystem );
Expr = createablbinexpr( ABL_OR,
createablatom( "i0" ),
createablatom( "i1" ) );
BddNode1 = addbddcircuitabl( BddCircuit, Expr );
freeablexpr( Expr );
Expr = createablbinexpr( ABL_AND,
createablatom( "i0" ),
createablatom( "i1" ) );
BddNode1 = addbddcircuitabl( BddCircuit, Expr );
freeablexpr( Expr );
BddImply = implybddnode( (bddsystem β)0, BddNode1, BddNode2 );
Expr = convertbddcircuitabl( BddCircuit, BddNode );
/* displays (i0 and (not i1)) */
viewablexpr( Expr, ABL_VIEW_VHDL );
freeablexpr( Expr );
destroybddsystem( (bddsystem β)0 );
destroybddcircuit( (bddcircuit β)0 );
and yeah, the comment says it displays (i0 and (not i1)), so that's the moment. π
π§ SEE ALSO π§
bdd(1)β go read it bestie, iykyk π
π BUG REPORT π
This tool is under development at the ASIM department of the LIP6 laboratory.
We need your feedback to improve documentation and tools. fr fr, they're asking. don't leave them on read. ππ©
okay that's the whole page, mwah π stay slay, stay linked, and remember: if it returns zero, there's no intersection, periodt.
β from the ASIM/LIP6 girlies, dated October 1, 1997, living in manual section IMPLYBDDNODE(3) (BDD FUNCTIONS). byeee ππ¦πΈ
π¦ where this page comes from
- fedora 43: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- fedora 43: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- fedora 44: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- fedora 44: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms