abc/src/bdd/cudd/cuddClip.c
DdNode *
cuddBddClippingAndAbstract(
  DdManager * dd /* manager */,
  DdNode * f /* first conjunct */,
  DdNode * g /* second conjunct */,
  DdNode * cube /* cube of variables to be abstracted */,
  int  maxDepth /* maximum recursion depth */,
  int  direction /* under (0) or over (1) approximation */)
{
    DdNode *res;

    res = cuddBddClipAndAbsRecur(dd,f,g,cube,maxDepth,direction);

    return(res);

}
/**Function********************************************************************

  Synopsis    [Approximates the conjunction of two BDDs f and g and
  simultaneously abstracts the variables in cube.]

  Description [Approximates the conjunction of two BDDs f and g and
  simultaneously abstracts the variables in cube. Returns a
  pointer to the resulting BDD if successful; NULL if the intermediate
  result blows up.]

  SideEffects [None]

  SeeAlso     [Cudd_bddClippingAndAbstract]

******************************************************************************/
Function
Synopsis    [Approximates the conjunction of two BDDs f and g and
simultaneously abstracts the variables in cube.]

Description [Approximates the conjunction of two BDDs f and g and
simultaneously abstracts the variables in cube. Returns a
pointer to the resulting BDD if successful; NULL if the intermediate
result blows up.]




Function Synopsis [ Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube . ] Description [ Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube . Returns a pointer to the resulting BDD if successful ; NULL if the intermediate result blows up . ]
DdNode *
cuddBddClippingAndAbstract(
  DdManager * dd ,
  DdNode * f ,
  DdNode * g ,
  DdNode * cube ,
  int  maxDepth ,
  int  direction )
{
    DdNode *res;
    res = cuddBddClipAndAbsRecur(dd,f,g,cube,maxDepth,direction);
    return(res);
}
DdNode * cuddBddClippingAndAbstract ( DdManager * dd , DdNode * f , DdNode * g , DdNode * cube , int maxDepth , int direction ) { DdNode * res ; res = cuddBddClipAndAbsRecur ( dd , f , g , cube , maxDepth , direction ) ; return ( res ) ; }
Function
Synopsis    [Approximates the conjunction of two BDDs f and g and
simultaneously abstracts the variables in cube.]
Function Synopsis [ Approximates the conjunction of two BDDs f and g and simultaneously abstracts the variables in cube . ]
/* manager */ /* first conjunct */ /* second conjunct */ /* cube of variables to be abstracted */ /* maximum recursion depth */ /* under (0) or over (1) approximation */