| commit | 0c4fc4d55c1573a76306683da97e202e5a42bc30 | |
| author | Eric Blake <eblake@redhat.com> | |
| Thu, 18 Jan 2024 01:09:42 +0000 (17 19:09 -0600) | ||
| committer | Eric Blake <eblake@redhat.com> | |
| Thu, 18 Jan 2024 01:09:42 +0000 (17 19:09 -0600) | ||
| tree | 694f42460772ade4ae7596d06133e5843973d406 | treesnapshot (tar.gz zip) |
| parent | 4855c23034404b266ebe8dbd15f08ae7461526e9 | commitdiff |
priority: add another algorithm for comparison purposes
Track the set of remaining priorities by a linear scan from low to
high. This is not quite as efficient as a radix heap, but for small
ranges with dense buckets, it may have better performance.
Track the set of remaining priorities by a linear scan from low to
high. This is not quite as efficient as a radix heap, but for small
ranges with dense buckets, it may have better performance.
15 files changed: