X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Fadt%2Fpqueue.h;h=35e585ad1bc93d9821111ce6ca0fdde710d426b2;hb=485c69395f430b4ccc7118d69f52d914ad2124d8;hp=8ff60406228add434087d576e1e89de27fe77579;hpb=1a3b7d363474ab544c13093a2f0b578718d37c7a;p=libfirm

diff --git a/include/libfirm/adt/pqueue.h b/include/libfirm/adt/pqueue.h
index 8ff604062..35e585ad1 100644
--- a/include/libfirm/adt/pqueue.h
+++ b/include/libfirm/adt/pqueue.h
@@ -23,13 +23,21 @@
  * @author  Christian Wuerdig
  * @brief   Implementation of a priority queue. This is the ported version of
             the original Java implementation by Matthias Braun.
- * @version $Id$
  */
 #ifndef FIRM_ADT_PQUEUE_H
 #define FIRM_ADT_PQUEUE_H
 
 #include "../begin.h"
 
+/**
+ * @ingroup adt
+ * @defgroup pqueue  Priority Queue
+ * A priority queue.
+ * Implementation based on a heap datastructure
+ * @{
+ */
+
+/** priority queue */
 typedef struct pqueue_t pqueue_t;
 
 /**
@@ -73,6 +81,8 @@ FIRM_API size_t pqueue_length(const pqueue_t *q);
  */
 FIRM_API int pqueue_empty(const pqueue_t *q);
 
+/** @} */
+
 #include "../end.h"
 
 #endif