Branch Coverage

Hunspell.xs
Criterion Covered Total %
branch 31 64 48.4


line true false branch
39 8 0 RETVAL = new Hunspell(aff, dic);
81 1 0 val = THIS->suggest(&wlsti, buf);
82 3 1 for (int i = 0; i < val; i++) {
83 3 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
3 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
85 1 0 THIS->free_list(&wlsti, val);
94 1 0 val = THIS->analyze(&wlsti, buf);
95 1 1 for (i = 0; i < val; i++) {
96 1 0 PUSHs(sv_2mortal(newSVpv(wlsti[i], 0)));
1 0 PUSHs(sv_2mortal(newSVpv(wlsti[i], 0)));
98 1 0 THIS->free_list(&wlsti, val);
108 0 0 val = THIS->stem(&wlsti, buf);
109 0 0 for (int i = 0; i < val; i++) {
110 0 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
0 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
112 0 0 THIS->free_list(&wlsti, val);
123 16 0 val = THIS->generate(&wlsti, buf, sample);
124 16 16 for (int i = 0; i < val; i++) {
125 16 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
16 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
127 16 0 THIS->free_list(&wlsti, val);
141 1 0 len = av_len(avref) + 1;
144 1 0 array = (char **) get_mortalspace( len * sizeof( *array ));
147 1 1 for (i=0; i
148 1 0 elem = av_fetch( avref, i, 0 );
149 1 0 array[i] = SvPV( *elem, PL_na );
0 0 array[i] = SvPV( *elem, PL_na );
152 1 0 val = THIS->generate(&wlsti, buf, array, len);
154 1 1 for (int i = 0; i < val; i++) {
155 1 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
1 0 PUSHs(sv_2mortal(newSVpv( wlsti[i] ,0 )));
157 1 0 THIS->free_list(&wlsti, val);