1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
<!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">
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="Start" href="index.html">
<link rel="next" href="Misc.Stdlib.Option.html">
<link rel="Up" href="Misc.Stdlib.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="Arg_helper" rel="Chapter" href="Arg_helper.html">
<link title="Ast_helper" rel="Chapter" href="Ast_helper.html">
<link title="Ast_invariants" rel="Chapter" href="Ast_invariants.html">
<link title="Ast_iterator" rel="Chapter" href="Ast_iterator.html">
<link title="Ast_mapper" rel="Chapter" href="Ast_mapper.html">
<link title="Asttypes" rel="Chapter" href="Asttypes.html">
<link title="Attr_helper" rel="Chapter" href="Attr_helper.html">
<link title="Build_path_prefix_map" rel="Chapter" href="Build_path_prefix_map.html">
<link title="Builtin_attributes" rel="Chapter" href="Builtin_attributes.html">
<link title="CamlinternalMenhirLib" rel="Chapter" href="CamlinternalMenhirLib.html">
<link title="Ccomp" rel="Chapter" href="Ccomp.html">
<link title="Clflags" rel="Chapter" href="Clflags.html">
<link title="Compiler_libs" rel="Chapter" href="Compiler_libs.html">
<link title="Config" rel="Chapter" href="Config.html">
<link title="Consistbl" rel="Chapter" href="Consistbl.html">
<link title="Depend" rel="Chapter" href="Depend.html">
<link title="Docstrings" rel="Chapter" href="Docstrings.html">
<link title="Domainstate" rel="Chapter" href="Domainstate.html">
<link title="Identifiable" rel="Chapter" href="Identifiable.html">
<link title="Int_replace_polymorphic_compare" rel="Chapter" href="Int_replace_polymorphic_compare.html">
<link title="Lexer" rel="Chapter" href="Lexer.html">
<link title="Load_path" rel="Chapter" href="Load_path.html">
<link title="Location" rel="Chapter" href="Location.html">
<link title="Longident" rel="Chapter" href="Longident.html">
<link title="Misc" rel="Chapter" href="Misc.html">
<link title="Numbers" rel="Chapter" href="Numbers.html">
<link title="Parse" rel="Chapter" href="Parse.html">
<link title="Parser" rel="Chapter" href="Parser.html">
<link title="Parsetree" rel="Chapter" href="Parsetree.html">
<link title="Pparse" rel="Chapter" href="Pparse.html">
<link title="Pprintast" rel="Chapter" href="Pprintast.html">
<link title="Printast" rel="Chapter" href="Printast.html">
<link title="Profile" rel="Chapter" href="Profile.html">
<link title="Strongly_connected_components" rel="Chapter" href="Strongly_connected_components.html">
<link title="Syntaxerr" rel="Chapter" href="Syntaxerr.html">
<link title="Targetint" rel="Chapter" href="Targetint.html">
<link title="Terminfo" rel="Chapter" href="Terminfo.html">
<link title="Warnings" rel="Chapter" href="Warnings.html"><title>Misc.Stdlib.List</title>
</head>
<body>
<div class="navbar"> <a class="up" href="Misc.Stdlib.html" title="Misc.Stdlib">Up</a>
<a class="post" href="Misc.Stdlib.Option.html" title="Misc.Stdlib.Option">Next</a>
</div>
<h1>Module <a href="type_Misc.Stdlib.List.html">Misc.Stdlib.List</a></h1>
<pre><span id="MODULEList"><span class="keyword">module</span> List</span>: <code class="code"><span class="keyword">sig</span></code> <a href="Misc.Stdlib.List.html">..</a> <code class="code"><span class="keyword">end</span></code></pre><hr width="100%">
<pre><span id="TYPEt"><span class="keyword">type</span> <code class="type">'a</code> t</span> = <code class="type">'a list</code> </pre>
<pre><span id="VALcompare"><span class="keyword">val</span> compare</span> : <code class="type">('a -> 'a -> int) -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> int</code></pre><div class="info ">
<div class="info-desc">
<p>The lexicographic order supported by the provided order.
There is no constraint on the relative lengths of the lists.</p>
</div>
</div>
<pre><span id="VALequal"><span class="keyword">val</span> equal</span> : <code class="type">('a -> 'a -> bool) -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> bool</code></pre><div class="info ">
<div class="info-desc">
<p>Returns <code class="code"><span class="keyword">true</span></code> iff the given lists have the same length and content
with respect to the given equality function.</p>
</div>
</div>
<pre><span id="VALfind_map"><span class="keyword">val</span> find_map</span> : <code class="type">('a -> 'b option) -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> 'b option</code></pre><div class="info ">
<div class="info-desc">
<p><code class="code">find_map f l</code> returns the first evaluation of <code class="code">f</code> that returns <code class="code"><span class="constructor">Some</span></code>,
or returns None if there is no such element.</p>
</div>
</div>
<pre><span id="VALsome_if_all_elements_are_some"><span class="keyword">val</span> some_if_all_elements_are_some</span> : <code class="type">'a option <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> option</code></pre><div class="info ">
<div class="info-desc">
<p>If all elements of the given list are <code class="code"><span class="constructor">Some</span> _</code> then <code class="code"><span class="constructor">Some</span> xs</code>
is returned with the <code class="code">xs</code> being the contents of those <code class="code"><span class="constructor">Some</span></code>s, with
order preserved. Otherwise return <code class="code"><span class="constructor">None</span></code>.</p>
</div>
</div>
<pre><span id="VALmap2_prefix"><span class="keyword">val</span> map2_prefix</span> : <code class="type">('a -> 'b -> 'c) -><br> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -><br> 'b <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> 'c <a href="Misc.Stdlib.List.html#TYPEt">t</a> * 'b <a href="Misc.Stdlib.List.html#TYPEt">t</a></code></pre><div class="info ">
<div class="info-desc">
<p><code class="code"><span class="keyword">let</span> r1, r2 = map2_prefix f l1 l2</code>
If <code class="code">l1</code> is of length n and <code class="code">l2 = h2 @ t2</code> with h2 of length n,
r1 is <code class="code"><span class="constructor">List</span>.map2 f l1 h1</code> and r2 is t2.</p>
</div>
</div>
<pre><span id="VALsplit_at"><span class="keyword">val</span> split_at</span> : <code class="type">int -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> -> 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a> * 'a <a href="Misc.Stdlib.List.html#TYPEt">t</a></code></pre><div class="info ">
<div class="info-desc">
<p><code class="code">split_at n l</code> returns the pair <code class="code">before, after</code> where <code class="code">before</code> is
the <code class="code">n</code> first elements of <code class="code">l</code> and <code class="code">after</code> the remaining ones.
If <code class="code">l</code> has less than <code class="code">n</code> elements, raises Invalid_argument.</p>
</div>
</div>
<pre><span id="VALis_prefix"><span class="keyword">val</span> is_prefix</span> : <code class="type">equal:('a -> 'a -> bool) -> 'a list -> of_:'a list -> bool</code></pre><div class="info ">
<div class="info-desc">
<p>Returns <code class="code"><span class="keyword">true</span></code> iff the given list, with respect to the given equality
function on list members, is a prefix of the list <code class="code">of_</code>.</p>
</div>
</div>
<pre><code><span id="TYPElongest_common_prefix_result"><span class="keyword">type</span> <code class="type">'a</code> longest_common_prefix_result</span> = private {</code></pre><table class="typetable">
<tr>
<td align="left" valign="top" >
<code> </code></td>
<td align="left" valign="top" >
<code><span id="TYPEELTlongest_common_prefix_result.longest_common_prefix">longest_common_prefix</span> : <code class="type">'a list</code>;</code></td>
</tr>
<tr>
<td align="left" valign="top" >
<code> </code></td>
<td align="left" valign="top" >
<code><span id="TYPEELTlongest_common_prefix_result.first_without_longest_common_prefix">first_without_longest_common_prefix</span> : <code class="type">'a list</code>;</code></td>
</tr>
<tr>
<td align="left" valign="top" >
<code> </code></td>
<td align="left" valign="top" >
<code><span id="TYPEELTlongest_common_prefix_result.second_without_longest_common_prefix">second_without_longest_common_prefix</span> : <code class="type">'a list</code>;</code></td>
</tr></table>
<code>}</code>
<pre><span id="VALfind_and_chop_longest_common_prefix"><span class="keyword">val</span> find_and_chop_longest_common_prefix</span> : <code class="type">equal:('a -> 'a -> bool) -><br> first:'a list -><br> second:'a list -> 'a <a href="Misc.Stdlib.List.html#TYPElongest_common_prefix_result">longest_common_prefix_result</a></code></pre><div class="info ">
<div class="info-desc">
<p>Returns the longest list that, with respect to the provided equality
function, is a prefix of both of the given lists. The input lists,
each with such longest common prefix removed, are also returned.</p>
</div>
</div>
</body></html>
|
