Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Typos identified by lintian #152

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Typos identified by lintian #152

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/base/abci/abc.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35199,7 +35199,7 @@ int Abc_CommandAbc9Extract( Abc_Frame_t * pAbc, int argc, char ** argv )
Abc_Print( -2, "usage: &extract [-K <num>] [-vh]\n");
Abc_Print( -2, "\t extract shared logic for XOR-rich circuits\n");
Abc_Print( -2, "\t-K <num> : the minimum gate size to consider for extraction [default = %d]\n", nMultiSize );
Abc_Print( -2, "\t-a : toogle extracting ANDs instead of XORs [default = %s]\n", fAnds? "yes": "no" );
Abc_Print( -2, "\t-a : toggle extracting ANDs instead of XORs [default = %s]\n", fAnds? "yes": "no" );
Abc_Print( -2, "\t-v : print verbose information [default = %s]\n", fVerbose? "yes": "no" );
Abc_Print( -2, "\t-h : print the command usage\n");
return 1;
Expand Down Expand Up @@ -49492,7 +49492,7 @@ int Abc_CommandAbc9Cfs( Abc_Frame_t * pAbc, int argc, char ** argv )
Abc_Print( -2, "usage: &cfs [-LNURPrcdvh]\n" );
Abc_Print( -2, "\t performs simulation\n" );
Abc_Print( -2, "\t-L num : the limit on the number of occurrences [default = %d]\n", Limit );
Abc_Print( -2, "\t-N num : the number of repetions of each pattern [default = %d]\n", Reps );
Abc_Print( -2, "\t-N num : the number of repetitions of each pattern [default = %d]\n", Reps );
Abc_Print( -2, "\t-U num : what to do with unseen patterns [default = %d]\n", UnseenUse );
Abc_Print( -2, "\t-R num : what to do with rare patterns [default = %d]\n", RareUse );
Abc_Print( -2, "\t-P num : base2-log of ramdom flip probability [default = %f]\n", FlipProb );
Expand Down
2 changes: 1 addition & 1 deletion src/bdd/cudd/cuddDecomp.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1673,7 +1673,7 @@ ZeroCase(
constant. At the decomposition point, the factors returned are (f,
1). Recur on the two children. The order is determined by the
heavier branch. Combine the factors of the two children and pick the
one that already occurs in the gh table. Occurence in g is indicated
one that already occurs in the gh table. Occurrence in g is indicated
by value 1, occurence in h by 2, occurence in both 3.]

SideEffects []
Expand Down
6 changes: 3 additions & 3 deletions src/opt/rwr/rwrExp.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -136,11 +136,11 @@ void Rwt_Man4ExplorePrint()
pReprs[ s_pManRwrExp4->pnCounts[i] ] = i;
}

printf( "Occurence = %6d. Num classes = %4d. \n", 0, 2288-nClasses );
printf( "Occurrence = %6d. Num classes = %4d. \n", 0, 2288-nClasses );
for ( i = 1; i <= CountMax; i++ )
if ( pDistrib[i] )
{
printf( "Occurence = %6d. Num classes = %4d. Repr = ", i, pDistrib[i] );
printf( "Occurrence = %6d. Num classes = %4d. Repr = ", i, pDistrib[i] );
Extra_PrintBinary( stdout, (unsigned*)&(pReprs[i]), 16 );
printf( "\n" );
}
Expand Down Expand Up @@ -256,7 +256,7 @@ void Rwt_Man5ExplorePrint()
for ( i = 1; i <= CountMax; i++ )
if ( pDistrib[i] )
{
printf( "Occurence = %6d. Num classes = %4d. Repr = ", i, pDistrib[i] );
printf( "Occurrence = %6d. Num classes = %4d. Repr = ", i, pDistrib[i] );
Extra_PrintBinary( stdout, pReprs + i, 32 );
printf( "\n" );
}
Expand Down