diff options
| author | bruvzg <7645683+bruvzg@users.noreply.github.com> | 2023-05-23 03:05:01 +0300 |
|---|---|---|
| committer | bruvzg <7645683+bruvzg@users.noreply.github.com> | 2023-05-23 03:26:16 +0300 |
| commit | b64df2bf74eddbf28e2e484d05c46a5ad0d7ee14 (patch) | |
| tree | 92094a0540179f5722b1fe10499ef45155928fcb /thirdparty/harfbuzz/src/hb-priority-queue.hh | |
| parent | d5c1b9f883adbb54900c145eafcaa789d0fd563c (diff) | |
| download | redot-engine-b64df2bf74eddbf28e2e484d05c46a5ad0d7ee14.tar.gz | |
Update HarfBuzz, ICU and FreeType
HarfBuzz: Update to version 7.3.0
ICU4C: Update to version 73.1
FreeType: Update to version 2.13.0
Diffstat (limited to 'thirdparty/harfbuzz/src/hb-priority-queue.hh')
| -rw-r--r-- | thirdparty/harfbuzz/src/hb-priority-queue.hh | 6 |
1 files changed, 6 insertions, 0 deletions
diff --git a/thirdparty/harfbuzz/src/hb-priority-queue.hh b/thirdparty/harfbuzz/src/hb-priority-queue.hh index 93a7842eb0..bf1b282d3d 100644 --- a/thirdparty/harfbuzz/src/hb-priority-queue.hh +++ b/thirdparty/harfbuzz/src/hb-priority-queue.hh @@ -35,6 +35,12 @@ * * Priority queue implemented as a binary heap. Supports extract minimum * and insert operations. + * + * The priority queue is implemented as a binary heap, which is a complete + * binary tree. The root of the tree is the minimum element. The heap + * property is that the priority of a node is less than or equal to the + * priority of its children. The heap is stored in an array, with the + * children of node i stored at indices 2i + 1 and 2i + 2. */ struct hb_priority_queue_t { |