Re: Parsing timestamps?

minforth <minforth@gmx.net> writes:

Am 16.07.2025 um 13:25 schrieb Anton Ertl:

I did not do any accuracy measurements, but I did performance
measurements

YMMV but "fast but wrong" would not be my goal.  ;-)

I did test correctness with cases where roundoff errors do not play a
role.

As mentioned, the RECursive balanced-tree sum (which is also the
fastest on several systems and absolutely) is expected to be more
accurate in those cases where roundoff errors do play a role.  But if
you care about that, better design a test and test it yourself.  It
will be interesting to see how you find out which result is more
accurate when they differ.

- anton
--
M. Anton Ertl  http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
     New standard: https://forth-standard.org/
EuroForth 2025 CFP: http://www.euroforth.org/ef25/cfp.html