The Caml Hump: General purpose libraries :: Data structures

Protocol Buffers, JSON and XML serialization".

Batteries Included is a candidate standard development platform for OCaml.

OCaml-RDF is an OCaml library to manipulate RDF graphs.

Mocac is a generator of construction functions for Caml concrete data types with algebraic invariants and maximal sharing facilities. Algebraic invariants are specified by using keywords denoting equational theories like commutativity and associativity. The construction functions generated by Mocac allow each equivalence class to be represented by a unique value.

Library for serializing OCaml values to and from S-expressions.

Uuidm is an OCaml module implementing 128 bits universally unique identifiers version 3, 5 (name based with MD5, SHA-1 hashing) and 4 (random based) according to RFC 4122. Uuidm is made of a single, independent, module and distributed under the new BSD license.

This library can read and write CSV files, including all extensions used by Excel - eg. quotes, newlines, 8 bit characters in fields, "0 etc. The library comes with a handy command line tool called csvtool for handling CSV files from shell scripts.

The module Sam allows common operations on sparse associative memories according to the model introduced here: http://www.vincent-gripon.com/?p=92

A modular framework of Objective Caml libraries comprising general purpose utilities and functional data structures, a more flexible abstraction of the system network sockets layer than the standard library, and modules to support the development of concurrent, single-threaded network application services with a functional programming style.

The ocaml-bitstring project adds Erlang-style bitstrings and matching over bitstrings as a syntax extension and library for OCaml. (This project was formerly known as "bitmatch"). You can use this module to both parse and generate binary formats, files and protocols. Bitstring handling is added as primitives to the language, making it exceptionally simple to use and very powerful.

Ancient is an OCaml module that allows you to use in-memory data structures which are larger than available memory and so are kept in swap. If you try this in normal OCaml code, you'll find that the machine quickly descends into thrashing as the garbage collector repeatedly iterates over swapped memory structures. This module lets you break that limitation. Of course the module doesn't work by magic :-) If your program tries to access these large structures, they still need to be swapped back in, but it is suitable for large, sparsely accessed structures. Secondly, this module allows you to share those structures between processes. In this mode, the structures are backed by a disk file, and any process that has read/write access that disk file can map that file in and see the structures.

Library for automatically resizing contiguous memory (arrays and strings).

Dum is a library for inspecting the runtime representation of arbitrary Objective Caml values. Shared or cyclic data are detected and labelled. This guarantees that printing would always terminate. This makes it possible to print values such as closures, objects or exceptions in depth and without risk.

An Ocaml implementation of extensible arrays. The implementation is functional, based on balanced trees (and on the code for Set and Map).

A quite simple program to do some basic routing over Open Streat Map maps. It parses an .osm.bz2 file, creates a compact data structure in memory (which is saved into a cache to speed up next searches), finds the OSM nodes closest to the source and goal points given as (latitude, longitude) couples, does the routing itself, prints it on the screen and saves it in .osm XML format (for example to load it into JOSM).

An unfunctorized version of Set and Map.

An OCaml program that outputs the set of N-edged graphs (polynema) to a standard .dot file.

/UbiEst/ is intended to be a indexer, allowing *structural* and *compound* searches into a "bunch" of documents (files). What is an indexer ? An indexer is a program recording the occurrences of words among documents and enable to point on them (quickly if possible). A detailled explanation is available in the distribution, but in two or three words... By *structural* indexing, we mean that /UbiEst/ not only maps words onto their locations, but also structures of the indexed documents. By *compound* indexing, we mean that /UbiEst/ does not allow to request to find occurrences of simple words among the indexed document. requests can be combined by the mean of operators. By combining requests, you not only get simple occurrences of words, but rather /extends/ (i.e. piece of text) containing information fitting you global request. /UbiEst/ is developped in Objective Caml and a graphical user interface based on Gtk (Lablgtk) is available.

A high-level combinatorial dataflow programming library based upon destructive lazy streams.

A weak hash table library for OCaml, with an interface compatible with the standard Hashtbl library.

An efficient, imperative Fibonacci heap library, based on the pseudocode of Cormen, Leiserson, Rivest, and Stein. Aims to be practical and elegant.

This is a user-space implementation of STM (Software Transactional Memory) library for OCaml. It's mainly inspired by the STM library of Haskell, with some exceptions due to the different nature of languages and different strategies of implementation.

Bindlib is a library and a camlp4 syntax extension for the OCaml language. It proposes a set of tools to manage data structures with bound and free variables. It includes fast substitution and management of variables names including renaming.

This module implements compact integer sets, represented as a (custom) list of integer intervals. Usual set operations are provided. The advantage compared to ordered lists is that the actual size may be smaller than the cardinal of a set when many elements are contiguous. Most set operations are linear w.r.t. the size of the structure, not the cardinal of the set.

This package provides a syntax extension for easier manipulation of flat records, objects or tuples and conversions from/to CSV files for your favorite spreadsheet or plotting program.

HashSet is a hashed set library for Objective Caml. Buckets are ordered and the first element of a bucket is kept in a separate array, with occupation controlled by a bitvector.

A wrapper for the Objective Caml Hashtbl module that uses a Linked List to preserve the order in which the hash elements are added. It's similar in purpose to the Tie::IxHash module for Perl.

A mutable, circular, doubly linked list library.

OCaml Genetic Programming Framework.

A graph library. Provides several graph data structures and several graph algorithms. Algorithms are written independently of the graph data structure (using functors).

A collection datastructure. Unordered insertion, uniformly random removal.

Lecture notes about data structure in Objective Caml (in French).

A persistent library for Ocaml. PersiL could help you to handle persistent data in your application (data which survive the end of the program).

Camlp4 syntax extension to get more {easy,perlish} usage of Hashtbl module hash tables.

Heaps, imperative and functional implementations.

An extension with camlp4 that allows one to use lightweight records in OCaml.

A data structures library.

A small library to demonstrate monadic programming in OCaml.

Recursive is a tiny OCaml module that helps the programmer to manipulate cyclic structures (such as recursive types or finite automata) with maximal sharing and unique representation.

Timbuk is a collection of tools for achieving proofs of reachability over Term Rewriting Systems and for manipulating Tree Automata (bottom-up non-deterministic finite tree automata).

Binary trees where often accessed items tend to be near the root.

Implementation of tries (maps over lists).

Okasaki's Purely Functional Datastructures in OCaml.

Efficient sets and maps over integers, from a paper by Chris Okasaki.

Library for maintaining partially ordered maps.

A bit vectors library.