Minimizing allocations from memoized functions

[lmiq]

@ash

Is there some documentation I can refer to that explains this a little?

The docs are here: Methods · The Julia Language

But I have learnt this only a couple of days ago thanks to this post:

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 …

In this particular example of yours it seems to make the code more modular, and you can feed omega and alpha parameters to the object as well.