From 7243830219a4b7aa1c3b40e1df27d3e9d5dd4c33 Mon Sep 17 00:00:00 2001 From: Dorian Lesbre Date: Thu, 11 Jul 2024 11:20:38 +0200 Subject: [PATCH] Newlines in doc --- src/signatures.ml | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/src/signatures.ml b/src/signatures.ml index 4c6a78a..932b240 100644 --- a/src/signatures.ml +++ b/src/signatures.ml @@ -1014,7 +1014,7 @@ module type MAP_WITH_VALUE = sig returns true for each mapping pair of keys. We assume that [f] is reflexive (i.e. [f key value value] returns [true]) to avoid visiting physically equal subtrees of [map1] and [map2]. The - complexity is O(log(n)*Delta) where Delta is the number of + complexity is O(log(n)+Delta) where Delta is the number of different keys between [map1] and [map2]. *) val nonreflexive_same_domain_for_all2 : (key -> 'a value -> 'b value -> bool) -> 'a t -> 'b t -> bool @@ -1025,10 +1025,10 @@ module type MAP_WITH_VALUE = sig val reflexive_subset_domain_for_all2 : (key -> 'a value -> 'a value -> bool) -> 'a t -> 'a t -> bool (** [reflexive_subset_domain_for_all2 f map1 map2] returns true if - all the keys of [map1] also are in [map2], and [f key (find map1 - key) (find map2 key)] returns [true] when both keys are present - in the map. We assume that [f] is reflexive (i.e. [f key value - value] returns true) to avoid visiting physically equal subtrees + all the keys of [map1] also are in [map2], and + [f key (find map1 key) (find map2 key)] returns [true] when both keys are present + in the map. We assume that [f] is reflexive (i.e. + [f key value value] returns true) to avoid visiting physically equal subtrees of [map1] and [map2]. The complexity is O(log(n)*Delta) where Delta is the number of different keys between [map1] and [map2]. *)