diff options
author | bruvzg <7645683+bruvzg@users.noreply.github.com> | 2023-10-27 23:21:25 +0300 |
---|---|---|
committer | bruvzg <7645683+bruvzg@users.noreply.github.com> | 2023-10-27 23:21:25 +0300 |
commit | 07c3d56e45d91d129f639a7bb8fdc18d4eaa68b1 (patch) | |
tree | 41af2c263563c7b2128c0c9b636090f5f4c3ec51 /thirdparty/harfbuzz/src/hb-priority-queue.hh | |
parent | f497156e0b37fc4c33ce11c285a8b318b319f7cc (diff) | |
download | redot-engine-07c3d56e45d91d129f639a7bb8fdc18d4eaa68b1.tar.gz |
HarfBuzz: Update to version 8.2.2
Diffstat (limited to 'thirdparty/harfbuzz/src/hb-priority-queue.hh')
-rw-r--r-- | thirdparty/harfbuzz/src/hb-priority-queue.hh | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/thirdparty/harfbuzz/src/hb-priority-queue.hh b/thirdparty/harfbuzz/src/hb-priority-queue.hh index baac7e1e69..2c8ccbfb68 100644 --- a/thirdparty/harfbuzz/src/hb-priority-queue.hh +++ b/thirdparty/harfbuzz/src/hb-priority-queue.hh @@ -42,10 +42,11 @@ * 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. */ +template <typename K> struct hb_priority_queue_t { private: - typedef hb_pair_t<int64_t, unsigned> item_t; + typedef hb_pair_t<K, unsigned> item_t; hb_vector_t<item_t> heap; public: @@ -57,7 +58,7 @@ struct hb_priority_queue_t #ifndef HB_OPTIMIZE_SIZE HB_ALWAYS_INLINE #endif - void insert (int64_t priority, unsigned value) + void insert (K priority, unsigned value) { heap.push (item_t (priority, value)); if (unlikely (heap.in_error ())) return; |