From 3abaae60667a2b04bd6d9e0adf2cd14a2e4b67d5 Mon Sep 17 00:00:00 2001 From: Simon Cruanes Date: Mon, 7 Mar 2016 14:28:32 +0100 Subject: [PATCH] prepare for 0.7 --- CHANGELOG.md | 8 ++++++++ _oasis | 2 +- opam | 2 ++ sequence.mli | 10 +++++----- sequenceLabels.mli | 8 ++++---- 5 files changed, 20 insertions(+), 10 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 38bc087..3915aef 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,5 +1,13 @@ # Changelog +## 0.7 + +- add missing entry in changelog and missing since annotations +- Add `shuffle`. +- Add `shuffle_buffer`. +- Add `sample`. +- Add `map_by_2`. + ## 0.6 - deprecate `flatMap` and `fmap` diff --git a/_oasis b/_oasis index c5f184f..10d80fa 100644 --- a/_oasis +++ b/_oasis @@ -1,6 +1,6 @@ OASISFormat: 0.4 Name: sequence -Version: 0.6 +Version: 0.7 Homepage: https://github.com/c-cube/sequence Authors: Simon Cruanes License: BSD-2-clause diff --git a/opam b/opam index 15aba0c..397ca53 100644 --- a/opam +++ b/opam @@ -1,4 +1,6 @@ opam-version: "1.2" +name: "sequence" +version: "0.7" author: "Simon Cruanes" maintainer: "simon.cruanes@inria.fr" build: [ diff --git a/sequence.mli b/sequence.mli index d20505a..c4e3a90 100644 --- a/sequence.mli +++ b/sequence.mli @@ -112,7 +112,7 @@ val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t val map_by_2 : ('a -> 'a -> 'a) -> 'a t -> 'a t (** Map objects two by two. lazily. The last element is kept in the sequence if the count is odd. - @since NEXT_RELEASE *) + @since 0.7 *) val for_all : ('a -> bool) -> 'a t -> bool (** Do all elements satisfy the predicate? *) @@ -419,7 +419,7 @@ val int_range_dec : start:int -> stop:int -> int t val bools : bool t (** Iterates on [true] and [false] - @since NEXT_RELEASE *) + @since 0.7 *) val of_set : (module Set.S with type elt = 'a and type t = 'b) -> 'b -> 'a t (** Convert the given set to a sequence. The set module must be provided. *) @@ -501,7 +501,7 @@ val random_list : 'a list -> 'a t val shuffle : 'a t -> 'a t (** [shuffle seq] returns a perfect shuffle of [seq]. Uses O(length seq) memory and time. Eager. - @since NEXT_RELEASE *) + @since 0.7 *) val shuffle_buffer : int -> 'a t -> 'a t (** [shuffle_buffer n seq] returns a sequence of element of [seq] in random @@ -509,7 +509,7 @@ val shuffle_buffer : int -> 'a t -> 'a t The first [n] elements of the sequence are consumed immediately. The rest is consumed lazily. - @since NEXT_RELEASE *) + @since 0.7 *) (** {2 Sampling} *) @@ -518,7 +518,7 @@ val sample : int -> 'a t -> 'a array It will consume the sequence and use O(n) memory. It returns an array of size [min (length seq) n]. - @since NEXT_RELEASE *) + @since 0.7 *) (** {2 Infix functions} *) diff --git a/sequenceLabels.mli b/sequenceLabels.mli index b52ac74..5db0707 100644 --- a/sequenceLabels.mli +++ b/sequenceLabels.mli @@ -90,7 +90,7 @@ val mapi : f:(int -> 'a -> 'b) -> 'a t -> 'b t val map_by_2 : f:('a -> 'a -> 'a) -> 'a t -> 'a t (** Map objects two by two. lazily. The last element is kept in the sequence if the count is odd. - @since NEXT_RELEASE *) + @since 0.7 *) val for_all : f:('a -> bool) -> 'a t -> bool (** Do all elements satisfy the predicate? *) @@ -449,7 +449,7 @@ val random_list : 'a list -> 'a t val shuffle : 'a t -> 'a t (** [shuffle seq] returns a perfect shuffle of [seq]. Uses O(length seq) memory and time. Eager. - @since NEXT_RELEASE *) + @since 0.7 *) val shuffle_buffer : n:int -> 'a t -> 'a t (** [shuffle_buffer n seq] returns a sequence of element of [seq] in random @@ -457,7 +457,7 @@ val shuffle_buffer : n:int -> 'a t -> 'a t The first [n] elements of the sequence are consumed immediately. The rest is consumed lazily. - @since NEXT_RELEASE *) + @since 0.7 *) (** {2 Sampling} *) @@ -466,7 +466,7 @@ val sample : n:int -> 'a t -> 'a array It will consume the sequence and use O(n) memory. It returns an array of size [min (length seq) n]. - @since NEXT_RELEASE *) + @since 0.7 *) (** {2 Infix functions} *)