DePacked

Example

use depacked::PackedData;structNeedToPack(u32);fnmain(){letmut packed = PackedData::with_max_capacity(1000);// Insertin is fast but not as CPU cache friendly.let first_item = packed.insert(NeedToPack(0));let second_item = packed.insert(NeedToPack(1));// Getting (mutable) references is fast and CPU cache friendly.let first_ref = packed.get(first_item);let second_ref_mut = packed.get_mut(second_item);// Removing might be slower.let first = packed.remove(first_item);}

License

DePacked is free and open source! All code in this repository is dual-licensed under either:

• MIT License (LICENSE-MIT or http://opensource.org/licenses/MIT)
• Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)

at your option.