AdamNiederer / AdamNiederer/faster

Indexing into an array / lookup table (lut)?

Abierto
#70 0 comentarios 0 reacciones 0 asignados Ver en GitHub
Lenguaje dominante
Rust
Estrellas
1.6k
Forks
52
Métricas de merge de PR
Sin PR fusionados en 30 d

Descripción

Hi thanks for the lib! My usage needs to index into an array based on a value. Shortly speaking, it is doing something like:

```
for x in 0..width {
let a = array_one[x+42] - array_one[x-42]; //???
let b = ...some arthi op on `a` which I know faster can do...
let c = array_two[b]; //???
}
```

Question: How can I parallalize the array indexing operation?
There do exist SIMD intrinsics for such lut(lookup table) operations. I have used OpenCV's universal intrinsics in C++, and it did provide one: https://docs.opencv.org/4.5.3/df/d91/group__core__hal__intrin.html#ga37fe7c336a68ae5f48967a066473a4ff

Guía de contribución

No hay ninguna guía de contribución indexada para este repositorio

Evaluación

Este issue todavía no se ha evaluado.

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.