AdamNiederer / AdamNiederer/faster

Indexing into an array / lookup table (lut)?

Open
#70 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
Rust
Stars
1.6k
Forks
52
PR merge metrics
No merged PRs in 30d

Description

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

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.