Crates.io | flatarray |
lib.rs | flatarray |
version | 1.1.0 |
created_at | 2025-01-13 06:10:07.144465+00 |
updated_at | 2025-05-30 19:38:59.746866+00 |
description | Implementation of a flattened iterator, that acts as if it still was an iterator of iterator |
homepage | |
repository | https://github.com/SimonTheoret/flatarray |
max_upload_size | |
id | 1514199 |
size | 33,666 |
This crates contains the code for a cache-friendly datastructure named
FlatArray
. It mimics the behavior of a Vec<Vec<T>>
by allowing the
users to iterate over the vectors and can be dereferenced into a
&[T]
. FlatArray
is of fixed size but can be iterated over as if
it was a Vec<Vec<T>>
, with the help of the iter_arrays
and
iter_arrays_mut
methods.