heap_matrix

Crates.ioheap_matrix
lib.rsheap_matrix
version0.1.0
created_at2025-11-17 12:05:27.402399+00
updated_at2025-11-17 12:05:27.402399+00
descriptionA dynamically sized multidimensional array implementation that avoids memory fragmentation and redundancy
homepage
repositoryhttps://github.com/rubcc95/heap_matrix
max_upload_size
id1936701
size9,741
Rubén Cantón Casado (rubcc95)

documentation

https://docs.rs/heap_matrix

README

Heap Matrix

A dynamically sized, contiguous, n‑dimensional array for the heap that aims to avoid memory fragmentation and redundant allocations. This crate lets you build arrays of arbitrary dimensionality and operate on their subviews naturally.

  • Contiguous heap storage for all dimensions
  • Arbitrary dimensionality driven by the Dimension and CompositeDimension traits
  • Cheap subviews via get/get_mut without extra allocation
  • Slice access to the entire storage for bulk operations
  • Zero-cost deref to [T] for 1‑D matrices and to T for scalar ()
Commit count: 0

cargo fmt