* \f$N\f$ and \f$A\f$ are exchanged, so now \f$A\f$ has children \f$N\f$ and
* \f$B\f$. \f$A < N\f$ and \f$A \le B\f$.
*/
-#define HEAP_TYPE(NAME, ETYPE, LT) \
- typedef ETYPE NAME##_element; \
- VECTOR_TYPE(NAME, NAME##_element, xrealloc) \
- \
- static inline int NAME##_count(struct NAME *heap) { \
- return heap->nvec; \
- } \
- \
- static inline NAME##_element NAME##_first(struct NAME *heap) { \
- assert(heap->nvec > 0); \
- return heap->vec[0]; \
- } \
- \
- static void NAME##_insert(struct NAME *heap, NAME##_element elt) { \
+#define HEAP_TYPE(NAME, ETYPE, LT) \
+ typedef ETYPE NAME##_element; \
+ VECTOR_TYPE(NAME, NAME##_element, xrealloc); \
+ \
+ static inline int NAME##_count(struct NAME *heap) { \
+ return heap->nvec; \
+ } \
+ \
+ static inline NAME##_element NAME##_first(struct NAME *heap) { \
+ assert(heap->nvec > 0); \
+ return heap->vec[0]; \
+ } \
+ \
+ void NAME##_insert(struct NAME *heap, NAME##_element elt); \
+ NAME##_element NAME##_remove(struct NAME *heap); \
+ \
+ struct heap_swallow_semicolon
+
+/** @brief External-linkage definitions for @ref HEAP_TYPE */
+#define HEAP_DEFINE(NAME, ETYPE, LT) \
+ void NAME##_insert(struct NAME *heap, NAME##_element elt) { \
int n = heap->nvec; \
NAME##_append(heap, elt); \
while(n > 0) { \
if(!LT(heap->vec[n],heap->vec[p])) \
break; \
else { \
- const NAME##_element t = heap->vec[n]; \
+ const NAME##_element t = heap->vec[n]; \
heap->vec[n] = heap->vec[p]; \
heap->vec[p] = t; \
n = p; \
} \
} \
\
- static NAME##_element NAME##_remove(struct NAME *heap) { \
+ NAME##_element NAME##_remove(struct NAME *heap) { \
int n = 0; \
NAME##_element r; \
\
heap->vec[n] = heap->vec[a]; \
heap->vec[a] = t; \
n = a; \
- } else \
+ } else \
break; \
} \
return r; \
} \
\
- struct heap_swallow_semicolon
+ struct heap_swallow_semicolon \
#endif /* PQUEUE_H */