Searched refs:numsum (Results 1 – 9 of 9) sorted by relevance
227 numsum = sum(numbers)229 return numsum, terms_with_func, other233 numsum, terms_with_func, other_non_num_terms = self._group_Add_terms(e)234 if numsum == 0:249 if coeff is not None and coeff.is_number and sign(coeff) == -sign(numsum):251 do_substitute = abs(coeff+numsum) < abs(numsum)253 do_substitute = coeff+numsum == 0256 numsum += coeff261 return e.func(numsum, *substituted, *untouched, *other_non_num_terms)
24 double numsum = 0; in getValues() local32 numsum += (i-1)*i*rank->get(i); in getValues()43 if(denom <= 0.0){ term1=0.0000; } else { term1 = (double)(srare * numsum)/(double)denom - 1.0; } in getValues()47 gamace = gamace * (1 + (nrare * (1 - Cace) * numsum) / denom); in getValues()
508 int *numsum) in freetreelist() argument524 *numsum = 0; in freetreelist()535 int *numsum) in addtree2list() argument549 *numsum = numtrees; in addtree2list()558 *numsum += numtrees; in addtree2list()573 *numsum += numtrees; in addtree2list()585 *numsum += numtrees; in addtree2list()
184 int *numsum);193 int *numsum);
557 int *numsum);560 int *numsum);
2114 numsum = 0.02122 numsum = numsum + j * binwidth * fdr[j]2125 results[loc] = numsum / densum
6312 (do ((numsum 0.0)6316 (set! curval (/ (* binwidth numsum) densum))) 6317 (set! numsum (+ numsum (* k (rl k))))
2205 0.0 0.0 { numsum densum }2211 binwidth f* i f* numsum f+ to numsum2214 results loc numsum densum f/ vct-set! drop