Data structureadvanced
Linear quadtree
Also called locational-code quadtree.
Pointerless quadtree stored as a sorted list of locational codes, usually Morton codes.
Pointerless quadtree stored as a sorted list of locational codes, usually Morton codes.
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 HXZGKW Edit this page History Report an error