DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Name Description Modified (UTC) Size
BitArray.h 2.2 kB
Fifo.h 4.5 kB
FixedSizeHash.h Class representing a hash set with fixed capacity, with newer entries * evicting older entries. Eac 3.8 kB
IdValuePair.h 1.1 kB
InlineMap.h A type can only be used as an InlineMap key if zero is an invalid key value * (and thus may be used 10.0 kB
LifoAlloc.cpp 4.8 kB
LifoAlloc.h 17.9 kB
OrderedHashTable.h Define two collection templates, js::OrderedHashMap and js::OrderedHashSet. * They are like js::Has 26.6 kB
PriorityQueue.h Class which represents a heap based priority queue using a vector. * Inserting elements and removin 3.4 kB
Sort.h Helper function for MergeSort. 3.9 kB
SplayTree.h Class which represents a splay tree with nodes allocated from a LifoAlloc. * Splay trees are balanc 8.1 kB
TraceableFifo.h 5.0 kB