Simple iterator abstract datatype, intended to iterate efficiently on collections while performing some transformations.
Find a file
Simon Cruanes 2ff632af11 more combinators in Sexpr;
bugfix in parsing, Return parsers must be poped off the stack as soon as possible;

^|| combinator for choosing parsers depending on a string
2013-02-08 23:20:42 +01:00
opam add files for opam 2013-01-29 15:45:29 +01:00
.gitignore generate documentation 2013-01-28 01:08:15 +01:00
LICENSE Add README and license 2013-01-27 23:45:30 +01:00
Makefile export, install and describe the S-expr module 2013-02-05 00:00:44 +01:00
META export, install and describe the S-expr module 2013-02-05 00:00:44 +01:00
README.md export, install and describe the S-expr module 2013-02-05 00:00:44 +01:00
sequence.ml functorial interface for Set too 2013-02-07 16:16:23 +01:00
sequence.mli functorial interface for Set too 2013-02-07 16:16:23 +01:00
sequence.odocl generate documentation 2013-01-28 01:08:15 +01:00
sexpr.ml more combinators in Sexpr; 2013-02-08 23:20:42 +01:00
sexpr.mli more combinators in Sexpr; 2013-02-08 23:20:42 +01:00
tests.ml offer two different functions for combining Map and Seq. Both build 2013-02-07 16:07:16 +01:00

Sequence

Simple sequence abstract datatype, intented to transfer a finite number of elements from one data structure to another. It also provides a tiny library for S-expressions, convertible to streams of tokens, and conversely.

Build

You need OCaml, say OCaml 3.12 or OCaml 4.0.

$ make

To see how to use it, check tests.ml. sequence.ml has a few examples of how to convert data structures into sequences, and conversely. The module sexpr.mli exposes the interface of the S-expression library.

License

Sequence is available under the BSD license.