Skip to content

[Docs] Fix many typos #2535

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 22, 2018
Merged

[Docs] Fix many typos #2535

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 14 additions & 14 deletions docs/api/Belt.Map.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -179,7 +179,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>

</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.comapre x y));;
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.compare x y));;
let s = make ~id:(module IntCmp)
</code></pre> </pre>
</div>
Expand All @@ -192,7 +192,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>

</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.comapre x y));;
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.compare x y));;
isEmpty (ofArray [|1,"1"|] ~id:(module IntCmp)) = false;;
</code></pre> </pre>
</div>
Expand All @@ -205,7 +205,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>

</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.comapre x y));;
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.compare x y));;
has (ofArray [|1,"1"|] ~id:(module IntCmp)) 1 = true;;
</code></pre> </pre>
</div>
Expand Down Expand Up @@ -252,7 +252,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;

let s0 = ofArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];;
let acc = ref [] ;;
Expand All @@ -274,7 +274,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;

let s0 = ofArray ~id:(module IntCmp) [|4,"4";1,"1";2,"2,"3""|];;
reduce s0 [] (fun acc k v -&gt; (k,v) acc ) = [4,"4";3,"3";2,"2";1,"1"];;
Expand Down Expand Up @@ -312,7 +312,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;
size (ofArray [2,"2"; 2,"1"; 3,"3"] ~id:(module IntCmp)) = 2 ;;
</code></pre> </pre>
</div>
Expand All @@ -326,7 +326,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;
toArray (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [1,"1";2,"2";3,"3"]
</code></pre> </pre>
</div>
Expand All @@ -352,7 +352,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;
toArray (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) = [1,"1";2,"2";3,"3"]
</code></pre> </pre>
</div>
Expand All @@ -366,7 +366,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;
keysToArray (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) =
[|1;2;3|];;
</code></pre> </pre>
Expand All @@ -381,7 +381,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;
valuesToArray (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) =
[|"1";"2";"3"|];;
</code></pre> </pre>
Expand Down Expand Up @@ -472,7 +472,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;
get (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) 2 =
Some "2";;
get (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp)) 2 =
Expand Down Expand Up @@ -527,7 +527,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;

let s0 = (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp));;

Expand Down Expand Up @@ -563,7 +563,7 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>
</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.comapre x y));;
(val IntCmp.comparableU ~cmp:(fun[@bs] (x:int) y -&gt; Pervasives.compare x y));;

let s0 = (ofArray [2,"2"; 1,"1"; 3,"3"] ~id:(module IntCmp));;

Expand Down Expand Up @@ -723,4 +723,4 @@ <h1>Module <a href="type_Belt.Map.html">Belt.Map</a></h1>

</div>

</body></html>
</body></html>
30 changes: 15 additions & 15 deletions docs/api/Belt.Set.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -176,7 +176,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>

</div>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.comapre x y))
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparable ~cmp:(fun (x:int) y -&gt; Pervasives.compare x y))
let s = make ~id:(module IntCmp)
</code></pre> </pre>
</div>
Expand All @@ -191,7 +191,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<div class="examples">
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp = (val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
toArray (ofArray [1;3;2;4] (module IntCmp)) = [1;2;3;4]

</code></pre> </pre>
Expand Down Expand Up @@ -222,7 +222,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
isEmpty (ofArray [||] ~id:(module IntCmp)) = true;;
isEmpty (ofArray [|1|] ~id:(module IntCmp)) = true;;
</code></pre> </pre>
Expand All @@ -238,7 +238,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let v = ofArray [|1;4;2;5|] ~id:(module IntCmp);;
has v 3 = false;;
has v 1 = true;;
Expand All @@ -256,7 +256,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = make ~id:(module IntCmp);;
let s1 = add s0 1 ;;
let s2 = add s1 2;;
Expand Down Expand Up @@ -294,7 +294,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|2;3;1;4;5|];;
let s1 = remove s0 1 ;;
let s2 = remove s1 3 ;;
Expand Down Expand Up @@ -331,7 +331,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
let s1 = ofArray ~id:(module IntCmp) [|5;2;3;1;5;4;|];;
toArray (union s0 s1) = [|1;2;3;4;5;6|]
Expand All @@ -349,7 +349,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
let s1 = ofArray ~id:(module IntCmp) [|5;2;3;1;5;4;|];;
toArray (intersect s0 s1) = [|2;3;5|]
Expand All @@ -367,7 +367,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
let s1 = ofArray ~id:(module IntCmp) [|5;2;3;1;5;4;|];;
toArray (diff s0 s1) = [|6|];;
Expand All @@ -386,7 +386,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
let s1 = ofArray ~id:(module IntCmp) [|5;2;3;1;5;4;|];;
let s2 = intersect s0 s1;;
Expand Down Expand Up @@ -431,7 +431,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
let acc = ref [] ;;
forEach s0 (fun x -&gt; acc := x !acc);;
Expand All @@ -451,7 +451,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
reduce s0 [] Bs.List.add = [6;5;3;2];;
</code></pre> </pre>
Expand Down Expand Up @@ -514,7 +514,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
size s0 = 4;;
</code></pre> </pre>
Expand All @@ -531,7 +531,7 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>
<pre class="example"> <pre class="codepre"><code class="code"> module IntCmp =
(val IntCmp.comparableU
~cmp:(fun[@bs]
(x:int) y -&gt; Pervasives.comapre x y));;
(x:int) y -&gt; Pervasives.compare x y));;
let s0 = ofArray ~id:(module IntCmp) [|5;2;3;5;6|]];;
toArray s0 = [|2;3;5;6|];;
</code></pre> </pre>
Expand Down Expand Up @@ -675,4 +675,4 @@ <h1>Module <a href="type_Belt.Set.html">Belt.Set</a></h1>

</div>

</body></html>
</body></html>
Loading