diff options
Diffstat (limited to 'include/bh/queue.h')
| -rwxr-xr-x | include/bh/queue.h | 34 |
1 files changed, 17 insertions, 17 deletions
diff --git a/include/bh/queue.h b/include/bh/queue.h index 7905c77..f7b8b12 100755 --- a/include/bh/queue.h +++ b/include/bh/queue.h @@ -5,7 +5,7 @@ #include "common.h" -typedef struct bh_queue_s bh_queue_t; +typedef struct BH_Queue BH_Queue; /** @@ -14,7 +14,7 @@ typedef struct bh_queue_s bh_queue_t; * \return On success, returns the pointer to the new queue object. * \return On failure, returns a null pointer. */ -bh_queue_t *bh_queue_new(void); +BH_Queue *BH_QueueNew(void); /** @@ -22,7 +22,7 @@ bh_queue_t *bh_queue_new(void); * * \param queue Pointer to the queue object to be freed */ -void bh_queue_free(bh_queue_t *queue); +void BH_QueueFree(BH_Queue *queue); /** @@ -30,7 +30,7 @@ void bh_queue_free(bh_queue_t *queue); * * \param queue Pointer to the queue object to be cleared */ -void bh_queue_clear(bh_queue_t *queue); +void BH_QueueClear(BH_Queue *queue); /** @@ -47,8 +47,8 @@ void bh_queue_clear(bh_queue_t *queue); * \return On success, returns zero value. * \return On failure, returns error code. */ -int bh_queue_reserve(bh_queue_t *queue, - size_t size); +int BH_QueueReserve(BH_Queue *queue, + size_t size); /** @@ -62,8 +62,8 @@ int bh_queue_reserve(bh_queue_t *queue, * \return On success, returns zero value. * \return On failure, returns error code. */ -int bh_queue_insert(bh_queue_t *queue, - void *value); +int BH_QueueInsert(BH_Queue *queue, + void *value); /** @@ -73,7 +73,7 @@ int bh_queue_insert(bh_queue_t *queue, * * \note Calling this function will invalidate iterators. */ -void bh_queue_remove(bh_queue_t *queue); +void BH_QueueRemove(BH_Queue *queue); /** @@ -84,8 +84,8 @@ void bh_queue_remove(bh_queue_t *queue); * \return On success, returns front value from the queue. * \return On failure, returns null pointer. */ -int bh_queue_front(bh_queue_t *queue, - void **value); +int BH_QueueFront(BH_Queue *queue, + void **value); /** @@ -96,7 +96,7 @@ int bh_queue_front(bh_queue_t *queue, * \return If queue is empty, returns non-zero value * \return If queue is not empty, returns zero value */ -int bh_queue_empty(bh_queue_t *queue); +int BH_QueueEmpty(BH_Queue *queue); /** @@ -106,7 +106,7 @@ int bh_queue_empty(bh_queue_t *queue); * * \return Returns the size of the queue. */ -size_t bh_queue_size(bh_queue_t *queue); +size_t BH_QueueSize(BH_Queue *queue); /** @@ -116,7 +116,7 @@ size_t bh_queue_size(bh_queue_t *queue); * * \return Returns the capacity of the queue. */ -size_t bh_queue_capacity(bh_queue_t *queue); +size_t BH_QueueCapacity(BH_Queue *queue); /** @@ -132,8 +132,8 @@ size_t bh_queue_capacity(bh_queue_t *queue); * \return If the \a iter is the null pointer, returns iterator to the * first element of the queue. */ -void *bh_queue_iter_next(bh_queue_t *queue, - void *iter); +void *BH_QueueIterNext(BH_Queue *queue, + void *iter); /** @@ -143,7 +143,7 @@ void *bh_queue_iter_next(bh_queue_t *queue, * * \return Returns value, pointed by iterator. */ -void *bh_queue_iter_value(void *iter); +void *BH_QueueIterValue(void *iter); #endif /* BH_QUEUE_H */ |