summaryrefslogtreecommitdiff
path: root/src/basic/prioq.c
diff options
context:
space:
mode:
authorSven Eden <yamakuzure@gmx.net>2017-03-29 10:05:39 +0200
committerSven Eden <yamakuzure@gmx.net>2017-03-29 10:46:30 +0200
commit3cd22db822df747636dcf30ebb8ec5d16bb71880 (patch)
tree5805f577516c2304c59daad957f2688d8d65cfb0 /src/basic/prioq.c
parentf556f28e9299d8e94acc652d58f4515fb89f6229 (diff)
[1/5] Apply missing fixes from upstream
Diffstat (limited to 'src/basic/prioq.c')
-rw-r--r--src/basic/prioq.c10
1 files changed, 10 insertions, 0 deletions
diff --git a/src/basic/prioq.c b/src/basic/prioq.c
index 5e567b181..d55b348c2 100644
--- a/src/basic/prioq.c
+++ b/src/basic/prioq.c
@@ -19,6 +19,16 @@
along with systemd; If not, see <http://www.gnu.org/licenses/>.
***/
+/*
+ * Priority Queue
+ * The prioq object implements a priority queue. That is, it orders objects by
+ * their priority and allows O(1) access to the object with the highest
+ * priority. Insertion and removal are Θ(log n). Optionally, the caller can
+ * provide a pointer to an index which will be kept up-to-date by the prioq.
+ *
+ * The underlying algorithm used in this implementation is a Heap.
+ */
+
#include "util.h"
#include "prioq.h"