File: README.md

package info (click to toggle)
rust-wasmtime 26.0.1%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 48,492 kB
  • sloc: ansic: 4,003; sh: 561; javascript: 542; cpp: 254; asm: 175; ml: 96; makefile: 55
file content (12 lines) | stat: -rw-r--r-- 603 bytes parent folder | download | duplicates (16) 
1
2
3
4
5
6
7
8
9
10
11
12
 
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.