Notes
This module provides an implementation for the alarm queue based on a pointer-based binary heap. Therefore, the alarm queue can contain an unlimited number of alarms. The following table exhibits the time complexities of the individual operations.
| Insert | \(O(\log n)\) |
| Peek | \(O(1)\) |
| Remove | \(O(\log n)\) |
| Remove peek | \(O(\log n)\) |
Include
ao_heap.h |
stdbool.h |
Configuration
AO_ALARM_QUEUE_ASSERT
#define AO_ALARM_QUEUE_ASSERT (false)
Defines whether to assert the correctness of the alarm queue upon each insertion and removal, in linear time. If that is not the case, a runtime assertion failure is triggered. This can aid in a debugging scenario.
Types
ao_alarm_queue_t
typedef ao_heap_t ao_alarm_queue_t;
Represents the alarm queue.
ao_alarm_queue_node_t
typedef ao_heap_node_t ao_alarm_queue_node_t;
Represents an alarm queue node.