simon/iter
1
0
Fork 0
mirror of https://github.com/c-cube/iter.git synced 2025-12-06 03:05:29 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

remove trailing whitespace

Browse source
This commit is contained in:
Simon Cruanes 2014-07-01 15:54:15 +02:00
parent 632a820b1d
commit 54025273dd
2 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
sequence.ml
View file

@ -690,7 +690,7 @@ include Infix
let pp_seq ?(sep=", ") pp_elt formatter seq = let pp_seq ?(sep=", ") pp_elt formatter seq =
let first = ref true in let first = ref true in
iter iter
(fun x -> (fun x ->
(if !first then first := false (if !first then first := false
else begin else begin
Format.pp_print_string formatter sep; Format.pp_print_string formatter sep;
@ -702,7 +702,7 @@ let pp_seq ?(sep=", ") pp_elt formatter seq =
let pp_buf ?(sep=", ") pp_elt buf seq = let pp_buf ?(sep=", ") pp_elt buf seq =
let first = ref true in let first = ref true in
iter iter
(fun x -> (fun x ->
if !first then first := false else Buffer.add_string buf sep; if !first then first := false else Buffer.add_string buf sep;
pp_elt buf x) pp_elt buf x)
seq seq

8
sequence.mli
View file

@ -32,7 +32,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
of many combinators. However, for transient iterators, the {!persistent} of many combinators. However, for transient iterators, the {!persistent}
function is provided, storing elements of a transient iterator function is provided, storing elements of a transient iterator
in memory; the iterator can then be used several times (See further). in memory; the iterator can then be used several times (See further).
Note that some combinators also return sequences (e.g. {!group}). The Note that some combinators also return sequences (e.g. {!group}). The
transformation is computed on the fly every time one iterates over transformation is computed on the fly every time one iterates over
the resulting sequence. If a transformation performs heavy computation, the resulting sequence. If a transformation performs heavy computation,
@ -42,7 +42,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
until their result is iterated on. For instance, if one calls {!map} until their result is iterated on. For instance, if one calls {!map}
on a sequence, one gets a new sequence, but nothing else happens until on a sequence, one gets a new sequence, but nothing else happens until
this new sequence is used (by folding or iterating on it). this new sequence is used (by folding or iterating on it).
If a sequence is built from an iteration function that is {b repeatable} If a sequence is built from an iteration function that is {b repeatable}
(i.e. calling it several times always iterates on the same set of (i.e. calling it several times always iterates on the same set of
elements, for instance List.iter or Map.iter), then elements, for instance List.iter or Map.iter), then
@ -202,7 +202,7 @@ val join : join_row:('a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
the two elements do not combine. Assume that [b] allows for multiple the two elements do not combine. Assume that [b] allows for multiple
iterations. *) iterations. *)
val unfoldr : ('b -> ('a * 'b) option) -> 'b -> 'a t val unfoldr : ('b -> ('a * 'b) option) -> 'b -> 'a t
(** [unfoldr f b] will apply [f] to [b]. If it (** [unfoldr f b] will apply [f] to [b]. If it
yields [Some (x,b')] then [x] is returned yields [Some (x,b')] then [x] is returned
and unfoldr recurses with [b']. *) and unfoldr recurses with [b']. *)
@ -367,7 +367,7 @@ module Set : sig
(** Create an enriched Set module from the given one *) (** Create an enriched Set module from the given one *)
module Adapt(X : Set.S) : S with type elt = X.elt and type t = X.t module Adapt(X : Set.S) : S with type elt = X.elt and type t = X.t
(** Functor to build an extended Set module from an ordered type *) (** Functor to build an extended Set module from an ordered type *)
module Make(X : Set.OrderedType) : S with type elt = X.t module Make(X : Set.OrderedType) : S with type elt = X.t
end end