Skip to content

`TinyArrayList` is a modified version of `std.ArrayList` that initially uses a fixed-size inline buffer for data storage. It only transitions to heap memory when the data size surpasses the buffer capacity, effectively minimizing heap allocation overhead for small data sizes.

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
Notifications You must be signed in to change notification settings

MINGtoMING/tiny_array_list

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Tiny Array List

TinyArrayList is a modified version of std.ArrayList that initially uses a fixed-size inline buffer for data storage. It only transitions to heap memory when the data size surpasses the buffer capacity, effectively minimizing heap allocation overhead for small data sizes.

License

Licensed under either of Apache License, Version 2.0 or MIT license at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in this crate by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

About

`TinyArrayList` is a modified version of `std.ArrayList` that initially uses a fixed-size inline buffer for data storage. It only transitions to heap memory when the data size surpasses the buffer capacity, effectively minimizing heap allocation overhead for small data sizes.

Resources

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT

Stars

Watchers

Forks

Packages

No packages published

Languages