diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:15:58 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:30:31 +0300 |
| commit | 4226ee0b71fec6f08897dacf3d6632526618acca (patch) | |
| tree | 560c333c5a9458f3dbbb606befd52d558b35503f /source/blender/blenlib/intern/DLRB_tree.c | |
| parent | 30c3852ffd140b003410aae25b222dea8b76412f (diff) | |
Cleanup: comment line length (blenlib)
Prevents clang-format wrapping text before comments.
Diffstat (limited to 'source/blender/blenlib/intern/DLRB_tree.c')
| -rw-r--r-- | source/blender/blenlib/intern/DLRB_tree.c | 14 |
1 files changed, 8 insertions, 6 deletions
diff --git a/source/blender/blenlib/intern/DLRB_tree.c b/source/blender/blenlib/intern/DLRB_tree.c index e331e070a4a..c49f37d5650 100644 --- a/source/blender/blenlib/intern/DLRB_tree.c +++ b/source/blender/blenlib/intern/DLRB_tree.c @@ -443,7 +443,8 @@ static void insert_check_3(DLRBT_Tree *tree, DLRBT_Node *node) { DLRBT_Node *gp = get_grandparent(node); - /* check that grandparent and node->parent exist (jut in case... really shouldn't happen on a good tree) */ + /* check that grandparent and node->parent exist + * (jut in case... really shouldn't happen on a good tree) */ if (node && node->parent && gp) { /* a left rotation will switch the roles of node and its parent, assuming that * the parent is the left child of the grandparent... otherwise, rotation direction @@ -466,13 +467,13 @@ static void insert_check_3(DLRBT_Tree *tree, DLRBT_Node *node) /* get 'new' grandparent (i.e. grandparent for old-parent (node)) */ gp = get_grandparent(node); - /* modify the coloring of the grandparent and parent so that they still satisfy the constraints */ + /* modify the coloring of the grandparent and parent + * so that they still satisfy the constraints */ node->parent->tree_col = DLRBT_BLACK; gp->tree_col = DLRBT_RED; - /* if there are several nodes that all form a left chain, do a right rotation to correct this - * (or a rotation in the opposite direction if they all form a right chain) - */ + /* if there are several nodes that all form a left chain, do a right rotation to correct + * this (or a rotation in the opposite direction if they all form a right chain) */ if ((node == node->parent->left) && (node->parent == gp->left)) rotate_right(tree, gp); else //if ((node == node->parent->right) && (node->parent == gp->right)) @@ -502,7 +503,8 @@ void BLI_dlrbTree_insert(DLRBT_Tree *tree, DLRBT_Node *node) /* ----- */ /* 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 */ +/* 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) { |