nightly index_many

A proof of concept for indexing an slice at multiple locations at once

12 releases (5 breaking)

0.6.1 Sep 7, 2021
0.6.0 Sep 7, 2021
0.5.2 Aug 12, 2021
0.4.1 Jun 15, 2021
0.1.2 Mar 18, 2021

#608 in Data structures

Download history 491/week @ 2024-07-19 294/week @ 2024-07-26 435/week @ 2024-08-02 502/week @ 2024-08-09 399/week @ 2024-08-16 576/week @ 2024-08-23 413/week @ 2024-08-30 328/week @ 2024-09-06 131/week @ 2024-09-13 268/week @ 2024-09-20 228/week @ 2024-09-27 269/week @ 2024-10-04 426/week @ 2024-10-11 244/week @ 2024-10-18 250/week @ 2024-10-25 212/week @ 2024-11-01

1,166 downloads per month

MIT/Apache

105KB
2K SLoC

Proof of concept functions for (mutably) accessing a slice at multiple positions at once via an array of indices.

Provided APIs

This crate implements multiple APIs:

  • "simple": accepts a sorted array [usize; N] of indices.
  • "simple_result": accepts a sorted array [usize; N] of indices, but with an Result based API.
  • "slice_index": accepts a sorted array [I; N] of indices, where I: SliceIndex<[T]>.
  • "generic": uses a generic I: Indices<N> that allows for more flexibility.

Example

use index_many::generic::index_many_mut;

let mut v = vec![1, 2, 3, 4, 5];
let [a, b, c] = index_many_mut(&mut v, [0, 2, 4]);
*a += 10;
*b += 100;
*c += 1000;
assert_eq!(v, vec![11, 2, 103, 4, 1005]);

Generated Assembly

The docs contain example functions with their x86_64 assembly codegen. See the crate::_doc_assembly module.

No runtime deps