Lucas Mongrain

I'm not really sure about what you're talking about... ``` template void foo { (*a)() // load function (*b)() // save function } ``` something like this? But in a...

oh I see, we should try this!

@ihhub with the new memory allocator, do we still need to check if the memory is aligned or we can consider it's always aligned?

Hi @ihhub I have some trouble to keep up with my study, so I'm gonna restart contributing in 1-2 months. When I'm gonna restart contributing, it would be a pleasure...

I will give it a try

are you sure that it's suppose to be more easy? the solution I found to replace the main for loop for the shift function look like that: ``` void Shift(uint32_t...

I didn't test it yet so I don't know if this algorithm is fine

seeing the calcul: value = pixel1 * coeff1 + pixel2 * coeff2 + pixel3 * coeff3 + pixel3 * coeff3 + 0.5f; I think this function gonna meet the same...

on my manjaro distribution, the library are usually install under /usr/lib, the header file under /usr/include and the documentation under /usr/share. Maybe I can try to do an AUR package...

it's not the case for all the function, the hough transform for example. Also, sometimes the compiler optimize with SIMD instruction. So if we run Accumulate for AVX for example...