code cleanup: header cleanup and remove some duplicate defines.

1 files changed, 51 insertions, 51 deletions

diff --git a/source/blender/blenlib/BLI_gsqueue.h b/source/blender/blenlib/BLI_gsqueue.h
index 29c31c19047..b4cb1edd45a 100644
--- a/source/blender/blenlib/BLI_gsqueue.h
+++ b/source/blender/blenlib/BLI_gsqueue.h
@@ -36,64 +36,64 @@
 
 typedef struct _GSQueue GSQueue;
 
-	/**
-	 * Create a new GSQueue.
-	 * 
-	 * \param elem_size The size of the structures in the queue.
-	 * \retval The new queue
-	 */
-GSQueue*	BLI_gsqueue_new		(int elem_size);
+/**
+ * Create a new GSQueue.
+ *
+ * \param elem_size The size of the structures in the queue.
+ * \retval The new queue
+ */
+GSQueue    *BLI_gsqueue_new(int elem_size);
 
-	/**
-	 * Query if the queue is empty
-	 */
-int			BLI_gsqueue_is_empty(GSQueue *gq);
+/**
+ * Query if the queue is empty
+ */
+int         BLI_gsqueue_is_empty(GSQueue *gq);
 
-	/**
-	 * Query number elements in the queue
-	 */
-int			BLI_gsqueue_size(GSQueue *gq);
+/**
+ * Query number elements in the queue
+ */
+int         BLI_gsqueue_size(GSQueue *gq);
 
-	/**
-	 * Access the item at the head of the queue
-	 * without removing it.
-	 * 
-	 * \param item_r A pointer to an appropriately
-	 * sized structure (the size passed to BLI_gsqueue_new)
-	 */
-void		BLI_gsqueue_peek	(GSQueue *gq, void *item_r);
+/**
+ * Access the item at the head of the queue
+ * without removing it.
+ *
+ * \param item_r A pointer to an appropriately
+ * sized structure (the size passed to BLI_gsqueue_new)
+ */
+void        BLI_gsqueue_peek(GSQueue *gq, void *item_r);
 
-	/**
-	 * Access the item at the head of the queue
-	 * and remove it.
-	 * 
-	 * \param item_r A pointer to an appropriately
-	 * sized structure (the size passed to BLI_gsqueue_new).
-	 * Can be NULL if desired.
-	 */
-void		BLI_gsqueue_pop		(GSQueue *gq, void *item_r);
+/**
+ * Access the item at the head of the queue
+ * and remove it.
+ *
+ * \param item_r A pointer to an appropriately
+ * sized structure (the size passed to BLI_gsqueue_new).
+ * Can be NULL if desired.
+ */
+void        BLI_gsqueue_pop(GSQueue *gq, void *item_r);
 
-	/**
-	 * Push an element onto the tail of the queue.
-	 * 
-	 * \param item A pointer to an appropriately
-	 * sized structure (the size passed to BLI_gsqueue_new).
-	 */
-void		BLI_gsqueue_push	(GSQueue *gq, void *item);
+/**
+ * Push an element onto the tail of the queue.
+ *
+ * \param item A pointer to an appropriately
+ * sized structure (the size passed to BLI_gsqueue_new).
+ */
+void        BLI_gsqueue_push(GSQueue *gq, void *item);
 
-	/**
-	 * Push an element back onto the head of the queue (so
-	 * it would be returned from the next call to BLI_gsqueue_pop).
-	 * 
-	 * \param item A pointer to an appropriately
-	 * sized structure (the size passed to BLI_gsqueue_new).
-	 */
-void		BLI_gsqueue_pushback	(GSQueue *gq, void *item);
+/**
+ * Push an element back onto the head of the queue (so
+ * it would be returned from the next call to BLI_gsqueue_pop).
+ *
+ * \param item A pointer to an appropriately
+ * sized structure (the size passed to BLI_gsqueue_new).
+ */
+void        BLI_gsqueue_pushback(GSQueue *gq, void *item);
 
-	/**
-	 * Free the queue
-	 */
-void		BLI_gsqueue_free	(GSQueue *gq);
+/**
+ * Free the queue
+ */
+void        BLI_gsqueue_free(GSQueue *gq);
 
 #endif /* __BLI_GSQUEUE_H__ */