Expand description
This crate implements simple multi-dimensional tables, for use in dynamic programming algorithms, memoization, etc.
It exposes two flavors:
TableNdis a plain table that allocates one slot per value,SparseTableNdis a sparse table that uses a hash table under the hood to only allocate slots based on actual usage.
Use the former if your table is dense, as indexing is faster, and the latter if your table is sparse, as memory usage is lower.
Structs§
- Occupied
Entry - An occupied entry in a
SparseTableNd. It is part of theEntryenum. - Sparse
Table Nd - A sparse N-dimensional table.
- TableNd
- A dense N-dimensional table.
- Vacant
Entry - A vacant entry in a
SparseTableNd. It is part of theEntryenum.
Enums§
- Entry
- Entry in a
SparseTableNd.
Type Aliases§
- Sparse
Table2d - A sparse 2-dimensional table.
- Sparse
Table3d - A sparse 3-dimensional table.
- Sparse
Table4d - A sparse 4-dimensional table.
- Sparse
Table5d - A sparse 5-dimensional table.
- Sparse
Table6d - A sparse 6-dimensional table.
- Sparse
Table7d - A sparse 7-dimensional table.
- Sparse
Table8d - A sparse 8-dimensional table.
- Sparse
Table9d - A sparse 9-dimensional table.
- Sparse
Table10d - A sparse 10-dimensional table.
- Sparse
Table11d - A sparse 11-dimensional table.
- Sparse
Table12d - A sparse 12-dimensional table.
- Table2d
- A dense 2-dimensional table.
- Table3d
- A dense 3-dimensional table.
- Table4d
- A dense 4-dimensional table.
- Table5d
- A dense 5-dimensional table.
- Table6d
- A dense 6-dimensional table.
- Table7d
- A dense 7-dimensional table.
- Table8d
- A dense 8-dimensional table.
- Table9d
- A dense 9-dimensional table.
- Table10d
- A dense 10-dimensional table.
- Table11d
- A dense 11-dimensional table.
- Table12d
- A dense 12-dimensional table.