Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > 7fd1c43f42958fba85e306866166f488 > files > 15

ocaml-bisect-devel-1.0-3.beta.1mdv2010.0.i586.rpm

<!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="ReportStat.html">
<link rel="next" href="Runtime.html">
<link rel="Up" 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 modules" rel=Appendix href="index_modules.html">
<link title="Common" rel="Chapter" href="Common.html">
<link title="ReportGeneric" rel="Chapter" href="ReportGeneric.html">
<link title="ReportHTML" rel="Chapter" href="ReportHTML.html">
<link title="ReportStat" rel="Chapter" href="ReportStat.html">
<link title="ReportUtils" rel="Chapter" href="ReportUtils.html">
<link title="Runtime" rel="Chapter" href="Runtime.html"><title>Bisect : ReportUtils</title>
</head>
<body>
<div class="navbar"><a href="ReportStat.html">Previous</a>
&nbsp;<a href="index.html">Up</a>
&nbsp;<a href="Runtime.html">Next</a>
</div>
<center><h1>Module <a href="type_ReportUtils.html">ReportUtils</a></h1></center>
<br>
<pre><span class="keyword">module</span> ReportUtils: <code class="code">sig</code> <a href="ReportUtils.html">..</a> <code class="code">end</code></pre>This module defines utility functions for the report program.<br>
<hr width="100%">
<pre><span class="keyword">val</span> <a name="VALversion"></a>version : <code class="type">string</code></pre><div class="info">
The Bisect version, as a string.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALurl"></a>url : <code class="type">string</code></pre><div class="info">
The Bisect URL, as a string.<br>
</div>
<pre><span class="keyword">val</span> <a name="VAL(++)"></a>(++) : <code class="type">int -> int -> int</code></pre><div class="info">
Similar to <code class="code">(+)</code> except that overflow is handled by returning:<ul>
<li><code class="code">max_int</code> if the result should be above <code class="code">max_int</code>;</li>
<li><code class="code">min_int</code> if the result should be below <code class="code">min_int</code>.</li>
</ul>
<br>
</div>
<pre><span class="keyword">val</span> <a name="VAL(+|)"></a>(+|) : <code class="type">int array -> int array -> int array</code></pre><div class="info">
Returns the sum of the passed arrays, using <code class="code">(++)</code> to sum elements.
    The length of the returned array is the maximum of the lengths of
    the passed arrays, missing elements from the smallest array are
    supposed to be equal to <code class="code">0</code>.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALmkdirs"></a>mkdirs : <code class="type">string -> unit</code></pre><div class="info">
Creates the directory whose path is passed, and all necessary parent
    directories. Raises <code class="code">Unix.Unix_error</code> if creation fails.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALsplit"></a>split : <code class="type">('a -> bool) -> 'a list -> 'a list * 'a list</code></pre><div class="info">
<code class="code">split p [e1; ...; en]</code> returns <code class="code">([e1; ...; e(i-1)], [ei; ...; en])</code>
    where is is the lowest index such that <code class="code">(p ei)</code> evaluates to false.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALsplit_after"></a>split_after : <code class="type">int -> 'a list -> 'a list * 'a list</code></pre><div class="info">
<code class="code">split_after k [e1; ...; en]</code> returns <code class="code">([e1; ...; ek], [e(k+1); ...; en])</code>.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALopen_both"></a>open_both : <code class="type">string -> string -> Pervasives.in_channel * Pervasives.out_channel</code></pre><div class="info">
<code class="code">open_both in_file out_file</code> return a <code class="code">(i, o)</code> couple where:<ul>
<li><code class="code">i</code> is an input channel for <code class="code">in_file</code>;</li>
<li><code class="code">o</code> is an output channel for <code class="code">out_file</code>.
    Raises an exception if an error occurs; ensures that either both files
    are either opened or closed.</li>
</ul>
<br>
</div>
<pre><span class="keyword">val</span> <a name="VALoutput_strings"></a>output_strings : <code class="type">string list -> (string * string) list -> Pervasives.out_channel -> unit</code></pre><div class="info">
<code class="code">output_strings lines mapping ch</code> writes the elements of <code class="code">lines</code>
    to the channel <code class="code">ch</code>. Each line is written after substituting <i>$(xyz)</i>
    sequences as described by <code class="code">Buffer.add_substitute</code>. The substitution is
    based on the association list <code class="code">mapping</code>.
    Raises en exception if an error occurs.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALoutput_bytes"></a>output_bytes : <code class="type">int array -> string -> unit</code></pre><div class="info">
<code class="code">output_bytes data filename</code> creates the file <code class="code">filename</code> and writes
    the bytes from <code class="code">data</code> to it. Each array element is considered as a
    byte value.
    Raises en exception if an error occurs.<br>
</div>
</body></html>