Re: [Gretl-devel] Boolean expression evaluation timings
On Mon, 9 Jan 2017, Marcin Błażejowski wrote:
Hi,
simple script: tree functions which do nothing but if/boolean evaluate.
It looks like strings evaluation is faster than scalars and integers
evaluation. Isn't it surprising?
Up to a point, actually.
My suspicion is that the small differences your script reveals are due
to the fact that internally, gretl numbers are all doubles, even if marked
as ints in function declarations. Libc string functions, instead, work
byte by byte and are super optimised. But it's a wild guess; there could
be some other reason tied to the inner working of our interpreter.
-------------------------------------------------------
Riccardo (Jack) Lucchetti
Dipartimento di Scienze Economiche e Sociali (DiSES)
Università Politecnica delle Marche
(formerly known as Università di Ancona)
r.lucchetti(a)univpm.it
http://www2.econ.univpm.it/servizi/hpp/lucchetti
-------------------------------------------------------