gecko-dev/third_party/rust/cranelift-bforest
Dan Gohman 493b0bb1b8 Bug 1507819 - Update to Cranelift 0.25. r=bbouvier 2018-11-27 00:06:00 +02:00
..
src Bug 1505777: Run mach-vendor-rust to update Cranelift. rs=bbouvier 2018-11-09 05:16:08 -08:00
.cargo-checksum.json Bug 1507819 - Update to Cranelift 0.25. r=bbouvier 2018-11-27 00:06:00 +02:00
Cargo.toml Bug 1507819 - Update to Cranelift 0.25. r=bbouvier 2018-11-27 00:06:00 +02:00
LICENSE Bug 1505777: Run mach-vendor-rust to update Cranelift. rs=bbouvier 2018-11-09 05:16:08 -08:00
README.md

README.md

This crate contains array-based data structures used by the core Cranelift code generator which represent a set of small ordered sets or maps.

These are not general purpose data structures that are somehow magically faster that the standard library's BTreeSet and BTreeMap types.

The tradeoffs are different:

  • Keys and values are expected to be small and copyable. We optimize for 32-bit types.
  • A comparator object is used to compare keys, allowing smaller "context free" keys.
  • Empty trees have a very small 32-bit footprint.
  • All the trees in a forest can be cleared in constant time.