Skip to content
  • Jakob Stoklund Olesen's avatar
    Add a Briggs and Torczon sparse set implementation. · 3a0f01f7
    Jakob Stoklund Olesen authored
    For objects that can be identified by small unsigned keys, SparseSet
    provides constant time clear() and fast deterministic iteration. Insert,
    erase, and find operations are typically faster than hash tables.
    
    SparseSet is useful for keeping information about physical registers,
    virtual registers, or numbered basic blocks.
    
    llvm-svn: 151110
    3a0f01f7
Loading