<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link rel="previous" href="Reins.DoubleQueue.html">
<link rel="next" href="Reins.SkewBinaryList.html">
<link rel="Up" href="Reins.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 modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="Reins" rel="Chapter" href="Reins.html"><title>Reins.SList</title>
</head>
<body>
<div class="navbar"><a href="Reins.DoubleQueue.html">Previous</a>
<a href="Reins.html">Up</a>
<a href="Reins.SkewBinaryList.html">Next</a>
</div>
<center><h1>Module <a href="type_Reins.SList.html">Reins.SList</a></h1></center>
<br>
<pre><span class="keyword">module</span> SList: <code class="code">sig</code> <a href="Reins.SList.html">..</a> <code class="code">end</code></pre><hr width="100%">
<pre><span class="keyword">type</span> <a name="TYPEt"></a><code class="type">'a</code> t = <code class="type">'a list</code> </pre>
<pre><span class="keyword">val</span> <a name="VALempty"></a>empty : <code class="type">'a list</code></pre><div class="info">
The empty list. aka []<br>
</div>
<pre><span class="keyword">val</span> <a name="VALis_empty"></a>is_empty : <code class="type">'a list -> bool</code></pre><div class="info">
Returns true if the list is empty<br>
</div>
<pre><span class="keyword">val</span> <a name="VALcons"></a>cons : <code class="type">'a -> 'a list -> 'a list</code></pre><div class="info">
<code class="code">cons x t</code> Adds <code class="code">x</code> onto the front of the list <code class="code">t</code>. Runs in
O(1) time and stack space.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALpop"></a>pop : <code class="type">'a list -> 'a * 'a list</code></pre><div class="info">
<code class="code">pop t</code> equivalent to <code class="code">(hd t), (tl t)</code> but is more efficient.
Runs in amortized O(1) time and stack space. If the list is
empty, it raises <code class="code">Failure "pop"</code>.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALfold"></a>fold : <code class="type">('a -> 'b -> 'a) -> 'a -> 'b list -> 'a</code></pre><div class="info">
<code class="code">fold f acc l</code> Equivalent to <code class="code">fold_left f acc l</code><br>
</div>
<pre><span class="keyword">val</span> <a name="VALsnoc"></a>snoc : <code class="type">'a -> 'a list -> 'a list</code></pre><div class="info">
<code class="code">snoc x t</code> Adds the element <code class="code">x</code> to the back of the list <code class="code">t</code>.
Runs in O(n) time and O(1) stack space where n is the length of
the list.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALlast"></a>last : <code class="type">'a <a href="Reins.SList.html#TYPEt">t</a> -> 'a</code></pre><div class="info">
<code class="code">last t</code> Returns the element at the back of the list. If the
list is empty, it raises <code class="code">Failure "last"</code>. Runs in O(1) stack
and O(n) time.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALto_list"></a>to_list : <code class="type">'a -> 'a</code></pre><div class="info">
<code class="code">to_list t</code> Included for compatibility with the common ListSig
signature. This function does not perform any computation.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALfrom_list"></a>from_list : <code class="type">'a -> 'a</code></pre><div class="info">
<code class="code">from_list t</code> Included for compatibility with the common ListSig
signature. This function does not perform any computation.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALto_string"></a>to_string : <code class="type">('a -> string) -> 'a list -> string</code></pre><div class="info">
<code class="code">to_string to_s t</code> Convert the list <code class="code">t</code> into a string using
<code class="code">to_s</code> to individually convert each element into a string. Runs
in O(n*st) where st is the running time of <code class="code">to_s</code> and uses O(ss)
stack space where ss is the amount of stack required by <code class="code">to_s</code>.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALcompare"></a>compare : <code class="type">('a -> 'b -> int) -> 'a list -> 'b list -> int</code></pre><div class="info">
<code class="code">compare f t1 t2</code> Compares the lists <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code> to
compare individual elements. Returns 0 if <code class="code">t1</code> and <code class="code">t2</code> are
equal (under f). Returns <code class="code"><0</code> if <code class="code">t1</code> is less than <code class="code">t2</code> and
returns <code class="code">>0</code> otherwise.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALgen"></a>gen : <code class="type">(?size:int -> Random.State.t -> 'a) -> ?size:int -> Random.State.t -> 'a list</code></pre><div class="info">
<code class="code">gen f ?size rs</code> Generates a random list whose length is bounded
by <code class="code">size</code>. Each element in the list is computed by calling <code class="code">f
?size rs</code>. Runs in time O(<code class="code">size</code> * ft) where ft is the running
time of <code class="code">f</code> and uses O(fs) stack space where fs is the stack space
of <code class="code">f</code>.<br>
</div>
<br>
The following are all implemented in the standard library<br>
<pre><span class="keyword">val</span> <a name="VALlength"></a>length : <code class="type">'a list -> int</code></pre><pre><span class="keyword">val</span> <a name="VALhd"></a>hd : <code class="type">'a list -> 'a</code></pre><pre><span class="keyword">val</span> <a name="VALtl"></a>tl : <code class="type">'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALnth"></a>nth : <code class="type">'a list -> int -> 'a</code></pre><pre><span class="keyword">val</span> <a name="VALrev"></a>rev : <code class="type">'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALappend"></a>append : <code class="type">'a list -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALrev_append"></a>rev_append : <code class="type">'a list -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALconcat"></a>concat : <code class="type">'a list list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALflatten"></a>flatten : <code class="type">'a list list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALiter"></a>iter : <code class="type">('a -> unit) -> 'a list -> unit</code></pre><pre><span class="keyword">val</span> <a name="VALmap"></a>map : <code class="type">('a -> 'b) -> 'a list -> 'b list</code></pre><pre><span class="keyword">val</span> <a name="VALrev_map"></a>rev_map : <code class="type">('a -> 'b) -> 'a list -> 'b list</code></pre><pre><span class="keyword">val</span> <a name="VALfold_left"></a>fold_left : <code class="type">('a -> 'b -> 'a) -> 'a -> 'b list -> 'a</code></pre><pre><span class="keyword">val</span> <a name="VALfold_right"></a>fold_right : <code class="type">('a -> 'b -> 'b) -> 'a list -> 'b -> 'b</code></pre><pre><span class="keyword">val</span> <a name="VALiter2"></a>iter2 : <code class="type">('a -> 'b -> unit) -> 'a list -> 'b list -> unit</code></pre><pre><span class="keyword">val</span> <a name="VALmap2"></a>map2 : <code class="type">('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list</code></pre><pre><span class="keyword">val</span> <a name="VALrev_map2"></a>rev_map2 : <code class="type">('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list</code></pre><pre><span class="keyword">val</span> <a name="VALfold_left2"></a>fold_left2 : <code class="type">('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a</code></pre><pre><span class="keyword">val</span> <a name="VALfold_right2"></a>fold_right2 : <code class="type">('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c</code></pre><pre><span class="keyword">val</span> <a name="VALfor_all"></a>for_all : <code class="type">('a -> bool) -> 'a list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALexists"></a>exists : <code class="type">('a -> bool) -> 'a list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALfor_all2"></a>for_all2 : <code class="type">('a -> 'b -> bool) -> 'a list -> 'b list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALexists2"></a>exists2 : <code class="type">('a -> 'b -> bool) -> 'a list -> 'b list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALmem"></a>mem : <code class="type">'a -> 'a list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALmemq"></a>memq : <code class="type">'a -> 'a list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALfind"></a>find : <code class="type">('a -> bool) -> 'a list -> 'a</code></pre><pre><span class="keyword">val</span> <a name="VALfilter"></a>filter : <code class="type">('a -> bool) -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALfind_all"></a>find_all : <code class="type">('a -> bool) -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALpartition"></a>partition : <code class="type">('a -> bool) -> 'a list -> 'a list * 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALassoc"></a>assoc : <code class="type">'a -> ('a * 'b) list -> 'b</code></pre><pre><span class="keyword">val</span> <a name="VALassq"></a>assq : <code class="type">'a -> ('a * 'b) list -> 'b</code></pre><pre><span class="keyword">val</span> <a name="VALmem_assoc"></a>mem_assoc : <code class="type">'a -> ('a * 'b) list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALmem_assq"></a>mem_assq : <code class="type">'a -> ('a * 'b) list -> bool</code></pre><pre><span class="keyword">val</span> <a name="VALremove_assoc"></a>remove_assoc : <code class="type">'a -> ('a * 'b) list -> ('a * 'b) list</code></pre><pre><span class="keyword">val</span> <a name="VALremove_assq"></a>remove_assq : <code class="type">'a -> ('a * 'b) list -> ('a * 'b) list</code></pre><pre><span class="keyword">val</span> <a name="VALsplit"></a>split : <code class="type">('a * 'b) list -> 'a list * 'b list</code></pre><pre><span class="keyword">val</span> <a name="VALcombine"></a>combine : <code class="type">'a list -> 'b list -> ('a * 'b) list</code></pre><pre><span class="keyword">val</span> <a name="VALsort"></a>sort : <code class="type">('a -> 'a -> int) -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALstable_sort"></a>stable_sort : <code class="type">('a -> 'a -> int) -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALfast_sort"></a>fast_sort : <code class="type">('a -> 'a -> int) -> 'a list -> 'a list</code></pre><pre><span class="keyword">val</span> <a name="VALmerge"></a>merge : <code class="type">('a -> 'a -> int) -> 'a list -> 'a list -> 'a list</code></pre></body></html>
