aboutsummaryrefslogtreecommitdiffstats
path: root/src
diff options
context:
space:
mode:
authorStefan Kangas2025-01-09 05:12:14 +0100
committerStefan Kangas2025-01-09 05:13:28 +0100
commitb6bec47c4abe84263cb88eda56d3a9d77f153f71 (patch)
treecd2487a4f096b20f62dd1a483da749234b673ba0 /src
parent493bb2eaf1610ec950e4a2f7229d6e1f939064b9 (diff)
downloademacs-b6bec47c4abe84263cb88eda56d3a9d77f153f71.tar.gz
emacs-b6bec47c4abe84263cb88eda56d3a9d77f153f71.zip
; Fix indentation in itree.c
Diffstat (limited to 'src')
-rw-r--r--src/itree.c20
1 files changed, 10 insertions, 10 deletions
diff --git a/src/itree.c b/src/itree.c
index 85f835178f7..3a91a7a534d 100644
--- a/src/itree.c
+++ b/src/itree.c
@@ -513,7 +513,7 @@ itree_size (struct itree_tree *tree)
513 513
514static void 514static void
515itree_rotate_left (struct itree_tree *tree, 515itree_rotate_left (struct itree_tree *tree,
516 struct itree_node *node) 516 struct itree_node *node)
517{ 517{
518 eassert (node->right != NULL); 518 eassert (node->right != NULL);
519 519
@@ -556,7 +556,7 @@ itree_rotate_left (struct itree_tree *tree,
556 556
557static void 557static void
558itree_rotate_right (struct itree_tree *tree, 558itree_rotate_right (struct itree_tree *tree,
559 struct itree_node *node) 559 struct itree_node *node)
560{ 560{
561 eassert (tree && node && node->left != NULL); 561 eassert (tree && node && node->left != NULL);
562 562
@@ -595,7 +595,7 @@ itree_rotate_right (struct itree_tree *tree,
595 595
596static void 596static void
597itree_insert_fix (struct itree_tree *tree, 597itree_insert_fix (struct itree_tree *tree,
598 struct itree_node *node) 598 struct itree_node *node)
599{ 599{
600 eassert (tree->root->red == false); 600 eassert (tree->root->red == false);
601 601
@@ -801,8 +801,8 @@ itree_subtree_min (uintmax_t otick, struct itree_node *node)
801 801
802static void 802static void
803itree_remove_fix (struct itree_tree *tree, 803itree_remove_fix (struct itree_tree *tree,
804 struct itree_node *node, 804 struct itree_node *node,
805 struct itree_node *parent) 805 struct itree_node *parent)
806{ 806{
807 if (parent == NULL) 807 if (parent == NULL)
808 eassert (node == tree->root); 808 eassert (node == tree->root);
@@ -917,8 +917,8 @@ itree_total_offset (struct itree_node *node)
917 Requires both nodes to be using the same effective 'offset'. */ 917 Requires both nodes to be using the same effective 'offset'. */
918static void 918static void
919itree_replace_child (struct itree_tree *tree, 919itree_replace_child (struct itree_tree *tree,
920 struct itree_node *source, 920 struct itree_node *source,
921 struct itree_node *dest) 921 struct itree_node *dest)
922{ 922{
923 eassert (tree && dest != NULL); 923 eassert (tree && dest != NULL);
924 eassert (source == NULL 924 eassert (source == NULL
@@ -943,8 +943,8 @@ itree_replace_child (struct itree_tree *tree,
943 effective 'offset'. */ 943 effective 'offset'. */
944static void 944static void
945itree_transplant (struct itree_tree *tree, 945itree_transplant (struct itree_tree *tree,
946 struct itree_node *source, 946 struct itree_node *source,
947 struct itree_node *dest) 947 struct itree_node *dest)
948{ 948{
949 itree_replace_child (tree, source, dest); 949 itree_replace_child (tree, source, dest);
950 source->left = dest->left; 950 source->left = dest->left;
@@ -1304,7 +1304,7 @@ itree_iter_next_in_subtree (struct itree_node *node,
1304 return next; 1304 return next;
1305 } 1305 }
1306 } 1306 }
1307 } 1307 }
1308 return NULL; 1308 return NULL;
1309 1309
1310 case ITREE_POST_ORDER: 1310 case ITREE_POST_ORDER: