ocaml-containers/1.3/index_values.html
2017-07-29 19:22:44 +02:00

8862 lines
No EOL
429 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="Start" href="index.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of class methods" rel=Appendix href="index_methods.html">
<link title="Index of class types" rel=Appendix href="index_class_types.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="CCVector" rel="Chapter" href="CCVector.html">
<link title="CCHeap" rel="Chapter" href="CCHeap.html">
<link title="CCList" rel="Chapter" href="CCList.html">
<link title="CCOpt" rel="Chapter" href="CCOpt.html">
<link title="CCPair" rel="Chapter" href="CCPair.html">
<link title="CCFun" rel="Chapter" href="CCFun.html">
<link title="CCHash" rel="Chapter" href="CCHash.html">
<link title="CCInt" rel="Chapter" href="CCInt.html">
<link title="CCBool" rel="Chapter" href="CCBool.html">
<link title="CCFloat" rel="Chapter" href="CCFloat.html">
<link title="CCArray" rel="Chapter" href="CCArray.html">
<link title="CCRef" rel="Chapter" href="CCRef.html">
<link title="CCSet" rel="Chapter" href="CCSet.html">
<link title="CCOrd" rel="Chapter" href="CCOrd.html">
<link title="CCRandom" rel="Chapter" href="CCRandom.html">
<link title="CCString" rel="Chapter" href="CCString.html">
<link title="CCHashtbl" rel="Chapter" href="CCHashtbl.html">
<link title="CCMap" rel="Chapter" href="CCMap.html">
<link title="CCFormat" rel="Chapter" href="CCFormat.html">
<link title="CCIO" rel="Chapter" href="CCIO.html">
<link title="CCInt64" rel="Chapter" href="CCInt64.html">
<link title="CCChar" rel="Chapter" href="CCChar.html">
<link title="CCResult" rel="Chapter" href="CCResult.html">
<link title="CCParse" rel="Chapter" href="CCParse.html">
<link title="CCArray_slice" rel="Chapter" href="CCArray_slice.html">
<link title="CCListLabels" rel="Chapter" href="CCListLabels.html">
<link title="CCArrayLabels" rel="Chapter" href="CCArrayLabels.html">
<link title="CCEqual" rel="Chapter" href="CCEqual.html">
<link title="Containers" rel="Chapter" href="Containers.html">
<link title="CCKTree" rel="Chapter" href="CCKTree.html">
<link title="CCKList" rel="Chapter" href="CCKList.html">
<link title="CCLazy_list" rel="Chapter" href="CCLazy_list.html">
<link title="CCMultiMap" rel="Chapter" href="CCMultiMap.html">
<link title="CCMultiSet" rel="Chapter" href="CCMultiSet.html">
<link title="CCTrie" rel="Chapter" href="CCTrie.html">
<link title="CCFlatHashtbl" rel="Chapter" href="CCFlatHashtbl.html">
<link title="CCCache" rel="Chapter" href="CCCache.html">
<link title="CCPersistentHashtbl" rel="Chapter" href="CCPersistentHashtbl.html">
<link title="CCDeque" rel="Chapter" href="CCDeque.html">
<link title="CCFQueue" rel="Chapter" href="CCFQueue.html">
<link title="CCBV" rel="Chapter" href="CCBV.html">
<link title="CCMixtbl" rel="Chapter" href="CCMixtbl.html">
<link title="CCMixmap" rel="Chapter" href="CCMixmap.html">
<link title="CCRingBuffer" rel="Chapter" href="CCRingBuffer.html">
<link title="CCIntMap" rel="Chapter" href="CCIntMap.html">
<link title="CCPersistentArray" rel="Chapter" href="CCPersistentArray.html">
<link title="CCMixset" rel="Chapter" href="CCMixset.html">
<link title="CCGraph" rel="Chapter" href="CCGraph.html">
<link title="CCHashSet" rel="Chapter" href="CCHashSet.html">
<link title="CCBitField" rel="Chapter" href="CCBitField.html">
<link title="CCHashTrie" rel="Chapter" href="CCHashTrie.html">
<link title="CCWBTree" rel="Chapter" href="CCWBTree.html">
<link title="CCRAL" rel="Chapter" href="CCRAL.html">
<link title="CCSimple_queue" rel="Chapter" href="CCSimple_queue.html">
<link title="CCImmutArray" rel="Chapter" href="CCImmutArray.html">
<link title="CCHet" rel="Chapter" href="CCHet.html">
<link title="CCZipper" rel="Chapter" href="CCZipper.html">
<link title="CCPool" rel="Chapter" href="CCPool.html">
<link title="CCLock" rel="Chapter" href="CCLock.html">
<link title="CCSemaphore" rel="Chapter" href="CCSemaphore.html">
<link title="CCThread" rel="Chapter" href="CCThread.html">
<link title="CCBlockingQueue" rel="Chapter" href="CCBlockingQueue.html">
<link title="CCTimer" rel="Chapter" href="CCTimer.html">
<link title="CCUnix" rel="Chapter" href="CCUnix.html">
<link title="CCSexp" rel="Chapter" href="CCSexp.html">
<link title="CCSexp_lex" rel="Chapter" href="CCSexp_lex.html"><title>Containers doc : Index of values</title>
</head>
<body>
<div class="navbar">&nbsp;<a class="up" href="index.html" title="Index">Up</a>
&nbsp;</div>
<h1>Index of values</h1>
<table>
<tr><td align="left"><br></td></tr>
<tr><td><a href="CCInt64.html#VAL( * )">( * )</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VAL( *** )">( *** )</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Map on both sides of a tuple
</div>
</td></tr>
<tr><td><a href="CCParse.Infix.html#VAL( *> )">( *&gt; )</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL( *> )">( *&gt; )</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;*&gt;&nbsp;b</code> parses <code class="code">a</code>, then parses <code class="code">b</code> into <code class="code">x</code>, and returns <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCParse.Infix.html#VAL( <* )">( &lt;* )</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL( <* )">( &lt;* )</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;&lt;*&nbsp;b</code> parses <code class="code">a</code> into <code class="code">x</code>, parses <code class="code">b</code> and ignores its result,
and returns <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCFun.html#VAL(%)">(%)</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Mathematical composition
</div>
</td></tr>
<tr><td><a href="CCFun.html#VAL(%>)">(%&gt;)</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Alias to <code class="code">compose</code>
</div>
</td></tr>
<tr><td><a href="CCPair.html#VAL(&&&)">(&amp;&amp;&amp;)</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
<code class="code">f&nbsp;&amp;&amp;&amp;&nbsp;g</code> is <code class="code"><span class="keyword">fun</span>&nbsp;x&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;f&nbsp;x,&nbsp;g&nbsp;x</code>.
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VAL(+)">(+)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(-)">(-)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.Infix.html#VAL(--)">(--)</a> [<a href="CCRAL.Infix.html">CCRAL.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCRAL.html#VALrange"><code class="code"><span class="constructor">CCRAL</span>.range</code></a>
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VAL(--)">(--)</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;--&nbsp;b</code> is the integer range from <code class="code">a</code> to <code class="code">b</code>, both included.
</div>
</td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(--)">(--)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(--)">(--)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;--&nbsp;b</code> is the range of integers containing
<code class="code">a</code> and <code class="code">b</code> (therefore, never empty)
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VAL(--)">(--)</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Range array
</div>
</td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(--)">(--)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VAL(--)">(--)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Infix alias for <code class="code">range</code>
</div>
</td></tr>
<tr><td><a href="CCArray.html#VAL(--)">(--)</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Range array
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(--)">(--)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCInt.html#VALrange"><code class="code"><span class="constructor">CCInt</span>.range</code></a>
</div>
</td></tr>
<tr><td><a href="CCList.Infix.html#VAL(--)">(--)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VAL(--)">(--)</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Infix alias for <code class="code">range</code>
</div>
</td></tr>
<tr><td><a href="CCVector.html#VAL(--)">(--)</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Range of integers, either ascending or descending (both included,
therefore the result is never empty).
</div>
</td></tr>
<tr><td><a href="CCRAL.Infix.html#VAL(--^)">(--^)</a> [<a href="CCRAL.Infix.html">CCRAL.Infix</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;--&nbsp;b</code> is the integer range from <code class="code">a</code> to <code class="code">b</code>, where <code class="code">b</code> is excluded.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VAL(--^)">(--^)</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;--&nbsp;b</code> is the integer range from <code class="code">a</code> to <code class="code">b</code>, where <code class="code">b</code> is excluded.
</div>
</td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(--^)">(--^)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(--^)">(--^)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;--&nbsp;b</code> is the integer range from <code class="code">a</code> to <code class="code">b</code>, where <code class="code">b</code> is excluded.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VAL(--^)">(--^)</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Range array, excluding right bound
</div>
</td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(--^)">(--^)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VAL(--^)">(--^)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Infix alias for <code class="code">range'</code>
</div>
</td></tr>
<tr><td><a href="CCArray.html#VAL(--^)">(--^)</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Range array, excluding right bound
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(--^)">(--^)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCInt.html#VALrange'"><code class="code"><span class="constructor">CCInt</span>.range'</code></a>
</div>
</td></tr>
<tr><td><a href="CCList.Infix.html#VAL(--^)">(--^)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCList.html#VAL(--^)">(--^)</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Infix alias for <code class="code">range'</code>
</div>
</td></tr>
<tr><td><a href="CCVector.html#VAL(--^)">(--^)</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Range of integers, either ascending or descending, but excluding right.,
Example: <code class="code">1&nbsp;--^&nbsp;10</code> returns the vector <code class="code">[1;2;3;4;5;6;7;8;9]</code>
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VAL(/)">(/)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(<$>)">(&lt;$&gt;)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VAL(<$>)">(&lt;$&gt;)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.Infix.html#VAL(<$>)">(&lt;$&gt;)</a> [<a href="CCOpt.Infix.html">CCOpt.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VAL(<$>)">(&lt;$&gt;)</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Infix.html#VAL(<$>)">(&lt;$&gt;)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VAL(<$>)">(&lt;$&gt;)</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.Infix.html#VAL(<)">(&lt;)</a> [<a href="CCFloat.Infix.html">CCFloat.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(<)">(&lt;)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCPool.Make.Fut.Infix.html">CCPool.Make.Fut.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Alias to <a href="CCPool.Make.Fut.html#VALapp"><code class="code"><span class="constructor">CCPool</span>.<span class="constructor">Make</span>.<span class="constructor">Fut</span>.app</code></a>
</div>
</td></tr>
<tr><td><a href="CCRAL.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCRAL.Infix.html">CCRAL.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCRAL.html#VALapp"><code class="code"><span class="constructor">CCRAL</span>.app</code></a>
</div>
</td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Applicative
</div>
</td></tr>
<tr><td><a href="CCResult.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCResult.Infix.html">CCResult.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;&lt;*&gt;&nbsp;b</code> evaluates <code class="code">a</code> and <code class="code">b</code>, and, in case of success, returns
<code class="code"><span class="constructor">Ok</span>&nbsp;(a&nbsp;b)</code>.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCOpt.Infix.html">CCOpt.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Infix.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VAL(<*>)">(&lt;*&gt;)</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.Infix.html#VAL(<+>)">(&lt;+&gt;)</a> [<a href="CCOpt.Infix.html">CCOpt.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VAL(<+>)">(&lt;+&gt;)</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;&lt;+&gt;&nbsp;b</code> is <code class="code">a</code> if <code class="code">a</code> is <code class="code"><span class="constructor">Some</span>&nbsp;_</code>, <code class="code">b</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(<.>)">(&lt;.&gt;)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(<.>)">(&lt;.&gt;)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Infix version of <a href="CCKList.html#VALfair_app"><code class="code"><span class="constructor">CCKList</span>.fair_app</code></a>
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.Infix.html#VAL(<::)">(&lt;::)</a> [<a href="CCSimple_queue.Infix.html">CCSimple_queue.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCSimple_queue.html#VALsnoc"><code class="code"><span class="constructor">CCSimple_queue</span>.snoc</code></a>
</div>
</td></tr>
<tr><td><a href="CCPair.html#VAL(<<<)">(&lt;&lt;&lt;)</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Map on the left side of the tuple
</div>
</td></tr>
<tr><td><a href="CCFloat.Infix.html#VAL(<=)">(&lt;=)</a> [<a href="CCFloat.Infix.html">CCFloat.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(<=)">(&lt;=)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFloat.Infix.html#VAL(<>)">(&lt;&gt;)</a> [<a href="CCFloat.Infix.html">CCFloat.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(<>)">(&lt;&gt;)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCParse.Infix.html#VAL(<?>)">(&lt;?&gt;)</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL(<?>)">(&lt;?&gt;)</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;&lt;?&gt;&nbsp;msg</code> behaves like <code class="code">a</code>, but if <code class="code">a</code> fails without
consuming any input, it fails with <code class="code">msg</code>
instead.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VAL(<?>)">(&lt;?&gt;)</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;&lt;?&gt;&nbsp;b</code> is a choice operator.
</div>
</td></tr>
<tr><td><a href="CCOrd.Infix.html#VAL(<?>)">(&lt;?&gt;)</a> [<a href="CCOrd.Infix.html">CCOrd.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VAL(<?>)">(&lt;?&gt;)</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
<code class="code">c1&nbsp;&lt;?&gt;&nbsp;(ord,&nbsp;x,&nbsp;y)</code> returns the same as <code class="code">c1</code> if <code class="code">c1</code> is not <code class="code">0</code>;
otherwise it uses <code class="code">ord</code> to compare the two values <code class="code">x</code> and <code class="code">y</code>,
of type <code class="code"><span class="keywordsign">'</span>a</code>.
</div>
</td></tr>
<tr><td><a href="CCParse.Infix.html#VAL(<|>)">(&lt;|&gt;)</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL(<|>)">(&lt;|&gt;)</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">a&nbsp;&lt;|&gt;&nbsp;b</code> tries to parse <code class="code">a</code>, and if <code class="code">a</code> fails without
consuming any input, backtracks and tries
to parse <code class="code">b</code>, otherwise it fails as <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCFloat.Infix.html#VAL(=)">(=)</a> [<a href="CCFloat.Infix.html">CCFloat.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(=)">(=)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFloat.Infix.html#VAL(>)">(&gt;)</a> [<a href="CCFloat.Infix.html">CCFloat.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(>)">(&gt;)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFloat.Infix.html#VAL(>=)">(&gt;=)</a> [<a href="CCFloat.Infix.html">CCFloat.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.Infix.html#VAL(>=)">(&gt;=)</a> [<a href="CCInt.Infix.html">CCInt.Infix</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.Infix.html#VAL(>>)">(&gt;&gt;)</a> [<a href="CCPool.Make.Fut.Infix.html">CCPool.Make.Fut.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VAL(>>)">(&gt;&gt;)</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(>>-)">(&gt;&gt;-)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(>>-)">(&gt;&gt;-)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Infix version of <a href="CCKList.html#VALfair_flat_map"><code class="code"><span class="constructor">CCKList</span>.fair_flat_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCPool.Make.Fut.Infix.html">CCPool.Make.Fut.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCRAL.Infix.html">CCRAL.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCRAL.html#VALflat_map"><code class="code"><span class="constructor">CCRAL</span>.flat_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCGraph.Seq.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCLazy_list.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCLazy_list.Infix.html">CCLazy_list.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.MONAD.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCKList.MONAD.html">CCKList.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Infix version of <a href="CCArrayLabels.html#VALflat_map"><code class="code"><span class="constructor">CCArrayLabels</span>.flat_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCListLabels.MONAD.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCListLabels.MONAD.html">CCListLabels.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Monadic bind
</div>
</td></tr>
<tr><td><a href="CCResult.MONAD.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCResult.MONAD.html">CCResult.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCResult.Infix.html">CCResult.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Infix version of <a href="CCArray.html#VALflat_map"><code class="code"><span class="constructor">CCArray</span>.flat_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCFun.Monad.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCFun.Monad.html">CCFun.Monad</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCOpt.Infix.html">CCOpt.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Monadic bind
</div>
</td></tr>
<tr><td><a href="CCList.MONAD.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCList.MONAD.html">CCList.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Infix.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VAL(>>=)">(&gt;&gt;=)</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Infix version of <a href="CCVector.html#VALflat_map"><code class="code"><span class="constructor">CCVector</span>.flat_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCPair.html#VAL(>>>)">(&gt;&gt;&gt;)</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Map on the right side of the tuple
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VAL(>>|)">(&gt;&gt;|)</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Infix version of <a href="CCArrayLabels.html#VALmap"><code class="code"><span class="constructor">CCArrayLabels</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCArray.html#VAL(>>|)">(&gt;&gt;|)</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Infix version of <a href="CCArray.html#VALmap"><code class="code"><span class="constructor">CCArray</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCPool.Make.Fut.Infix.html">CCPool.Make.Fut.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Alias to <a href="CCPool.Make.Fut.html#VALmap"><code class="code"><span class="constructor">CCPool</span>.<span class="constructor">Make</span>.<span class="constructor">Fut</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCSimple_queue.Infix.html">CCSimple_queue.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCSimple_queue.html#VALmap"><code class="code"><span class="constructor">CCSimple_queue</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCRAL.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCRAL.Infix.html">CCRAL.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCRAL.html#VALmap"><code class="code"><span class="constructor">CCRAL</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Synonym to <a href="CCFQueue.html#VALmap"><code class="code"><span class="constructor">CCFQueue</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCLazy_list.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCLazy_list.Infix.html">CCLazy_list.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCKList.Infix.html">CCKList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td></td></tr>
<tr><td><a href="CCEqual.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCEqual.Infix.html">CCEqual.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCEqual.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td><div class="info">
Infix equivalent of <a href="CCEqual.html#VALmap"><code class="code"><span class="constructor">CCEqual</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Infix version of <a href="CCArrayLabels.html#VALmap"><code class="code"><span class="constructor">CCArrayLabels</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Infix version of <code class="code">map</code> with reversed arguments
</div>
</td></tr>
<tr><td><a href="CCParse.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCParse.Infix.html">CCParse.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Map
</div>
</td></tr>
<tr><td><a href="CCResult.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCResult.Infix.html">CCResult.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCOrd.Infix.html">CCOrd.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
Infix equivalent of <a href="CCOrd.html#VALmap"><code class="code"><span class="constructor">CCOrd</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCArray.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Infix version of <a href="CCArray.html#VALmap"><code class="code"><span class="constructor">CCArray</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCFun.Monad.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCFun.Monad.html">CCFun.Monad</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCOpt.Infix.html">CCOpt.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Infix version of <a href="CCOpt.html#VALmap"><code class="code"><span class="constructor">CCOpt</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCList.Infix.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Infix version of <code class="code">map</code> with reversed arguments
</div>
</td></tr>
<tr><td><a href="CCVector.html#VAL(>|=)">(&gt;|=)</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Infix version of <a href="CCVector.html#VALmap"><code class="code"><span class="constructor">CCVector</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.Infix.html#VAL(@)">(@)</a> [<a href="CCSimple_queue.Infix.html">CCSimple_queue.Infix</a>]</td>
<td><div class="info">
Alias to <a href="CCSimple_queue.html#VALappend"><code class="code"><span class="constructor">CCSimple_queue</span>.append</code></a>
</div>
</td></tr>
<tr><td><a href="CCListLabels.Infix.html#VAL(@)">(@)</a> [<a href="CCListLabels.Infix.html">CCListLabels.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VAL(@)">(@)</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Infix.html#VAL(@)">(@)</a> [<a href="CCList.Infix.html">CCList.Infix</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VAL(@)">(@)</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.Infix.html#VAL(@+)">(@+)</a> [<a href="CCRAL.Infix.html">CCRAL.Infix</a>]</td>
<td><div class="info">
Cons (alias to <a href="CCRAL.html#VALcons"><code class="code"><span class="constructor">CCRAL</span>.cons</code></a>)
</div>
</td></tr>
<tr><td><a href="CCFun.html#VAL(@@)">(@@)</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">f&nbsp;@@&nbsp;x</code> is the same as <code class="code">f&nbsp;x</code>, but right-associative.
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VAL(asr)">(asr)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(land)">(land)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(lor)">(lor)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(lsl)">(lsl)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(lsr)">(lsr)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(lxor)">(lxor)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VAL(mod)">(mod)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCFun.html#VAL(|>)">(|&gt;)</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Pipeline.
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VAL(~-)">(~-)</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCUnix.Infix.html#VAL?|">?|</a> [<a href="CCUnix.Infix.html">CCUnix.Infix</a>]</td>
<td><div class="info">
Infix version of <a href="CCUnix.html#VALcall"><code class="code"><span class="constructor">CCUnix</span>.call</code></a>
</div>
</td></tr>
<tr><td><a href="CCUnix.Infix.html#VAL?|&">?|&amp;</a> [<a href="CCUnix.Infix.html">CCUnix.Infix</a>]</td>
<td><div class="info">
Infix version of <a href="CCUnix.html#VALasync_call"><code class="code"><span class="constructor">CCUnix</span>.async_call</code></a>
</div>
</td></tr>
<tr><td><a href="CCSexp_lex.html#VAL__ocaml_lex_tables">__ocaml_lex_tables</a> [<a href="CCSexp_lex.html">CCSexp_lex</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp_lex.html#VAL__ocaml_lex_token_rec">__ocaml_lex_token_rec</a> [<a href="CCSexp_lex.html">CCSexp_lex</a>]</td>
<td></td></tr>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="CCTrie.S.html#VALabove">above</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
All bindings whose key is bigger or equal to the given key, in
ascending order
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALabs">abs</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALabs">abs</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCSemaphore.html#VALacquire">acquire</a> [<a href="CCSemaphore.html">CCSemaphore</a>]</td>
<td><div class="info">
<code class="code">acquire&nbsp;n&nbsp;s</code> blocks until <code class="code">get&nbsp;s&nbsp;&gt;=&nbsp;n</code>, then atomically
sets <code class="code">s&nbsp;:=&nbsp;!s&nbsp;-&nbsp;n</code>
</div>
</td></tr>
<tr><td><a href="CCThread.Barrier.html#VALactivate">activate</a> [<a href="CCThread.Barrier.html">CCThread.Barrier</a>]</td>
<td><div class="info">
<code class="code">activate&nbsp;b</code> unblocks all threads that were waiting on <code class="code">b</code>
</div>
</td></tr>
<tr><td><a href="CCThread.Barrier.html#VALactivated">activated</a> [<a href="CCThread.Barrier.html">CCThread.Barrier</a>]</td>
<td><div class="info">
<code class="code">activated&nbsp;b</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">activate&nbsp;b</code> was called, and <code class="code">reset&nbsp;b</code>
was not called since.
</div>
</td></tr>
<tr><td><a href="CCTimer.html#VALactive">active</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
Returns <code class="code"><span class="keyword">true</span></code> until <code class="code">stop&nbsp;t</code> has been called.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.html#VALactive">active</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td><div class="info">
<code class="code">active&nbsp;()</code> is true as long as <code class="code">stop()</code> has not been called yet
</div>
</td></tr>
<tr><td><a href="CCHashTrie.Transient.html#VALactive">active</a> [<a href="CCHashTrie.Transient.html">CCHashTrie.Transient</a>]</td>
<td><div class="info">
<code class="code">active&nbsp;i</code> is <code class="code">not&nbsp;(frozen&nbsp;i)</code>
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALadd">add</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALadd">add</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALadd">add</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd">add</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALadd">add</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td><div class="info">
Add a vertex, possibly with no outgoing edge
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALadd">add</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixmap.S.html#VALadd">add</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Bind the key to the value, using <code class="code">inj</code>
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALadd">add</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Add the binding to the table, returning a new table.
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALadd">add</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">add&nbsp;tbl&nbsp;k&nbsp;v</code> adds <code class="code">k&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v</code> to <code class="code">tbl</code>, possibly replacing the old
value associated with <code class="code">k</code>.
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALadd">add</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Add a binding to the trie (possibly erasing the previous one)
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALadd">add</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALadd">add</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Add a binding (left,right)
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALadd">add</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Add a key/value binding
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALadd">add</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALadd">add</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Synonym to <a href="CCHeap.S.html#VALinsert"><code class="code"><span class="constructor">CCHeap</span>.<span class="constructor">S</span>.insert</code></a>
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALadd_array">add_array</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALadd_ctx">add_ctx</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">add_ctx&nbsp;msg</code> leaves <code class="code"><span class="constructor">Ok</span>&nbsp;x</code> untouched, but transforms
<code class="code"><span class="constructor">Error</span>&nbsp;s</code> into <code class="code"><span class="constructor">Error</span>&nbsp;s'</code> where <code class="code">s'</code> contains the additional
context given by <code class="code">msg</code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALadd_ctxf">add_ctxf</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">add_ctxf&nbsp;format_message</code> is similar to <a href="CCResult.html#VALadd_ctx"><code class="code"><span class="constructor">CCResult</span>.add_ctx</code></a> but with
<code class="code"><span class="constructor">Format</span></code> for printing the message (eagerly).
</div>
</td></tr>
<tr><td><a href="CCGraph.MAP.html#VALadd_edge">add_edge</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALadd_gen">add_gen</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALadd_gen">add_gen</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALadd_gen">add_gen</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_gen">add_gen</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALadd_gen">add_gen</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALadd_gen">add_gen</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_gen_mut">add_gen_mut</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALadd_klist">add_klist</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALadd_klist">add_klist</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALadd_klist">add_klist</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALadd_list">add_list</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALadd_list">add_list</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALadd_list">add_list</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALadd_list">add_list</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALadd_list">add_list</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_list">add_list</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALadd_list">add_list</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALadd_list">add_list</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALadd_list">add_list</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALadd_list">add_list</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALadd_list">add_list</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">add_list&nbsp;tbl&nbsp;x&nbsp;y</code> adds <code class="code">y</code> to the list <code class="code">x</code> is bound to.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALadd_list">add_list</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">add_list&nbsp;tbl&nbsp;x&nbsp;y</code> adds <code class="code">y</code> to the list <code class="code">x</code> is bound to.
</div>
</td></tr>
<tr><td><a href="CCSet.S.html#VALadd_list">add_list</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALadd_list">add_list</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Add the elements of the list to the heap.
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_list_mut">add_list_mut</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALadd_mult">add_mult</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">add_mult&nbsp;set&nbsp;x&nbsp;n</code> adds <code class="code">n</code> occurrences of <code class="code">x</code> to <code class="code">set</code>
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_mut">add_mut</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
<code class="code">add_mut&nbsp;~id&nbsp;k&nbsp;v&nbsp;m</code> behaves like <code class="code">add&nbsp;k&nbsp;v&nbsp;m</code>, except it will mutate
in place whenever possible.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALadd_nodup">add_nodup</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">add_nodup&nbsp;x&nbsp;set</code> adds <code class="code">x</code> to <code class="code">set</code> if it was not already present.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALadd_nodup">add_nodup</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">add_nodup&nbsp;x&nbsp;set</code> adds <code class="code">x</code> to <code class="code">set</code> if it was not already present.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALadd_pairs">add_pairs</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Add pairs
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALadd_seq">add_seq</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALadd_seq">add_seq</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALadd_seq">add_seq</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALadd_seq">add_seq</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALadd_seq">add_seq</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_seq">add_seq</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALadd_seq">add_seq</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALadd_seq">add_seq</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALadd_seq">add_seq</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALadd_seq">add_seq</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALadd_seq">add_seq</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALadd_seq">add_seq</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Add the corresponding pairs to the table, using <code class="code"><span class="constructor">Hashtbl</span>.add</code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALadd_seq">add_seq</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Add the corresponding pairs to the table, using <code class="code"><span class="constructor">Hashtbl</span>.add</code>.
</div>
</td></tr>
<tr><td><a href="CCSet.S.html#VALadd_seq">add_seq</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALadd_seq">add_seq</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALadd_seq_back">add_seq_back</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALadd_seq_back">add_seq_back</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">add_seq_back&nbsp;q&nbsp;seq</code> adds elements of <code class="code">seq</code> into the back of <code class="code">q</code>,
in order.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALadd_seq_count">add_seq_count</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">add_seq_count&nbsp;tbl&nbsp;seq</code> increments the count of each element of <code class="code">seq</code>
by calling <a href="CCHashtbl.S.html#VALincr"><code class="code"><span class="constructor">CCHashtbl</span>.<span class="constructor">S</span>.incr</code></a>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALadd_seq_count">add_seq_count</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">add_seq_count&nbsp;tbl&nbsp;seq</code> increments the count of each element of <code class="code">seq</code>
by calling <a href="CCHashtbl.Poly.html#VALincr"><code class="code"><span class="constructor">CCHashtbl</span>.<span class="constructor">Poly</span>.incr</code></a>.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALadd_seq_front">add_seq_front</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALadd_seq_front">add_seq_front</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">add_seq_front&nbsp;q&nbsp;seq</code> adds elements of <code class="code">seq</code> into the front of <code class="code">q</code>,
in reverse order.
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALadd_seq_mut">add_seq_mut</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCTimer.html#VALafter">after</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
Call the callback <code class="code">f</code> after the given number of seconds.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALall_ok">all_ok</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">all_ok&nbsp;l</code> returns <code class="code"><span class="constructor">Ok</span>&nbsp;l'</code> if all elements of <code class="code">l</code> are of the form <code class="code"><span class="constructor">Ok</span>&nbsp;x</code>,
or <code class="code"><span class="constructor">Error</span>&nbsp;e</code> otherwise (with the first error met).
</div>
</td></tr>
<tr><td><a href="CCList.html#VALall_some">all_some</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">all_some&nbsp;l</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;l'</code> if all elements of <code class="code">l</code> are of the form <code class="code"><span class="constructor">Some</span>&nbsp;x</code>,
or <code class="code"><span class="constructor">None</span></code> otherwise.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALand_then">and_then</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Wait for the first future to succeed, then launch the second
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALapp">app</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
<code class="code">app&nbsp;f&nbsp;x</code> applies the result of <code class="code">f</code> to the result of <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALapp">app</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALapp_async">app_async</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
<code class="code">app&nbsp;f&nbsp;x</code> applies the result of <code class="code">f</code> to the result of <code class="code">x</code>, in
a separated job scheduled in the pool
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALappend">append</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALappend">append</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Append two queues.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALappend">append</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALappend">append</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
Append the two arrays
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALappend">append</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">append&nbsp;b&nbsp;~into</code> copies all data from <code class="code">b</code> and adds it at the
end of <code class="code">into</code>.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALappend">append</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Append two queues.
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALappend">append</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Lazy concatenation
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALappend">append</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALappend">append</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Safe version of append
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALappend">append</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Append the given string into the given file
</div>
</td></tr>
<tr><td><a href="CCList.html#VALappend">append</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Safe version of append
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALappend">append</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
<code class="code">append&nbsp;a&nbsp;b</code> adds all elements of b to a
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALappend_array">append_array</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Same as append, with an array
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALappend_back">append_back</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">append_back&nbsp;~into&nbsp;q</code> adds all elements of <code class="code">q</code> at the back of <code class="code">into</code>.
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALappend_exn">append_exn</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Append the given string into the given file, possibly raising
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALappend_front">append_front</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">append_front&nbsp;~into&nbsp;q</code> adds all elements of <code class="code">q</code> at the front
of <code class="code">into</code>
O(length q) in time
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALappend_gen">append_gen</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Append content of generator
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALappend_list">append_list</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Append content of list
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALappend_seq">append_seq</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Append content of sequence
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALarray">array</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALarray">array</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALarray">array</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALarray">array</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALarray">array</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALarray_comm">array_comm</a> [<a href="CCHash.html">CCHash</a>]</td>
<td><div class="info">
Commutative version of <a href="CCHash.html#VALarray"><code class="code"><span class="constructor">CCHash</span>.array</code></a>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALarrayi">arrayi</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALas_graph">as_graph</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td><div class="info">
Graph view of the map
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALas_tree">as_tree</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
For debugging purpose: explore the structure of the tree,
with <code class="code"><span class="keywordsign">`</span><span class="constructor">L</span>&nbsp;(h,l)</code> being a leaf (with shared hash <code class="code">h</code>)
and <code class="code"><span class="keywordsign">`</span><span class="constructor">N</span></code> an inner node
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALas_tree">as_tree</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCUnix.html#VALasync_call">async_call</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Spawns a subprocess, like <a href="CCUnix.html#VALcall"><code class="code"><span class="constructor">CCUnix</span>.call</code></a>, but the subprocess's channels are
line generators and line sinks (for stdin).
</div>
</td></tr>
<tr><td><a href="CCTimer.html#VALat">at</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
Create a future that evaluates to <code class="code">()</code> at the given Unix timestamp
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALatom">atom</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Build an atom directly from a string
</div>
</td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="CCTrie.S.html#VALbelow">below</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
All bindings whose key is smaller or equal to the given key,
in decreasing order
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALbfs">bfs</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALbfs">bfs</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Breadth-first traversal of the tree
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALbfs_tag">bfs_tag</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixmap.S.html#VALbindings">bindings</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Iterate on all bindings
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALbindings">bindings</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Iterate on all bindings
</div>
</td></tr>
<tr><td><a href="CCMixmap.S.html#VALbindings_of">bindings_of</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
All the bindings that come from the corresponding injection
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALbindings_of">bindings_of</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
All the bindings that come from the corresponding injection
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALblit">blit</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">blit&nbsp;t&nbsp;s&nbsp;arr&nbsp;i&nbsp;len</code> copies <code class="code">len</code> elements from <code class="code">arr</code> starting at <code class="code">i</code>
to position <code class="code">s</code> from <code class="code">t</code>
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALblit">blit</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">blit&nbsp;from&nbsp;i&nbsp;into&nbsp;j&nbsp;len</code> copies <code class="code">len</code> elements from the first array
to the second.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALblit">blit</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">blit&nbsp;from&nbsp;i&nbsp;into&nbsp;j&nbsp;len</code> copies <code class="code">len</code> elements from the first array
to the second.
</div>
</td></tr>
<tr><td><a href="CCString.S.html#VALblit">blit</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td><div class="info">
Similar to <code class="code"><span class="constructor">String</span>.blit</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALblit">blit</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">blit&nbsp;from&nbsp;i&nbsp;into&nbsp;j&nbsp;len</code> copies <code class="code">len</code> elements from the first array
to the second.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALblit_from">blit_from</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">blit_from&nbsp;buf&nbsp;from_buf&nbsp;o&nbsp;len</code> copies the slice <code class="code">o,&nbsp;...&nbsp;o&nbsp;+&nbsp;len&nbsp;-&nbsp;1</code> from
a input buffer <code class="code">from_buf</code> to the end of the buffer.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALblit_into">blit_into</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">blit_into&nbsp;buf&nbsp;to_buf&nbsp;o&nbsp;len</code> copies at most <code class="code">len</code> elements from <code class="code">buf</code>
into <code class="code">to_buf</code> starting at offset <code class="code">o</code> in <code class="code">s</code>.
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALbool">bool</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALbool">bool</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALbool">bool</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALbool">bool</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALbool">bool</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALboth">both</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">both&nbsp;a&nbsp;b</code>, in case of success, returns <code class="code"><span class="constructor">Ok</span>&nbsp;(o,&nbsp;o')</code> with the ok values
of <code class="code">a</code> and <code class="code">b</code>.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALbsearch">bsearch</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">bsearch&nbsp;?cmp&nbsp;key&nbsp;arr</code> finds the index of the object <code class="code">key</code> in the array <code class="code">arr</code>,
provided <code class="code">arr</code> is <b>sorted</b> using <code class="code">cmp</code>.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALbsearch">bsearch</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">bsearch&nbsp;?cmp&nbsp;x&nbsp;arr</code> finds the index of the object <code class="code">x</code> in the array <code class="code">arr</code>,
provided <code class="code">arr</code> is <b>sorted</b> using <code class="code">cmp</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALbsearch">bsearch</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">bsearch&nbsp;?cmp&nbsp;x&nbsp;arr</code> finds the index of the object <code class="code">x</code> in the array <code class="code">arr</code>,
provided <code class="code">arr</code> is <b>sorted</b> using <code class="code">cmp</code>.
</div>
</td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="CCUnix.html#VALcall">call</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
<code class="code">call&nbsp;cmd</code> is similar to <code class="code">call_full&nbsp;cmd</code> but returns
a tuple <code class="code">stdout,&nbsp;stderr,&nbsp;errcode</code> instead of an object.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALcall_full">call_full</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
<code class="code">call_full&nbsp;cmd</code> wraps the result of <code class="code"><span class="constructor">Unix</span>.open_process_full&nbsp;cmd</code> into an
object.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALcall_stdout">call_stdout</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td></td></tr>
<tr><td><a href="CCBlockingQueue.html#VALcapacity">capacity</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
Number of values the queue can hold
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALcapacity">capacity</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Length of the inner buffer.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALcapacity">capacity</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
The number of bits this bitvector can store without resizing.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALcapacity">capacity</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Number of elements the vector can contain without being resized
</div>
</td></tr>
<tr><td><a href="CCString.html#VALcapitalize_ascii">capitalize_ascii</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
See <code class="code"><span class="constructor">String</span></code>.
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALcardinal">cardinal</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALcardinal">cardinal</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALcardinal">cardinal</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALcardinal">cardinal</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">cardinal&nbsp;s</code> returns the number of elements in <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCMixset.html#VALcardinal">cardinal</a> [<a href="CCMixset.html">CCMixset</a>]</td>
<td><div class="info">
Number of mappings
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALcardinal">cardinal</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
Number of bindings in the map.
</div>
</td></tr>
<tr><td><a href="CCMixmap.S.html#VALcardinal">cardinal</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Number of bindings
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALcardinal">cardinal</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Number of bits set to one, seen as a set of bits.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALcardinal">cardinal</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
Number of distinct elements
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALcardinal_left">cardinal_left</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Number of distinct left keys
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALcardinal_right">cardinal_right</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Number of distinct right keys
</div>
</td></tr>
<tr><td><a href="CCList.html#VALcartesian_product">cartesian_product</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
For example:
<pre class="codepre"><code class="code"> <span class="keywordsign">#</span> cartesian_product [[1;2];[3];[4;5;6]] =
[[1;3;4];[1;3;5];[1;3;6];[2;3;4];[2;3;5];[2;3;6]];;
<span class="keywordsign">#</span> cartesian_product [[1;2];[];[4;5;6]] = [];;
<span class="keywordsign">#</span> cartesian_product [[1;2];[3];[4];[5];[6]] =
[[1;3;4;5;6];[2;3;4;5;6]];;
</code></pre>
invariant: <code class="code">cartesian_product&nbsp;l&nbsp;=&nbsp;map_product&nbsp;id&nbsp;l</code>.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALcatch">catch</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">catch&nbsp;e&nbsp;~ok&nbsp;~err</code> calls either <code class="code">ok</code> or <code class="code">err</code> depending on
the value of <code class="code">e</code>.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALchar">char</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">char&nbsp;c</code> parses the char <code class="code">c</code> and nothing else
</div>
</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALchar">char</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALchar">char</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALchar">char</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALchar_if">char_if</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">char_if&nbsp;f</code> parses a character <code class="code">c</code> if <code class="code">f&nbsp;c&nbsp;=&nbsp;<span class="keyword">true</span></code>
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALchars1_if">chars1_if</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Same as <a href="CCParse.html#VALchars_if"><code class="code"><span class="constructor">CCParse</span>.chars_if</code></a>, but only non-empty strings
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALchars_if">chars_if</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">chars_if&nbsp;f</code> parses a string of chars that satisfy <code class="code">f</code>
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALchoice">choice</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">choice</code> returns the first non-<code class="code"><span class="constructor">None</span></code> element of the list, or <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALchoice_seq">choice_seq</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">choice_seq&nbsp;s</code> is similar to <a href="CCOpt.html#VALchoice"><code class="code"><span class="constructor">CCOpt</span>.choice</code></a>, but works on sequences.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALchoose">choose</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALchoose">choose</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALchoose">choose</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALchoose">choose</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">choose&nbsp;l</code> selects a member of <code class="code">l</code> that is a <code class="code"><span class="constructor">Ok</span>&nbsp;_</code> value,
or returns <code class="code"><span class="constructor">Error</span>&nbsp;l</code> otherwise, where <code class="code">l</code> is the list of errors.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALchoose">choose</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Choose a generator within the list.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALchoose_a">choose_a</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Choose among those futures (the first to terminate).
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALchoose_array">choose_array</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALchoose_exn">choose_exn</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALchoose_exn">choose_exn</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALchoose_exn">choose_exn</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALchoose_exn">choose_exn</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Same as <a href="CCRandom.html#VALchoose"><code class="code"><span class="constructor">CCRandom</span>.choose</code></a> but without option.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALchoose_l">choose_l</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Choose among those futures (the first to terminate).
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALchoose_return">choose_return</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Choose among the list
</div>
</td></tr>
<tr><td><a href="CCString.html#VALchop_prefix">chop_prefix</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">chop_pref&nbsp;~pre&nbsp;s</code> removes <code class="code">pre</code> from <code class="code">s</code> if <code class="code">pre</code> really is a prefix
of <code class="code">s</code>, returns <code class="code"><span class="constructor">None</span></code> otherwise
</div>
</td></tr>
<tr><td><a href="CCString.html#VALchop_suffix">chop_suffix</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">chop_suffix&nbsp;~suf&nbsp;s</code> removes <code class="code">suf</code> from <code class="code">s</code> if <code class="code">suf</code> really is a suffix
of <code class="code">s</code>, returns <code class="code"><span class="constructor">None</span></code> otherwise
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALclassify">classify</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALclear">clear</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">clear&nbsp;s</code> removes all elements from <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALclear">clear</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Clear the content of the buffer.
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALclear">clear</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Clear content of the hashtable
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALclear">clear</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Set every bit to 0
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALclear">clear</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Remove all elements
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALclear">clear</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Clear the content of the cache
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALclear">clear</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td><div class="info">
Remove all elements
</div>
</td></tr>
<tr><td><a href="CCList.Ref.html#VALclear">clear</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td><div class="info">
Remove all elements
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALclear">clear</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Clear the content of the vector
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALcombine">combine</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALcombine">combine</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Similar to <code class="code"><span class="constructor">List</span>.combine</code> but tail-recursive.
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALcombine2">combine2</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALcombine3">combine3</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALcombine4">combine4</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALcombine_gen">combine_gen</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Lazy version of <a href="CCList.html#VALcombine"><code class="code"><span class="constructor">CCList</span>.combine</code></a>.
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALcompare">compare</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALcompare">compare</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Lexicographic comparison
</div>
</td></tr>
<tr><td><a href="CCWBTree.ORD.html#VALcompare">compare</a> [<a href="CCWBTree.ORD.html">CCWBTree.ORD</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALcompare">compare</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
Total order between maps; the precise order is unspecified .
</div>
</td></tr>
<tr><td><a href="CCMixmap.ORD.html#VALcompare">compare</a> [<a href="CCMixmap.ORD.html">CCMixmap.ORD</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALcompare">compare</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">compare&nbsp;a&nbsp;b</code> compares lexicographically <code class="code">a</code> and <code class="code">b</code>
</div>
</td></tr>
<tr><td><a href="CCTrie.ORDERED.html#VALcompare">compare</a> [<a href="CCTrie.ORDERED.html">CCTrie.ORDERED</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.WORD.html#VALcompare">compare</a> [<a href="CCTrie.WORD.html">CCTrie.WORD</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALcompare">compare</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.OrderedType.html#VALcompare">compare</a> [<a href="CCMultiMap.OrderedType.html">CCMultiMap.OrderedType</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALcompare">compare</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Total order on multimaps
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALcompare">compare</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Lexicographic comparison.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALcompare">compare</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALcompare">compare</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALcompare">compare</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALcompare">compare</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCChar.html#VALcompare">compare</a> [<a href="CCChar.html">CCChar</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALcompare">compare</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALcompare">compare</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALcompare">compare</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
Polymorphic "magic" comparison
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALcompare">compare</a> [<a href="CCRef.html">CCRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALcompare">compare</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALcompare">compare</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCBool.html#VALcompare">compare</a> [<a href="CCBool.html">CCBool</a>]</td>
<td><div class="info">
Total ordering on booleans, similar to <code class="code"><span class="constructor">Pervasives</span>.compare</code>
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALcompare">compare</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALcompare">compare</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALcompare">compare</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALcompare">compare</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALcompare">compare</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Total ordering on vectors.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALcompare_natural">compare_natural</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Natural Sort Order, comparing chunks of digits as natural numbers.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALcompare_versions">compare_versions</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">compare_versions&nbsp;a&nbsp;b</code> compares <i>version strings</i> <code class="code">a</code> and <code class="code">b</code>,
considering that numbers are above text.
</div>
</td></tr>
<tr><td><a href="CCString.Find.html#VALcompile">compile</a> [<a href="CCString.Find.html">CCString.Find</a>]</td>
<td></td></tr>
<tr><td><a href="CCFun.html#VALcompose">compose</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Composition
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALcompose_binop">compose_binop</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">compose_binop&nbsp;f&nbsp;g</code> is <code class="code"><span class="keyword">fun</span>&nbsp;x&nbsp;y&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;g&nbsp;(f&nbsp;x)&nbsp;(f&nbsp;y)</code>
Example (partial order):
<code class="code"><span class="constructor">List</span>.sort&nbsp;(compose_binop&nbsp;fst&nbsp;<span class="constructor">CCInt</span>.compare)&nbsp;[1,&nbsp;<span class="keyword">true</span>;&nbsp;2,&nbsp;<span class="keyword">false</span>;&nbsp;1,&nbsp;<span class="keyword">false</span>]</code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALconcat_gen">concat_gen</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">concat_gen&nbsp;~sep&nbsp;g</code> concatenates all strings of <code class="code">g</code>, separated with <code class="code">sep</code>.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALcons">cons</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Add an element at the front of the list
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALcons">cons</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Push element at the front of the queue
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALcons">cons</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALcons">cons</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALcons">cons</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">cons&nbsp;x&nbsp;l</code> is <code class="code">x::l</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALcons">cons</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">cons&nbsp;x&nbsp;l</code> is <code class="code">x::l</code>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALcons_maybe">cons_maybe</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">cons_maybe&nbsp;(<span class="constructor">Some</span>&nbsp;x)&nbsp;l</code> is <code class="code">x&nbsp;::&nbsp;l</code>
<code class="code">cons_maybe&nbsp;<span class="constructor">None</span>&nbsp;l</code> is <code class="code">l</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALcons_maybe">cons_maybe</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">cons_maybe&nbsp;(<span class="constructor">Some</span>&nbsp;x)&nbsp;l</code> is <code class="code">x&nbsp;::&nbsp;l</code>
<code class="code">cons_maybe&nbsp;<span class="constructor">None</span>&nbsp;l</code> is <code class="code">l</code>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALconst">const</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">const&nbsp;pp&nbsp;x</code> is a unit printer that uses <code class="code">pp</code> on <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALconst">const</a> [<a href="CCHash.html">CCHash</a>]</td>
<td><div class="info">
<code class="code">return&nbsp;h</code> hashes any value into <code class="code">h</code>.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALconst">const</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">const&nbsp;x&nbsp;y&nbsp;=&nbsp;x</code> for any <code class="code">y</code>
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALcontains">contains</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">contains&nbsp;a&nbsp;x&nbsp;=&nbsp;(count&nbsp;m&nbsp;x&nbsp;&gt;&nbsp;0)</code>
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALcopy">copy</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
Fresh copy
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALcopy">copy</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">copy&nbsp;a</code> returns a fresh copy of <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALcopy">copy</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Make a fresh copy of the buffer.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALcopy">copy</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">copy&nbsp;t</code> makes a fresh copy of the array <code class="code">t</code>
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALcopy">copy</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Copy of the table
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALcopy">copy</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Copy of bitvector
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALcopy">copy</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Fresh copy, O(n) in time
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALcopy">copy</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Fresh copy of the table; the underlying structure is not shared
anymore, so using both tables alternatively will be efficient
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALcopy">copy</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Copy into a new array
</div>
</td></tr>
<tr><td><a href="CCString.Sub.html#VALcopy">copy</a> [<a href="CCString.Sub.html">CCString.Sub</a>]</td>
<td><div class="info">
Make a copy of the substring
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALcopy">copy</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Shallow copy (may give an immutable or mutable vector)
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALcopy_into">copy_into</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">copy_into&nbsp;~into&nbsp;s</code> copies all elements of <code class="code">s</code> into <code class="code">into</code>
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALcount">count</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALcount">count</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Number of bindings for this key
</div>
</td></tr>
<tr><td><a href="CCTimer.html#VALcreate">create</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
A new timer.
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALcreate">create</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
Create a new queue of size <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="CCThread.Barrier.html#VALcreate">create</a> [<a href="CCThread.Barrier.html">CCThread.Barrier</a>]</td>
<td><div class="info">
Create a barrier
</div>
</td></tr>
<tr><td><a href="CCSemaphore.html#VALcreate">create</a> [<a href="CCSemaphore.html">CCSemaphore</a>]</td>
<td><div class="info">
<code class="code">create&nbsp;n</code> creates a semaphore with initial value <code class="code">n</code>
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALcreate">create</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
Create a new protected value
</div>
</td></tr>
<tr><td><a href="CCHet.Tbl.html#VALcreate">create</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Key.html#VALcreate">create</a> [<a href="CCHet.Key.html">CCHet.Key</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.Transient.html#VALcreate">create</a> [<a href="CCHashTrie.Transient.html">CCHashTrie.Transient</a>]</td>
<td><div class="info">
Create a new, active ID
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALcreate">create</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">create&nbsp;n</code> makes a new set with the given capacity <code class="code">n</code>
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALcreate">create</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">create&nbsp;size</code> creates a new bounded buffer with given size.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALcreate">create</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
Make an array of the given size, filled with dummy elements
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALcreate">create</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
<code class="code">create&nbsp;n</code> creates a hash table of initial size <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALcreate">create</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Create a bitvector of given size, with given default value
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALcreate">create</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
New deque
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALcreate">create</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Create a new hashtable, with the given initial capacity
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALcreate">create</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td><div class="info">
Create a new table of the given initial capacity
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALcreate">create</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td><div class="info">
Create a new list reference
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALcreate">create</a> [<a href="CCRef.html">CCRef</a>]</td>
<td><div class="info">
Alias to <code class="code">ref</code>
</div>
</td></tr>
<tr><td><a href="CCList.Ref.html#VALcreate">create</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td><div class="info">
Create a new list reference
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALcreate">create</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Create a new, empty vector
</div>
</td></tr>
<tr><td><a href="CCMixmap.html#VALcreate_inj">create_inj</a> [<a href="CCMixmap.html">CCMixmap</a>]</td>
<td><div class="info">
Return a value that works for a given type of values.
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALcreate_inj">create_inj</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Return a value that works for a given type of values.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALcreate_with">create_with</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Create a new vector, using the given value as a filler.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALcurry">curry</a> [<a href="CCFun.html">CCFun</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALcut_depth">cut_depth</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Cut the tree at the given depth, so it becomes finite.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALcycle">cycle</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Cycle through the iterator infinitely.
</div>
</td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="CCLock.html#VALdecr">decr</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
Atomically decrement the value
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALdecr">decr</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Same as <a href="CCHashtbl.S.html#VALincr"><code class="code"><span class="constructor">CCHashtbl</span>.<span class="constructor">S</span>.incr</code></a> but substract 1 (or the value of <code class="code">by</code>).
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALdecr">decr</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Same as <a href="CCHashtbl.Poly.html#VALincr"><code class="code"><span class="constructor">CCHashtbl</span>.<span class="constructor">Poly</span>.incr</code></a> but substract 1 (or the value of <code class="code">by</code>).
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALdecr_then_get">decr_then_get</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">decr_then_get&nbsp;x</code> decrements <code class="code">x</code>, and return its new value
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALdelay">delay</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Delay evaluation.
</div>
</td></tr>
<tr><td><a href="CCThread.html#VALdetach">detach</a> [<a href="CCThread.html">CCThread</a>]</td>
<td><div class="info">
<code class="code">detach&nbsp;f</code> is the same as <code class="code">ignore&nbsp;(spawn&nbsp;f)</code>
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALdfs">dfs</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td><div class="info">
Full version of DFS.
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALdfs">dfs</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALdfs">dfs</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Depth-first traversal of the tree
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALdfs_tag">dfs_tag</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td><div class="info">
Full version of DFS using integer tags
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALdfs_tag">dfs_tag</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALdiagonal">diagonal</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
All pairs of distinct positions of the list.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALdiagonal">diagonal</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
All pairs of distinct positions of the list.
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALdiff">diff</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">diff&nbsp;a&nbsp;b</code> returns <code class="code">a&nbsp;-&nbsp;b</code>
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALdiff">diff</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">diff&nbsp;t1&nbsp;t2</code> Return those bits found <code class="code">t1</code> but not in <code class="code">t2</code>.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALdiff">diff</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
MultiSet difference.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALdiff">diff</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Difference of maps, ie bindings of the first that are not
in the second
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALdiff_into">diff_into</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">diff&nbsp;~into&nbsp;t</code> Modify <code class="code">into</code> with only the bits set but not in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALdijkstra">dijkstra</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td><div class="info">
Dijkstra algorithm, traverses a graph in increasing distance order.
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALdijkstra_tag">dijkstra_tag</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALdivisors_graph">divisors_graph</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">n</code> points to all its strict divisors
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALdoubleton">doubleton</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALdoubleton">doubleton</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCFQueue.html#VALdoubleton">doubleton</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALdrop">drop</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALdrop">drop</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALdrop">drop</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Drop the <code class="code">n</code> first elements, keep the rest
</div>
</td></tr>
<tr><td><a href="CCString.html#VALdrop">drop</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">drop&nbsp;n&nbsp;s</code> removes the <code class="code">n</code> first chars of <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALdrop">drop</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Drop the <code class="code">n</code> first elements, keep the rest
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALdrop_after">drop_after</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Drop every element on the "right" (calling <a href="CCZipper.html#VALright"><code class="code"><span class="constructor">CCZipper</span>.right</code></a> then will do nothing),
keeping the focused element, if any.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALdrop_after_and_focused">drop_after_and_focused</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Drop every element on the "right" (calling <a href="CCZipper.html#VALright"><code class="code"><span class="constructor">CCZipper</span>.right</code></a> then will do nothing),
<i>including</i> the focused element if it is present.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALdrop_before">drop_before</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Drop every element on the "left" (calling <a href="CCZipper.html#VALleft"><code class="code"><span class="constructor">CCZipper</span>.left</code></a> then will do nothing).
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALdrop_while">drop_while</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALdrop_while">drop_while</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALdrop_while">drop_while</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCList.html#VALdrop_while">drop_while</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALdummy">dummy</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Dummy cache, never stores any value
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALdup">dup</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
<code class="code">dup&nbsp;x&nbsp;=&nbsp;(x,x)</code> (duplicate the value)
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALdup_map">dup_map</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
<code class="code">dup_map&nbsp;f&nbsp;x&nbsp;=&nbsp;(x,&nbsp;f&nbsp;x)</code>.
</div>
</td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="CCString.html#VALedit_distance">edit_distance</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Edition distance between two strings.
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALelements">elements</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
List of elements
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALempty">empty</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Empty zipper
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALempty">empty</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALempty">empty</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALempty">empty</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALempty">empty</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Empty list
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALempty">empty</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALempty">empty</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCBitField.S.html#VALempty">empty</a> [<a href="CCBitField.S.html">CCBitField.S</a>]</td>
<td><div class="info">
Empty bitfields (all bits 0)
</div>
</td></tr>
<tr><td><a href="CCGraph.MAP.html#VALempty">empty</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixset.html#VALempty">empty</a> [<a href="CCMixset.html">CCMixset</a>]</td>
<td><div class="info">
Empty set
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALempty">empty</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixmap.S.html#VALempty">empty</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Empty map
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALempty">empty</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Empty bitvector
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALempty">empty</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALempty">empty</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Empty table.
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALempty">empty</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALempty">empty</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALempty">empty</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALempty">empty</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Empty multimap
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALempty">empty</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Empty list
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALempty">empty</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALempty">empty</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALempty">empty</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALempty">empty</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALempty">empty</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALempty">empty</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALempty">empty</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALempty">empty</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Empty heap
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALendline">endline</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Parses '\n'
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALensure">ensure</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Hint to the vector that it should have at least the given capacity.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALensure_with">ensure_with</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Hint to the vector that it should have at least the given capacity.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALeoi">eoi</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Expect the end of input, fails otherwise
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALepsilon">epsilon</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALequal">equal</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Key.html#VALequal">equal</a> [<a href="CCHet.Key.html">CCHet.Key</a>]</td>
<td><div class="info">
Compare two keys that have compatible types
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALequal">equal</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALequal">equal</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.KEY.html#VALequal">equal</a> [<a href="CCHashTrie.KEY.html">CCHashTrie.KEY</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.Transient.html#VALequal">equal</a> [<a href="CCHashTrie.Transient.html">CCHashTrie.Transient</a>]</td>
<td><div class="info">
Equality between IDs
</div>
</td></tr>
<tr><td><a href="CCHashSet.ELEMENT.html#VALequal">equal</a> [<a href="CCHashSet.ELEMENT.html">CCHashSet.ELEMENT</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALequal">equal</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">equal&nbsp;a&nbsp;b</code> is extensional equality (<code class="code">a</code> and <code class="code">b</code> have the same elements)
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALequal">equal</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
<code class="code">equal&nbsp;~eq&nbsp;a&nbsp;b</code> checks whether <code class="code">a</code> and <code class="code">b</code> have the same set of pairs
(key, value), comparing values with <code class="code">eq</code>
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALequal">equal</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALequal">equal</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">equal&nbsp;a&nbsp;b</code> checks whether <code class="code">a</code> and <code class="code">b</code> contain the same sequence of
elements.
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.HashedType.html#VALequal">equal</a> [<a href="CCPersistentHashtbl.HashedType.html">CCPersistentHashtbl.HashedType</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALequal">equal</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCFlatHashtbl.HASHABLE.html#VALequal">equal</a> [<a href="CCFlatHashtbl.HASHABLE.html">CCFlatHashtbl.HASHABLE</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALequal">equal</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALequal">equal</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Same multimap
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALequal">equal</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Equality step by step.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALequal">equal</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALequal">equal</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALequal">equal</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALequal">equal</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCChar.html#VALequal">equal</a> [<a href="CCChar.html">CCChar</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALequal">equal</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALequal">equal</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCRef.html#VALequal">equal</a> [<a href="CCRef.html">CCRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALequal">equal</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALequal">equal</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCBool.html#VALequal">equal</a> [<a href="CCBool.html">CCBool</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALequal">equal</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALequal">equal</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALequal">equal</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALequal">equal</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALequal">equal</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALequal_caseless">equal_caseless</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Comparison without respect to <b>ascii</b> lowercase.
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALequal_precision">equal_precision</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
Equality with allowed error up to a non negative epsilon value
</div>
</td></tr>
<tr><td><a href="CCOrd.html#VALequiv">equiv</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
Returns <code class="code"><span class="keyword">true</span></code> iff the two comparison results are the same
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALerrcode">errcode</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp_lex.html#VALerror">error</a> [<a href="CCSexp_lex.html">CCSexp_lex</a>]</td>
<td></td></tr>
<tr><td><a href="CCUnix.html#VALescape_str">escape_str</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Escape a string so it can be a shell argument.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALestablish_server">establish_server</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Listen on the address and calls the handler in a blocking fashion.
</div>
</td></tr>
<tr><td><a href="CCTimer.html#VALevery">every</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
<code class="code">every&nbsp;timer&nbsp;n&nbsp;~f</code> calls <code class="code">f&nbsp;()</code> every <code class="code">n</code> seconds.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALexcept_idx">except_idx</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Remove given index, obtaining the list of the other elements
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALexcept_idx">except_idx</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Remove given index, obtaining the list of the other elements
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALexists">exists</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALexists">exists</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALexists">exists</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALexists">exists</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALexists">exists</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCIO.File.html#VALexists">exists</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALexists">exists</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
True for some char?
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALexists">exists</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALexists">exists</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALexists">exists</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Existential test (is there an element that satisfies the predicate?)
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALexists2">exists2</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALexists2">exists2</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Exists on pairs of arrays.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALexists2">exists2</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Exists on pairs of arrays.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALexists2">exists2</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Exists a pair of chars?
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALexists2">exists2</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Exists on pairs of arrays.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALextract_max">extract_max</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
<code class="code">extract_max&nbsp;m</code> returns <code class="code">k,&nbsp;v,&nbsp;m'</code> where <code class="code">k,v</code> is the pair with the
highest key in <code class="code">m</code>, and <code class="code">m'</code> does not contain <code class="code">k</code>.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALextract_min">extract_min</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
<code class="code">extract_min&nbsp;m</code> returns <code class="code">k,&nbsp;v,&nbsp;m'</code> where <code class="code">k,v</code> is the pair with the
smallest key in <code class="code">m</code>, and <code class="code">m'</code> does not contain <code class="code">k</code>.
</div>
</td></tr>
<tr><td align="left"><br>F</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALfail">fail</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Future that fails immediately
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALfail">fail</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">fail&nbsp;msg</code> fails with the given message.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALfail">fail</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Fail with an error
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALfail_fprintf">fail_fprintf</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">fail_printf&nbsp;format</code> uses <code class="code">format</code> to obtain an error message
and then returns <code class="code"><span class="constructor">Error</span>&nbsp;msg</code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALfail_printf">fail_printf</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">fail_printf&nbsp;format</code> uses <code class="code">format</code> to obtain an error message
and then returns <code class="code"><span class="constructor">Error</span>&nbsp;msg</code>
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALfailf">failf</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code"><span class="constructor">Format</span>.sprintf</code> version of <a href="CCParse.html#VALfail"><code class="code"><span class="constructor">CCParse</span>.fail</code></a>
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfair_app">fair_app</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Fair version of <a href="CCKList.html#VAL(<*>)"><code class="code"><span class="constructor">CCKList</span>.(&lt;*&gt;)</code></a>
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfair_flat_map">fair_flat_map</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Fair version of <a href="CCKList.html#VALflat_map"><code class="code"><span class="constructor">CCKList</span>.flat_map</code></a>.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALfilter">filter</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCBV.html#VALfilter">filter</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">filter&nbsp;bv&nbsp;p</code> only keeps the true bits of <code class="code">bv</code> whose <code class="code">index</code>
satisfies <code class="code">p&nbsp;index</code>
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALfilter">filter</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCLazy_list.html#VALfilter">filter</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Filter values.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfilter">filter</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALfilter">filter</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Filter elements out of the array.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfilter">filter</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Safe version of <code class="code"><span class="constructor">List</span>.filter</code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfilter">filter</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfilter">filter</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Filter elements out of the array.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALfilter">filter</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Filter on 0 or 1 element
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfilter">filter</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Safe version of <code class="code"><span class="constructor">List</span>.filter</code>
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALfilter">filter</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Filter values, only retaining the ones that satisfy the predicate.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfilter">filter</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Filter elements from the vector.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfilter'">filter'</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Filter elements in place.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALfilter_map">filter_map</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Seq.html#VALfilter_map">filter_map</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALfilter_map">filter_map</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALfilter_map">filter_map</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALfilter_map">filter_map</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Map each element into another value, or discard it
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfilter_map">filter_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Map and remove elements at the same time
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfilter_map">filter_map</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfilter_map">filter_map</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Map each element into another value, or discard it
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfilter_map">filter_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Map and remove elements at the same time
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfilter_map">filter_map</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Map elements with a function, possibly filtering some of them out
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALfinally">finally</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">finally&nbsp;h&nbsp;f</code> calls <code class="code">f&nbsp;()</code> and returns its result.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALfinally1">finally1</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">finally1&nbsp;~h&nbsp;f&nbsp;x</code> is the same as <code class="code">f&nbsp;x</code>, but after the computation,
<code class="code">h&nbsp;()</code> is called whether <code class="code">f&nbsp;x</code> rose an exception or not.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALfinally2">finally2</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">finally2&nbsp;~h&nbsp;f&nbsp;x&nbsp;y</code> is the same as <code class="code">f&nbsp;x&nbsp;y</code>, but after the computation,
<code class="code">h&nbsp;()</code> is called whether <code class="code">f&nbsp;x&nbsp;y</code> rose an exception or not.
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALfind">find</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALfind">find</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALfind">find</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
Safe version of <a href="CCHashSet.S.html#VALfind_exn"><code class="code"><span class="constructor">CCHashSet</span>.<span class="constructor">S</span>.find_exn</code></a>
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALfind">find</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixmap.S.html#VALfind">find</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Find the value for the given key, which must be of the right type.
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALfind">find</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Find the value for the given key, which must be of the right type.
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALfind">find</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Find the value for this key, or fails
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALfind">find</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALfind">find</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Find the value associated with the key, if any
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALfind">find</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
List of values for this key
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALfind">find</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Look for an element that maps to <code class="code"><span class="constructor">Some</span>&nbsp;_</code>
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALfind">find</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">find&nbsp;f&nbsp;a</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;y</code> if there is an element <code class="code">x</code> such
that <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;y</code>, else it returns <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfind">find</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">find&nbsp;f&nbsp;a</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;y</code> if there is an element <code class="code">x</code> such
that <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;y</code>, else it returns <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCString.Find.html#VALfind">find</a> [<a href="CCString.Find.html">CCString.Find</a>]</td>
<td><div class="info">
Search for <code class="code">pattern</code> in the string, left-to-right
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfind">find</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Find <code class="code">sub</code> in string, returns its first index or <code class="code">-1</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfind">find</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<span class="deprecated">Alias to <a href="CCArray.html#VALfind_map"><code class="code"><span class="constructor">CCArray</span>.find_map</code></a>
</span></div>
</td></tr>
<tr><td><a href="CCVector.html#VALfind">find</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Find an element that satisfies the predicate
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALfind1_left">find1_left</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
like <a href="CCMultiMap.BIDIR.html#VALfind_left"><code class="code"><span class="constructor">CCMultiMap</span>.<span class="constructor">BIDIR</span>.find_left</code></a> but returns at most one value
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALfind1_right">find1_right</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
like <a href="CCMultiMap.BIDIR.html#VALfind_right"><code class="code"><span class="constructor">CCMultiMap</span>.<span class="constructor">BIDIR</span>.find_right</code></a> but returns at most one value
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfind_all">find_all</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">find_all&nbsp;~sub&nbsp;s</code> finds all occurrences of <code class="code">sub</code> in <code class="code">s</code>, even overlapping
instances.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfind_all_l">find_all_l</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">find_all&nbsp;~sub&nbsp;s</code> finds all occurrences of <code class="code">sub</code> in <code class="code">s</code> and returns
them in a list
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALfind_exn">find_exn</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHet.Tbl.html#VALfind_exn">find_exn</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALfind_exn">find_exn</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">find_exn&nbsp;s&nbsp;x</code> returns <code class="code">y</code> if <code class="code">x</code> and <code class="code">y</code> are equal, and <code class="code">mem&nbsp;s&nbsp;y</code>.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALfind_exn">find_exn</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
Same as <a href="CCIntMap.html#VALfind"><code class="code"><span class="constructor">CCIntMap</span>.find</code></a> but unsafe
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALfind_exn">find_exn</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALfind_exn">find_exn</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Same as <a href="CCTrie.S.html#VALfind"><code class="code"><span class="constructor">CCTrie</span>.<span class="constructor">S</span>.find</code></a> but can fail.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfind_exn">find_exn</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Find an element that satisfies the predicate, or
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALfind_idx">find_idx</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">find_idx&nbsp;p&nbsp;x</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;(i,x)</code> where <code class="code">x</code> is the <code class="code">i</code>-th element of <code class="code">l</code>,
and <code class="code">p&nbsp;x</code> holds.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfind_idx">find_idx</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">find_idx&nbsp;p&nbsp;x</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;(i,x)</code> where <code class="code">x</code> is the <code class="code">i</code>-th element of <code class="code">l</code>,
and <code class="code">p&nbsp;x</code> holds.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfind_idx">find_idx</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">find_idx&nbsp;p&nbsp;x</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;(i,x)</code> where <code class="code">x</code> is the <code class="code">i</code>-th element of <code class="code">l</code>,
and <code class="code">p&nbsp;x</code> holds.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfind_idx">find_idx</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">find_idx&nbsp;p&nbsp;x</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;(i,x)</code> where <code class="code">x</code> is the <code class="code">i</code>-th element of <code class="code">l</code>,
and <code class="code">p&nbsp;x</code> holds.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfind_idx">find_idx</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">find_idx&nbsp;p&nbsp;x</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;(i,x)</code> where <code class="code">x</code> is the <code class="code">i</code>-th element of <code class="code">l</code>,
and <code class="code">p&nbsp;x</code> holds.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALfind_iter">find_iter</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Iterate on bindings for this key
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALfind_left">find_left</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Find all bindings for this given left-key
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfind_map">find_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">find_map&nbsp;f&nbsp;l</code> traverses <code class="code">l</code>, applying <code class="code">f</code> to each element.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfind_map">find_map</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">find_map&nbsp;f&nbsp;a</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;y</code> if there is an element <code class="code">x</code> such
that <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;y</code>, else it returns <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfind_map">find_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">find_map&nbsp;f&nbsp;l</code> traverses <code class="code">l</code>, applying <code class="code">f</code> to each element.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfind_map">find_map</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
<code class="code">find_map&nbsp;f&nbsp;v</code> returns the first <code class="code"><span class="constructor">Some</span>&nbsp;y&nbsp;=&nbsp;f&nbsp;x</code> for <code class="code">x</code> in <code class="code">v</code>,
or <code class="code"><span class="constructor">None</span></code> if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="constructor">None</span></code> for each <code class="code">x</code> in <code class="code">v</code>
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfind_map_i">find_map_i</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Like <a href="CCArray.html#VALfind_map"><code class="code"><span class="constructor">CCArray</span>.find_map</code></a>, but also pass the index to the predicate function.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfind_mapi">find_mapi</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Like <a href="CCListLabels.html#VALfind_map"><code class="code"><span class="constructor">CCListLabels</span>.find_map</code></a>, but also pass the index to the predicate function.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfind_mapi">find_mapi</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Like <a href="CCList.html#VALfind_map"><code class="code"><span class="constructor">CCList</span>.find_map</code></a>, but also pass the index to the predicate function.
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALfind_min">find_min</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Find minimal element
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALfind_min_exn">find_min_exn</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Same as <a href="CCHeap.S.html#VALfind_min"><code class="code"><span class="constructor">CCHeap</span>.<span class="constructor">S</span>.find_min</code></a> but can fail
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfind_pred">find_pred</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">find_pred&nbsp;p&nbsp;l</code> finds the first element of <code class="code">l</code> that satisfies <code class="code">p</code>,
or returns <code class="code"><span class="constructor">None</span></code> if no element satisfies <code class="code">p</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfind_pred">find_pred</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">find_pred&nbsp;p&nbsp;l</code> finds the first element of <code class="code">l</code> that satisfies <code class="code">p</code>,
or returns <code class="code"><span class="constructor">None</span></code> if no element satisfies <code class="code">p</code>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfind_pred_exn">find_pred_exn</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCListLabels.html#VALfind_pred"><code class="code"><span class="constructor">CCListLabels</span>.find_pred</code></a>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfind_pred_exn">find_pred_exn</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCList.html#VALfind_pred"><code class="code"><span class="constructor">CCList</span>.find_pred</code></a>
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALfind_right">find_right</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Find all bindings for this given right-key
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALfindi">findi</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Like <a href="CCArrayLabels.html#VALfind"><code class="code"><span class="constructor">CCArrayLabels</span>.find</code></a>, but also pass the index to the predicate function.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfindi">findi</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Like <a href="CCArray_slice.html#VALfind"><code class="code"><span class="constructor">CCArray_slice</span>.find</code></a>, but also pass the index to the predicate function.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfindi">findi</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<span class="deprecated">Alias to <a href="CCArray.html#VALfind_map_i"><code class="code"><span class="constructor">CCArray</span>.find_map_i</code></a>
</span></div>
</td></tr>
<tr><td><a href="CCBV.html#VALfirst">first</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
First set bit, or return None.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALfirst">first</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
First element of the queue
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALfirst_exn">first_exn</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
First set bit, or
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALfirst_exn">first_exn</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Same as <a href="CCFQueue.html#VALfirst"><code class="code"><span class="constructor">CCFQueue</span>.first</code></a> but
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALfix">fix</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Fixpoint combinator
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALfix">fix</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Recursion combinators, for building recursive values.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALfix_memo">fix_memo</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Same as <a href="CCParse.html#VALfix"><code class="code"><span class="constructor">CCParse</span>.fix</code></a>, but the fixpoint is memoized.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALflat_map">flat_map</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Monadic combination of futures
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALflat_map">flat_map</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALflat_map">flat_map</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
Flat map (map + concatenation)
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALflat_map">flat_map</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Monadic flatten + map
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALflat_map">flat_map</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALflat_map">flat_map</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Transform each element into an array, then flatten
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALflat_map">flat_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Map and flatten at the same time (safe).
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALflat_map">flat_map</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALflat_map">flat_map</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Map each chars to a string, then concatenates them all
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALflat_map">flat_map</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALflat_map">flat_map</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Transform each element into an array, then flatten
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALflat_map">flat_map</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Flip version of <code class="code">&gt;&gt;=</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALflat_map">flat_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Map and flatten at the same time (safe).
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALflat_map">flat_map</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Map each element to a sub-vector
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALflat_map_list">flat_map_list</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Like <a href="CCVector.html#VALflat_map"><code class="code"><span class="constructor">CCVector</span>.flat_map</code></a>, but using <code class="code">list</code> for
intermediate collections.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALflat_map_seq">flat_map_seq</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Like <a href="CCVector.html#VALflat_map"><code class="code"><span class="constructor">CCVector</span>.flat_map</code></a>, but using <a href="CCVector.html#TYPEsequence"><code class="code"><span class="constructor">CCVector</span>.sequence</code></a> for
intermediate collections.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALflatten">flatten</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALflatten">flatten</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
Concatenates all the sub-arrays
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALflatten">flatten</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALflatten">flatten</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Safe flatten
</div>
</td></tr>
<tr><td><a href="CCList.html#VALflatten">flatten</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Safe flatten
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALflip">flip</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Flip i-th bit, extending the bitvector if needed.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALflip">flip</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Flip arguments
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALfloat">float</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALfloat">float</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALfloat">float</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VALfloat">float</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Random float within the given range
</div>
</td></tr>
<tr><td><a href="CCOrd.html#VALfloat">float</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALfloat3">float3</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VALfloat_range">float_range</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Inclusive range.
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALfloor_div">floor_div</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">floor_div&nbsp;a&nbsp;n</code> is integer division rounding towards negative infinity.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALflush">flush</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Format</span>.pp_print_flush</code>.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfmap">fmap</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCZipper.html#VALfocused">focused</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Returns the focused element, if any.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALfocused_exn">focused_exn</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Returns the focused element, or
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALfold">fold</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALfold">fold</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALfold">fold</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Fold on the list's elements
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALfold">fold</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALfold">fold</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALfold">fold</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
Fold on values
</div>
</td></tr>
<tr><td><a href="CCGraph.Seq.html#VALfold">fold</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALfold">fold</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCFQueue.html#VALfold">fold</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALfold">fold</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Fold on elements
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALfold">fold</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Fold over bindings
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALfold">fold</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Fold on key/value bindings.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALfold">fold</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALfold">fold</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Fold on pairs
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALfold">fold</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Fold on all key/value
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfold">fold</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Fold on values
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALfold">fold</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Fold on values in no specified order.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALfold">fold</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALfold">fold</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALfold">fold</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">fold&nbsp;~ok&nbsp;~error&nbsp;e</code> opens <code class="code">e</code> and, if <code class="code">e&nbsp;=&nbsp;<span class="constructor">Ok</span>&nbsp;x</code>, returns
<code class="code">ok&nbsp;x</code>, otherwise <code class="code">e&nbsp;=&nbsp;<span class="constructor">Error</span>&nbsp;s</code> and it returns <code class="code">error&nbsp;s</code>.
</div>
</td></tr>
<tr><td><a href="CCString.S.html#VALfold">fold</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td><div class="info">
Fold on chars by increasing index.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfold">fold</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALfold">fold</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Synonym to <a href="CCPair.html#VALmerge"><code class="code"><span class="constructor">CCPair</span>.merge</code></a>
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALfold">fold</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Fold on 0 or 1 element
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALfold">fold</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Fold on all values
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfold">fold</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Fold on elements of the vector
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfold2">fold2</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Fold on two collections at once.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALfold2">fold2</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Fold on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfold2">fold2</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Fold on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfold2">fold2</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Fold on pairs of chars
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfold2">fold2</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Fold on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfold_filter_map">fold_filter_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">fold_filter_map&nbsp;f&nbsp;acc&nbsp;l</code> is a <code class="code">fold_left</code>-like function, but also
generates a list of output in a way similar to <a href="CCListLabels.html#VALfilter_map"><code class="code"><span class="constructor">CCListLabels</span>.filter_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_filter_map">fold_filter_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">fold_filter_map&nbsp;f&nbsp;acc&nbsp;l</code> is a <code class="code">fold_left</code>-like function, but also
generates a list of output in a way similar to <a href="CCList.html#VALfilter_map"><code class="code"><span class="constructor">CCList</span>.filter_map</code></a>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfold_flat_map">fold_flat_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">fold_flat_map&nbsp;f&nbsp;acc&nbsp;l</code> is a <code class="code">fold_left</code>-like function, but it also maps the
list to a list of lists that is then <code class="code">flatten</code>'d..
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_flat_map">fold_flat_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">fold_flat_map&nbsp;f&nbsp;acc&nbsp;l</code> is a <code class="code">fold_left</code>-like function, but it also maps the
list to a list of lists that is then <code class="code">flatten</code>'d..
</div>
</td></tr>
<tr><td><a href="CCMixmap.S.html#VALfold_keys">fold_keys</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Fold over the keys
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALfold_keys">fold_keys</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Fold over the keys
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALfold_l">fold_l</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALfold_left">fold_left</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.Traverse.html#VALfold_m">fold_m</a> [<a href="CCKList.Traverse.html">CCKList.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Traverse.html#VALfold_m">fold_m</a> [<a href="CCListLabels.Traverse.html">CCListLabels.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.Traverse.html#VALfold_m">fold_m</a> [<a href="CCResult.Traverse.html">CCResult.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Traverse.html#VALfold_m">fold_m</a> [<a href="CCList.Traverse.html">CCList.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALfold_map">fold_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">fold_map&nbsp;f&nbsp;acc&nbsp;l</code> is a <code class="code">fold_left</code>-like function, but it also maps the
list to another list.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfold_map">fold_map</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">fold_map&nbsp;f&nbsp;acc&nbsp;a</code> is a <code class="code">fold_left</code>-like function, but it also maps the
array to another array.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_map">fold_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">fold_map&nbsp;f&nbsp;acc&nbsp;l</code> is a <code class="code">fold_left</code>-like function, but it also maps the
list to another list.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfold_map2">fold_map2</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">fold_map2</code> is to <code class="code">fold_map</code> what <code class="code"><span class="constructor">List</span>.map2</code> is to <code class="code"><span class="constructor">List</span>.map</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_map2">fold_map2</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">fold_map2</code> is to <code class="code">fold_map</code> what <code class="code"><span class="constructor">List</span>.map2</code> is to <code class="code"><span class="constructor">List</span>.map</code>.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALfold_ok">fold_ok</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">fold_ok&nbsp;f&nbsp;acc&nbsp;r</code> will compute <code class="code">f&nbsp;acc&nbsp;x</code> if <code class="code">r=<span class="constructor">Ok</span>&nbsp;x</code>,
and return <code class="code">acc</code> otherwise, as if the result were a mere option.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfold_product">fold_product</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Fold on the cartesian product
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_product">fold_product</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Fold on the cartesian product
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALfold_rev">fold_rev</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Fold on the list's elements, in reverse order (starting from the tail)
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALfold_right">fold_right</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
Fold on the elements of the array.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfold_right">fold_right</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Safe version of <code class="code">fold_right</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_right">fold_right</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Safe version of <code class="code">fold_right</code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALfold_seq">fold_seq</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Lazy_tree.html#VALfold_v">fold_v</a> [<a href="CCGraph.Lazy_tree.html">CCGraph.Lazy_tree</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALfold_values">fold_values</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
More efficient version of <a href="CCTrie.S.html#VALfold"><code class="code"><span class="constructor">CCTrie</span>.<span class="constructor">S</span>.fold</code></a>, that doesn't keep keys
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALfold_while">fold_while</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Fold left on array until a stop condition via <code class="code">(<span class="keywordsign">'</span>a,&nbsp;<span class="keywordsign">`</span><span class="constructor">Stop</span>)</code> is
indicated by the accumulator
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfold_while">fold_while</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Fold until a stop condition via <code class="code">(<span class="keywordsign">'</span>a,&nbsp;<span class="keywordsign">`</span><span class="constructor">Stop</span>)</code> is
indicated by the accumulator
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfold_while">fold_while</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Fold left on array until a stop condition via <code class="code">(<span class="keywordsign">'</span>a,&nbsp;<span class="keywordsign">`</span><span class="constructor">Stop</span>)</code> is
indicated by the accumulator
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfold_while">fold_while</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Fold left on array until a stop condition via <code class="code">(<span class="keywordsign">'</span>a,&nbsp;<span class="keywordsign">`</span><span class="constructor">Stop</span>)</code> is
indicated by the accumulator
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfold_while">fold_while</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Fold until a stop condition via <code class="code">(<span class="keywordsign">'</span>a,&nbsp;<span class="keywordsign">`</span><span class="constructor">Stop</span>)</code> is
indicated by the accumulator
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALfoldi">foldi</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALfoldi">foldi</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Fold left on array, with index
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALfoldi">foldi</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Fold on list, with index
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfoldi">foldi</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Fold left on array, with index
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfoldi">foldi</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Fold left on array, with index
</div>
</td></tr>
<tr><td><a href="CCList.html#VALfoldi">foldi</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Fold on list, with index
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALfor_all">for_all</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALfor_all">for_all</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALfor_all">for_all</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALfor_all">for_all</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALfor_all">for_all</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALfor_all">for_all</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
True for all chars?
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfor_all">for_all</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALfor_all">for_all</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfor_all">for_all</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Universal test (do all the elements satisfy the predicate?)
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALfor_all2">for_all2</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALfor_all2">for_all2</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Forall on pairs of arrays.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfor_all2">for_all2</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Forall on pairs of arrays.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALfor_all2">for_all2</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
All pairs of chars respect the predicate?
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALfor_all2">for_all2</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Forall on pairs of arrays.
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALforce">force</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
<code class="code">force&nbsp;t</code> evaluates <code class="code">t</code> completely and returns a regular tree
structure
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALfprintf">fprintf</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Format</span>.fprintf</code>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALfprintf_dyn_color">fprintf_dyn_color</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Similar to <a href="CCFormat.html#VALfprintf"><code class="code"><span class="constructor">CCFormat</span>.fprintf</code></a> but enable/disable colors depending on <code class="code">colors</code>
</div>
</td></tr>
<tr><td><a href="CCHashTrie.Transient.html#VALfreeze">freeze</a> [<a href="CCHashTrie.Transient.html">CCHashTrie.Transient</a>]</td>
<td><div class="info">
<code class="code">freeze&nbsp;i</code> makes <code class="code">i</code> unusable for new modifications.
</div>
</td></tr>
<tr><td><a href="CCBitField.S.html#VALfreeze">freeze</a> [<a href="CCBitField.S.html">CCBitField.S</a>]</td>
<td><div class="info">
Prevent new fields from being added.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfreeze">freeze</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Make an immutable vector (no copy! Don't use the old version)
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALfreeze_copy">freeze_copy</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Copy the vector into an immutable version
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALfront">front</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Remove and return the first element of the list
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALfront_exn">front_exn</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCRAL.html#VALfront"><code class="code"><span class="constructor">CCRAL</span>.front</code></a>.
</div>
</td></tr>
<tr><td><a href="CCHashTrie.Transient.html#VALfrozen">frozen</a> [<a href="CCHashTrie.Transient.html">CCHashTrie.Transient</a>]</td>
<td><div class="info">
<code class="code">frozen&nbsp;i</code> returns <code class="code"><span class="keyword">true</span></code> if <code class="code">freeze&nbsp;i</code> was called before.
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALfsign">fsign</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
<code class="code">fsign&nbsp;x</code> is one of <code class="code">-1.,&nbsp;-0.,&nbsp;+0.,&nbsp;+1.</code>, or <code class="code">nan</code> if <code class="code">x</code> is NaN.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALfull">full</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Slice that covers the full array
</div>
</td></tr>
<tr><td><a href="CCString.Sub.html#VALfull">full</a> [<a href="CCString.Sub.html">CCString.Sub</a>]</td>
<td><div class="info">
Full string
</div>
</td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="CCString.Split.html#VALgen">gen</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALgen">gen</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.Split.html#VALgen_cpy">gen_cpy</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALgeneric">generic</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td><div class="info">
Traversal of the given graph, starting from a sequence
of vertices, using the given bag to choose the next vertex to
explore.
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.html#VALgeneric_tag">generic_tag</a> [<a href="CCGraph.Traverse.html">CCGraph.Traverse</a>]</td>
<td><div class="info">
One-shot traversal of the graph using a tag set and the given bag
</div>
</td></tr>
<tr><td><a href="CCSemaphore.html#VALget">get</a> [<a href="CCSemaphore.html">CCSemaphore</a>]</td>
<td><div class="info">
Current value
</div>
</td></tr>
<tr><td><a href="CCLock.LockRef.html#VALget">get</a> [<a href="CCLock.LockRef.html">CCLock.LockRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCLock.html#VALget">get</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
Atomically get the value in the lock.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALget">get</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Blocking get: wait for the future to be evaluated, and get the value,
or the exception that failed the future is returned.
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALget">get</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td><div class="info">
Access the element
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALget">get</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">get&nbsp;l&nbsp;i</code> accesses the <code class="code">i</code>-th element of the list.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALget">get</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALget">get</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCBitField.S.html#VALget">get</a> [<a href="CCBitField.S.html">CCBitField.S</a>]</td>
<td><div class="info">
Get the value of this field
</div>
</td></tr>
<tr><td><a href="CCMixset.html#VALget">get</a> [<a href="CCMixset.html">CCMixset</a>]</td>
<td><div class="info">
<code class="code">get&nbsp;~key&nbsp;set</code> obtains the value for <code class="code">key</code> in <code class="code">set</code>, if any.
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALget">get</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">get&nbsp;a&nbsp;i</code> returns the element with index <code class="code">i</code> from the array <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALget">get</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">get&nbsp;t&nbsp;i</code> gets the element at position <code class="code">i</code>
</div>
</td></tr>
<tr><td><a href="CCMixmap.S.html#VALget">get</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Get the value corresponding to this key, if it exists and
belongs to the same key
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALget">get</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Get the value corresponding to this key, if it exists and
belongs to the same key
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALget">get</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Is the i-th bit true? Returns false if the index is too high
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALget">get</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Safe version of !
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALget">get</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">get&nbsp;k&nbsp;tbl</code> recovers the value for <code class="code">k</code> in <code class="code">tbl</code>, or
returns <code class="code"><span class="constructor">None</span></code> if <code class="code">k</code> doesn't belong
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.MONO_ARRAY.html#VALget">get</a> [<a href="CCArrayLabels.MONO_ARRAY.html">CCArrayLabels.MONO_ARRAY</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALget">get</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Assoc.html#VALget">get</a> [<a href="CCListLabels.Assoc.html">CCListLabels.Assoc</a>]</td>
<td><div class="info">
Find the element
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALget">get</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALget">get</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
Safe version of <code class="code">find</code>
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALget">get</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Safe version of <code class="code"><span class="constructor">Hashtbl</span>.find</code>
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALget">get</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Safe version of <code class="code"><span class="constructor">Hashtbl</span>.find</code>
</div>
</td></tr>
<tr><td><a href="CCString.Sub.html#VALget">get</a> [<a href="CCString.Sub.html">CCString.Sub</a>]</td>
<td><div class="info">
<code class="code">get&nbsp;s&nbsp;i</code> gets the <code class="code">i</code>-th element, or fails
</div>
</td></tr>
<tr><td><a href="CCArray.MONO_ARRAY.html#VALget">get</a> [<a href="CCArray.MONO_ARRAY.html">CCArray.MONO_ARRAY</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALget">get</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Assoc.html#VALget">get</a> [<a href="CCList.Assoc.html">CCList.Assoc</a>]</td>
<td><div class="info">
Find the element
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALget">get</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Access element by its index, or
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALget_at_idx">get_at_idx</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALget_at_idx">get_at_idx</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALget_at_idx_exn">get_at_idx_exn</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Get the i-th element, or
</div>
</td></tr>
<tr><td><a href="CCList.html#VALget_at_idx_exn">get_at_idx_exn</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Get the i-th element, or
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALget_back">get_back</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">get_back&nbsp;buf&nbsp;i</code> returns the <code class="code">i</code>-th element of <code class="code">buf</code> from the back, ie
the one returned by <code class="code">take_back&nbsp;buf</code> after <code class="code">i-1</code> calls to <code class="code">junk_back&nbsp;buf</code>.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALget_cnum">get_cnum</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Reflects the current column number
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALget_edge">get_edge</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALget_edge_kind">get_edge_kind</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALget_enter">get_enter</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALget_exit">get_exit</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALget_exn">get_exn</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCRAL.html#VALget"><code class="code"><span class="constructor">CCRAL</span>.get</code></a>
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALget_exn">get_exn</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALget_exn">get_exn</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCMixset.html#VALget_exn">get_exn</a> [<a href="CCMixset.html">CCMixset</a>]</td>
<td><div class="info">
Same as <a href="CCMixset.html#VALget"><code class="code"><span class="constructor">CCMixset</span>.get</code></a>, but can fail
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALget_exn">get_exn</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Synonym to <a href="CCPersistentHashtbl.S.html#VALfind"><code class="code"><span class="constructor">CCPersistentHashtbl</span>.<span class="constructor">S</span>.find</code></a> with flipped arguments
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALget_exn">get_exn</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Assoc.html#VALget_exn">get_exn</a> [<a href="CCListLabels.Assoc.html">CCListLabels.Assoc</a>]</td>
<td><div class="info">
Same as <code class="code">get</code>, but unsafe
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALget_exn">get_exn</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Extract the value <code class="code">x</code> from <code class="code"><span class="constructor">Ok</span>&nbsp;x</code>, fails otherwise.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALget_exn">get_exn</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Open the option, possibly failing if it is <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCList.Assoc.html#VALget_exn">get_exn</a> [<a href="CCList.Assoc.html">CCList.Assoc</a>]</td>
<td><div class="info">
Same as <code class="code">get</code>, but unsafe
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALget_front">get_front</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">get_front&nbsp;buf&nbsp;i</code> returns the <code class="code">i</code>-th element of <code class="code">buf</code> from the front, ie
the one returned by <code class="code">take_front&nbsp;buf</code> after <code class="code">i-1</code> calls to <code class="code">junk_front&nbsp;buf</code>.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALget_lazy">get_lazy</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">get_lazy&nbsp;default_fn&nbsp;x</code> unwraps <code class="code">x</code>, but if <code class="code">x&nbsp;=&nbsp;<span class="constructor">None</span></code> it returns <code class="code">default_fn&nbsp;()</code> instead.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALget_lnum">get_lnum</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Reflects the current line number
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALget_or">get_or</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">get_or&nbsp;e&nbsp;~default</code> returns <code class="code">x</code> if <code class="code">e&nbsp;=&nbsp;<span class="constructor">Ok</span>&nbsp;x</code>, <code class="code">default</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCMap.S.html#VALget_or">get_or</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
<code class="code">get_or&nbsp;k&nbsp;m&nbsp;~default</code> returns the value associated to <code class="code">k</code> if present,
and returns <code class="code">default</code> otherwise (if <code class="code">k</code> doesn't belong in <code class="code">m</code>)
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALget_or">get_or</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">get_or&nbsp;tbl&nbsp;k&nbsp;~default</code> returns the value associated to <code class="code">k</code> if present,
and returns <code class="code">default</code> otherwise (if <code class="code">k</code> doesn't belong in <code class="code">tbl</code>)
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALget_or">get_or</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">get_or&nbsp;tbl&nbsp;k&nbsp;~default</code> returns the value associated to <code class="code">k</code> if present,
and returns <code class="code">default</code> otherwise (if <code class="code">k</code> doesn't belong in <code class="code">tbl</code>)
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALget_or">get_or</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">get_or&nbsp;~default&nbsp;o</code> extracts the value from <code class="code">o</code>, or
returns <code class="code">default</code> if <code class="code">o&nbsp;=&nbsp;<span class="constructor">None</span></code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALget_or_add">get_or_add</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">get_or_add&nbsp;tbl&nbsp;~k&nbsp;~f</code> finds and returns the binding of <code class="code">k</code>
in <code class="code">tbl</code>, if it exists.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALget_or_add">get_or_add</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">get_or_add&nbsp;tbl&nbsp;~k&nbsp;~f</code> finds and returns the binding of <code class="code">k</code>
in <code class="code">tbl</code>, if it exists.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALget_pos">get_pos</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Reflects the current (line, column) numbers
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALget_safe">get_safe</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">get_safe&nbsp;a&nbsp;i</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;a.(i)</code> if <code class="code">i</code> is a valid index
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALget_safe">get_safe</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">get_safe&nbsp;a&nbsp;i</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;a.(i)</code> if <code class="code">i</code> is a valid index
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALget_safe">get_safe</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">get_safe&nbsp;a&nbsp;i</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;a.(i)</code> if <code class="code">i</code> is a valid index
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALget_then_clear">get_then_clear</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">get_then_clear&nbsp;b</code> sets <code class="code">b</code> to <code class="code"><span class="keyword">false</span></code>, and return the old value
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALget_then_decr">get_then_decr</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">get_then_decr&nbsp;x</code> decrements <code class="code">x</code>, and return its previous value
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALget_then_incr">get_then_incr</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">get_then_incr&nbsp;x</code> increments <code class="code">x</code>, and return its previous value
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALget_then_incr">get_then_incr</a> [<a href="CCRef.html">CCRef</a>]</td>
<td><div class="info">
<code class="code">get_then_incr&nbsp;r</code> increments <code class="code">r</code> and returns its old value, think <code class="code">r++</code>
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALget_then_set">get_then_set</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">get_then_set&nbsp;b</code> sets <code class="code">b</code> to <code class="code"><span class="keyword">true</span></code>, and return the old value
</div>
</td></tr>
<tr><td><a href="CCGraph.Traverse.Event.html#VALget_vertex">get_vertex</a> [<a href="CCGraph.Traverse.Event.html">CCGraph.Traverse.Event</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALgroup">group</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">group&nbsp;eq&nbsp;l</code> groups together consecutive elements that satisfy <code class="code">eq</code>.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALgroup_succ">group_succ</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">group_succ&nbsp;~eq&nbsp;l</code> groups together consecutive elements that are equal
according to <code class="code">eq</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALgroup_succ">group_succ</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">group_succ&nbsp;~eq&nbsp;l</code> groups together consecutive elements that are equal
according to <code class="code">eq</code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALguard">guard</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">guard&nbsp;f</code> runs <code class="code">f&nbsp;()</code> and returns its result wrapped in <code class="code"><span class="constructor">Ok</span></code>.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALguard_str">guard_str</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Same as <a href="CCResult.html#VALguard"><code class="code"><span class="constructor">CCResult</span>.guard</code></a> but uses <a href="CCResult.html#VALof_exn"><code class="code"><span class="constructor">CCResult</span>.of_exn</code></a> to print the exception.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALguard_str_trace">guard_str_trace</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Same as <a href="CCResult.html#VALguard_str"><code class="code"><span class="constructor">CCResult</span>.guard_str</code></a> but uses <a href="CCResult.html#VALof_exn_trace"><code class="code"><span class="constructor">CCResult</span>.of_exn_trace</code></a> instead of <a href="CCResult.html#VALof_exn"><code class="code"><span class="constructor">CCResult</span>.of_exn</code></a> so
that the stack trace is printed.
</div>
</td></tr>
<tr><td align="left"><br>H</td></tr>
<tr><td><a href="CCSexp.html#VALhash">hash</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.KEY.html#VALhash">hash</a> [<a href="CCHashTrie.KEY.html">CCHashTrie.KEY</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.ELEMENT.html#VALhash">hash</a> [<a href="CCHashSet.ELEMENT.html">CCHashSet.ELEMENT</a>]</td>
<td><div class="info">
Positive value
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.HashedType.html#VALhash">hash</a> [<a href="CCPersistentHashtbl.HashedType.html">CCPersistentHashtbl.HashedType</a>]</td>
<td></td></tr>
<tr><td><a href="CCFlatHashtbl.HASHABLE.html#VALhash">hash</a> [<a href="CCFlatHashtbl.HASHABLE.html">CCFlatHashtbl.HASHABLE</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALhash">hash</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALhash">hash</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALhash">hash</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALhash">hash</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALhbox">hbox</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Wrap the printer in an horizontal box
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALhd">hd</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
First element of the list, or
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALhd_tl">hd_tl</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">hd_tl&nbsp;(x&nbsp;::&nbsp;l)</code> returns <code class="code">hd,&nbsp;l</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALhd_tl">hd_tl</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">hd_tl&nbsp;(x&nbsp;::&nbsp;l)</code> returns <code class="code">hd,&nbsp;l</code>.
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALhead">head</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Evaluate head, return it, or <code class="code"><span class="constructor">None</span></code> if the list is empty
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALhead">head</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Head of the list
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALhead_exn">head_exn</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCKList.html#VALhead"><code class="code"><span class="constructor">CCKList</span>.head</code></a>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALhead_opt">head_opt</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
First element.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALhead_opt">head_opt</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
First element.
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALheight">height</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Length of the longest path to empty leaves
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALhovbox">hovbox</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Wrap the printer in a horizontal or vertical box
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALhvbox">hvbox</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Wrap the printer in a horizontal/vertical box
</div>
</td></tr>
<tr><td align="left"><br>I</td></tr>
<tr><td><a href="CCFun.html#VALid">id</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Identity function
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALif_">if_</a> [<a href="CCHash.html">CCHash</a>]</td>
<td><div class="info">
Decide which hash function to use depending on the boolean
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALif_">if_</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">if_&nbsp;f&nbsp;x</code> is <code class="code"><span class="constructor">Some</span>&nbsp;x</code> if <code class="code">f&nbsp;x</code>, <code class="code"><span class="constructor">None</span></code> otherwise
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALincr">incr</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
Atomically increment the value
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALincr">incr</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">incr&nbsp;?by&nbsp;tbl&nbsp;x</code> increments or initializes the counter associated with <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALincr">incr</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">incr&nbsp;?by&nbsp;tbl&nbsp;x</code> increments or initializes the counter associated with <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALincr_then_get">incr_then_get</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">incr_then_get&nbsp;x</code> increments <code class="code">x</code>, and return its new value
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALincr_then_get">incr_then_get</a> [<a href="CCRef.html">CCRef</a>]</td>
<td><div class="info">
<code class="code">incr_then_get&nbsp;r</code> increments <code class="code">r</code> and returns its new value, think <code class="code">++&nbsp;r</code>
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALinit">init</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td><div class="info">
<code class="code">init&nbsp;n&nbsp;f</code> makes the array <code class="code">[|&nbsp;f&nbsp;0;&nbsp;f&nbsp;1;&nbsp;...&nbsp;;&nbsp;f&nbsp;(n-1)&nbsp;|]</code>.
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALinit">init</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">make&nbsp;n&nbsp;f</code> returns a persistent array of length n, with element
<code class="code">i</code> initialized to the result of <code class="code">f&nbsp;i</code>.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALinit">init</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Queue deprived of its last element.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALinit">init</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Similar to <code class="code"><span class="constructor">Array</span>.init</code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALinit">init</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Analog to <code class="code"><span class="constructor">Array</span>.init</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALinit">init</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Similar to <code class="code"><span class="constructor">Array</span>.init</code>
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALinit">init</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Init the vector with the given function and size
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALinsert">insert</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Insert an element at the current position.
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALinsert">insert</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">insert&nbsp;s&nbsp;x</code> adds <code class="code">x</code> into <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALinsert">insert</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Insert a value in the heap
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALinsert_at_idx">insert_at_idx</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Insert at i-th position, between the two existing elements.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALinsert_at_idx">insert_at_idx</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Insert at i-th position, between the two existing elements.
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALint">int</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.U.html#VALint">int</a> [<a href="CCParse.U.html">CCParse.U</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALint">int</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALint">int</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VALint">int</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALint">int</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALint">int</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALint32">int32</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALint32">int32</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALint32">int32</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALint64">int64</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALint64">int64</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALint64">int64</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VALint_range">int_range</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Inclusive range
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALinter">inter</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">inter&nbsp;a&nbsp;b</code> returns <code class="code">a ∩ b</code>
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALinter">inter</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCBV.html#VALinter">inter</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">inter&nbsp;bv1&nbsp;bv2</code> returns the intersection of the two sets
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALinter">inter</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Intersection of multimaps
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALinter">inter</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
List intersection.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALinter">inter</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
List intersection.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALinter_into">inter_into</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">inter&nbsp;~into&nbsp;bv</code> sets <code class="code">into</code> to the intersection of itself and <code class="code">bv</code>
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALinter_mut">inter_mut</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">inter_mut&nbsp;~into&nbsp;a</code> changes <code class="code">into</code> into <code class="code">a ∩ into</code>
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALinterleave">interleave</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Fair interleaving of both streams.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALintersection">intersection</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">intersection&nbsp;a&nbsp;b</code> is a multiset such that
<code class="code">count&nbsp;(intersection&nbsp;a&nbsp;b)&nbsp;x&nbsp;=&nbsp;min&nbsp;(count&nbsp;a&nbsp;x)&nbsp;(count&nbsp;b&nbsp;x)</code>
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALis_alpha">is_alpha</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Is the char a letter?
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALis_alpha_num">is_alpha_num</a> [<a href="CCParse.html">CCParse</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALis_dag">is_dag</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">is_dag&nbsp;~graph&nbsp;vs</code> returns <code class="code"><span class="keyword">true</span></code> if the subset of <code class="code">graph</code> reachable
from <code class="code">vs</code> is acyclic.
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALis_directory">is_directory</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALis_done">is_done</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Is the future evaluated (success/failure)?
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALis_empty">is_empty</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Empty zipper? Returns true iff the two lists are empty.
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALis_empty">is_empty</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALis_empty">is_empty</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Check whether the list is empty
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALis_empty">is_empty</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALis_empty">is_empty</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALis_empty">is_empty</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Is the buffer empty (i.e.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALis_empty">is_empty</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Are there any true bits?
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALis_empty">is_empty</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALis_empty">is_empty</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Is the deque empty?
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALis_empty">is_empty</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Is the table empty?
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALis_empty">is_empty</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALis_empty">is_empty</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALis_empty">is_empty</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALis_empty">is_empty</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Empty multimap?
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALis_empty">is_empty</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Evaluates the head
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALis_empty">is_empty</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALis_empty">is_empty</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALis_empty">is_empty</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">is_empty&nbsp;l</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">l&nbsp;=&nbsp;[]</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALis_empty">is_empty</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">is_empty&nbsp;l</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">l&nbsp;=&nbsp;[]</code>
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALis_empty">is_empty</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Is the heap empty?
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALis_empty">is_empty</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Is the vector empty?
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALis_error">is_error</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Return true if Error
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALis_focused">is_focused</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Is the zipper focused on some element? That is, will <a href="CCZipper.html#VALfocused"><code class="code"><span class="constructor">CCZipper</span>.focused</code></a>
return a <code class="code"><span class="constructor">Some</span>&nbsp;v</code>?
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALis_full">is_full</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
true if pushing an element would erase another element.
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALis_nan">is_nan</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALis_none">is_none</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALis_num">is_num</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Is the char a digit?
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALis_ok">is_ok</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Return true if Ok
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALis_some">is_some</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALis_sorted">is_sorted</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">is_sorted&nbsp;l</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">l</code> is sorted (according to given order)
</div>
</td></tr>
<tr><td><a href="CCList.html#VALis_sorted">is_sorted</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">is_sorted&nbsp;l</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">l</code> is sorted (according to given order)
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALis_space">is_space</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
True on ' ' and '\t'
</div>
</td></tr>
<tr><td><a href="CCString.html#VALis_sub">is_sub</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">is_sub&nbsp;~sub&nbsp;i&nbsp;s&nbsp;j&nbsp;~len</code> returns <code class="code"><span class="keyword">true</span></code> iff the substring of
<code class="code">sub</code> starting at position <code class="code">i</code> and of length <code class="code">len</code> is a substring
of <code class="code">s</code> starting at position <code class="code">j</code>
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALis_white">is_white</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
True on ' ' and '\t' and '\n'
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALiter">iter</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALiter">iter</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALiter">iter</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALiter">iter</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALiter">iter</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Iterate on the list's elements
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALiter">iter</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALiter">iter</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALiter">iter</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
Iterate on values
</div>
</td></tr>
<tr><td><a href="CCGraph.Seq.html#VALiter">iter</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALiter">iter</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALiter">iter</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALiter">iter</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">iter&nbsp;b&nbsp;~f</code> calls <code class="code">f&nbsp;i&nbsp;t</code> for each element <code class="code">t</code> in <code class="code">buf</code>
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALiter">iter</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">iter&nbsp;f&nbsp;t</code> iterates over the array <code class="code">t</code> invoking <code class="code">f</code> with
the current element, in array order
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALiter">iter</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Iterate on all bits
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALiter">iter</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALiter">iter</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Iterate on elements
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALiter">iter</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Iterate over bindings
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALiter">iter</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Iterate on cached values.
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALiter">iter</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Same as <a href="CCTrie.S.html#VALfold"><code class="code"><span class="constructor">CCTrie</span>.<span class="constructor">S</span>.fold</code></a>, but for effectful functions
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALiter">iter</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALiter">iter</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Iterate on all key/value
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALiter">iter</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALiter">iter</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALiter">iter</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALiter">iter</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALiter">iter</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Apply the function only in case of Ok
</div>
</td></tr>
<tr><td><a href="CCString.html#VALiter">iter</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">String</span>.iter</code>
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALiter">iter</a> [<a href="CCRef.html">CCRef</a>]</td>
<td><div class="info">
Call the function on the content of the reference
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALiter">iter</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALiter">iter</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALiter">iter</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Iterate on 0 or 1 element
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALiter">iter</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Iterate on elements
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALiter">iter</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Iterate on the vector's content
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALiter2">iter2</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Iterate on two collections at once.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALiter2">iter2</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Iterate on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALiter2">iter2</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Iterate on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALiter2">iter2</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Iterate on pairs of chars
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALiter2">iter2</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Iterate on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCMixmap.S.html#VALiter_keys">iter_keys</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Iterate on the keys of this map
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALiter_keys">iter_keys</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Iterate on the keys of this table
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALiter_true">iter_true</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Iterate on bits set to 1
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALiter_values">iter_values</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALiteri">iteri</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALiteri">iteri</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALiteri">iteri</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">iter&nbsp;f&nbsp;t</code> applies function <code class="code">f</code> to all elements of the persistent array,
in order from element <code class="code">0</code> to element <code class="code">length&nbsp;t&nbsp;-&nbsp;1</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALiteri">iteri</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">iteri&nbsp;b&nbsp;~f</code> calls <code class="code">f&nbsp;i&nbsp;t</code> for each element <code class="code">t</code> in <code class="code">buf</code>, with <code class="code">i</code>
being its relative index within <code class="code">buf</code>.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALiteri">iteri</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Iterate with index (starts at 0)
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALiteri">iteri</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALiteri">iteri</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALiteri">iteri</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALiteri">iteri</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Iter on chars with their index
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALiteri">iteri</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALiteri">iteri</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALiteri">iteri</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Iterate on the vector, with indexes
</div>
</td></tr>
<tr><td><a href="CCString.html#VALiteri2">iteri2</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Iterate on pairs of chars with their index
</div>
</td></tr>
<tr><td align="left"><br>J</td></tr>
<tr><td><a href="CCThread.Arr.html#VALjoin">join</a> [<a href="CCThread.Arr.html">CCThread.Arr</a>]</td>
<td><div class="info">
<code class="code"><span class="constructor">A</span>.join&nbsp;a</code> joins every thread in <code class="code">a</code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALjoin">join</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">join&nbsp;t</code>, in case of success, returns <code class="code"><span class="constructor">Ok</span>&nbsp;o</code> from <code class="code"><span class="constructor">Ok</span>&nbsp;(<span class="constructor">Ok</span>&nbsp;o)</code>.
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALjunk">junk</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Remove first element.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALjunk_back">junk_back</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Drop the back element from <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALjunk_front">junk_front</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Drop the front element from <code class="code">t</code>.
</div>
</td></tr>
<tr><td align="left"><br>K</td></tr>
<tr><td><a href="CCList.html#VALkeep_ok">keep_ok</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">filter_some&nbsp;l</code> retains only elements of the form <code class="code"><span class="constructor">Some</span>&nbsp;x</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALkeep_some">keep_some</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">filter_some&nbsp;l</code> retains only elements of the form <code class="code"><span class="constructor">Some</span>&nbsp;x</code>.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALkeys">keys</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALkeys">keys</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALkeys">keys</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALkeys">keys</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
Iterate on keys only
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALkeys">keys</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Iterate on keys (similar order as <code class="code"><span class="constructor">Hashtbl</span>.iter</code>)
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALkeys">keys</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Iterate on keys (similar order as <code class="code"><span class="constructor">Hashtbl</span>.iter</code>)
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALkeys_list">keys_list</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">keys&nbsp;t</code> is the list of keys in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALkeys_list">keys_list</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">keys_list&nbsp;t</code> is the list of keys in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCMixmap.S.html#VALkeys_seq">keys_seq</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
All the keys
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALkeys_seq">keys_seq</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
All the keys
</div>
</td></tr>
<tr><td><a href="CCString.Split.html#VALklist">klist</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALklist">klist</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.Split.html#VALklist_cpy">klist_cpy</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALksprintf">ksprintf</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">ksprintf&nbsp;fmt&nbsp;~f</code> formats using <code class="code">fmt</code>, in a way similar to <a href="CCFormat.html#VALsprintf"><code class="code"><span class="constructor">CCFormat</span>.sprintf</code></a>,
and then calls <code class="code">f</code> on the resulting string.
</div>
</td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="CCFQueue.html#VALlast">last</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Last element of the queue
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALlast">last</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">last&nbsp;n&nbsp;l</code> takes the last <code class="code">n</code> elements of <code class="code">l</code> (or less if
<code class="code">l</code> doesn't have that many elements
</div>
</td></tr>
<tr><td><a href="CCList.html#VALlast">last</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">last&nbsp;n&nbsp;l</code> takes the last <code class="code">n</code> elements of <code class="code">l</code> (or less if
<code class="code">l</code> doesn't have that many elements
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALlast_exn">last_exn</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALlast_opt">last_opt</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Last element.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALlast_opt">last_opt</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Last element.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALleft">left</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Go to the left, or do nothing if the zipper is already at leftmost pos
</div>
</td></tr>
<tr><td><a href="CCString.Split.html#VALleft">left</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td><div class="info">
Split on the first occurrence of <code class="code">by</code> from the leftmost part of
the string
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALleft_exn">left_exn</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Go to the left, or
</div>
</td></tr>
<tr><td><a href="CCString.Split.html#VALleft_exn">left_exn</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td><div class="info">
Split on the first occurrence of <code class="code">by</code> from the leftmost part of the string
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALlength">length</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALlength">length</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALlength">length</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALlength">length</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Number of elements in the queue (linear in time)
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALlength">length</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Number of elements.
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALlength">length</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
Returns the length of the persistent array.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALlength">length</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Number of elements currently stored in the buffer.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALlength">length</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">length&nbsp;t</code> gets the total number of elements currently in <code class="code">t</code>
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALlength">length</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Number of bindings
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALlength">length</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Size of underlying bitvector.
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALlength">length</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Number of elements
used to be linear time, now constant time
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALlength">length</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Number of bindings
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALlength">length</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
<code class="code">length&nbsp;l</code> returns the number of elements in <code class="code">l</code>, eagerly (linear time).
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALlength">length</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Number of elements in the list.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.MONO_ARRAY.html#VALlength">length</a> [<a href="CCArrayLabels.MONO_ARRAY.html">CCArrayLabels.MONO_ARRAY</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALlength">length</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALlength">length</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.S.html#VALlength">length</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.MONO_ARRAY.html#VALlength">length</a> [<a href="CCArray.MONO_ARRAY.html">CCArray.MONO_ARRAY</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALlength">length</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALlength">length</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Synonym for <a href="CCVector.html#VALsize"><code class="code"><span class="constructor">CCVector</span>.size</code></a>
</div>
</td></tr>
<tr><td><a href="CCHeap.PARTIAL_ORD.html#VALleq">leq</a> [<a href="CCHeap.PARTIAL_ORD.html">CCHeap.PARTIAL_ORD</a>]</td>
<td><div class="info">
<code class="code">leq&nbsp;x&nbsp;y</code> shall return <code class="code"><span class="keyword">true</span></code> iff <code class="code">x</code> is lower or equal to <code class="code">y</code>
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALlexicographic">lexicographic</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
Lexicographic combination of comparison functions
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALlift">lift</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td><div class="info">
Apply a list function to the content
</div>
</td></tr>
<tr><td><a href="CCList.Ref.html#VALlift">lift</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td><div class="info">
Apply a list function to the content
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALlinear">linear</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Linear cache with the given size.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALlines">lines</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">lines&nbsp;s</code> returns a list of the lines of <code class="code">s</code> (splits along '\n')
</div>
</td></tr>
<tr><td><a href="CCString.html#VALlines_gen">lines_gen</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">lines_gen&nbsp;s</code> returns a generator of the lines of <code class="code">s</code> (splits along '\n')
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALlist">list</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.U.html#VALlist">list</a> [<a href="CCParse.U.html">CCParse.U</a>]</td>
<td><div class="info">
<code class="code">list&nbsp;p</code> parses a list of <code class="code">p</code>, with the OCaml conventions for
start token "<code class="code"><span class="string">",&nbsp;stop&nbsp;token&nbsp;"</span></code>" and separator ";".
</div>
</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALlist">list</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALlist">list</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALlist">list</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
Lexicographic combination on lists
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALlist">list</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.Split.html#VALlist_">list_</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td><div class="info">
Eplit the given string along the given separator <code class="code">by</code>.
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALlist_comm">list_comm</a> [<a href="CCHash.html">CCHash</a>]</td>
<td><div class="info">
Commutative version of <a href="CCHash.html#VALlist"><code class="code"><span class="constructor">CCHash</span>.list</code></a>.
</div>
</td></tr>
<tr><td><a href="CCString.Split.html#VALlist_cpy">list_cpy</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCRandom.html#VALlist_seq">list_seq</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Build random lists from lists of random generators
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALlnot">lnot</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALlongest_prefix">longest_prefix</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
<code class="code">longest_prefix&nbsp;k&nbsp;m</code> finds the longest prefix of <code class="code">k</code> that leads to
at least one path in <code class="code">m</code> (it does not mean that the prefix is bound to
a value.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALlookup">lookup</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Lookup the index of some value in a sorted array.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALlookup">lookup</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Lookup the index of some value in a sorted array.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALlookup">lookup</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Lookup the index of some value in a sorted array.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALlookup_exn">lookup_exn</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Same as <a href="CCArrayLabels.html#VALlookup_exn"><code class="code"><span class="constructor">CCArrayLabels</span>.lookup_exn</code></a>, but
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALlookup_exn">lookup_exn</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Same as <a href="CCArray_slice.html#VALlookup"><code class="code"><span class="constructor">CCArray_slice</span>.lookup</code></a>, but
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALlookup_exn">lookup_exn</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Same as <a href="CCArray.html#VALlookup"><code class="code"><span class="constructor">CCArray</span>.lookup</code></a>, but
</div>
</td></tr>
<tr><td><a href="CCChar.html#VALlowercase_ascii">lowercase_ascii</a> [<a href="CCChar.html">CCChar</a>]</td>
<td><div class="info">
See <code class="code"><span class="constructor">Char</span></code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALlowercase_ascii">lowercase_ascii</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
See <code class="code"><span class="constructor">String</span></code>.
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALlru">lru</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
LRU cache of the given size ("Least Recently Used": keys that have not been
used recently are deleted first).
</div>
</td></tr>
<tr><td><a href="CCString.html#VALltrim">ltrim</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
trim space on the left (see <code class="code"><span class="constructor">String</span>.trim</code> for more details)
</div>
</td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmake">make</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Create a future, representing a value that will be computed by
the function.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALmake">make</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Create a zipper pointing at the first element of the list
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALmake">make</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td><div class="info">
<code class="code">make&nbsp;n&nbsp;x</code> makes an array of <code class="code">n</code> times <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALmake">make</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALmake">make</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
Make a graph by providing the children function
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALmake">make</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">make&nbsp;n&nbsp;x</code> returns a persistent array of length n, with <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCKTree.Dot.html#VALmake">make</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALmake">make</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Create a slice from given offset and length..
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALmake">make</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Build a file representation from a path (absolute or relative)
</div>
</td></tr>
<tr><td><a href="CCString.Sub.html#VALmake">make</a> [<a href="CCString.Sub.html">CCString.Sub</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALmake">make</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Make a tuple from its components
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALmake">make</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
<code class="code">make&nbsp;n&nbsp;x</code> makes a vector of size <code class="code">n</code>, filled with <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmake1">make1</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmake2">make2</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALmany">many</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">many&nbsp;p</code> parses a list of <code class="code">p</code>, eagerly (as long as possible)
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALmany1">many1</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
parses a non empty list
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmap">map</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Maps the value inside the future.
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALmap">map</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALmap">map</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Map values
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALmap">map</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Map on elements
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALmap">map</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
Map values, giving only the value.
</div>
</td></tr>
<tr><td><a href="CCGraph.Seq.html#VALmap">map</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALmap">map</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALmap">map</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALmap">map</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Map values
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALmap">map</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Map all values
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALmap">map</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Map values, giving only the value.
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALmap">map</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Lazy map
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALmap">map</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALmap">map</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td></td></tr>
<tr><td><a href="CCEqual.html#VALmap">map</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td><div class="info">
<code class="code">map&nbsp;f&nbsp;eq</code> is the equality function that, given objects <code class="code">x</code> and <code class="code">y</code>,
projects <code class="code">x</code> and <code class="code">y</code> using <code class="code">f</code> (e.g.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALmap">map</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALmap">map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Safe version of map
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALmap">map</a> [<a href="CCParse.html">CCParse</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALmap">map</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Map on success
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALmap">map</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALmap">map</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Map chars
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALmap">map</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALmap">map</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
<code class="code">map&nbsp;f&nbsp;ord</code> is the comparison function that, given objects <code class="code">x</code> and <code class="code">y</code>,
projects <code class="code">x</code> and <code class="code">y</code> using <code class="code">f</code> (e.g.
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALmap">map</a> [<a href="CCRef.html">CCRef</a>]</td>
<td><div class="info">
Transform the value
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALmap">map</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALmap">map</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALmap">map</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Transform the element inside, if any
</div>
</td></tr>
<tr><td><a href="CCList.html#VALmap">map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Safe version of map
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALmap">map</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Map elements of the vector, yielding a new vector
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALmap1">map1</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALmap2">map2</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Map on two collections at once.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALmap2">map2</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Map on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALmap2">map2</a> [<a href="CCParse.html">CCParse</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALmap2">map2</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Same as <a href="CCResult.html#VALmap"><code class="code"><span class="constructor">CCResult</span>.map</code></a>, but also with a function that can transform
the error message in case of failure
</div>
</td></tr>
<tr><td><a href="CCString.html#VALmap2">map2</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Map pairs of chars
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALmap2">map2</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Map on two arrays stepwise.
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALmap2">map2</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALmap2">map2</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALmap3">map3</a> [<a href="CCParse.html">CCParse</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmap_a">map_a</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
<code class="code">map_l&nbsp;f&nbsp;a</code> maps <code class="code">f</code> on every element of <code class="code">a</code>, and will return
the array of every result if all calls succeed, or an error otherwise.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmap_async">map_async</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Maps the value inside the future, to be computed in a separated job.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALmap_err">map_err</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Map on the error variant
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALmap_fst">map_fst</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Compose the given function with <code class="code">fst</code>.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALmap_l">map_l</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
<code class="code">map_l&nbsp;f&nbsp;l</code> maps <code class="code">f</code> on every element of <code class="code">l</code>, and will return
the list of every result if all calls succeed, or an error otherwise.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALmap_l">map_l</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALmap_lazy">map_lazy</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">map_lazy&nbsp;default_fn&nbsp;f&nbsp;o</code> if <code class="code">f&nbsp;o</code> if <code class="code">o&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;x</code>, <code class="code">default_fn&nbsp;()</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALmap_list">map_list</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Map on a hashtable's items, collect into a list
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALmap_list">map_list</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Map on a hashtable's items, collect into a list
</div>
</td></tr>
<tr><td><a href="CCKList.Traverse.html#VALmap_m">map_m</a> [<a href="CCKList.Traverse.html">CCKList.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Traverse.html#VALmap_m">map_m</a> [<a href="CCListLabels.Traverse.html">CCListLabels.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.Traverse.html#VALmap_m">map_m</a> [<a href="CCResult.Traverse.html">CCResult.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Traverse.html#VALmap_m">map_m</a> [<a href="CCList.Traverse.html">CCList.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Traverse.html#VALmap_m_par">map_m_par</a> [<a href="CCListLabels.Traverse.html">CCListLabels.Traverse</a>]</td>
<td><div class="info">
Same as <code class="code">map_m</code> but <code class="code">map_m_par&nbsp;f&nbsp;(x::l)</code> evaluates <code class="code">f&nbsp;x</code> and
<code class="code">f&nbsp;l</code> "in parallel" before combining their result (for instance
in Lwt).
</div>
</td></tr>
<tr><td><a href="CCList.Traverse.html#VALmap_m_par">map_m_par</a> [<a href="CCList.Traverse.html">CCList.Traverse</a>]</td>
<td><div class="info">
Same as <code class="code">map_m</code> but <code class="code">map_m_par&nbsp;f&nbsp;(x::l)</code> evaluates <code class="code">f&nbsp;x</code> and
<code class="code">f&nbsp;l</code> "in parallel" before combining their result (for instance
in Lwt).
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALmap_or">map_or</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">map_or&nbsp;f&nbsp;e&nbsp;~default</code> returns <code class="code">f&nbsp;x</code> if <code class="code">e&nbsp;=&nbsp;<span class="constructor">Ok</span>&nbsp;x</code>, <code class="code">default</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALmap_or">map_or</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">map_or&nbsp;~default&nbsp;f&nbsp;o</code> is <code class="code">f&nbsp;x</code> if <code class="code">o&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;x</code>, <code class="code">default</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCList.html#VALmap_product_l">map_product_l</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">map_product_l&nbsp;f&nbsp;l</code> maps each element of <code class="code">l</code> to a list of
objects of type <code class="code"><span class="keywordsign">'</span>b</code> using <code class="code">f</code>.
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALmap_same">map_same</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALmap_snd">map_snd</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Compose the given function with <code class="code">snd</code>.
</div>
</td></tr>
<tr><td><a href="CCGraph.Lazy_tree.html#VALmap_v">map_v</a> [<a href="CCGraph.Lazy_tree.html">CCGraph.Lazy_tree</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALmapi">mapi</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALmapi">mapi</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Map with index
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALmapi">mapi</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
Map values, giving both key and value.
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALmapi">mapi</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
Applies the given function to all elements of the array, and returns
a persistent array initialized by the results of f.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALmapi">mapi</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALmapi">mapi</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Map values, giving both key and value.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALmapi">mapi</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Map with index (starts at 0)
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALmapi">mapi</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALmapi">mapi</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Map chars with their index
</div>
</td></tr>
<tr><td><a href="CCList.html#VALmapi">mapi</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALmax">max</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
Maximal element w.r.t the total ordering on elements
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALmax">max</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALmax">max</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALmax_finite_value">max_finite_value</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALmax_int">max_int</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.PARAM.html#VALmax_size">max_size</a> [<a href="CCPool.PARAM.html">CCPool.PARAM</a>]</td>
<td><div class="info">
Maximum number of threads in the pool
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALmax_value">max_value</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCBitField.html#VALmax_width">max_width</a> [<a href="CCBitField.html">CCBitField</a>]</td>
<td><div class="info">
System-dependent maximum width for a bitfield, typically 30 or 62
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALmeet">meet</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">meet&nbsp;a&nbsp;b</code> is a multiset such that
<code class="code">count&nbsp;(meet&nbsp;a&nbsp;b)&nbsp;x&nbsp;=&nbsp;max&nbsp;(count&nbsp;a&nbsp;x)&nbsp;(count&nbsp;b&nbsp;x)</code>
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALmem">mem</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALmem">mem</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALmem">mem</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALmem">mem</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALmem">mem</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">mem&nbsp;s&nbsp;x</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">x</code> is in <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALmem">mem</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixmap.S.html#VALmem">mem</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Is the given key in the map, with the right type?
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALmem">mem</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Is the given key in the table, with the right type?
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALmem">mem</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Is the key bound?
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALmem">mem</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">mem&nbsp;tbl&nbsp;k</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">k</code> is mapped to some value
in <code class="code">tbl</code>
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALmem">mem</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALmem">mem</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Is there a binding for this key?
</div>
</td></tr>
<tr><td><a href="CCListLabels.Assoc.html#VALmem">mem</a> [<a href="CCListLabels.Assoc.html">CCListLabels.Assoc</a>]</td>
<td><div class="info">
<code class="code">mem&nbsp;x&nbsp;l</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">x</code> is a key in <code class="code">l</code>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALmem">mem</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Membership to the list.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALmem">mem</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">mem&nbsp;~sub&nbsp;s</code> is true iff <code class="code">sub</code> is a substring of <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCList.Assoc.html#VALmem">mem</a> [<a href="CCList.Assoc.html">CCList.Assoc</a>]</td>
<td><div class="info">
<code class="code">mem&nbsp;x&nbsp;l</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">x</code> is a key in <code class="code">l</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALmem">mem</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Membership to the list.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALmem_left">mem_left</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Is the left key present in at least one pair?
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALmem_right">mem_right</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Is the right key present in at least one pair?
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALmember">member</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Is the element a member of the vector?
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALmemo">memo</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Memoize the parser.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALmemoize">memoize</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Avoid recomputations by caching intermediate results
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALmerge">merge</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
Similar to <code class="code"><span class="constructor">Map</span>.<span class="constructor">S</span>.merge</code>
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALmerge">merge</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Merge two tables together into a new table.
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALmerge">merge</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Merge two tries together.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALmerge">merge</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Merge two sorted iterators into a sorted iterator
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALmerge">merge</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Uncurrying (merges the two components of a tuple)
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALmerge">merge</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Merge two heaps
</div>
</td></tr>
<tr><td><a href="CCMap.S.html#VALmerge_safe">merge_safe</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
<code class="code">merge_safe&nbsp;~f&nbsp;a&nbsp;b</code> merges the maps <code class="code">a</code> and <code class="code">b</code> together.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALmin">min</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
Minimal element w.r.t the total ordering on elements
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALmin">min</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALmin">min</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALmin_int">min_int</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.PARAM.html#VALmin_size">min_size</a> [<a href="CCPool.PARAM.html">CCPool.PARAM</a>]</td>
<td><div class="info">
Minimum number of threads in the pool
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALmin_value">min_value</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCBitField.S.html#VALmk_field">mk_field</a> [<a href="CCBitField.S.html">CCBitField.S</a>]</td>
<td><div class="info">
Make a new field
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALmk_heap">mk_heap</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">mk_heap&nbsp;~leq</code> makes a priority queue where <code class="code">leq&nbsp;x&nbsp;y&nbsp;=&nbsp;<span class="keyword">true</span></code> means that
<code class="code">x</code> is smaller than <code class="code">y</code> and should be prioritary
</div>
</td></tr>
<tr><td><a href="CCKTree.Dot.html#VALmk_id">mk_id</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td><div class="info">
Using a formatter string, build an ID
</div>
</td></tr>
<tr><td><a href="CCKTree.Dot.html#VALmk_label">mk_label</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td><div class="info">
Using a formatter string, build a label
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALmk_map">mk_map</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
Use a <code class="code"><span class="constructor">Map</span>.<span class="constructor">S</span></code> underneath
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALmk_mut_tbl">mk_mut_tbl</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
Make a new mutable graph from a Hashtbl.
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALmk_queue">mk_queue</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALmk_stack">mk_stack</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALmk_table">mk_table</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
Default implementation for <a href="CCGraph.html#TYPEtable"><code class="code"><span class="constructor">CCGraph</span>.table</code></a>: a <code class="code"><span class="constructor">Hashtbl</span>.t</code>
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALmodify">modify</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Modify the current element, if any, by returning a new element, or
returning <code class="code"><span class="constructor">None</span></code> if the element is to be deleted
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALmutex">mutex</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
Underlying mutex
</div>
</td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="CCFloat.html#VALnan">nan</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALnativeint">nativeint</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALnativeint">nativeint</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALnativeint">nativeint</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALneg">neg</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALneg">neg</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">neg&nbsp;i&nbsp;=&nbsp;-&nbsp;i</code>
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALnegate">negate</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">negate&nbsp;t</code> returns a copy of <code class="code">t</code> with all of the bits flipped.
</div>
</td></tr>
<tr><td><a href="CCBool.html#VALnegate">negate</a> [<a href="CCBool.html">CCBool</a>]</td>
<td><div class="info">
Negation on booleans (functional version of <code class="code">not</code>)
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALnegate_self">negate_self</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">negate_self&nbsp;t</code> flips all of the bits in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCMixset.html#VALnewkey">newkey</a> [<a href="CCMixset.html">CCMixset</a>]</td>
<td><div class="info">
<code class="code">newkey&nbsp;()</code> creates a new unique key that can be used to access
a <code class="code"><span class="keywordsign">'</span>a</code> value in a set.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALnewline">newline</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Force newline (see <code class="code"><span class="constructor">Format</span>.pp_force_newline</code>)
</div>
</td></tr>
<tr><td><a href="CCSexp.Decoder.html#VALnext">next</a> [<a href="CCSexp.Decoder.html">CCSexp.Decoder</a>]</td>
<td><div class="info">
Parse the next S-expression or return an error if the input isn't
long enough or isn't a proper S-expression
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALnil">nil</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALnode">node</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Build a node from a label and a list of children
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALnode1">node1</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Node with one child
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALnode2">node2</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Node with two children
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALnop">nop</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Succeed with <code class="code">()</code>
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALnth">nth</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
<code class="code">nth&nbsp;i&nbsp;m</code> returns the <code class="code">i</code>-th <code class="code">key,&nbsp;value</code> in the ascending
order.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALnth">nth</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Return the <code class="code">i</code>-th element of the queue in logarithmic time
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALnth_exn">nth_exn</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALnth_exn">nth_exn</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCFQueue.html#VALnth"><code class="code"><span class="constructor">CCFQueue</span>.nth</code></a>
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="CCRAL.html#VALof_array">of_array</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALof_array">of_array</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">from_array&nbsp;a</code> returns an immutable copy of <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALof_array">of_array</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Create a buffer from an initial array, but doesn't take ownership
of it (stills allocates a new internal array)
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALof_array">of_array</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Iterate on the array
</div>
</td></tr>
<tr><td><a href="CCString.html#VALof_array">of_array</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALof_array">of_array</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALof_array_unsafe">of_array_unsafe</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td><div class="info">
Take ownership of the given array.
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALof_bool">of_bool</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALof_chan">of_chan</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Format</span>.formatter_of_out_channel</code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALof_char">of_char</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">of_char&nbsp;<span class="string">'a'</span>&nbsp;=&nbsp;<span class="string">"a"</span></code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALof_err">of_err</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALof_exn">of_exn</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">of_exn&nbsp;e</code> uses <code class="code"><span class="constructor">Printexc</span></code> to print the exception as a string
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALof_exn_trace">of_exn_trace</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">of_exn_trace&nbsp;e</code> is similar to <code class="code">of_exn&nbsp;e</code>, but it adds the stacktrace
to the error message.
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALof_field">of_field</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Used to represent one record field
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALof_float">of_float</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALof_float">of_float</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALof_float_exn">of_float_exn</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Int64</span>.of_float</code>
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALof_fun">of_fun</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">of_fun&nbsp;f</code> makes a graph out of a function that maps a vertex to
the list of its children.
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALof_gen">of_gen</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALof_gen">of_gen</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALof_gen">of_gen</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALof_gen">of_gen</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALof_gen">of_gen</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALof_gen">of_gen</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALof_gen">of_gen</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALof_gen">of_gen</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
<code class="code">of_gen&nbsp;g</code> makes a deque containing the elements of <code class="code">g</code>
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALof_gen">of_gen</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALof_gen">of_gen</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">of_gen&nbsp;g</code> consumes the generator and caches intermediate results
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALof_gen">of_gen</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALof_gen">of_gen</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALof_gen">of_gen</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALof_gen">of_gen</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALof_gen">of_gen</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALof_hashtbl">of_hashtbl</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">of_hashtbl&nbsp;tbl</code> makes a graph from a hashtable that maps vertices
to lists of children
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALof_int">of_int</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCChar.html#VALof_int">of_int</a> [<a href="CCChar.html">CCChar</a>]</td>
<td><div class="info">
Safe version of <a href="CCChar.html#VALof_int"><code class="code"><span class="constructor">CCChar</span>.of_int</code></a>
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALof_int">of_int</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALof_int">of_int</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
Alias to <code class="code">float_of_int</code>
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALof_int32">of_int32</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALof_int32_exn">of_int32_exn</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Int64</span>.of_int32</code>
</div>
</td></tr>
<tr><td><a href="CCChar.html#VALof_int_exn">of_int_exn</a> [<a href="CCChar.html">CCChar</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Char</span>.chr</code>
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALof_int_exn">of_int_exn</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Int64</span>.of_int</code>
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALof_klist">of_klist</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALof_klist">of_klist</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALof_klist">of_klist</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALof_klist">of_klist</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALof_klist">of_klist</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALof_klist">of_klist</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALof_klist">of_klist</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALof_klist">of_klist</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.Decoder.html#VALof_lexbuf">of_lexbuf</a> [<a href="CCSexp.Decoder.html">CCSexp.Decoder</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALof_list">of_list</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Map.html#VALof_list">of_list</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALof_list">of_list</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALof_list">of_list</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALof_list">of_list</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALof_list">of_list</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Convert a list to a RAL.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALof_list">of_list</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALof_list">of_list</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALof_list">of_list</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALof_list">of_list</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.html#VALof_list">of_list</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">of_list&nbsp;l</code> makes a graph from a list of pairs of vertices.
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALof_list">of_list</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">of_list&nbsp;l</code> returns a fresh persistent array containing the elements of <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALof_list">of_list</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCBV.html#VALof_list">of_list</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
From a list of true bits.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALof_list">of_list</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALof_list">of_list</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Conversion from list, in order
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALof_list">of_list</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALof_list">of_list</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.WORD.html#VALof_list">of_list</a> [<a href="CCTrie.WORD.html">CCTrie.WORD</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALof_list">of_list</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALof_list">of_list</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCLazy_list.html#VALof_list">of_list</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALof_list">of_list</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALof_list">of_list</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
Build a map from the given list of bindings <code class="code">k_i&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v_i</code>,
added in order using <code class="code">add</code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALof_list">of_list</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Build a table from the given list of bindings <code class="code">k_i&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v_i</code>,
added in order using <code class="code">add</code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALof_list">of_list</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Build a table from the given list of bindings <code class="code">k_i&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v_i</code>,
added in order using <code class="code">add</code>.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALof_list">of_list</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCSet.S.html#VALof_list">of_list</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td><div class="info">
Build a set from the given list of elements,
added in order using <code class="code">add</code>.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALof_list">of_list</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Head of list, or <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALof_list">of_list</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
<code class="code">of_list&nbsp;l&nbsp;=&nbsp;add_list&nbsp;empty&nbsp;l</code>
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALof_list">of_list</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALof_list_map">of_list_map</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Combination of <a href="CCRAL.html#VALof_list"><code class="code"><span class="constructor">CCRAL</span>.of_list</code></a> and <a href="CCRAL.html#VALmap"><code class="code"><span class="constructor">CCRAL</span>.map</code></a>
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALof_list_mult">of_list_mult</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALof_nativeint">of_nativeint</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALof_nativeint_exn">of_nativeint_exn</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Int64</span>.of_nativeint</code>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALof_opt">of_opt</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALof_pair">of_pair</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALof_quad">of_quad</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALof_record">of_record</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Represent a record by its named fields
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALof_result">of_result</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALof_rev_list">of_rev_list</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Reverse the list
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALof_rev_list">of_rev_list</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">of_rev_list&nbsp;l</code> is the same as <code class="code">of_list&nbsp;(<span class="constructor">List</span>.rev&nbsp;l)</code> but more efficient
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALof_seq">of_seq</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALof_seq">of_seq</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALof_seq">of_seq</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALof_seq">of_seq</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALof_seq">of_seq</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALof_seq">of_seq</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALof_seq">of_seq</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALof_seq">of_seq</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALof_seq">of_seq</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALof_seq">of_seq</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALof_seq">of_seq</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCBV.html#VALof_seq">of_seq</a> [<a href="CCBV.html">CCBV</a>]</td>
<td></td></tr>
<tr><td><a href="CCFQueue.html#VALof_seq">of_seq</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALof_seq">of_seq</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Create a deque from the sequence.
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALof_seq">of_seq</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Add (replace) bindings from the sequence to the table
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALof_seq">of_seq</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALof_seq">of_seq</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALof_seq">of_seq</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALof_seq">of_seq</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALof_seq">of_seq</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALof_seq">of_seq</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
Same as <a href="CCMap.S.html#VALof_list"><code class="code"><span class="constructor">CCMap</span>.<span class="constructor">S</span>.of_list</code></a>
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALof_seq">of_seq</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
From the given bindings, added in order
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALof_seq">of_seq</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
From the given bindings, added in order
</div>
</td></tr>
<tr><td><a href="CCString.html#VALof_seq">of_seq</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCSet.S.html#VALof_seq">of_seq</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALof_seq">of_seq</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALof_seq">of_seq</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALof_seq">of_seq</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashtbl.S.html#VALof_seq_count">of_seq_count</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Similar to <a href="CCHashtbl.S.html#VALadd_seq_count"><code class="code"><span class="constructor">CCHashtbl</span>.<span class="constructor">S</span>.add_seq_count</code></a>, but allocates a new table and returns it
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALof_seq_count">of_seq_count</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Similar to <a href="CCHashtbl.Poly.html#VALadd_seq_count"><code class="code"><span class="constructor">CCHashtbl</span>.<span class="constructor">Poly</span>.add_seq_count</code></a>, but allocates a new table and returns it
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALof_seq_mult">of_seq_mult</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALof_slice">of_slice</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Make a sub-array from a triple <code class="code">(arr,&nbsp;i,&nbsp;len)</code> where <code class="code">arr</code> is the array,
<code class="code">i</code> the offset in <code class="code">arr</code>, and <code class="code">len</code> the number of elements of the slice.
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALof_string">of_string</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALof_string">of_string</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
<span class="deprecated">Alias to <code class="code">float_of_string</code>.
</span></div>
</td></tr>
<tr><td><a href="CCInt.html#VALof_string">of_string</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALof_string_exn">of_string_exn</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALof_string_exn">of_string_exn</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
Alias to <code class="code">float_of_string</code>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALof_to_string">of_to_string</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">of_to_string&nbsp;f</code> converts its input to a string using <code class="code">f</code>,
then prints the string
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALof_triple">of_triple</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALof_unit">of_unit</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALof_variant">of_variant</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
<code class="code">of_variant&nbsp;name&nbsp;args</code> is used to encode algebraic variants
into a S-expr.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALon_failure">on_failure</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Attach a handler to be called upon failure.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALon_finish">on_finish</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Attach a handler to be called when the future is evaluated.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALon_success">on_success</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Attach a handler to be called upon success.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALopaque_identity">opaque_identity</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">opaque_identity&nbsp;x</code> is like <code class="code">x</code>, but prevents Flambda from using <code class="code">x</code>'s
definition for optimizing it (flambda is an optimization/inlining pass
in OCaml &gt;= 4.03).
</div>
</td></tr>
<tr><td><a href="CCOrd.html#VALopp">opp</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
Opposite order
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALopt">opt</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">opt&nbsp;pp</code> prints options as follows:
<code class="code"><span class="constructor">Some</span>&nbsp;x</code> will become "some foo" if <code class="code">pp&nbsp;x&nbsp;---&gt;&nbsp;<span class="string">"foo"</span></code>
<code class="code"><span class="constructor">None</span></code> will become "none"
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALopt">opt</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCEqual.html#VALoption">option</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALoption">option</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALoption">option</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td><div class="info">
Comparison of optional values.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALor_">or_</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">or_&nbsp;~else_&nbsp;a</code> is <code class="code">a</code> if <code class="code">a</code> is <code class="code"><span class="constructor">Some</span>&nbsp;_</code>, <code class="code">else_</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALor_lazy">or_lazy</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">or_lazy&nbsp;else_&nbsp;a</code> is <code class="code">a</code> if <code class="code">a</code> is <code class="code"><span class="constructor">Some</span>&nbsp;_</code>, <code class="code">else_&nbsp;()</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALoutput">output</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="CCString.html#VALpad">pad</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">pad&nbsp;n&nbsp;str</code> ensures that <code class="code">str</code> is at least <code class="code">n</code> bytes long,
and pads it on the <code class="code">side</code> with <code class="code">c</code> if it's not the case.
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALpair">pair</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.U.html#VALpair">pair</a> [<a href="CCParse.U.html">CCParse.U</a>]</td>
<td><div class="info">
Parse a pair using OCaml whitespace conventions.
</div>
</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALpair">pair</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALpair">pair</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALpair">pair</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALpair">pair</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALpairs">pairs</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Iterate on pairs
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALparse">parse</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">parse&nbsp;p&nbsp;st</code> applies <code class="code">p</code> on the input, and returns <code class="code"><span class="constructor">Ok</span>&nbsp;x</code> if
<code class="code">p</code> succeeds with <code class="code">x</code>, or <code class="code"><span class="constructor">Error</span>&nbsp;s</code> otherwise
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALparse_chan">parse_chan</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Parse a S-expression from the given channel.
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALparse_chan_gen">parse_chan_gen</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Parse a channel into a generator of S-expressions
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALparse_chan_list">parse_chan_list</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALparse_exn">parse_exn</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCParse.html#VALparse"><code class="code"><span class="constructor">CCParse</span>.parse</code></a>
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALparse_file">parse_file</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Open the file and read a S-exp from it
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALparse_file">parse_file</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">parse_file&nbsp;p&nbsp;file</code> parses <code class="code">file</code> with <code class="code">p</code> by opening the file
and reading it whole.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALparse_file_exn">parse_file_exn</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALparse_file_list">parse_file_list</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Open the file and read a S-exp from it
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALparse_string">parse_string</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Parse a string
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALparse_string">parse_string</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Specialization of <a href="CCParse.html#VALparse"><code class="code"><span class="constructor">CCParse</span>.parse</code></a> for string inputs
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALparse_string_exn">parse_string_exn</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALparsing">parsing</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">parsing&nbsp;s&nbsp;p</code> behaves the same as <code class="code">p</code>, with the information that
we are parsing <code class="code">s</code>, if <code class="code">p</code> fails
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALpartition_map">partition_map</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">partition_map&nbsp;f&nbsp;l</code> maps <code class="code">f</code> on <code class="code">l</code> and gather results in lists: if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="keywordsign">`</span><span class="constructor">Left</span>&nbsp;y</code>, adds <code class="code">y</code> to the first list, if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="keywordsign">`</span><span class="constructor">Right</span>&nbsp;z</code>, adds <code class="code">z</code> to the second list, if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="keywordsign">`</span><span class="constructor">Drop</span></code>, ignores <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALpartition_map">partition_map</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">partition_map&nbsp;f&nbsp;l</code> maps <code class="code">f</code> on <code class="code">l</code> and gather results in lists: if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="keywordsign">`</span><span class="constructor">Left</span>&nbsp;y</code>, adds <code class="code">y</code> to the first list, if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="keywordsign">`</span><span class="constructor">Right</span>&nbsp;z</code>, adds <code class="code">z</code> to the second list, if <code class="code">f&nbsp;x&nbsp;=&nbsp;<span class="keywordsign">`</span><span class="constructor">Drop</span></code>, ignores <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALpeek">peek</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
<code class="code">peek&nbsp;q</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;x</code> if <code class="code">x</code> is the first element of <code class="code">q</code>,
otherwise it returns <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALpeek">peek</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
First element of the queue
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALpeek_back">peek_back</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Get the last value from back of <code class="code">t</code>, without modification.
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALpeek_back">peek_back</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Last value, or
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALpeek_back_exn">peek_back_exn</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Get the last value from back of <code class="code">t</code>, without modification.
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALpeek_exn">peek_exn</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Same as <a href="CCSimple_queue.html#VALpeek"><code class="code"><span class="constructor">CCSimple_queue</span>.peek</code></a> but
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALpeek_front">peek_front</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
First value from front of <code class="code">t</code>, without modification.
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALpeek_front">peek_front</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
First value, or
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALpeek_front_exn">peek_front_exn</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
First value from front of <code class="code">t</code>, without modification.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALpick_array">pick_array</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Pick an element at random from the array
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALpick_list">pick_list</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Pick an element at random from the list
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALpoly">poly</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td><div class="info">
Standard polymorphic equality
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALpoly">poly</a> [<a href="CCHash.html">CCHash</a>]</td>
<td><div class="info">
the regular polymorphic hash function
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALpop">pop</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Get and remove the first element
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALpop">pop</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Ref.html#VALpop">pop</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALpop">pop</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Remove last element, or <code class="code"><span class="constructor">None</span></code>
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALpop_exn">pop_exn</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Same as <a href="CCSimple_queue.html#VALpop"><code class="code"><span class="constructor">CCSimple_queue</span>.pop</code></a>, but fails on empty queues.
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALpop_exn">pop_exn</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCListLabels.Ref.html#VALpop"><code class="code"><span class="constructor">CCListLabels</span>.<span class="constructor">Ref</span>.pop</code></a>.
</div>
</td></tr>
<tr><td><a href="CCList.Ref.html#VALpop_exn">pop_exn</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCList.Ref.html#VALpop"><code class="code"><span class="constructor">CCList</span>.<span class="constructor">Ref</span>.pop</code></a>.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALpop_exn">pop_exn</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Remove last element, or raise a Failure if empty
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALpow">pow</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">pow&nbsp;a&nbsp;b&nbsp;=&nbsp;a^b</code> for positive integers <code class="code">a</code> and <code class="code">b</code>.
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALpp">pp</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Pretty-printer nice on human eyes (including indentation)
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALpp">pp</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALpp">pp</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">pp&nbsp;pp_elt</code> returns a set printer, given a printer for
individual elements
</div>
</td></tr>
<tr><td><a href="CCGraph.Dot.html#VALpp">pp</a> [<a href="CCGraph.Dot.html">CCGraph.Dot</a>]</td>
<td><div class="info">
Print the graph, starting from given vertex, on the formatter
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALpp">pp</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALpp">pp</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Print the list with the given separator (default ",").
</div>
</td></tr>
<tr><td><a href="CCKTree.Dot.html#VALpp">pp</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td><div class="info">
Printer to DOT with indentation, etc.
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALpp">pp</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
A pretty-printer using S-expressions and boxes to render the tree.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALpp">pp</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Print an array of items with printing function
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALpp">pp</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALpp">pp</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Print an array of items with printing function
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALpp">pp</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCChar.html#VALpp">pp</a> [<a href="CCChar.html">CCChar</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALpp">pp</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.S.html#VALpp">pp</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCSet.S.html#VALpp">pp</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCRef.html#VALpp">pp</a> [<a href="CCRef.html">CCRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALpp">pp</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Print an array of items with printing function
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALpp">pp</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCBool.html#VALpp">pp</a> [<a href="CCBool.html">CCBool</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALpp">pp</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCPair.html#VALpp">pp</a> [<a href="CCPair.html">CCPair</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALpp">pp</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALpp">pp</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALpp">pp</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALpp'">pp'</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Printer that is generic on the error type
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALpp_binary">pp_binary</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
prints as "0b00101010".
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALpp_i">pp_i</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Print an array, giving the printing function both index and item
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALpp_i">pp_i</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Print an array, giving the printing function both index and item
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALpp_i">pp_i</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Print an array, giving the printing function both index and item
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALpp_noindent">pp_noindent</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Raw, direct printing as compact as possible
</div>
</td></tr>
<tr><td><a href="CCGraph.Dot.html#VALpp_seq">pp_seq</a> [<a href="CCGraph.Dot.html">CCGraph.Dot</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.Dot.html#VALpp_single">pp_single</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALprefix">prefix</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">prefix&nbsp;~pre&nbsp;s</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">pre</code> is a prefix of <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALprint">print</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALprint">print</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALprint">print</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALprint">print</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALprint">print</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALprint">print</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALprint">print</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Print the bitvector as a string of bits
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALprint">print</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALprint">print</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Print the elements
</div>
</td></tr>
<tr><td><a href="CCChar.html#VALprint">print</a> [<a href="CCChar.html">CCChar</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashtbl.S.html#VALprint">print</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Printer for tables
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALprint">print</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Printer for table
</div>
</td></tr>
<tr><td><a href="CCString.S.html#VALprint">print</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td><div class="info">
Print the string within quotes
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALprint">print</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCKTree.Dot.html#VALprint_to_file">print_to_file</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td><div class="info">
<code class="code">print_to_file&nbsp;filename&nbsp;g</code> prints <code class="code">g</code> into a file whose name
is <code class="code">filename</code>.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALproduct">product</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Specialization of <a href="CCKList.html#VALproduct_with"><code class="code"><span class="constructor">CCKList</span>.product_with</code></a> producing tuples
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALproduct">product</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Cartesian product of the two lists, with the given combinator
</div>
</td></tr>
<tr><td><a href="CCList.html#VALproduct">product</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Cartesian product of the two lists, with the given combinator
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALproduct_with">product_with</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Fair product of two (possibly infinite) lists into a new list.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALpure">pure</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALpure">pure</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALpure">pure</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Synonym to <a href="CCParse.html#VALreturn"><code class="code"><span class="constructor">CCParse</span>.return</code></a>
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALpure">pure</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Synonym of <a href="CCResult.html#VALreturn"><code class="code"><span class="constructor">CCResult</span>.return</code></a>
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALpure">pure</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALpure">pure</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Alias to <a href="CCOpt.html#VALreturn"><code class="code"><span class="constructor">CCOpt</span>.return</code></a>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALpure">pure</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCBlockingQueue.html#VALpush">push</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
<code class="code">push&nbsp;q&nbsp;x</code> pushes <code class="code">x</code> into <code class="code">q</code>, blocking if the queue is full
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALpush">push</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Push element at the end of the queue
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALpush">push</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Ref.html#VALpush">push</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALpush">push</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Add an element at the end of the vector
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALpush_back">push_back</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Push value at the back of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALpush_back">push_back</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Push value at the back
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALpush_front">push_front</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Push value at the front
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALpush_list">push_list</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
Push items of the list, one by one
</div>
</td></tr>
<tr><td><a href="CCListLabels.Ref.html#VALpush_list">push_list</a> [<a href="CCListLabels.Ref.html">CCListLabels.Ref</a>]</td>
<td><div class="info">
Add elements of the list at the beginning of the list ref.
</div>
</td></tr>
<tr><td><a href="CCList.Ref.html#VALpush_list">push_list</a> [<a href="CCList.Ref.html">CCList.Ref</a>]</td>
<td><div class="info">
Add elements of the list at the beginning of the list ref.
</div>
</td></tr>
<tr><td align="left"><br>Q</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALquad">quad</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALquad">quad</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALquad">quad</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="CCArrayLabels.html#VALrandom">random</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALrandom">random</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALrandom">random</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALrandom">random</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALrandom">random</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALrandom">random</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALrandom">random</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALrandom_choose">random_choose</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
Randomly choose a (key,value) pair within the tree, using weights
as probability weights
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALrandom_choose">random_choose</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Choose an element randomly.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALrandom_choose">random_choose</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Randomly choose an element in the list.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALrandom_choose">random_choose</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Choose an element randomly.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALrandom_choose">random_choose</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Choose an element randomly.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALrandom_choose">random_choose</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Randomly choose an element in the list.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALrandom_len">random_len</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALrandom_len">random_len</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALrandom_len">random_len</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALrandom_len">random_len</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALrandom_non_empty">random_non_empty</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALrandom_non_empty">random_non_empty</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALrandom_non_empty">random_non_empty</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALrandom_non_empty">random_non_empty</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALrandom_range">random_range</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALrandom_range">random_range</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALrandom_sequence">random_sequence</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALrandom_sequence">random_sequence</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALrandom_small">random_small</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALrandom_small">random_small</a> [<a href="CCInt.html">CCInt</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALrange">range</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">range&nbsp;i&nbsp;j</code> is <code class="code">i;&nbsp;i+1;&nbsp;...&nbsp;;&nbsp;j</code> or <code class="code">j;&nbsp;j-1;&nbsp;...;&nbsp;i</code>
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALrange">range</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALrange">range</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">range&nbsp;i&nbsp;j</code> iterates on integers from <code class="code">i</code> to <code class="code">j</code> included .
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALrange">range</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">range&nbsp;i&nbsp;j</code> iterates on integers from <code class="code">i</code> to <code class="code">j</code> included .
</div>
</td></tr>
<tr><td><a href="CCList.html#VALrange">range</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">range&nbsp;i&nbsp;j</code> iterates on integers from <code class="code">i</code> to <code class="code">j</code> included .
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALrange'">range'</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Same as <a href="CCListLabels.html#VALrange"><code class="code"><span class="constructor">CCListLabels</span>.range</code></a> but the second bound is excluded.
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALrange'">range'</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
Same as <a href="CCInt.html#VALrange"><code class="code"><span class="constructor">CCInt</span>.range</code></a> but the second bound is excluded.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALrange'">range'</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Same as <a href="CCList.html#VALrange"><code class="code"><span class="constructor">CCList</span>.range</code></a> but the second bound is excluded.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALrange_by">range_by</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">range_by&nbsp;~step&nbsp;i&nbsp;j</code> iterates on integers from <code class="code">i</code> to <code class="code">j</code> included,
where the difference between successive elements is <code class="code">step</code>.
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALrange_by">range_by</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">range_by&nbsp;~step&nbsp;i&nbsp;j</code> iterates on integers from <code class="code">i</code> to <code class="code">j</code> included,
where the difference between successive elements is <code class="code">step</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALrange_by">range_by</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">range_by&nbsp;~step&nbsp;i&nbsp;j</code> iterates on integers from <code class="code">i</code> to <code class="code">j</code> included,
where the difference between successive elements is <code class="code">step</code>.
</div>
</td></tr>
<tr><td><a href="CCString.Find.html#VALrcompile">rcompile</a> [<a href="CCString.Find.html">CCString.Find</a>]</td>
<td></td></tr>
<tr><td><a href="CCIO.File.html#VALread">read</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Read the content of the given file
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALread_all">read_all</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Read the whole channel into a buffer, then converted into a string.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALread_all_bytes">read_all_bytes</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Read the whole channel into a mutable byte array
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALread_chunks">read_chunks</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Read the channel's content into chunks of size <code class="code">size</code>
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALread_dir">read_dir</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
<code class="code">read_dir&nbsp;d</code> returns a sequence of files and directory contained
in the directory <code class="code">d</code> (or an empty stream if <code class="code">d</code> is not a directory)
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALread_exn">read_exn</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Read the content of the given file, or raises some exception
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALread_line">read_line</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Read a line from the channel.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALread_lines">read_lines</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Read all lines.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALread_lines_l">read_lines_l</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Read all lines into a list
</div>
</td></tr>
<tr><td><a href="CCSemaphore.html#VALrelease">release</a> [<a href="CCSemaphore.html">CCSemaphore</a>]</td>
<td><div class="info">
<code class="code">release&nbsp;n&nbsp;s</code> atomically sets <code class="code">s&nbsp;:=&nbsp;!s&nbsp;+&nbsp;n</code>
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALrem">rem</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">rem&nbsp;a&nbsp;n</code> is the remainder of dividing <code class="code">a</code> by <code class="code">n</code>, with the same
sign as <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALremove">remove</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
<code class="code">remove&nbsp;l</code> removes the current element, if any.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALremove">remove</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">remove&nbsp;l&nbsp;i</code> removes the <code class="code">i</code>-th element of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALremove">remove</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALremove">remove</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
Remove the key, if present.
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALremove">remove</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
Remove the element, if it were in there
</div>
</td></tr>
<tr><td><a href="CCGraph.MAP.html#VALremove">remove</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td><div class="info">
Remove the vertex and all its outgoing edges.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALremove">remove</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCMixmap.S.html#VALremove">remove</a> [<a href="CCMixmap.S.html">CCMixmap.S</a>]</td>
<td><div class="info">
Remove the binding for this key
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALremove">remove</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Remove the binding for this key
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALremove">remove</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Remove the key
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALremove">remove</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td><div class="info">
Remove binding
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALremove">remove</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Remove the key, if present
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALremove">remove</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALremove">remove</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Remove a specific binding
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALremove">remove</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Remove the binding
</div>
</td></tr>
<tr><td><a href="CCListLabels.Assoc.html#VALremove">remove</a> [<a href="CCListLabels.Assoc.html">CCListLabels.Assoc</a>]</td>
<td><div class="info">
<code class="code">remove&nbsp;x&nbsp;l</code> removes the first occurrence of <code class="code">k</code> from <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALremove">remove</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">remove&nbsp;~key&nbsp;l</code> removes every instance of <code class="code">key</code> from <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALremove">remove</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Like <code class="code">remove_exn</code> but with an error monad.
</div>
</td></tr>
<tr><td><a href="CCList.Assoc.html#VALremove">remove</a> [<a href="CCList.Assoc.html">CCList.Assoc</a>]</td>
<td><div class="info">
<code class="code">remove&nbsp;x&nbsp;l</code> removes the first occurrence of <code class="code">k</code> from <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALremove">remove</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">remove&nbsp;~x&nbsp;l</code> removes every instance of <code class="code">x</code> from <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALremove">remove</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Remove the <code class="code">n-th</code> element of the vector.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALremove_all">remove_all</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">remove_all&nbsp;set&nbsp;x</code> removes all occurrences of <code class="code">x</code> from <code class="code">set</code>
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALremove_all">remove_all</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Remove the key from the map
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALremove_at_idx">remove_at_idx</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Remove element at given index.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALremove_at_idx">remove_at_idx</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Remove element at given index.
</div>
</td></tr>
<tr><td><a href="CCGraph.MAP.html#VALremove_edge">remove_edge</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCIO.File.html#VALremove_exn">remove_exn</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
<code class="code">remove_exn&nbsp;path</code> tries to remove the file at <code class="code">path</code> from the
file system.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALremove_left">remove_left</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Remove all bindings for the left key
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALremove_mult">remove_mult</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">remove_mult&nbsp;set&nbsp;x&nbsp;n</code> removes at most <code class="code">n</code> occurrences of <code class="code">x</code> from <code class="code">set</code>
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALremove_mut">remove_mut</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
Same as <a href="CCHashTrie.S.html#VALremove"><code class="code"><span class="constructor">CCHashTrie</span>.<span class="constructor">S</span>.remove</code></a>, but modifies in place whenever possible
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALremove_noerr">remove_noerr</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Like <code class="code">remove_exn</code> but do not raise any exception on failure.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALremove_one">remove_one</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">remove_one&nbsp;x&nbsp;set</code> removes one occurrence of <code class="code">x</code> from <code class="code">set</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALremove_one">remove_one</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">remove_one&nbsp;x&nbsp;set</code> removes one occurrence of <code class="code">x</code> from <code class="code">set</code>.
</div>
</td></tr>
<tr><td><a href="CCSexp_lex.html#VALremove_quotes">remove_quotes</a> [<a href="CCSexp_lex.html">CCSexp_lex</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALremove_right">remove_right</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td><div class="info">
Remove all bindings for the right key
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALrepeat">repeat</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">repeat&nbsp;n&nbsp;l</code> is <code class="code">append&nbsp;l&nbsp;(append&nbsp;l&nbsp;...&nbsp;l)</code> <code class="code">n</code> times
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALrepeat">repeat</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">repeat&nbsp;~n&nbsp;x</code> repeats <code class="code">x</code> <code class="code">n</code> times then stops.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALrepeat">repeat</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Concatenate the list with itself <code class="code">n</code> times
</div>
</td></tr>
<tr><td><a href="CCString.html#VALrepeat">repeat</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
The same string, repeated n times
</div>
</td></tr>
<tr><td><a href="CCList.html#VALrepeat">repeat</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Concatenate the list with itself <code class="code">n</code> times
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALreplace">replace</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Add the binding to the table, returning a new table.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALreplace">replace</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">replace&nbsp;~sub&nbsp;~by&nbsp;s</code> replaces some occurrences of <code class="code">sub</code> by <code class="code">by</code> in <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALreplacing">replacing</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Replacing cache of the given size.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALreplicate">replicate</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Replicate the given element <code class="code">n</code> times
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALreplicate">replicate</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
<code class="code">replicate&nbsp;n&nbsp;g</code> makes a list of <code class="code">n</code> elements which are all generated
randomly using <code class="code">g</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALreplicate">replicate</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Replicate the given element <code class="code">n</code> times
</div>
</td></tr>
<tr><td><a href="CCThread.Barrier.html#VALreset">reset</a> [<a href="CCThread.Barrier.html">CCThread.Barrier</a>]</td>
<td><div class="info">
Reset to initial (non-triggered) state
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALreset">reset</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Set i-th bit to 0, extending the bitvector if needed.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALresize">resize</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Resize the BV so that it has the specified length.
</div>
</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALresult">result</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALresult'">result'</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALretry">retry</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
<code class="code">retry&nbsp;n&nbsp;f</code> calls <code class="code">f</code> at most <code class="code">n</code> times, returning the first result
of <code class="code">f&nbsp;()</code> that doesn't fail.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALretry">retry</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
<code class="code">retry&nbsp;g</code> calls <code class="code">g</code> until it returns some value, or until the maximum
number of retries was reached.
</div>
</td></tr>
<tr><td><a href="CCResult.Traverse.html#VALretry_m">retry_m</a> [<a href="CCResult.Traverse.html">CCResult.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALreturn">return</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Future that is already computed
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALreturn">return</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Singleton
</div>
</td></tr>
<tr><td><a href="CCGraph.Seq.html#VALreturn">return</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCLazy_list.html#VALreturn">return</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Return a computed value
</div>
</td></tr>
<tr><td><a href="CCKList.MONAD.html#VALreturn">return</a> [<a href="CCKList.MONAD.html">CCKList.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALreturn">return</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.MONAD.html#VALreturn">return</a> [<a href="CCListLabels.MONAD.html">CCListLabels.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALreturn">return</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALreturn">return</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Always succeeds, without consuming its input
</div>
</td></tr>
<tr><td><a href="CCResult.MONAD.html#VALreturn">return</a> [<a href="CCResult.MONAD.html">CCResult.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALreturn">return</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Successfully return a value
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALreturn">return</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">return&nbsp;<span class="string">"some_format_string"</span></code> takes a argument-less format string
and returns a printer actionable by <code class="code">()</code>.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALreturn">return</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
<code class="code">return&nbsp;x</code> is the generator that always returns <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCFun.Monad.html#VALreturn">return</a> [<a href="CCFun.Monad.html">CCFun.Monad</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALreturn">return</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
Monadic return, that is <code class="code">return&nbsp;x&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;x</code>
</div>
</td></tr>
<tr><td><a href="CCList.MONAD.html#VALreturn">return</a> [<a href="CCList.MONAD.html">CCList.MONAD</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALreturn">return</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALreturn">return</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Singleton vector
</div>
</td></tr>
<tr><td><a href="CCSimple_queue.html#VALrev">rev</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Reverse the queue.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALrev">rev</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Reverse the list
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALrev">rev</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Reverse the queue, O(n) complexity
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALrev">rev</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Copy + reverse in place
</div>
</td></tr>
<tr><td><a href="CCString.html#VALrev">rev</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">rev&nbsp;s</code> returns the reverse of <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALrev">rev</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Copy + reverse in place
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALrev">rev</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Reverse the vector
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALrev_in_place">rev_in_place</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Reverse the vector in place
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALrev_iter">rev_iter</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
<code class="code">rev_iter&nbsp;f&nbsp;a</code> is the same as <code class="code">iter&nbsp;f&nbsp;(rev&nbsp;a)</code>, only more efficient.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALrev_map">rev_map</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">rev_map&nbsp;f&nbsp;l</code> is the same as <code class="code">map&nbsp;f&nbsp;(rev&nbsp;l)</code>
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALreverse_in_place">reverse_in_place</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Reverse the array in place
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALreverse_in_place">reverse_in_place</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Reverse the array in place
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALreverse_in_place">reverse_in_place</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Reverse the array in place
</div>
</td></tr>
<tr><td><a href="CCString.Find.html#VALrfind">rfind</a> [<a href="CCString.Find.html">CCString.Find</a>]</td>
<td><div class="info">
Search for <code class="code">pattern</code> in the string, right-to-left
</div>
</td></tr>
<tr><td><a href="CCString.html#VALrfind">rfind</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Find <code class="code">sub</code> in string from the right, returns its first index or <code class="code">-1</code>.
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALright">right</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Go to the right, or do nothing if the zipper is already at rightmost pos
</div>
</td></tr>
<tr><td><a href="CCString.Split.html#VALright">right</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td><div class="info">
Split on the first occurrence of <code class="code">by</code> from the rightmost part of
the string
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALright_exn">right_exn</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Go to the right, or
</div>
</td></tr>
<tr><td><a href="CCString.Split.html#VALright_exn">right_exn</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td><div class="info">
Split on the first occurrence of <code class="code">by</code> from the rightmost part of the string
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALround">round</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
<code class="code">round&nbsp;f</code> returns the closest integer value, either above or below
</div>
</td></tr>
<tr><td><a href="CCString.html#VALrtrim">rtrim</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
trim space on the right (see <code class="code"><span class="constructor">String</span>.trim</code> for more details)
</div>
</td></tr>
<tr><td><a href="CCPool.Make.html#VALrun">run</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td><div class="info">
<code class="code">run&nbsp;f</code> schedules <code class="code">f</code> for being executed in the thread pool
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALrun">run</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Using a random state (possibly the one in argument) run a generator
</div>
</td></tr>
<tr><td><a href="CCPool.Make.html#VALrun1">run1</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td><div class="info">
<code class="code">run1&nbsp;f&nbsp;x</code> is similar to <code class="code">run&nbsp;(<span class="keyword">fun</span>&nbsp;()&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;f&nbsp;x)</code>
</div>
</td></tr>
<tr><td><a href="CCPool.Make.html#VALrun2">run2</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.html#VALrun3">run3</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td></td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="CCRandom.html#VALsample_without_replacement">sample_without_replacement</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
<code class="code">sample_without_replacement&nbsp;n&nbsp;g</code> makes a list of <code class="code">n</code> elements which are all
generated randomly using <code class="code">g</code> with the added constraint that none of the generated
random values are equal
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALscale">scale</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALscan_left">scan_left</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">scan_left&nbsp;f&nbsp;acc&nbsp;a</code> returns the array
<code class="code"> [|acc; f acc x0; f (f acc a.(0)) a.(1); …|] </code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALscan_left">scan_left</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">scan_left&nbsp;f&nbsp;acc&nbsp;l</code> returns the list <code class="code">[acc; f acc x0; f (f acc x0) x1; …]</code>
where <code class="code">x0</code>, <code class="code">x1</code>, etc.
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALscc">scc</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
Strongly connected components reachable from the given vertices.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALselect">select</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">select&nbsp;arr&nbsp;bv</code> selects the elements of <code class="code">arr</code> whose index
corresponds to a true bit in <code class="code">bv</code>.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALselecti">selecti</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Same as <a href="CCBV.html#VALselect"><code class="code"><span class="constructor">CCBV</span>.select</code></a>, but selected elements are paired with their index
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALsep">sep</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">sep&nbsp;~by&nbsp;p</code> parses a list of <code class="code">p</code> separated by <code class="code">by</code>
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALsep1">sep1</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">sep1&nbsp;~by&nbsp;p</code> parses a non empty list of <code class="code">p</code>, separated by <code class="code">by</code>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALseq">seq</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.Split.html#VALseq">seq</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALseq">seq</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.Split.html#VALseq_cpy">seq_cpy</a> [<a href="CCString.Split.html">CCString.Split</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALseq_left">seq_left</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.BIDIR.html#VALseq_right">seq_right</a> [<a href="CCMultiMap.BIDIR.html">CCMultiMap.BIDIR</a>]</td>
<td></td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALsequence_a">sequence_a</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Future that waits for all previous futures to terminate.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALsequence_l">sequence_l</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Future that waits for all previous futures to terminate.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALsequence_l">sequence_l</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">sequence_l&nbsp;[x1;&nbsp;x2;&nbsp;...;&nbsp;xn]</code> returns <code class="code"><span class="constructor">Some</span>&nbsp;[y1;y2;...;yn]</code> if
every <code class="code">xi</code> is <code class="code"><span class="constructor">Some</span>&nbsp;yi</code>.
</div>
</td></tr>
<tr><td><a href="CCKList.Traverse.html#VALsequence_m">sequence_m</a> [<a href="CCKList.Traverse.html">CCKList.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Traverse.html#VALsequence_m">sequence_m</a> [<a href="CCListLabels.Traverse.html">CCListLabels.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.Traverse.html#VALsequence_m">sequence_m</a> [<a href="CCResult.Traverse.html">CCResult.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Traverse.html#VALsequence_m">sequence_m</a> [<a href="CCList.Traverse.html">CCList.Traverse</a>]</td>
<td></td></tr>
<tr><td><a href="CCLock.LockRef.html#VALset">set</a> [<a href="CCLock.LockRef.html">CCLock.LockRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCLock.html#VALset">set</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
Atomically set the value
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALset">set</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td><div class="info">
Copy the array and modify its copy
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALset">set</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">set&nbsp;l&nbsp;i&nbsp;v</code> sets the <code class="code">i</code>-th element of the list to <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="CCBitField.S.html#VALset">set</a> [<a href="CCBitField.S.html">CCBitField.S</a>]</td>
<td><div class="info">
Set the value of this field
</div>
</td></tr>
<tr><td><a href="CCMixset.html#VALset">set</a> [<a href="CCMixset.html">CCMixset</a>]</td>
<td><div class="info">
<code class="code">set&nbsp;~key&nbsp;v&nbsp;set</code> maps <code class="code">key</code> to <code class="code">v</code> in <code class="code">set</code>.
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALset">set</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">set&nbsp;a&nbsp;i&nbsp;v</code> sets the element index <code class="code">i</code> from the array <code class="code">a</code> to <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALset">set</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">set&nbsp;t&nbsp;i&nbsp;e</code> sets the element at position <code class="code">i</code> to <code class="code">e</code>
</div>
</td></tr>
<tr><td><a href="CCMixtbl.html#VALset">set</a> [<a href="CCMixtbl.html">CCMixtbl</a>]</td>
<td><div class="info">
Bind the key to the value, using <code class="code">inj</code>
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALset">set</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Set i-th bit, extending the bitvector if needed.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.MONO_ARRAY.html#VALset">set</a> [<a href="CCArrayLabels.MONO_ARRAY.html">CCArrayLabels.MONO_ARRAY</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALset">set</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.Assoc.html#VALset">set</a> [<a href="CCListLabels.Assoc.html">CCListLabels.Assoc</a>]</td>
<td><div class="info">
Add the binding into the list (erase it if already present)
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALset">set</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.html#VALset">set</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">set&nbsp;s&nbsp;i&nbsp;c</code> creates a new string which is a copy of <code class="code">s</code>, except
for index <code class="code">i</code>, which becomes <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.MONO_ARRAY.html#VALset">set</a> [<a href="CCArray.MONO_ARRAY.html">CCArray.MONO_ARRAY</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALset">set</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.Assoc.html#VALset">set</a> [<a href="CCList.Assoc.html">CCList.Assoc</a>]</td>
<td><div class="info">
Add the binding into the list (erase it if already present)
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALset">set</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Modify element at given index, or
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALset_at_idx">set_at_idx</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Set i-th element (removes the old one), or does nothing if
index is too high
</div>
</td></tr>
<tr><td><a href="CCList.html#VALset_at_idx">set_at_idx</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Set i-th element (removes the old one), or does nothing if
index is too high
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALset_color_default">set_color_default</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">set_color_default&nbsp;b</code> enables color handling on the standard formatters
(stdout, stderr) if <code class="code">b&nbsp;=&nbsp;<span class="keyword">true</span></code> as well as on <a href="CCFormat.html#VALsprintf"><code class="code"><span class="constructor">CCFormat</span>.sprintf</code></a> formatters;
it disables the color handling if <code class="code">b&nbsp;=&nbsp;<span class="keyword">false</span></code>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALset_color_tag_handling">set_color_tag_handling</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
adds functions to support color tags to the given formatter.
</div>
</td></tr>
<tr><td><a href="CCTimer.html#VALset_exn_handler">set_exn_handler</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
<code class="code">set_exn_handler&nbsp;timer&nbsp;f</code> registers <code class="code">f</code> so that any exception
raised by a task scheduled in <code class="code">timer</code> is given to <code class="code">f</code>
</div>
</td></tr>
<tr><td><a href="CCPool.Make.html#VALset_exn_handler">set_exn_handler</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALset_of_cmp">set_of_cmp</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Build a set structure given a total ordering
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALshow_walk_item">show_walk_item</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALshrink">shrink</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Shrink to the given size (remove elements above this size).
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALshuffle">shuffle</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Shuffle randomly the array, in place
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALshuffle">shuffle</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Shuffle randomly the array, in place
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALshuffle">shuffle</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Shuffle randomly the array, in place
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALshuffle_with">shuffle_with</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Like shuffle but using a specialized random state
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALshuffle_with">shuffle_with</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Like shuffle but using a specialized random state
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALshuffle_with">shuffle_with</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Like shuffle but using a specialized random state
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALsign">sign</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
<code class="code">sign&nbsp;i</code> is one of <code class="code">-1,&nbsp;0,&nbsp;1</code>
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALsign_exn">sign_exn</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
<code class="code">sign_exn&nbsp;x</code> will return the sign of <code class="code">x</code> as <code class="code">1,&nbsp;0</code> or <code class="code">-1</code>, or raise an
exception <code class="code"><span class="constructor">TrapNaN</span></code> if <code class="code">x</code> is a NaN.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALsilent">silent</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Prints nothing
</div>
</td></tr>
<tr><td><a href="CCImmutArray.html#VALsingleton">singleton</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALsingleton">singleton</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALsingleton">singleton</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALsingleton">singleton</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">singleton&nbsp;x</code> is the singleton <code class="code">{x}</code>
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALsingleton">singleton</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCFQueue.html#VALsingleton">singleton</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALsingleton">singleton</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALsingleton">singleton</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.Dot.html#VALsingleton">singleton</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.html#VALsingleton">singleton</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Tree with only one label
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALsize">size</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
Number of elements currently in the queue
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALsize">size</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Number of elements in the queue (constant time)
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALsize">size</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Size of the cache (number of entries).
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALsize">size</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td><div class="info">
Number of bindings
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALsize">size</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Number of bindings
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALsize">size</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Number of keys
</div>
</td></tr>
<tr><td><a href="CCKTree.html#VALsize">size</a> [<a href="CCKTree.html">CCKTree</a>]</td>
<td><div class="info">
Number of elements
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALsize">size</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Number of elements (linear complexity)
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALsize">size</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Number of elements in vector
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALskip">skip</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
<code class="code">skip&nbsp;b&nbsp;len</code> removes <code class="code">len</code> elements from the front of <code class="code">b</code>.
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALskip">skip</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">skip&nbsp;p</code> parses zero or more times <code class="code">p</code> and ignores its result
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALskip_chars">skip_chars</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Skip 0 or more chars satisfying the predicate
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALskip_space">skip_space</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Skip ' ' and '\t'
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALskip_white">skip_white</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Skip ' ' and '\t' and '\n'
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALsleep">sleep</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
Future that returns with success in the given amount of seconds.
</div>
</td></tr>
<tr><td><a href="CCHash.html#VALslice">slice</a> [<a href="CCHash.html">CCHash</a>]</td>
<td><div class="info">
<code class="code">slice&nbsp;s&nbsp;i&nbsp;len&nbsp;state</code> hashes the slice <code class="code">i,&nbsp;...&nbsp;i+len-1</code> of <code class="code">s</code>
into <code class="code">state</code>
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALslice">slice</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Vector as an array slice.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALslice_seq">slice_seq</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
<code class="code">slice_seq&nbsp;v&nbsp;start&nbsp;len</code> is the sequence of elements from <code class="code">v.(start)</code>
to <code class="code">v.(start+len-1)</code>.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALsmall_float">small_float</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
A reasonably small float.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALsmall_int">small_int</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALsnoc">snoc</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td><div class="info">
Flip version of <a href="CCSimple_queue.html#VALpush"><code class="code"><span class="constructor">CCSimple_queue</span>.push</code></a>
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALsnoc">snoc</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Push element at the end of the queue
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALsome">some</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">some&nbsp;pp</code> will print options as follows: <code class="code"><span class="constructor">Some</span>&nbsp;x</code> is printed using <code class="code">pp</code> on <code class="code">x</code>, <code class="code"><span class="constructor">None</span></code> is not printed at all
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALsort">sort</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Eager sort.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALsort">sort</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Sort the vector, returning a copy of it that is sorted
w.r.t the given ordering.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALsort'">sort'</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Sort the vector in place (modifying it).
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALsort_generic">sort_generic</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
Sort the array, without allocating (eats stack space though).
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALsort_generic">sort_generic</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
Sort the array, without allocating (eats stack space though).
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALsort_indices">sort_indices</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">sort_indices&nbsp;cmp&nbsp;a</code> returns a new array <code class="code">b</code>, with the same length as <code class="code">a</code>,
such that <code class="code">b.(i)</code> is the index of the <code class="code">i</code>-th element of <code class="code">a</code> in <code class="code">sort&nbsp;cmp&nbsp;a</code>.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALsort_indices">sort_indices</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">sort_indices&nbsp;cmp&nbsp;a</code> returns a new array <code class="code">b</code>, with the same length as <code class="code">a</code>,
such that <code class="code">b.(i)</code> is the index at which the <code class="code">i</code>-th element of <code class="code">sorted&nbsp;cmp&nbsp;a</code>
appears in <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALsort_indices">sort_indices</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">sort_indices&nbsp;cmp&nbsp;a</code> returns a new array <code class="code">b</code>, with the same length as <code class="code">a</code>,
such that <code class="code">b.(i)</code> is the index at which the <code class="code">i</code>-th element of <code class="code">sorted&nbsp;cmp&nbsp;a</code>
appears in <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALsort_ranking">sort_ranking</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">sort_ranking&nbsp;cmp&nbsp;a</code> returns a new array <code class="code">b</code>, with the same length as <code class="code">a</code>,
such that <code class="code">b.(i)</code> is the position in <code class="code">sorted&nbsp;cmp&nbsp;a</code> of the <code class="code">i</code>-th
element of <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALsort_ranking">sort_ranking</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">sort_ranking&nbsp;cmp&nbsp;a</code> returns a new array <code class="code">b</code>, with the same length as <code class="code">a</code>,
such that <code class="code">b.(i)</code> is the index at which the <code class="code">i</code>-the element of <code class="code">a</code> appears
in <code class="code">sorted&nbsp;cmp&nbsp;a</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALsort_ranking">sort_ranking</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">sort_ranking&nbsp;cmp&nbsp;a</code> returns a new array <code class="code">b</code>, with the same length as <code class="code">a</code>,
such that <code class="code">b.(i)</code> is the index at which the <code class="code">i</code>-the element of <code class="code">a</code> appears
in <code class="code">sorted&nbsp;cmp&nbsp;a</code>.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALsort_uniq">sort_uniq</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Eager sort that removes duplicate values.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALsort_uniq">sort_uniq</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Sort the list and remove duplicate elements
</div>
</td></tr>
<tr><td><a href="CCList.html#VALsort_uniq">sort_uniq</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Sort the list and remove duplicate elements
</div>
</td></tr>
<tr><td><a href="CCArrayLabels.html#VALsorted">sorted</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td><div class="info">
<code class="code">sorted&nbsp;cmp&nbsp;a</code> makes a copy of <code class="code">a</code> and sorts it with <code class="code">cmp</code>.
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALsorted">sorted</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
<code class="code">sorted&nbsp;cmp&nbsp;a</code> makes a copy of <code class="code">a</code> and sorts it with <code class="code">cmp</code>.
</div>
</td></tr>
<tr><td><a href="CCArray.html#VALsorted">sorted</a> [<a href="CCArray.html">CCArray</a>]</td>
<td><div class="info">
<code class="code">sorted&nbsp;cmp&nbsp;a</code> makes a copy of <code class="code">a</code> and sorts it with <code class="code">cmp</code>.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALsorted_insert">sorted_insert</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">sorted_insert&nbsp;x&nbsp;l</code> inserts <code class="code">x</code> into <code class="code">l</code> such that, if <code class="code">l</code> was sorted,
then <code class="code">sorted_insert&nbsp;x&nbsp;l</code> is sorted too.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALsorted_insert">sorted_insert</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">sorted_insert&nbsp;x&nbsp;l</code> inserts <code class="code">x</code> into <code class="code">l</code> such that, if <code class="code">l</code> was sorted,
then <code class="code">sorted_insert&nbsp;x&nbsp;l</code> is sorted too.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALsorted_merge">sorted_merge</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Merges elements from both sorted list
</div>
</td></tr>
<tr><td><a href="CCList.html#VALsorted_merge">sorted_merge</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Merges elements from both sorted list
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALsorted_merge_uniq">sorted_merge_uniq</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">sorted_merge_uniq&nbsp;l1&nbsp;l2</code> merges the sorted lists <code class="code">l1</code> and <code class="code">l2</code> and
removes duplicates
</div>
</td></tr>
<tr><td><a href="CCList.html#VALsorted_merge_uniq">sorted_merge_uniq</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">sorted_merge_uniq&nbsp;l1&nbsp;l2</code> merges the sorted lists <code class="code">l1</code> and <code class="code">l2</code> and
removes duplicates
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALspace">space</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Tab or space
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALspanning_tree">spanning_tree</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">spanning_tree&nbsp;~graph&nbsp;v</code> computes a lazy spanning tree that has <code class="code">v</code>
as a root.
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALspanning_tree_tag">spanning_tree_tag</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td></td></tr>
<tr><td><a href="CCThread.Arr.html#VALspawn">spawn</a> [<a href="CCThread.Arr.html">CCThread.Arr</a>]</td>
<td><div class="info">
<code class="code"><span class="constructor">A</span>.spawn&nbsp;n&nbsp;f</code> creates an array <code class="code">res</code> of length <code class="code">n</code>, such that
<code class="code">res.(i)&nbsp;=&nbsp;spawn&nbsp;(<span class="keyword">fun</span>&nbsp;()&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;f&nbsp;i)</code>
</div>
</td></tr>
<tr><td><a href="CCThread.html#VALspawn">spawn</a> [<a href="CCThread.html">CCThread</a>]</td>
<td><div class="info">
<code class="code">spawn&nbsp;f</code> creates a new thread that runs <code class="code">f&nbsp;()</code>
</div>
</td></tr>
<tr><td><a href="CCThread.html#VALspawn1">spawn1</a> [<a href="CCThread.html">CCThread</a>]</td>
<td><div class="info">
<code class="code">spawn1&nbsp;f&nbsp;x</code> is like <code class="code">spawn&nbsp;(<span class="keyword">fun</span>&nbsp;()&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;f&nbsp;x)</code>.
</div>
</td></tr>
<tr><td><a href="CCThread.html#VALspawn2">spawn2</a> [<a href="CCThread.html">CCThread</a>]</td>
<td><div class="info">
<code class="code">spawn2&nbsp;f&nbsp;x&nbsp;y</code> is like <code class="code">spawn&nbsp;(<span class="keyword">fun</span>&nbsp;()&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;f&nbsp;x&nbsp;y)</code>.
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALsplit">split</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
<code class="code">split&nbsp;k&nbsp;t</code> returns <code class="code">l,&nbsp;o,&nbsp;r</code> where <code class="code">l</code> is the part of the map
with keys smaller than <code class="code">k</code>, <code class="code">r</code> has keys bigger than <code class="code">k</code>,
and <code class="code">o&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;v</code> if <code class="code">k,&nbsp;v</code> belonged to the map
</div>
</td></tr>
<tr><td><a href="CCString.html#VALsplit">split</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Alias to <a href="CCString.Split.html#VALlist_cpy"><code class="code"><span class="constructor">CCString</span>.<span class="constructor">Split</span>.list_cpy</code></a>
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALsplit">split</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Split a positive value <code class="code">n</code> into <code class="code">n1,n2</code> where <code class="code">n&nbsp;=&nbsp;n1&nbsp;+&nbsp;n2</code>.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALsplit">split</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
A tail-recursive version of <code class="code"><span class="constructor">List</span>.split</code>.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALsplit_list">split_list</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
Split a value <code class="code">n</code> into a list of values whose sum is <code class="code">n</code>
and whose length is <code class="code">length</code>.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALsplit_on_char">split_on_char</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
Split the string along the given char
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALsprintf">sprintf</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Print into a string any format string that would usually be compatible
with <a href="CCFormat.html#VALfprintf"><code class="code"><span class="constructor">CCFormat</span>.fprintf</code></a>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALsprintf_dyn_color">sprintf_dyn_color</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Similar to <a href="CCFormat.html#VALsprintf"><code class="code"><span class="constructor">CCFormat</span>.sprintf</code></a> but enable/disable colors depending on <code class="code">colors</code>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALsprintf_no_color">sprintf_no_color</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Similar to <a href="CCFormat.html#VALsprintf"><code class="code"><span class="constructor">CCFormat</span>.sprintf</code></a> but never prints colors
</div>
</td></tr>
<tr><td><a href="CCPool.Make.Fut.html#VALstate">state</a> [<a href="CCPool.Make.Fut.html">CCPool.Make.Fut</a>]</td>
<td><div class="info">
State of the future
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALstate_of_string">state_of_string</a> [<a href="CCParse.html">CCParse</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALstats">stats</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Statistics on the internal table.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALstatus">status</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td></td></tr>
<tr><td><a href="CCUnix.html#VALstderr">stderr</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALstderr">stderr</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCUnix.html#VALstdout">stdout</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALstdout">stdout</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCTimer.html#VALstop">stop</a> [<a href="CCTimer.html">CCTimer</a>]</td>
<td><div class="info">
Stop the given timer, cancelling pending tasks.
</div>
</td></tr>
<tr><td><a href="CCPool.Make.html#VALstop">stop</a> [<a href="CCPool.Make.html">CCPool.Make</a>]</td>
<td><div class="info">
After calling <code class="code">stop&nbsp;()</code>, Most functions will raise Stopped.
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALstring">string</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALstring">string</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">string&nbsp;s</code> parses exactly the string <code class="code">s</code>, and nothing else
</div>
</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALstring">string</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALstring">string</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALstring">string</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALstring">string</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALstring_of_branch">string_of_branch</a> [<a href="CCParse.html">CCParse</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALstring_quoted">string_quoted</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Similar to <code class="code"><span class="constructor">CCString</span>.print</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.Array.S.html#VALsub">sub</a> [<a href="CCRingBuffer.Array.S.html">CCRingBuffer.Array.S</a>]</td>
<td><div class="info">
<code class="code">sub&nbsp;t&nbsp;i&nbsp;len</code> gets the subarray of <code class="code">t</code> from
position <code class="code">i</code> to <code class="code">i&nbsp;+&nbsp;len</code>
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALsub">sub</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Sub-slice
</div>
</td></tr>
<tr><td><a href="CCString.Sub.html#VALsub">sub</a> [<a href="CCString.Sub.html">CCString.Sub</a>]</td>
<td><div class="info">
Sub-slice
</div>
</td></tr>
<tr><td><a href="CCFloat.html#VALsub">sub</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALsublists_of_len">sublists_of_len</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">sublists_of_len&nbsp;n&nbsp;l</code> returns sub-lists of <code class="code">l</code> that have length <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALsubmap">submap</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
<code class="code">submap&nbsp;m1&nbsp;m2</code> is true iff all bindings of <code class="code">m1</code> are also in <code class="code">m2</code>
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALsubset">subset</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">subset&nbsp;a&nbsp;b</code> returns <code class="code"><span class="keyword">true</span></code> if all elements of <code class="code">a</code> are in <code class="code">b</code>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALsubset">subset</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Test for inclusion
</div>
</td></tr>
<tr><td><a href="CCList.html#VALsubset">subset</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Test for inclusion
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALsubstring">substring</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Print the substring <code class="code">(s,i,len)</code>, where <code class="code">i</code> is the offset
in <code class="code">s</code> and <code class="code">len</code> the number of bytes in the substring.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALsuffix">suffix</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">suffix&nbsp;~suf&nbsp;s</code> returns <code class="code"><span class="keyword">true</span></code> iff <code class="code">suf</code> is a suffix of <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCParse.html#VALsuspend">suspend</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">suspend&nbsp;f</code> is the same as <code class="code">f&nbsp;()</code>, but evaluates <code class="code">f&nbsp;()</code> only
when needed
</div>
</td></tr>
<tr><td><a href="CCPair.html#VALswap">swap</a> [<a href="CCPair.html">CCPair</a>]</td>
<td><div class="info">
Swap the components of the tuple
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="CCFQueue.html#VALtail">tail</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Queue deprived of its first element.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALtail">tail</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Tail of the list
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALtail_exn">tail_exn</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Unsafe version of <a href="CCKList.html#VALtail"><code class="code"><span class="constructor">CCKList</span>.tail</code></a>
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALtake">take</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
Take the first element, blocking if needed
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALtake">take</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCLazy_list.html#VALtake">take</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td><div class="info">
Take at most n values.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALtake">take</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALtake">take</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Take the <code class="code">n</code> first elements, drop the rest
</div>
</td></tr>
<tr><td><a href="CCString.html#VALtake">take</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">take&nbsp;n&nbsp;s</code> keeps only the <code class="code">n</code> first chars of <code class="code">s</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALtake">take</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Take the <code class="code">n</code> first elements, drop the rest
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALtake">take</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Extract and return the minimum element, and the new heap (without
this element), or <code class="code"><span class="constructor">None</span></code> if the heap is empty
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALtake_back">take_back</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Take and remove the last value from back of <code class="code">t</code>, if any
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_back">take_back</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Take last element
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALtake_back">take_back</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Take last value, or
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALtake_back_exn">take_back_exn</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Take and remove the last value from back of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_back_exn">take_back_exn</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCFQueue.html#VALtake_back_l">take_back_l</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
<code class="code">take_back_l&nbsp;n&nbsp;q</code> removes and returns the last <code class="code">n</code> elements of <code class="code">q</code>.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_back_while">take_back_while</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALtake_drop">take_drop</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
<code class="code">take_drop&nbsp;n&nbsp;l</code> splits <code class="code">l</code> into <code class="code">a,&nbsp;b</code> such that <code class="code">length&nbsp;a&nbsp;=&nbsp;n</code>
if <code class="code">length&nbsp;l&nbsp;&gt;=&nbsp;n</code>, and such that <code class="code">append&nbsp;a&nbsp;b&nbsp;=&nbsp;l</code>
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALtake_drop">take_drop</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">take_drop&nbsp;n&nbsp;l</code> returns <code class="code">l1,&nbsp;l2</code> such that <code class="code">l1&nbsp;@&nbsp;l2&nbsp;=&nbsp;l</code> and
<code class="code">length&nbsp;l1&nbsp;=&nbsp;min&nbsp;(length&nbsp;l)&nbsp;n</code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALtake_drop">take_drop</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">take_drop&nbsp;n&nbsp;s&nbsp;=&nbsp;take&nbsp;n&nbsp;s,&nbsp;drop&nbsp;n&nbsp;s</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALtake_drop">take_drop</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">take_drop&nbsp;n&nbsp;l</code> returns <code class="code">l1,&nbsp;l2</code> such that <code class="code">l1&nbsp;@&nbsp;l2&nbsp;=&nbsp;l</code> and
<code class="code">length&nbsp;l1&nbsp;=&nbsp;min&nbsp;(length&nbsp;l)&nbsp;n</code>
</div>
</td></tr>
<tr><td><a href="CCList.html#VALtake_drop_while">take_drop_while</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">take_drop_while&nbsp;p&nbsp;l&nbsp;=&nbsp;take_while&nbsp;p&nbsp;l,&nbsp;drop_while&nbsp;p&nbsp;l</code>
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALtake_exn">take_exn</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Same as <a href="CCHeap.S.html#VALtake"><code class="code"><span class="constructor">CCHeap</span>.<span class="constructor">S</span>.take</code></a>, but can fail.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALtake_front">take_front</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Take and remove the first value from front of <code class="code">t</code>, if any
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_front">take_front</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Get and remove the first element
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALtake_front">take_front</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Take first value, or
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALtake_front_exn">take_front_exn</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Take and remove the first value from front of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_front_exn">take_front_exn</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
Same as <a href="CCFQueue.html#VALtake_front"><code class="code"><span class="constructor">CCFQueue</span>.take_front</code></a>, but fails on empty queues.
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_front_l">take_front_l</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td><div class="info">
<code class="code">take_front_l&nbsp;n&nbsp;q</code> takes at most <code class="code">n</code> elements from the front
of <code class="code">q</code>, and returns them wrapped in a list
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALtake_front_while">take_front_while</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCBlockingQueue.html#VALtake_list">take_list</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
<code class="code">take_list&nbsp;n&nbsp;q</code> takes <code class="code">n</code> elements out of <code class="code">q</code>
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALtake_while">take_while</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALtake_while">take_while</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALtake_while">take_while</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCList.html#VALtake_while">take_while</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALtap">tap</a> [<a href="CCFun.html">CCFun</a>]</td>
<td><div class="info">
<code class="code">tap&nbsp;f&nbsp;x</code> evaluates <code class="code">f&nbsp;x</code>, discards it, then returns <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALtee">tee</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
<code class="code">tee&nbsp;funs&nbsp;gen</code> behaves like <code class="code">gen</code>, but each element is given to
every function <code class="code">f</code> in <code class="code">funs</code> at the time the element is produced.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALtee">tee</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">tee&nbsp;a&nbsp;b</code> makes a new formatter that writes in both <code class="code">a</code> and <code class="code">b</code>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALtext">text</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Print string, but replacing spaces with breaks and newlines
with <a href="CCFormat.html#VALnewline"><code class="code"><span class="constructor">CCFormat</span>.newline</code></a>.
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALtl">tl</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
Remove the first element from the list, or
</div>
</td></tr>
<tr><td><a href="CCRAL.html#VALto_array">to_array</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td><div class="info">
More efficient than on usual lists
</div>
</td></tr>
<tr><td><a href="CCPersistentArray.html#VALto_array">to_array</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">to_array&nbsp;t</code> returns a mutable copy of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALto_array">to_array</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Create an array from the elements, in order.
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALto_array">to_array</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Convert into array.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALto_array">to_array</a> [<a href="CCString.html">CCString</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALto_array">to_array</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALto_buf">to_buf</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp.html#VALto_chan">to_chan</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALto_err">to_err</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALto_file">to_file</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCKTree.Dot.html#VALto_file">to_file</a> [<a href="CCKTree.Dot.html">CCKTree.Dot</a>]</td>
<td><div class="info">
<code class="code">to_file&nbsp;filename&nbsp;trees</code> makes a graph out of the trees, opens the
file <code class="code">filename</code> and prints the graph into the file.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALto_file">to_file</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Print to the given file
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALto_file_seq">to_file_seq</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td><div class="info">
Print the given sequence of expressions to a file
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALto_float">to_float</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALto_gen">to_gen</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALto_gen">to_gen</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALto_gen">to_gen</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALto_gen">to_gen</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALto_gen">to_gen</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALto_gen">to_gen</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALto_gen">to_gen</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALto_gen">to_gen</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Iterates on elements of the deque
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALto_gen">to_gen</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALto_gen">to_gen</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALto_gen">to_gen</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALto_gen">to_gen</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALto_gen">to_gen</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.S.html#VALto_gen">to_gen</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALto_gen">to_gen</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALto_gen">to_gen</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALto_gen">to_gen</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALto_gen">to_gen</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALto_gen">to_gen</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCChar.html#VALto_int">to_int</a> [<a href="CCChar.html">CCChar</a>]</td>
<td><div class="info">
Alias to <code class="code"><span class="constructor">Char</span>.code</code>
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALto_int">to_int</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALto_int">to_int</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td><div class="info">
Alias to <code class="code">int_of_float</code>.
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALto_int32">to_int32</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALto_klist">to_klist</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALto_klist">to_klist</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALto_klist">to_klist</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALto_klist">to_klist</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALto_klist">to_klist</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALto_klist">to_klist</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCString.S.html#VALto_klist">to_klist</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALto_klist">to_klist</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALto_klist">to_klist</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALto_klist">to_klist</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALto_klist">to_klist</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCZipper.html#VALto_list">to_list</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Convert the zipper back to a list.
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALto_list">to_list</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALto_list">to_list</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALto_list">to_list</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALto_list">to_list</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALto_list">to_list</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALto_list">to_list</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALto_list">to_list</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALto_list">to_list</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.Seq.html#VALto_list">to_list</a> [<a href="CCGraph.Seq.html">CCGraph.Seq</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALto_list">to_list</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td><div class="info">
<code class="code">to_list&nbsp;t</code> returns the list of elements in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALto_list">to_list</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCRingBuffer.S.html#VALto_list">to_list</a> [<a href="CCRingBuffer.S.html">CCRingBuffer.S</a>]</td>
<td><div class="info">
Extract the current content into a list
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALto_list">to_list</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
List of indexes that are true
</div>
</td></tr>
<tr><td><a href="CCFQueue.html#VALto_list">to_list</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALto_list">to_list</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
List of elements, in order.
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALto_list">to_list</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALto_list">to_list</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALto_list">to_list</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALto_list">to_list</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCLazy_list.html#VALto_list">to_list</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALto_list">to_list</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Gather all values into a list
</div>
</td></tr>
<tr><td><a href="CCArray_slice.html#VALto_list">to_list</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Convert directly to a list
</div>
</td></tr>
<tr><td><a href="CCMap.S.html#VALto_list">to_list</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashtbl.S.html#VALto_list">to_list</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
List of bindings (order unspecified)
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALto_list">to_list</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
List of bindings (order unspecified)
</div>
</td></tr>
<tr><td><a href="CCString.S.html#VALto_list">to_list</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCSet.S.html#VALto_list">to_list</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCRef.html#VALto_list">to_list</a> [<a href="CCRef.html">CCRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALto_list">to_list</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALto_list">to_list</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Return the elements of the heap, in no particular order.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALto_list">to_list</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALto_list_mult">to_list_mult</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCLazy_list.html#VALto_list_rev">to_list_rev</a> [<a href="CCLazy_list.html">CCLazy_list</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALto_list_sorted">to_list_sorted</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Return the elements in increasing order
</div>
</td></tr>
<tr><td><a href="CCInt64.html#VALto_nativeint">to_nativeint</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALto_opt">to_opt</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALto_result">to_result</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALto_result_lazy">to_result_lazy</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCZipper.html#VALto_rev_list">to_rev_list</a> [<a href="CCZipper.html">CCZipper</a>]</td>
<td><div class="info">
Convert the zipper back to a <i>reversed</i> list.
</div>
</td></tr>
<tr><td><a href="CCDeque.html#VALto_rev_list">to_rev_list</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
Efficient conversion to list, in reverse order
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALto_rev_list">to_rev_list</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Convert to a list, in reverse order.
</div>
</td></tr>
<tr><td><a href="CCHet.Map.html#VALto_seq">to_seq</a> [<a href="CCHet.Map.html">CCHet.Map</a>]</td>
<td></td></tr>
<tr><td><a href="CCHet.Tbl.html#VALto_seq">to_seq</a> [<a href="CCHet.Tbl.html">CCHet.Tbl</a>]</td>
<td></td></tr>
<tr><td><a href="CCImmutArray.html#VALto_seq">to_seq</a> [<a href="CCImmutArray.html">CCImmutArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCSimple_queue.html#VALto_seq">to_seq</a> [<a href="CCSimple_queue.html">CCSimple_queue</a>]</td>
<td></td></tr>
<tr><td><a href="CCRAL.html#VALto_seq">to_seq</a> [<a href="CCRAL.html">CCRAL</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALto_seq">to_seq</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashTrie.S.html#VALto_seq">to_seq</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashSet.S.html#VALto_seq">to_seq</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALto_seq">to_seq</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentArray.html#VALto_seq">to_seq</a> [<a href="CCPersistentArray.html">CCPersistentArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALto_seq">to_seq</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCBV.html#VALto_seq">to_seq</a> [<a href="CCBV.html">CCBV</a>]</td>
<td></td></tr>
<tr><td><a href="CCFQueue.html#VALto_seq">to_seq</a> [<a href="CCFQueue.html">CCFQueue</a>]</td>
<td></td></tr>
<tr><td><a href="CCDeque.html#VALto_seq">to_seq</a> [<a href="CCDeque.html">CCDeque</a>]</td>
<td><div class="info">
iterate on the elements
</div>
</td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALto_seq">to_seq</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
Sequence of the bindings of the table
</div>
</td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALto_seq">to_seq</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.WORD.html#VALto_seq">to_seq</a> [<a href="CCTrie.WORD.html">CCTrie.WORD</a>]</td>
<td></td></tr>
<tr><td><a href="CCTrie.S.html#VALto_seq">to_seq</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALto_seq">to_seq</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALto_seq">to_seq</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALto_seq">to_seq</a> [<a href="CCKList.html">CCKList</a>]</td>
<td></td></tr>
<tr><td><a href="CCArrayLabels.html#VALto_seq">to_seq</a> [<a href="CCArrayLabels.html">CCArrayLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCListLabels.html#VALto_seq">to_seq</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALto_seq">to_seq</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td></td></tr>
<tr><td><a href="CCResult.html#VALto_seq">to_seq</a> [<a href="CCResult.html">CCResult</a>]</td>
<td></td></tr>
<tr><td><a href="CCMap.S.html#VALto_seq">to_seq</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHashtbl.S.html#VALto_seq">to_seq</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Iterate on values in the table
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALto_seq">to_seq</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Iterate on bindings in the table
</div>
</td></tr>
<tr><td><a href="CCString.S.html#VALto_seq">to_seq</a> [<a href="CCString.S.html">CCString.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCSet.S.html#VALto_seq">to_seq</a> [<a href="CCSet.S.html">CCSet.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCRef.html#VALto_seq">to_seq</a> [<a href="CCRef.html">CCRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray.html#VALto_seq">to_seq</a> [<a href="CCArray.html">CCArray</a>]</td>
<td></td></tr>
<tr><td><a href="CCOpt.html#VALto_seq">to_seq</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td></td></tr>
<tr><td><a href="CCList.html#VALto_seq">to_seq</a> [<a href="CCList.html">CCList</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALto_seq">to_seq</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALto_seq">to_seq</a> [<a href="CCVector.html">CCVector</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiSet.S.html#VALto_seq_mult">to_seq_mult</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALto_seq_rev">to_seq_rev</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
<code class="code">to_seq_rev&nbsp;v</code> returns the sequence of elements of <code class="code">v</code> in reverse order,
that is, the last elements of <code class="code">v</code> are iterated on first.
</div>
</td></tr>
<tr><td><a href="CCHeap.S.html#VALto_seq_sorted">to_seq_sorted</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td><div class="info">
Iterate on the elements, in increasing order
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALto_seq_values">to_seq_values</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALto_slice">to_slice</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Convert into a triple <code class="code">(arr,&nbsp;i,&nbsp;len)</code> where <code class="code">len</code> is the length of
the subarray of <code class="code">arr</code> starting at offset <code class="code">i</code>
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALto_sorted_list">to_sorted_list</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
Same as <a href="CCBV.html#VALto_list"><code class="code"><span class="constructor">CCBV</span>.to_list</code></a>, but also guarantees the list is sorted in
increasing order
</div>
</td></tr>
<tr><td><a href="CCSexp.html#VALto_string">to_string</a> [<a href="CCSexp.html">CCSexp</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt64.html#VALto_string">to_string</a> [<a href="CCInt64.html">CCInt64</a>]</td>
<td></td></tr>
<tr><td><a href="CCIO.File.html#VALto_string">to_string</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALto_string">to_string</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td><div class="info">
Alias to <a href="CCFormat.html#VALto_string"><code class="code"><span class="constructor">CCFormat</span>.to_string</code></a>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALto_string">to_string</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCFloat.html#VALto_string">to_string</a> [<a href="CCFloat.html">CCFloat</a>]</td>
<td></td></tr>
<tr><td><a href="CCInt.html#VALto_string">to_string</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCInt.html#VALto_string_binary">to_string_binary</a> [<a href="CCInt.html">CCInt</a>]</td>
<td><div class="info">
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALto_tree">to_tree</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCHeap.S.html#VALto_tree">to_tree</a> [<a href="CCHeap.S.html">CCHeap.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCSexp_lex.html#VALtoken">token</a> [<a href="CCSexp_lex.html">CCSexp_lex</a>]</td>
<td></td></tr>
<tr><td><a href="CCVector.html#VALtop">top</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Top element, if present
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALtop_exn">top_exn</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Top element, if present
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALtopo_sort">topo_sort</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
<code class="code">topo_sort&nbsp;~graph&nbsp;seq</code> returns a list of vertices <code class="code">l</code> where each
element of <code class="code">l</code> is reachable from <code class="code">seq</code>.
</div>
</td></tr>
<tr><td><a href="CCGraph.html#VALtopo_sort_tag">topo_sort_tag</a> [<a href="CCGraph.html">CCGraph</a>]</td>
<td><div class="info">
Same as <a href="CCGraph.html#VALtopo_sort"><code class="code"><span class="constructor">CCGraph</span>.topo_sort</code></a> but uses an explicit tag set
</div>
</td></tr>
<tr><td><a href="CCBitField.S.html#VALtotal_width">total_width</a> [<a href="CCBitField.S.html">CCBitField.S</a>]</td>
<td><div class="info">
Current width of the bitfield
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALtriple">triple</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.U.html#VALtriple">triple</a> [<a href="CCParse.U.html">CCParse.U</a>]</td>
<td><div class="info">
Parse a triple using OCaml whitespace conventions.
</div>
</td></tr>
<tr><td><a href="CCFormat.Dump.html#VALtriple">triple</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALtriple">triple</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td></td></tr>
<tr><td><a href="CCOrd.html#VALtriple">triple</a> [<a href="CCOrd.html">CCOrd</a>]</td>
<td></td></tr>
<tr><td><a href="CCHash.html#VALtriple">triple</a> [<a href="CCHash.html">CCHash</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALtry_">try_</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
<code class="code">try_&nbsp;p</code> tries to parse like <code class="code">p</code>, but backtracks if <code class="code">p</code> fails.
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALtry_push">try_push</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
<code class="code">try_push&nbsp;q&nbsp;x</code> pushes <code class="code">x</code> into <code class="code">q</code> if <code class="code">q</code> is not full, in which
case it returns <code class="code"><span class="keyword">true</span></code>.
</div>
</td></tr>
<tr><td><a href="CCRandom.html#VALtry_successively">try_successively</a> [<a href="CCRandom.html">CCRandom</a>]</td>
<td><div class="info">
<code class="code">try_successively&nbsp;l</code> tries each generator of <code class="code">l</code>, one after the other.
</div>
</td></tr>
<tr><td><a href="CCBlockingQueue.html#VALtry_take">try_take</a> [<a href="CCBlockingQueue.html">CCBlockingQueue</a>]</td>
<td><div class="info">
Take the first element if the queue is not empty, return <code class="code"><span class="constructor">None</span></code>
otherwise
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALtry_with_lock">try_with_lock</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">try_with_lock&nbsp;l&nbsp;f</code> runs <code class="code">f&nbsp;x</code> in a critical section if <code class="code">l</code> is not
locked.
</div>
</td></tr>
<tr><td align="left"><br>U</td></tr>
<tr><td><a href="CCCache.html#VALunbounded">unbounded</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
Unbounded cache, backed by a Hash table.
</div>
</td></tr>
<tr><td><a href="CCString.html#VALuncapitalize_ascii">uncapitalize_ascii</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
See <code class="code"><span class="constructor">String</span></code>.
</div>
</td></tr>
<tr><td><a href="CCFun.html#VALuncurry">uncurry</a> [<a href="CCFun.html">CCFun</a>]</td>
<td></td></tr>
<tr><td><a href="CCArray_slice.html#VALunderlying">underlying</a> [<a href="CCArray_slice.html">CCArray_slice</a>]</td>
<td><div class="info">
Underlying array (shared).
</div>
</td></tr>
<tr><td><a href="CCString.Sub.html#VALunderlying">underlying</a> [<a href="CCString.Sub.html">CCString.Sub</a>]</td>
<td></td></tr>
<tr><td><a href="CCKList.html#VALunfold">unfold</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">unfold&nbsp;f&nbsp;acc</code> calls <code class="code">f&nbsp;acc</code> and: if <code class="code">f&nbsp;acc&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;(x,&nbsp;acc')</code>, yield <code class="code">x</code>, continue with <code class="code">unfold&nbsp;f&nbsp;acc'</code>, if <code class="code">f&nbsp;acc&nbsp;=&nbsp;<span class="constructor">None</span></code>, stops
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALunion">union</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">union&nbsp;a&nbsp;b</code> returns <code class="code">a b</code>
</div>
</td></tr>
<tr><td><a href="CCGraph.MAP.html#VALunion">union</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCIntMap.html#VALunion">union</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCBV.html#VALunion">union</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">union&nbsp;bv1&nbsp;bv2</code> returns the union of the two sets
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALunion">union</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">union&nbsp;a&nbsp;b</code> contains as many occurrences of an element <code class="code">x</code>
as <code class="code">count&nbsp;a&nbsp;x&nbsp;+&nbsp;count&nbsp;b&nbsp;x</code>.
</div>
</td></tr>
<tr><td><a href="CCMultiMap.S.html#VALunion">union</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Union of multimaps
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALunion">union</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
List union.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALunion">union</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
List union.
</div>
</td></tr>
<tr><td><a href="CCBV.html#VALunion_into">union_into</a> [<a href="CCBV.html">CCBV</a>]</td>
<td><div class="info">
<code class="code">union&nbsp;~into&nbsp;bv</code> sets <code class="code">into</code> to the union of itself and <code class="code">bv</code>.
</div>
</td></tr>
<tr><td><a href="CCHashSet.S.html#VALunion_mut">union_mut</a> [<a href="CCHashSet.S.html">CCHashSet.S</a>]</td>
<td><div class="info">
<code class="code">union_mut&nbsp;~into&nbsp;a</code> changes <code class="code">into</code> into <code class="code">a into</code>
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALuniq">uniq</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
<code class="code">uniq&nbsp;eq&nbsp;l</code> returns <code class="code">l</code> but removes consecutive duplicates.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALuniq">uniq</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
Remove duplicates w.r.t the equality predicate.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALuniq">uniq</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
Remove duplicates w.r.t the equality predicate.
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALuniq_sort">uniq_sort</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Sort the array and remove duplicates, in place (e.g.
</div>
</td></tr>
<tr><td><a href="CCListLabels.html#VALuniq_succ">uniq_succ</a> [<a href="CCListLabels.html">CCListLabels</a>]</td>
<td><div class="info">
<code class="code">uniq_succ&nbsp;l</code> removes duplicate elements that occur one next to the other.
</div>
</td></tr>
<tr><td><a href="CCList.html#VALuniq_succ">uniq_succ</a> [<a href="CCList.html">CCList</a>]</td>
<td><div class="info">
<code class="code">uniq_succ&nbsp;l</code> removes duplicate elements that occur one next to the other.
</div>
</td></tr>
<tr><td><a href="CCEqual.html#VALunit">unit</a> [<a href="CCEqual.html">CCEqual</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.Dump.html#VALunit">unit</a> [<a href="CCFormat.Dump.html">CCFormat.Dump</a>]</td>
<td></td></tr>
<tr><td><a href="CCFormat.html#VALunit">unit</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Prints "()"
</div>
</td></tr>
<tr><td><a href="CCString.html#VALunlines">unlines</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">unlines&nbsp;l</code> concatenates all strings of <code class="code">l</code>, separated with '\n'
</div>
</td></tr>
<tr><td><a href="CCString.html#VALunlines_gen">unlines_gen</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
<code class="code">unlines_gen&nbsp;g</code> concatenates all strings of <code class="code">g</code>, separated with '\n'
</div>
</td></tr>
<tr><td><a href="CCVector.html#VALunsafe_get_array">unsafe_get_array</a> [<a href="CCVector.html">CCVector</a>]</td>
<td><div class="info">
Access the underlying <b>shared</b> array (do not modify!).
</div>
</td></tr>
<tr><td><a href="CCKList.html#VALunzip">unzip</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Splits each tuple in the list
</div>
</td></tr>
<tr><td><a href="CCLock.LockRef.html#VALupdate">update</a> [<a href="CCLock.LockRef.html">CCLock.LockRef</a>]</td>
<td></td></tr>
<tr><td><a href="CCLock.html#VALupdate">update</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;l&nbsp;f</code> replaces the content <code class="code">x</code> of <code class="code">l</code> with <code class="code">f&nbsp;x</code>, atomically
</div>
</td></tr>
<tr><td><a href="CCWBTree.S.html#VALupdate">update</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;k&nbsp;f&nbsp;m</code> calls <code class="code">f&nbsp;(<span class="constructor">Some</span>&nbsp;v)</code> if <code class="code">get&nbsp;k&nbsp;m&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;v</code>, <code class="code">f&nbsp;<span class="constructor">None</span></code>
otherwise.
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALupdate">update</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;k&nbsp;~f&nbsp;m</code> calls <code class="code">f&nbsp;(<span class="constructor">Some</span>&nbsp;v)</code> if <code class="code">get&nbsp;k&nbsp;m&nbsp;=&nbsp;<span class="constructor">Some</span>&nbsp;v</code>, <code class="code">f&nbsp;<span class="constructor">None</span></code>
otherwise.
</div>
</td></tr>
<tr><td><a href="CCIntMap.html#VALupdate">update</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCPersistentHashtbl.S.html#VALupdate">update</a> [<a href="CCPersistentHashtbl.S.html">CCPersistentHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;tbl&nbsp;key&nbsp;f</code> calls <code class="code">f&nbsp;<span class="constructor">None</span></code> if <code class="code">key</code> doesn't belong in <code class="code">tbl</code>,
<code class="code">f&nbsp;(<span class="constructor">Some</span>&nbsp;v)</code> if <code class="code">key&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v</code> otherwise; If <code class="code">f</code> returns <code class="code"><span class="constructor">None</span></code> then
<code class="code">key</code> is removed, else it returns <code class="code"><span class="constructor">Some</span>&nbsp;v'</code> and <code class="code">key&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v'</code> is added.
</div>
</td></tr>
<tr><td><a href="CCTrie.S.html#VALupdate">update</a> [<a href="CCTrie.S.html">CCTrie.S</a>]</td>
<td><div class="info">
Update the binding for the given key.
</div>
</td></tr>
<tr><td><a href="CCMultiSet.S.html#VALupdate">update</a> [<a href="CCMultiSet.S.html">CCMultiSet.S</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;set&nbsp;x&nbsp;f</code> calls <code class="code">f&nbsp;n</code> where <code class="code">n</code> is the current multiplicity
of <code class="code">x</code> in <code class="code">set</code> (<code class="code">0</code> to indicate its absence); the result of <code class="code">f&nbsp;n</code>
is the new multiplicity of <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="CCListLabels.Assoc.html#VALupdate">update</a> [<a href="CCListLabels.Assoc.html">CCListLabels.Assoc</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;k&nbsp;~f&nbsp;l</code> updates <code class="code">l</code> on the key <code class="code">k</code>, by calling <code class="code">f&nbsp;(get&nbsp;l&nbsp;k)</code>
and removing <code class="code">k</code> if it returns <code class="code"><span class="constructor">None</span></code>, mapping <code class="code">k</code> to <code class="code">v'</code> if it
returns <code class="code"><span class="constructor">Some</span>&nbsp;v'</code>
</div>
</td></tr>
<tr><td><a href="CCMap.S.html#VALupdate">update</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;k&nbsp;f&nbsp;m</code> calls <code class="code">f&nbsp;(<span class="constructor">Some</span>&nbsp;v)</code> if <code class="code">find&nbsp;k&nbsp;m&nbsp;=&nbsp;v</code>,
otherwise it calls <code class="code">f&nbsp;<span class="constructor">None</span></code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALupdate">update</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;tbl&nbsp;~f&nbsp;~k</code> updates key <code class="code">k</code> by calling <code class="code">f&nbsp;k&nbsp;(<span class="constructor">Some</span>&nbsp;v)</code> if
<code class="code">k</code> was mapped to <code class="code">v</code>, or <code class="code">f&nbsp;k&nbsp;<span class="constructor">None</span></code> otherwise; if the call
returns <code class="code"><span class="constructor">None</span></code> then <code class="code">k</code> is removed/stays removed, if the call
returns <code class="code"><span class="constructor">Some</span>&nbsp;v'</code> then the binding <code class="code">k&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v'</code> is inserted
using <code class="code"><span class="constructor">Hashtbl</span>.replace</code>
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALupdate">update</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;tbl&nbsp;~f&nbsp;~k</code> updates key <code class="code">k</code> by calling <code class="code">f&nbsp;k&nbsp;(<span class="constructor">Some</span>&nbsp;v)</code> if
<code class="code">k</code> was mapped to <code class="code">v</code>, or <code class="code">f&nbsp;k&nbsp;<span class="constructor">None</span></code> otherwise; if the call
returns <code class="code"><span class="constructor">None</span></code> then <code class="code">k</code> is removed/stays removed, if the call
returns <code class="code"><span class="constructor">Some</span>&nbsp;v'</code> then the binding <code class="code">k&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;v'</code> is inserted
using <code class="code"><span class="constructor">Hashtbl</span>.replace</code>
</div>
</td></tr>
<tr><td><a href="CCRef.html#VALupdate">update</a> [<a href="CCRef.html">CCRef</a>]</td>
<td><div class="info">
Update the reference's content with the given function
</div>
</td></tr>
<tr><td><a href="CCList.Assoc.html#VALupdate">update</a> [<a href="CCList.Assoc.html">CCList.Assoc</a>]</td>
<td><div class="info">
<code class="code">update&nbsp;k&nbsp;~f&nbsp;l</code> updates <code class="code">l</code> on the key <code class="code">k</code>, by calling <code class="code">f&nbsp;(get&nbsp;l&nbsp;k)</code>
and removing <code class="code">k</code> if it returns <code class="code"><span class="constructor">None</span></code>, mapping <code class="code">k</code> to <code class="code">v'</code> if it
returns <code class="code"><span class="constructor">Some</span>&nbsp;v'</code>
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALupdate_map">update_map</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">update_map&nbsp;l&nbsp;f</code> computes <code class="code">x',&nbsp;y&nbsp;=&nbsp;f&nbsp;(get&nbsp;l)</code>, then puts <code class="code">x'</code> in <code class="code">l</code>
and returns <code class="code">y</code>
</div>
</td></tr>
<tr><td><a href="CCHashTrie.S.html#VALupdate_mut">update_mut</a> [<a href="CCHashTrie.S.html">CCHashTrie.S</a>]</td>
<td><div class="info">
Same as <a href="CCHashTrie.S.html#VALupdate"><code class="code"><span class="constructor">CCHashTrie</span>.<span class="constructor">S</span>.update</code></a> but with mutability
</div>
</td></tr>
<tr><td><a href="CCChar.html#VALuppercase_ascii">uppercase_ascii</a> [<a href="CCChar.html">CCChar</a>]</td>
<td><div class="info">
See <code class="code"><span class="constructor">Char</span></code>
</div>
</td></tr>
<tr><td><a href="CCString.html#VALuppercase_ascii">uppercase_ascii</a> [<a href="CCString.html">CCString</a>]</td>
<td><div class="info">
See <code class="code"><span class="constructor">String</span></code>.
</div>
</td></tr>
<tr><td align="left"><br>V</td></tr>
<tr><td><a href="CCIntMap.html#VALvalues">values</a> [<a href="CCIntMap.html">CCIntMap</a>]</td>
<td></td></tr>
<tr><td><a href="CCFlatHashtbl.S.html#VALvalues">values</a> [<a href="CCFlatHashtbl.S.html">CCFlatHashtbl.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCMultiMap.S.html#VALvalues">values</a> [<a href="CCMultiMap.S.html">CCMultiMap.S</a>]</td>
<td><div class="info">
Some values may occur several times
</div>
</td></tr>
<tr><td><a href="CCMap.S.html#VALvalues">values</a> [<a href="CCMap.S.html">CCMap.S</a>]</td>
<td><div class="info">
Iterate on values only
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALvalues">values</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
Iterate on values in the table
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALvalues">values</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
Iterate on values in the table
</div>
</td></tr>
<tr><td><a href="CCHashtbl.S.html#VALvalues_list">values_list</a> [<a href="CCHashtbl.S.html">CCHashtbl.S</a>]</td>
<td><div class="info">
<code class="code">values&nbsp;t</code> is the list of values in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCHashtbl.Poly.html#VALvalues_list">values_list</a> [<a href="CCHashtbl.Poly.html">CCHashtbl.Poly</a>]</td>
<td><div class="info">
<code class="code">values_list&nbsp;t</code> is the list of values in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALvbox">vbox</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
Wrap the printer in a vertical box
</div>
</td></tr>
<tr><td><a href="CCGraph.MAP.html#VALvertices">vertices</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td><a href="CCGraph.MAP.html#VALvertices_l">vertices_l</a> [<a href="CCGraph.MAP.html">CCGraph.MAP</a>]</td>
<td></td></tr>
<tr><td align="left"><br>W</td></tr>
<tr><td><a href="CCThread.Barrier.html#VALwait">wait</a> [<a href="CCThread.Barrier.html">CCThread.Barrier</a>]</td>
<td><div class="info">
<code class="code">wait&nbsp;b</code> waits for barrier <code class="code">b</code> to be activated by <code class="code">activate&nbsp;b</code>.
</div>
</td></tr>
<tr><td><a href="CCSemaphore.html#VALwait_until_at_least">wait_until_at_least</a> [<a href="CCSemaphore.html">CCSemaphore</a>]</td>
<td><div class="info">
<code class="code">wait_until_at_least&nbsp;~n&nbsp;s&nbsp;~f</code> waits until <code class="code">get&nbsp;s&nbsp;&gt;=&nbsp;n</code>, then calls <code class="code">f&nbsp;()</code>
and returns its result.
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALwalk">walk</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Similar to <a href="CCIO.File.html#VALread_dir"><code class="code"><span class="constructor">CCIO</span>.<span class="constructor">File</span>.read_dir</code></a> (with <code class="code">recurse=<span class="keyword">true</span></code>), this function walks
a directory recursively and yields either files or directories.
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALwalk_l">walk_l</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Same as <a href="CCIO.File.html#VALwalk"><code class="code"><span class="constructor">CCIO</span>.<span class="constructor">File</span>.walk</code></a> but returns a list (therefore it's eager and might
take some time on large directories)
</div>
</td></tr>
<tr><td><a href="CCWBTree.KEY.html#VALweight">weight</a> [<a href="CCWBTree.KEY.html">CCWBTree.KEY</a>]</td>
<td></td></tr>
<tr><td><a href="CCWBTree.S.html#VALweight">weight</a> [<a href="CCWBTree.S.html">CCWBTree.S</a>]</td>
<td></td></tr>
<tr><td><a href="CCParse.html#VALwhite">white</a> [<a href="CCParse.html">CCParse</a>]</td>
<td><div class="info">
Tab or space or newline
</div>
</td></tr>
<tr><td><a href="CCHashTrie.Transient.html#VALwith_">with_</a> [<a href="CCHashTrie.Transient.html">CCHashTrie.Transient</a>]</td>
<td><div class="info">
<code class="code"><span class="constructor">Transient</span>.with_&nbsp;f</code> creates a transient ID <code class="code">i</code>, calls <code class="code">f&nbsp;i</code>,
freezes the ID <code class="code">i</code> and returns the result of <code class="code">f&nbsp;i</code>.
</div>
</td></tr>
<tr><td><a href="CCSemaphore.html#VALwith_acquire">with_acquire</a> [<a href="CCSemaphore.html">CCSemaphore</a>]</td>
<td><div class="info">
<code class="code">with_acquire&nbsp;~n&nbsp;s&nbsp;~f</code> first acquires <code class="code">s</code> with <code class="code">n</code> units,
calls <code class="code">f&nbsp;()</code>, and then release <code class="code">s</code> with <code class="code">n</code> units.
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALwith_cache">with_cache</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
<code class="code">with_cache&nbsp;c&nbsp;f</code> behaves like <code class="code">f</code>, but caches calls to <code class="code">f</code> in the
cache <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="CCCache.html#VALwith_cache_rec">with_cache_rec</a> [<a href="CCCache.html">CCCache</a>]</td>
<td><div class="info">
<code class="code">with_cache_rec&nbsp;c&nbsp;f</code> is a function that first, applies <code class="code">f</code> to
some <code class="code">f'&nbsp;=&nbsp;fix&nbsp;f</code>, such that recursive calls to <code class="code">f'</code> are cached in <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALwith_color">with_color</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">with_color&nbsp;<span class="string">"Blue"</span>&nbsp;pp</code> behaves like the printer <code class="code">pp</code>, but with the given
style.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALwith_color_ksf">with_color_ksf</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">with_color_ksf&nbsp;<span class="string">"Blue"</span>&nbsp;~f&nbsp;<span class="string">"%s&nbsp;%d"</span>&nbsp;<span class="string">"yolo"</span>&nbsp;42</code> will behave like
<a href="CCFormat.html#VALksprintf"><code class="code"><span class="constructor">CCFormat</span>.ksprintf</code></a>, but wrapping the content with the given style
Example:
the following with raise <code class="code"><span class="constructor">Failure</span></code> with a colored message
<pre class="codepre"><code class="code"> <span class="constructor">CCFormat</span>.with_color_ksf <span class="string">"red"</span> ~f:failwith <span class="string">"%a"</span> <span class="constructor">CCFormat</span>.<span class="constructor">Dump</span>.(list int) [1;2;3];;
</code></pre>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALwith_color_sf">with_color_sf</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">with_color_sf&nbsp;<span class="string">"Blue"</span>&nbsp;out&nbsp;<span class="string">"%s&nbsp;%d"</span>&nbsp;<span class="string">"yolo"</span>&nbsp;42</code> will behave like
<a href="CCFormat.html#VALsprintf"><code class="code"><span class="constructor">CCFormat</span>.sprintf</code></a>, but wrapping the content with the given style
Example:
<pre class="codepre"><code class="code"> <span class="constructor">CCFormat</span>.with_color_sf <span class="string">"red"</span> <span class="string">"%a"</span> <span class="constructor">CCFormat</span>.<span class="constructor">Dump</span>.(list int) [1;2;3] |&gt; print_endline;;
</code></pre>
<b>status: experimental</b>
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALwith_colorf">with_colorf</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">with_colorf&nbsp;<span class="string">"Blue"</span>&nbsp;out&nbsp;<span class="string">"%s&nbsp;%d"</span>&nbsp;<span class="string">"yolo"</span>&nbsp;42</code> will behave like <code class="code"><span class="constructor">Format</span>.fprintf</code>,
but wrapping the content with the given style
<b>status: experimental</b>
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_connection">with_connection</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Wrap <code class="code"><span class="constructor">Unix</span>.open_connection</code> with a handler
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_file_lock">with_file_lock</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
<code class="code">with_file_lock&nbsp;~kind&nbsp;filename&nbsp;f</code> puts a lock on the offset 0
of the file named <code class="code">filename</code>, calls <code class="code">f</code> and returns its result after
the file is unlocked.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_in">with_in</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Open an input file with the given optional flag list, calls the function
on the input channel.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwith_in">with_in</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Open an input file with the given optional flag list, calls the function
on the input channel.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwith_in_out">with_in_out</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Combines <a href="CCIO.html#VALwith_in"><code class="code"><span class="constructor">CCIO</span>.with_in</code></a> and <a href="CCIO.html#VALwith_out"><code class="code"><span class="constructor">CCIO</span>.with_out</code></a>.
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALwith_lock">with_lock</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">with_lock&nbsp;l&nbsp;f</code> runs <code class="code">f&nbsp;x</code> where <code class="code">x</code> is the value protected with
the lock <code class="code">l</code>, in a critical section.
</div>
</td></tr>
<tr><td><a href="CCLock.html#VALwith_lock_as_ref">with_lock_as_ref</a> [<a href="CCLock.html">CCLock</a>]</td>
<td><div class="info">
<code class="code">with_lock_as_ref&nbsp;l&nbsp;f</code> calls <code class="code">f</code> with a reference-like object
that allows to manipulate the value of <code class="code">l</code> safely.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_out">with_out</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Same as <a href="CCUnix.html#VALwith_in"><code class="code"><span class="constructor">CCUnix</span>.with_in</code></a> but for an output channel
</div>
</td></tr>
<tr><td><a href="CCGraph.Dot.html#VALwith_out">with_out</a> [<a href="CCGraph.Dot.html">CCGraph.Dot</a>]</td>
<td><div class="info">
Shortcut to open a file and write to it
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwith_out">with_out</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Same as <a href="CCIO.html#VALwith_in"><code class="code"><span class="constructor">CCIO</span>.with_in</code></a> but for an output channel
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwith_out_a">with_out_a</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Similar to <a href="CCIO.html#VALwith_out"><code class="code"><span class="constructor">CCIO</span>.with_out</code></a> but with the <code class="code">[<span class="constructor">Open_append</span>;&nbsp;<span class="constructor">Open_creat</span>;&nbsp;<span class="constructor">Open_wronly</span>]</code>
flags activated, to append to the file.
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALwith_out_chan">with_out_chan</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">with_out_chan&nbsp;oc&nbsp;f</code> turns <code class="code">oc</code> into a formatter <code class="code">fmt</code>, and call <code class="code">f&nbsp;fmt</code>.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_process_full">with_process_full</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Open a subprocess and obtain a handle to its channels.
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_process_in">with_process_in</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Open a subprocess and obtain a handle to its stdout
<pre class="codepre"><code class="code"> <span class="constructor">CCUnix</span>.with_process_in <span class="string">"ls /tmp"</span> ~f:<span class="constructor">CCIO</span>.read_lines_l;;
</code></pre>
</div>
</td></tr>
<tr><td><a href="CCUnix.html#VALwith_process_out">with_process_out</a> [<a href="CCUnix.html">CCUnix</a>]</td>
<td><div class="info">
Open a subprocess and obtain a handle to its stdin
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALwith_temp">with_temp</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
<code class="code">with_temp&nbsp;~prefix&nbsp;~suffix&nbsp;f</code> will call <code class="code">f</code> with the name of a new
temporary file (located in <code class="code">temp_dir</code>).
</div>
</td></tr>
<tr><td><a href="CCFormat.html#VALwithin">within</a> [<a href="CCFormat.html">CCFormat</a>]</td>
<td><div class="info">
<code class="code">within&nbsp;a&nbsp;b&nbsp;p</code> wraps <code class="code">p</code> inside the strings <code class="code">a</code> and <code class="code">b</code>.
</div>
</td></tr>
<tr><td><a href="CCParse.U.html#VALword">word</a> [<a href="CCParse.U.html">CCParse.U</a>]</td>
<td><div class="info">
non empty string of alpha num, start with alpha
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALwrap">wrap</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">wrap&nbsp;f&nbsp;x</code> calls <code class="code">f&nbsp;x</code> and returns <code class="code"><span class="constructor">Some</span>&nbsp;y</code> if <code class="code">f&nbsp;x&nbsp;=&nbsp;y</code>.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALwrap1">wrap1</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Same as <a href="CCResult.html#VALguard"><code class="code"><span class="constructor">CCResult</span>.guard</code></a> but gives the function one argument.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALwrap2">wrap2</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Same as <a href="CCResult.html#VALguard"><code class="code"><span class="constructor">CCResult</span>.guard</code></a> but gives the function two arguments.
</div>
</td></tr>
<tr><td><a href="CCOpt.html#VALwrap2">wrap2</a> [<a href="CCOpt.html">CCOpt</a>]</td>
<td><div class="info">
<code class="code">wrap2&nbsp;f&nbsp;x&nbsp;y</code> is similar to <code class="code">wrap1</code> but for binary functions.
</div>
</td></tr>
<tr><td><a href="CCResult.html#VALwrap3">wrap3</a> [<a href="CCResult.html">CCResult</a>]</td>
<td><div class="info">
Same as <a href="CCResult.html#VALguard"><code class="code"><span class="constructor">CCResult</span>.guard</code></a> but gives the function three arguments.
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALwrite">write</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Write the given string into the given file
</div>
</td></tr>
<tr><td><a href="CCIO.File.html#VALwrite_exn">write_exn</a> [<a href="CCIO.File.html">CCIO.File</a>]</td>
<td><div class="info">
Write the given string into the given file, possibly raising
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwrite_gen">write_gen</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Write the given strings on the output.
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwrite_line">write_line</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Write the given string on the channel, followed by "\n"
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwrite_lines">write_lines</a> [<a href="CCIO.html">CCIO</a>]</td>
<td><div class="info">
Write every string on the output, followed by "\n".
</div>
</td></tr>
<tr><td><a href="CCIO.html#VALwrite_lines_l">write_lines_l</a> [<a href="CCIO.html">CCIO</a>]</td>
<td></td></tr>
<tr><td align="left"><br>Z</td></tr>
<tr><td><a href="CCKList.html#VALzip">zip</a> [<a href="CCKList.html">CCKList</a>]</td>
<td><div class="info">
Combine elements pairwise.
</div>
</td></tr>
</table>
</body>
</html>