Data structurecore
Segregated free lists
Also called segregated storage, segregated fits.
One free list per size class, so a request searches only its own class.
One free list per size class, so a request searches only its own class.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 2CE79K Edit this page History Report an error