diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2020-01-27 10:43:37 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2020-01-27 10:43:37 -0800 |
| commit | 951afa27cb5f2621ddac2f003a4844288e01eddf (patch) | |
| tree | cce115371b41ace2b78bc630758782cfbe252200 /src/bool | |
| parent | 8c8f39ad7603362c7e16598d1888313f2e6ca0a0 (diff) | |
| download | abc-951afa27cb5f2621ddac2f003a4844288e01eddf.tar.gz abc-951afa27cb5f2621ddac2f003a4844288e01eddf.tar.bz2 abc-951afa27cb5f2621ddac2f003a4844288e01eddf.zip | |
Cleaning up code and fixing for several typos.
Diffstat (limited to 'src/bool')
| -rw-r--r-- | src/bool/dec/dec.h | 4 | ||||
| -rw-r--r-- | src/bool/deco/deco.h | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/src/bool/dec/dec.h b/src/bool/dec/dec.h index 07bf9f6b..e02b96c4 100644 --- a/src/bool/dec/dec.h +++ b/src/bool/dec/dec.h @@ -94,10 +94,10 @@ struct Dec_Man_t_ /// ITERATORS /// //////////////////////////////////////////////////////////////////////// -// interator throught the leaves +// iterator through the leaves #define Dec_GraphForEachLeaf( pGraph, pLeaf, i ) \ for ( i = 0; (i < (pGraph)->nLeaves) && (((pLeaf) = Dec_GraphNode(pGraph, i)), 1); i++ ) -// interator throught the internal nodes +// iterator through the internal nodes #define Dec_GraphForEachNode( pGraph, pAnd, i ) \ for ( i = (pGraph)->nLeaves; (i < (pGraph)->nSize) && (((pAnd) = Dec_GraphNode(pGraph, i)), 1); i++ ) diff --git a/src/bool/deco/deco.h b/src/bool/deco/deco.h index a1db47ce..33dbed87 100644 --- a/src/bool/deco/deco.h +++ b/src/bool/deco/deco.h @@ -94,10 +94,10 @@ struct Dec_Man_t_ /// ITERATORS /// //////////////////////////////////////////////////////////////////////// -// interator throught the leaves +// iterator through the leaves #define Dec_GraphForEachLeaf( pGraph, pLeaf, i ) \ for ( i = 0; (i < (pGraph)->nLeaves) && (((pLeaf) = Dec_GraphNode(pGraph, i)), 1); i++ ) -// interator throught the internal nodes +// iterator through the internal nodes #define Dec_GraphForEachNode( pGraph, pAnd, i ) \ for ( i = (pGraph)->nLeaves; (i < (pGraph)->nSize) && (((pAnd) = Dec_GraphNode(pGraph, i)), 1); i++ ) |