X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Fadt%2Fpqueue.h;h=504b739126027b63b915bd1f4a0fa3b1d4c60b55;hb=95439e41faebfaeca2bf517718932e47dd8aaa7c;hp=81596dedfc2bb7c35bfeb70bd880eaec3422ac2a;hpb=060aa4c91666063f9bb70aaa76f5c819d256a15f;p=libfirm

diff --git a/include/libfirm/adt/pqueue.h b/include/libfirm/adt/pqueue.h
index 81596dedf..504b73912 100644
--- a/include/libfirm/adt/pqueue.h
+++ b/include/libfirm/adt/pqueue.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -23,14 +23,13 @@
  * @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"
 
-typedef struct _pqueue_t pqueue_t;
+typedef struct pqueue_t pqueue_t;
 
 /**
  * Creates a new priority queue.
@@ -64,7 +63,7 @@ FIRM_API void *pqueue_pop_front(pqueue_t *q);
  * @param q   The priority queue.
  * @return The length of the queue.
  */
-FIRM_API int pqueue_length(const pqueue_t *q);
+FIRM_API size_t pqueue_length(const pqueue_t *q);
 
 /**
  * Returns true if queue is empty.