| AvlTree.h |
|
36069 |
78 % |
| BitArray.h |
namespace js |
2474 |
100 % |
| Bitmap.cpp |
|
3129 |
70 % |
| Bitmap.h |
|
7057 |
89 % |
| Fifo.h |
|
5573 |
74 % |
| FixedLengthVector.h |
|
2605 |
- |
| IdValuePair.h |
namespace js |
891 |
100 % |
| InlineTable.h |
|
17111 |
97 % |
| LifoAlloc.cpp |
static |
12953 |
95 % |
| LifoAlloc.h |
|
42161 |
97 % |
| moz.build |
|
561 |
- |
| Nestable.h |
(Concrete*) -> bool |
2058 |
100 % |
| PriorityQueue.h |
Class which represents a heap based priority queue using a vector.
Inserting elements and removing the highest priority one are both O(log n).
Template parameters are the same as for Vector, with the addition that P
must have a static higherPriority(const T& a, const T& b) method which
returns true if |a| has a higher priority than |b|.
|
3650 |
98 % |
| SinglyLinkedList.h |
Circular singly linked list that requires only one word per element and for
the list itself.
Requires T has field |T::next| for the link pointer.
The list only stores a pointer to the last element. Since the list is
circular, that provides access to the first element and allows insertion at
the start and end of the list.
|
6314 |
88 % |
| SlimLinkedList.h |
The classes SlimLinkedList<T> and SlimLinkedListElement<T> provide a
type-safe doubly-linked list class which uses one word for the list and two
words for each element (for comparison mozilla::LinkedList uses three words
for the list and for each element due to padding).
This aims to be a replacement for mozilla::LinkedList although the interface
is not identical. In particular most actions are implemented as methods on
the list itself as opposed to the element.
Private element inheritance is not supported; clients must publicly derive
from LinkedListElement.
|
11627 |
78 % |
| Sort.h |
Helper function for MergeSort. |
3834 |
95 % |
| TraceableFifo.h |
|
3248 |
42 % |