|0.2.1||Sep 8, 2022|
|0.2.0||Dec 22, 2021|
|0.1.2||Jun 4, 2020|
|0.1.1||Mar 21, 2020|
|0.1.0||Jan 18, 2020|
#1149 in Data structures
101 downloads per month
ttmap (Trivial Type Map)
Trivial type-map implementation
Implementation uses type erased values with type as index.
Due to limitation of
TypeId only types without non-static references are supported. (in future it can be changed)
Each inserted value is stored on heap, with type erased pointer, using type as key. When value is retrieved, type information is used as key and pointer is casted to corresponding the type. This is safe, because Rust allows cast back and forth between pointers as long as the pointer actually points to the type (which is the case).
Static references are allowed, but in current implementation are stored on heap. It might be changed in future.
The map uses simplified
Hasher that relies on fact that
TypeId produces unique values only.
In fact there is no hashing under hood, and type's id is returned as it is.
allocwith enabled global allocator