mirror of
https://github.com/c-cube/ocaml-containers.git
synced 2025-12-06 03:05:28 -05:00
2 lines
5 KiB
HTML
2 lines
5 KiB
HTML
<!DOCTYPE html>
|
||
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>index (containers-data.index)</title><meta charset="utf-8"/><link rel="stylesheet" href="../odoc.support/odoc.css"/><meta name="generator" content="odoc 2.4.3"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../odoc.support/highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body class="odoc"><nav class="odoc-nav"><a href="../index.html">Up</a> – containers-data</nav><header class="odoc-preamble"><h1 id="containers-data-index"><a href="#containers-data-index" class="anchor"></a>containers-data index</h1></header><nav class="odoc-toc"><ul><li><a href="#library-containers-data">Library containers-data</a></li><li><a href="#library-containers-data.top">Library containers-data.top</a></li></ul></nav><div class="odoc-content"><h2 id="library-containers-data"><a href="#library-containers-data" class="anchor"></a>Library containers-data</h2><p>This library exposes the following toplevel modules:</p><ul class="modules"><li><a href="CCBV/index.html"><code>CCBV</code></a> <span class="synopsis">Imperative Bitvectors.</span></li><li><a href="CCBijection/index.html"><code>CCBijection</code></a> <span class="synopsis">Functor to build a bijection Represents 1-to-1 mappings between two types. Each element from the "left" is mapped to one "right" value, and conversely.</span></li><li><a href="CCBitField/index.html"><code>CCBitField</code></a> <span class="synopsis">Efficient Bit Field for up to 31 or 61 fiels</span></li><li><a href="CCCache/index.html"><code>CCCache</code></a> <span class="synopsis">Caches Utils</span></li><li><a href="CCDeque/index.html"><code>CCDeque</code></a> <span class="synopsis">Imperative deque</span></li><li><a href="CCFQueue/index.html"><code>CCFQueue</code></a> <span class="synopsis">Functional queues</span></li><li><a href="CCFun_vec/index.html"><code>CCFun_vec</code></a> <span class="synopsis">Functional Vectors</span></li><li><a href="CCGraph/index.html"><code>CCGraph</code></a> <span class="synopsis">Simple Graph Interface</span></li><li><a href="CCHashSet/index.html"><code>CCHashSet</code></a> <span class="synopsis">Mutable Set</span></li><li><a href="CCHashTrie/index.html"><code>CCHashTrie</code></a> <span class="synopsis">Hash Tries</span></li><li><a href="CCHet/index.html"><code>CCHet</code></a> <span class="synopsis">Associative containers with Heterogeneous Values</span></li><li><a href="CCImmutArray/index.html"><code>CCImmutArray</code></a> <span class="synopsis">Immutable Arrays</span></li><li><a href="CCIntMap/index.html"><code>CCIntMap</code></a> <span class="synopsis">Map specialized for Int keys</span></li><li><a href="CCKTree/index.html"><code>CCKTree</code></a> <span class="synopsis">Lazy Tree Structure This structure can be used to represent trees and directed graphs (as infinite trees) in a lazy fashion. It is a structural type.</span></li><li><a href="CCLazy_list/index.html"><code>CCLazy_list</code></a> <span class="synopsis">Lazy List</span></li><li><a href="CCMixmap/index.html"><code>CCMixmap</code></a> <span class="synopsis">Maps with Heterogeneous Values</span></li><li><a href="CCMixset/index.html"><code>CCMixset</code></a> <span class="synopsis">Set of Heterogeneous Values</span></li><li><a href="CCMixtbl/index.html"><code>CCMixtbl</code></a> <span class="synopsis">Hash Table with Heterogeneous Keys</span></li><li><a href="CCMultiMap/index.html"><code>CCMultiMap</code></a> <span class="synopsis">Map that can map key to several values</span></li><li><a href="CCMultiSet/index.html"><code>CCMultiSet</code></a> <span class="synopsis">Multiset</span></li><li><a href="CCMutHeap/index.html"><code>CCMutHeap</code></a> <span class="synopsis">Mutable Heaps</span></li><li><a href="CCMutHeap_intf/index.html"><code>CCMutHeap_intf</code></a> </li><li><a href="CCPersistentArray/index.html"><code>CCPersistentArray</code></a> <span class="synopsis">Persistent Arrays</span></li><li><a href="CCPersistentHashtbl/index.html"><code>CCPersistentHashtbl</code></a> <span class="synopsis">Persistent hash-table on top of OCaml's hashtables</span></li><li><a href="CCRAL/index.html"><code>CCRAL</code></a> <span class="synopsis">Random-Access Lists</span></li><li><a href="CCRingBuffer/index.html"><code>CCRingBuffer</code></a> <span class="synopsis">Circular Buffer (Deque)</span></li><li><a href="CCSimple_queue/index.html"><code>CCSimple_queue</code></a> <span class="synopsis">Functional queues (fifo)</span></li><li><a href="CCTrie/index.html"><code>CCTrie</code></a> <span class="synopsis">Prefix Tree</span></li><li><a href="CCWBTree/index.html"><code>CCWBTree</code></a> <span class="synopsis">Weight-Balanced Tree</span></li><li><a href="CCZipper/index.html"><code>CCZipper</code></a> <span class="synopsis">List Zipper</span></li></ul><h2 id="library-containers-data.top"><a href="#library-containers-data.top" class="anchor"></a>Library containers-data.top</h2><p>The entry point of this library is the module: <a href="Containers_data_top/index.html"><code>Containers_data_top</code></a>.</p></div></body></html>
|