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

fix a few typos

Browse source
This commit is contained in:
Simon Cruanes 2016-12-25 21:35:48 +01:00
parent e2bd8fa4f7
commit e71e9560cc
1 changed files with 2 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
README.adoc
View file

@ -5,7 +5,7 @@
Simple sequence abstract datatype, intended to iterate efficiently Simple sequence abstract datatype, intended to iterate efficiently
on collections while performing some transformations. on collections while performing some transformations.
Common operations supported by Sequence include ` Common operations supported by Sequence include
`filter`, `map`, `take`, `drop`, `append`, `flat_map`, etc. `filter`, `map`, `take`, `drop`, `append`, `flat_map`, etc.
Sequence is not designed to be as general-purpose or flexible as, say, Sequence is not designed to be as general-purpose or flexible as, say,
Batteries' `'a Enum.t`. Rather, it aims at providing a very simple and efficient Batteries' `'a Enum.t`. Rather, it aims at providing a very simple and efficient
@ -53,7 +53,6 @@ sequences, and conversely.
=== Transferring Data === Transferring Data
TODO: transfer queue->stack, hashtbl->list
Conversion between n container types Conversion between n container types
would take n² functions. In practice, for a given collection would take n² functions. In practice, for a given collection
we can at best hope for `to_list` and `of_list`. we can at best hope for `to_list` and `of_list`.
@ -162,7 +161,7 @@ val vars_list : term list -> string sequence = <fun >
=== Permutations === Permutations
Makes it easy to write backtracking code (a non-deterministic Makes it easy to write backtracking code (a non-deterministic
function returning several '`a' function returning several `'a`
will just return a `'a Sequence.t`). will just return a `'a Sequence.t`).
Here, we generate all permutations of a list by Here, we generate all permutations of a list by
enumerating the ways we can insert an element in a list. enumerating the ways we can insert an element in a list.