Data Structurescs
Ways of organizing data for efficient access — arrays, trees, graphs, hash maps, heaps.
The IR store, inverted index, and priority queues in the scheduler are all data structures; choosing them right keeps compilation fast.
Where it appears
- SKCE IRStore
- search-index (inverted index)
Descend
Historical evolution
Foundational to all of computer science; the substrate every algorithm runs on.
Implementation details
SKCE search-index.json is an inverted index (token -> [conceptId]); IRStore is an in-memory dict of ConceptNodes.
Sources
- [compiler/ir.py] compiler/ir.py
- [compiler/ir.py] compiler/ir.py