From: Kuan-Wei Chiu Date: Fri, 29 Nov 2024 18:12:21 +0000 (+0800) Subject: lib min_heap: add brief introduction to Min Heap API X-Git-Url: https://www.infradead.org/git/?a=commitdiff_plain;h=2ad0546deb0214e385dbf33bb7a5e26c0dda3ad1;p=users%2Fdwmw2%2Flinux.git lib min_heap: add brief introduction to Min Heap API A short description of the Min Heap API is added to the min_heap.h, explaining its purpose for managing min-heaps and emphasizing the use of macro wrappers instead of direct function calls. For more details, users are directed to the documentation at Documentation/core-api/min_heap.rst. Link: https://lkml.kernel.org/r/20241129181222.646855-4-visitorckw@gmail.com Signed-off-by: Kuan-Wei Chiu Cc: Ching-Chun (Jim) Huang Cc: Geert Uytterhoeven Cc: Jonathan Corbet Signed-off-by: Andrew Morton --- diff --git a/include/linux/min_heap.h b/include/linux/min_heap.h index 456cfbc1b8f51..55bfe670bbb94 100644 --- a/include/linux/min_heap.h +++ b/include/linux/min_heap.h @@ -6,6 +6,17 @@ #include #include +/* + * The Min Heap API provides utilities for managing min-heaps, a binary tree + * structure where each node's value is less than or equal to its children's + * values, ensuring the smallest element is at the root. + * + * Users should avoid directly calling functions prefixed with __min_heap_*(). + * Instead, use the provided macro wrappers. + * + * For further details and examples, refer to Documentation/core-api/min_heap.rst. + */ + /** * Data structure to hold a min-heap. * @nr: Number of elements currently in the heap.