Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source
Page
Library
Module
Module type
Parameter
Class
Class type
Source
Iter.map_while
map_by_2
, add testsIO.write_lines
should produce an empty file for an empty iterof_gen_once
for_each
and for_eachi
inline
annotationsStdlib
instead of Pervasives
from_labeled_iter
.raise_notrace
for internal exceptions.Set.elements
to convert to listt2
(breaking)result
filter_count
count
lazygroup_by
lazySequence.append_l
Sequence.filter_mapi
SequenceLabels
with missing functionsSequence.pair_with_idx
{sum,sumf}
for summation over sequencesseq_list
and seq_list_map
{union,inter,diff,subset}
{join_by,join_all_by,group_join_by}
find_map{,i}
as better alias to existing functions{max_exn,min_exn}
count
doc
and test
to opamdiagonal,diagonal_l
init,fold_map,fold_filter_map,sorted,diagonal,findi,…
SequenceLabels
int_range_by
int_range_by
Sequence.flat_map_l
shuffle
.shuffle_buffer
.sample
.map_by_2
.flatMap
and fmap
group_by
(ignores the ordering)group_succ_by
, deprecated group
SequenceLabels
fold_while
funSet.Adapt.of_list
for < 4.02
IO
functions (keep compat)bytes
-safe-string
sequence.bigarray
take
and is_empty
take
on_list
for mapping lists through sequencesSequence.IO
module, a very very simple way to read/write filesto_opt/of_opt/head/head_exn
klist
>|=
add several functions:
product2
find
, mem
doubleton
, cons
, snoc
drop_while
, take_while
...concat_str
delimcc
in a new module, SequenceInvert
, in order to reverse the control flow (here with conversion to Gen)product
)Bench
with Benchmark
persistent_lazy
bin_annot
persistent
persistent
TypeClass
min
/max
(in case the sequence is empty)Gen
fmap
Set
and Map
join
combinatorSequence.persistent
sort
, uniq
, group
and sort_uniq
combinators implementedSequence.t2
Sequence.Infix
Sequence.t2
type for efficient iteration on pairs of elementsSequence.t2
zip
, unzip
and zip_i
to convert between t
and t2
scan
combinatornote: git log --no-merges previous_version..HEAD --pretty=%s