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_dlrbTree.h
parentcffaa42d3a34c6b310c3c87c98e1f8313881e473 (diff)
code cleanup: header cleanup and remove some duplicate defines.
Diffstat (limited to 'source/blender/blenlib/BLI_dlrbTree.h')
-rw-r--r--source/blender/blenlib/BLI_dlrbTree.h10
1 files changed, 5 insertions, 5 deletions
diff --git a/source/blender/blenlib/BLI_dlrbTree.h b/source/blender/blenlib/BLI_dlrbTree.h
index 7443d7a07fe..92356b24403 100644
--- a/source/blender/blenlib/BLI_dlrbTree.h
+++ b/source/blender/blenlib/BLI_dlrbTree.h
@@ -58,7 +58,7 @@ typedef struct DLRBT_Node {
/* Red/Black defines for tree_col */
typedef enum eDLRBT_Colors {
- DLRBT_BLACK= 0,
+ DLRBT_BLACK = 0,
DLRBT_RED,
} eDLRBT_Colors;
@@ -67,10 +67,10 @@ typedef enum eDLRBT_Colors {
/* The Tree Data */
typedef struct DLRBT_Tree {
/* ListBase capabilities */
- void *first, *last; /* these should be based on DLRBT_Node-s */
+ void *first, *last; /* these should be based on DLRBT_Node-s */
/* Root Node */
- void *root; /* this should be based on DLRBT_Node-s */
+ void *root; /* this should be based on DLRBT_Node-s */
} DLRBT_Tree;
/* Callback Types --------------------------------- */
@@ -87,7 +87,7 @@ typedef short (*DLRBT_Comparator_FP)(void *node, void *data);
typedef DLRBT_Node *(*DLRBT_NAlloc_FP)(void *data);
/* update an existing node instance accordingly to be in sync with the given data *
- * - node: <DLRBT_Node> the node to update
+ * - node: <DLRBT_Node> the node to update
* - data: pointer to the relevant data or values stored in the bitpattern dependent on the function
*/
typedef void (*DLRBT_NUpdate_FP)(void *node, void *data);
@@ -137,7 +137,7 @@ short BLI_dlrbTree_contains(DLRBT_Tree *tree, DLRBT_Comparator_FP cmp_cb, void *
/* Add the given data to the tree, and return the node added */
// NOTE: for duplicates, the update_cb is called (if available), and the existing node is returned
DLRBT_Node *BLI_dlrbTree_add(DLRBT_Tree *tree, DLRBT_Comparator_FP cmp_cb,
- DLRBT_NAlloc_FP new_cb, DLRBT_NUpdate_FP update_cb, void *data);
+ DLRBT_NAlloc_FP new_cb, DLRBT_NUpdate_FP update_cb, void *data);
/* Remove the given element from the tree and balance again */