From 90311ad4fab675812a0d7e67d951b25b3236541c Mon Sep 17 00:00:00 2001 From: Simon Cruanes Date: Thu, 1 May 2025 13:32:37 -0400 Subject: [PATCH] format --- src/posix/heap.ml | 8 ++++---- src/unix/heap.ml | 8 ++++---- 2 files changed, 8 insertions(+), 8 deletions(-) diff --git a/src/posix/heap.ml b/src/posix/heap.ml index a9a9c9e..1a553d3 100644 --- a/src/posix/heap.ml +++ b/src/posix/heap.ml @@ -22,10 +22,10 @@ open struct | E -> 0 | N (r, _, _, _) -> r - (** Make a balanced node labelled with [x], and subtrees [a] and [b]. - We ensure that the right child's rank is ≤ to the rank of the - left child (leftist property). The rank of the resulting node - is the length of the rightmost path. *) + (** Make a balanced node labelled with [x], and subtrees [a] and [b]. We + ensure that the right child's rank is ≤ to the rank of the left child + (leftist property). The rank of the resulting node is the length of the + rightmost path. *) let[@inline] mk_node_ x a b = if rank_ a >= rank_ b then N (rank_ b + 1, x, a, b) diff --git a/src/unix/heap.ml b/src/unix/heap.ml index a9a9c9e..1a553d3 100644 --- a/src/unix/heap.ml +++ b/src/unix/heap.ml @@ -22,10 +22,10 @@ open struct | E -> 0 | N (r, _, _, _) -> r - (** Make a balanced node labelled with [x], and subtrees [a] and [b]. - We ensure that the right child's rank is ≤ to the rank of the - left child (leftist property). The rank of the resulting node - is the length of the rightmost path. *) + (** Make a balanced node labelled with [x], and subtrees [a] and [b]. We + ensure that the right child's rank is ≤ to the rank of the left child + (leftist property). The rank of the resulting node is the length of the + rightmost path. *) let[@inline] mk_node_ x a b = if rank_ a >= rank_ b then N (rank_ b + 1, x, a, b)