Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCampbell Barton <ideasman42@gmail.com>2012-05-13 00:39:39 +0400
committerCampbell Barton <ideasman42@gmail.com>2012-05-13 00:39:39 +0400
commit9892736206676c5b7fabc8d1184f9655511ff2dd (patch)
tree83562ac50c93fe3004959d35c1af4a5b380fdd97 /source/blender/blenlib/BLI_heap.h
parentcffaa42d3a34c6b310c3c87c98e1f8313881e473 (diff)
code cleanup: header cleanup and remove some duplicate defines.
Diffstat (limited to 'source/blender/blenlib/BLI_heap.h')
-rw-r--r--source/blender/blenlib/BLI_heap.h22
1 files changed, 11 insertions, 11 deletions
diff --git a/source/blender/blenlib/BLI_heap.h b/source/blender/blenlib/BLI_heap.h
index 5ceccda96e4..b378f2bb365 100644
--- a/source/blender/blenlib/BLI_heap.h
+++ b/source/blender/blenlib/BLI_heap.h
@@ -38,35 +38,35 @@ struct HeapNode;
typedef struct Heap Heap;
typedef struct HeapNode HeapNode;
-typedef void (*HeapFreeFP)(void *ptr);
+typedef void (*HeapFreeFP)(void *ptr);
/* Creates a new heap. BLI_memarena is used for allocating nodes. Removed nodes
* are recycled, so memory usage will not shrink. */
-Heap* BLI_heap_new (void);
-void BLI_heap_free (Heap *heap, HeapFreeFP ptrfreefp);
+Heap *BLI_heap_new(void);
+void BLI_heap_free(Heap *heap, HeapFreeFP ptrfreefp);
/* Insert heap node with a value (often a 'cost') and pointer into the heap,
* duplicate values are allowed. */
-HeapNode* BLI_heap_insert (Heap *heap, float value, void *ptr);
+HeapNode *BLI_heap_insert(Heap *heap, float value, void *ptr);
/* Remove a heap node. */
-void BLI_heap_remove (Heap *heap, HeapNode *node);
+void BLI_heap_remove(Heap *heap, HeapNode *node);
/* Return 0 if the heap is empty, 1 otherwise. */
-int BLI_heap_empty (Heap *heap);
+int BLI_heap_empty(Heap *heap);
/* Return the size of the heap. */
-int BLI_heap_size (Heap *heap);
+int BLI_heap_size(Heap *heap);
/* Return the top node of the heap. This is the node with the lowest value. */
-HeapNode* BLI_heap_top (Heap *heap);
+HeapNode *BLI_heap_top(Heap *heap);
/* Pop the top node off the heap and return it's pointer. */
-void* BLI_heap_popmin (Heap *heap);
+void *BLI_heap_popmin(Heap *heap);
/* Return the value or pointer of a heap node. */
-float BLI_heap_node_value (HeapNode *heap);
-void* BLI_heap_node_ptr (HeapNode *heap);
+float BLI_heap_node_value(HeapNode *heap);
+void *BLI_heap_node_ptr(HeapNode *heap);
#endif