zephyr

118645 Commits

81 Branches

203 Tags

1.7 GiB

Tree: e3ed029b55

Commit Graph

Author	SHA1	Message	Date
Sayooj K Karun	964a832702	lib: min_heap: Refactor heapify_up/down functions Remove using `swap()` which was using VLA and replace it with `byteswp()`. Reduce the scope of local variables in `heapify_up/down` to the smallest necessary block. Replace `while(true)` loop in `heapify_down()` with a bounded `for` loop. Signed-off-by: Sayooj K Karun <sayooj@aerlync.com>	2 weeks ago
Sayooj K Karun	cd7c78e92e	lib: min_heap: Add min-heap data structure Introduce a binary min-heap implementation as a generic data structure for use in kernel and application code. A min-heap always maintains the smallest element at the root, making insertion and removal of the minimum element efficient (O(log n)). The API allows both static and dynamic initialization, supports custom comparators. Signed-off-by: Sayooj K Karun <sayooj@aerlync.com>	1 month ago

Author

SHA1

Message

Date

Sayooj K Karun

964a832702

lib: min_heap: Refactor heapify_up/down functions

Remove using `swap()` which was using VLA and replace it
with `byteswp()`.
Reduce the scope of local variables in `heapify_up/down` to
the smallest necessary block.
Replace `while(true)` loop in `heapify_down()` with a bounded `for`
loop.

Signed-off-by: Sayooj K Karun <sayooj@aerlync.com>

2 weeks ago

Sayooj K Karun

cd7c78e92e

lib: min_heap: Add min-heap data structure

Introduce a binary min-heap implementation as a generic data structure
for use in kernel and application code. A min-heap always maintains
the smallest element at the root, making insertion and removal of the
minimum element efficient (O(log n)).

The API allows both static and dynamic initialization, supports custom
comparators.

Signed-off-by: Sayooj K Karun <sayooj@aerlync.com>

1 month ago

2 Commits (e3ed029b5546d327b0ba73bd50bd9edba4ddaf4a)