@@ -1746,13 +1746,16 @@ linkR_ x !lsz l r = case r of
17461746 Tip -> Bin (1 + lsz) x l Tip
17471747
17481748-- insertMin and insertMax don't perform potentially expensive comparisons.
1749- insertMax ,insertMin :: a -> Set a -> Set a
1749+ -- @since FIXME
1750+ insertMax :: a -> Set a -> Set a
17501751insertMax x t
17511752 = case t of
17521753 Tip -> singleton x
17531754 Bin _ y l r
17541755 -> balanceR y l (insertMax x r)
17551756
1757+ -- @since FIXME
1758+ insertMin :: a -> Set a -> Set a
17561759insertMin x t
17571760 = case t of
17581761 Tip -> singleton x
@@ -1788,6 +1791,7 @@ mergeR_ !lsz l r = case r of
17881791 [glue l r]: glues two trees together.
17891792 Assumes that [l] and [r] are already balanced with respect to each other.
17901793--------------------------------------------------------------------}
1794+ -- @since FIXME
17911795glue :: Set a -> Set a -> Set a
17921796glue Tip r = r
17931797glue l Tip = l
@@ -1931,6 +1935,7 @@ ratio = 2
19311935
19321936-- balanceL is called when left subtree might have been inserted to or when
19331937-- right subtree might have been deleted from.
1938+ -- @since FIXME
19341939balanceL :: a -> Set a -> Set a -> Set a
19351940balanceL x l r = case (l, r) of
19361941 (Bin ls _ _ _, Bin rs _ _ _)
@@ -1961,6 +1966,7 @@ balanceL_ x l r = case r of
19611966
19621967-- balanceR is called when right subtree might have been inserted to or when
19631968-- left subtree might have been deleted from.
1969+ -- @since FIXME
19641970balanceR :: a -> Set a -> Set a -> Set a
19651971balanceR x l r = case (l, r) of
19661972 (Bin ls _ _ _, Bin rs _ _ _)
0 commit comments