How Can I Create Permanently-Stored Lookup Tables?

[lmiq]

Use a functor:

Define data-dependent function, various ways

I think function-like objects (sometimes called “functors”) would be yet another option to achieve the same kind of things. (AFAIU, this is what’s internally used to implement closures, and I think it requires a bit less work for the compiler to optimize. Maybe someone more knowledgeable will chime in and confirm or correct this) struct Fun data :: Vector{Int} end function (f::Fun)(x) s = 0. for i in 1:length(x) s += (x[i]-f.data[i])^2 end s end println(" Functor: ") functor …

Ps: of course you can read the tables into arrays, using CSV.jl