| .. |
|
alloc.praat
|
f6e00cab12
interpreter speed
|
%!s(int64=7) %!d(string=hai) anos |
|
assign.praat
|
f6e00cab12
interpreter speed
|
%!s(int64=7) %!d(string=hai) anos |
|
binomialQ.praat
|
7c75b767dc
5.2.20
|
%!s(int64=10) %!d(string=hai) anos |
|
fisherQ.praat
|
e87ff8cc4a
NUMundefined is infinity again until no comparisons against it exist
|
%!s(int64=7) %!d(string=hai) anos |
|
inner.praat
|
9308fd0d2a
summing base case 64
|
%!s(int64=7) %!d(string=hai) anos |
|
mathFunctions.praat
|
a2a743db8f
Bare Cygwin edition passes all test scripts
|
%!s(int64=9) %!d(string=hai) anos |
|
mean.R
|
cd488136aa
pairwise update
|
%!s(int64=7) %!d(string=hai) anos |
|
mean.praat
|
80d6cc8c89
scripting: faster arrays
|
%!s(int64=7) %!d(string=hai) anos |
|
min.praat
|
7c75b767dc
5.2.20
|
%!s(int64=10) %!d(string=hai) anos |
|
mul.praat
|
890afbcb0e
mul_numvec(): pairwise with stride
|
%!s(int64=7) %!d(string=hai) anos |
|
plusgets.praat
|
f6e00cab12
interpreter speed
|
%!s(int64=7) %!d(string=hai) anos |
|
sort.praat
|
5e3f13981d
formula impl: arrays by reference
|
%!s(int64=7) %!d(string=hai) anos |
|
stdev.praat
|
97fee580eb
three methods for stdev_scalar()
|
%!s(int64=7) %!d(string=hai) anos |
|
sum.praat
|
cd488136aa
pairwise update
|
%!s(int64=7) %!d(string=hai) anos |
Paul Boersma
f6e00cab12
interpreter speed