| 48080e341c2a12db12deb086adce1d487a759141 |
|
11-Mar-2017 |
Meng-hsuan Chung <menghsuan@google.com> |
Adds a const overload of begin() and end() iterators
Change-Id: Ia24d985b602da8c9761f8cf746a0738cf1e3e468
/system/chre/util/include/chre/util/priority_queue.h
|
| 5ea6fa358541d4b9cc1d9856a0b9291785d7536d |
|
06-Feb-2017 |
Meng-hsuan Chung <menghsuan@google.com> |
Rename CompareType to CompareFunction in PriorityQueue/heap
Change-Id: I4d7e9adffef2684e87f8bcbc0aeabfe9e7a8a687
/system/chre/util/include/chre/util/priority_queue.h
|
| e1129bcc6fb320fd1752cd6c900ead2a0595c761 |
|
28-Jan-2017 |
Meng-hsuan Chung <menghsuan@google.com> |
Iterators: rename const iterators
- Renamed const iterators to cbegin() and cend().
- Added comments for iterator invalidation
- Added iterator tests.
Change-Id: Ia10d33c64d0c543a2791dc93f875a641148298e1
/system/chre/util/include/chre/util/priority_queue.h
|
| 90c04ef3564eb228eebb5da5b21bb80e5e46e299 |
|
13-Jan-2017 |
Meng-hsuan Chung <menghsuan@google.com> |
Iterator implementation
Added implementation for containers whose iterator can rely on pointer
arithmetics, which includes FixedSizeVector, DynamicVector and PriorityQueue.
Change-Id: Iee5b682fd093360e11ff47506d5cb21ff804ca21
/system/chre/util/include/chre/util/priority_queue.h
|
| fa589941fe8c8aa1ff0d8fb9ee1445dba6382768 |
|
10-Jan-2017 |
Andrew Rossignol <aarossig@google.com> |
Adds a missing include to PriorityQueue
Change-Id: I1380e60e36166466e9c3ebeebe60690fd383c0a4
/system/chre/util/include/chre/util/priority_queue.h
|
| 021aae0ed1c9ff80d9ffef6b1114f030138c25d2 |
|
07-Jan-2017 |
Meng-hsuan Chung <menghsuan@google.com> |
priority queue: update to use heap data structure
Change-Id: I35e95c597db9eb9eed3fda21bb02d1268cc8fe74
/system/chre/util/include/chre/util/priority_queue.h
|
| f9fe99d728ad476dc941be5a9dff1e20402c3754 |
|
22-Dec-2016 |
Meng-hsuan Chung <menghsuan@google.com> |
Priority queue implementation
This is a first step to get the interface and behavior right.
Internally it's a linear array with O(N) push/pop.
The next step is to use heap with O(logN) complexity.
Change-Id: Icbe4842b8515c2fb95a4ec2388a8ecd4243967d2
/system/chre/util/include/chre/util/priority_queue.h
|