mirror of
https://github.com/c-cube/ocaml-containers.git
synced 2025-12-05 19:00:31 -05:00
prepare for 3.15
This commit is contained in:
parent
f02df05b35
commit
e1de3da1e3
10 changed files with 14 additions and 10 deletions
|
|
@ -2,6 +2,10 @@
|
|||
|
||||
## main
|
||||
|
||||
## 3.15
|
||||
|
||||
- Add `CCList.split_result` (#459)
|
||||
- pretty printer in MultiSet
|
||||
- `CCHeap`: building a heap from an almost-sorted sequence
|
||||
- perf: `CCHeap`: building a heap from n elements is now in time O(n)
|
||||
instead of O(n log n)
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
# This file is generated by dune, edit dune-project instead
|
||||
opam-version: "2.0"
|
||||
version: "3.14"
|
||||
version: "3.15"
|
||||
synopsis: "A set of advanced datatypes for containers"
|
||||
maintainer: ["c-cube"]
|
||||
authors: ["c-cube"]
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
# This file is generated by dune, edit dune-project instead
|
||||
opam-version: "2.0"
|
||||
version: "3.14"
|
||||
version: "3.15"
|
||||
synopsis:
|
||||
"A modular, clean and powerful extension of the OCaml standard library"
|
||||
maintainer: ["c-cube"]
|
||||
|
|
|
|||
|
|
@ -2,7 +2,7 @@
|
|||
(name containers)
|
||||
(generate_opam_files true)
|
||||
|
||||
(version 3.14)
|
||||
(version 3.15)
|
||||
(authors c-cube)
|
||||
(maintainers c-cube)
|
||||
(license BSD-2-Clause)
|
||||
|
|
|
|||
|
|
@ -156,7 +156,7 @@ module type S = sig
|
|||
[merge h (of_iter_almost_sorted iter)].
|
||||
See {!of_iter_almost_sorted}.
|
||||
Complexity: [O(log m + n)].
|
||||
@since NEXT_RELEASE
|
||||
@since 3.14
|
||||
*)
|
||||
|
||||
(** {2 Conversions} *)
|
||||
|
|
|
|||
|
|
@ -151,7 +151,7 @@ module type S = sig
|
|||
[merge h (of_iter_almost_sorted iter)].
|
||||
See {!of_iter_almost_sorted}.
|
||||
Complexity: [O(log m + n)].
|
||||
@since NEXT_RELEASE
|
||||
@since 3.14
|
||||
*)
|
||||
|
||||
(** {2 Conversions} *)
|
||||
|
|
@ -191,7 +191,7 @@ module type S = sig
|
|||
then successive {!take} run in [O(1)],
|
||||
and {!to_list_sorted} runs in [O(n)].
|
||||
Complexity: [O(n)].
|
||||
@since NEXT_RELEASE
|
||||
@since 3.14
|
||||
*)
|
||||
|
||||
val to_list : t -> elt list
|
||||
|
|
|
|||
|
|
@ -497,7 +497,7 @@ val all_ok : ('a, 'err) result t -> ('a t, 'err) result
|
|||
|
||||
val split_result : ('ok, 'error) result list -> 'ok list * 'error list
|
||||
(** Split a list of results into [Ok]s and [Error]s.
|
||||
@since NEXT_RELEASE *)
|
||||
@since 3.14 *)
|
||||
|
||||
val sorted_mem : cmp:('a -> 'a -> int) -> 'a -> 'a list -> bool
|
||||
(** [sorted_mem ~cmp x l] and [mem x l] give the same result for any sorted list [l],
|
||||
|
|
|
|||
|
|
@ -531,7 +531,7 @@ val all_ok : ('a, 'err) result t -> ('a t, 'err) result
|
|||
|
||||
val split_result : ('ok, 'error) result list -> 'ok list * 'error list
|
||||
(** Split a list of results into [Ok]s and [Error]s.
|
||||
@since NEXT_RELEASE *)
|
||||
@since 3.14 *)
|
||||
|
||||
val sorted_mem : cmp:(('a -> 'a -> int)[@keep_label]) -> 'a -> 'a list -> bool
|
||||
(** [sorted_mem ~cmp x l] and [mem x l] give the same result for any sorted list [l],
|
||||
|
|
|
|||
|
|
@ -98,7 +98,7 @@ module type S = sig
|
|||
elt printer ->
|
||||
t printer
|
||||
(** Print the multiset.
|
||||
@since NEXT_RELEASE *)
|
||||
@since 3.14 *)
|
||||
end
|
||||
|
||||
module Make (O : Set.OrderedType) = struct
|
||||
|
|
|
|||
|
|
@ -95,7 +95,7 @@ module type S = sig
|
|||
elt printer ->
|
||||
t printer
|
||||
(** Print the multiset.
|
||||
@since NEXT_RELEASE *)
|
||||
@since 3.14 *)
|
||||
end
|
||||
|
||||
module Make (O : Set.OrderedType) : S with type elt = O.t
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue