@@ -110,11 +110,11 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
110
110
111
111
The motivation of creating such library is to provide BuckleScript users a
112
112
better end-to-end user experience, since the original OCaml stdlib was not
113
- writte with JS platform in mind, below are a list of areas this lib aims to
113
+ written with JS platform in mind, below are a list of areas this lib aims to
114
114
improve: < OL >
115
115
< li > 1. Consistency in name convention: camlCase, and arguments order</ li >
116
116
< li > 2. Exception thrown functions are all suffixed with < i > Exn</ i > , e.g, < i > getExn</ i > </ li >
117
- < li > 3. Beter peformance and smaller code size running on JS platform</ li >
117
+ < li > 3. Better performance and smaller code size running on JS platform</ li >
118
118
</ OL >
119
119
120
120
< p >
@@ -183,7 +183,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
183
183
< code class ="code "> I0.identity</ code > and < code class ="code "> I1.identity</ code > are not the same using our encoding scheme.
184
184
< p >
185
185
186
- < b > Collection Hierachy </ b >
186
+ < b > Collection Hierarchy </ b >
187
187
< p >
188
188
189
189
In general, we provide a generic collection module, but also create specialized
@@ -201,7 +201,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
201
201
< p >
202
202
203
203
Currently, both < i > Belt_Set</ i > and < i > Belt.Set</ i > are accessible to users for some
204
- technical rasons ,
204
+ technical reasons ,
205
205
we < b > strongly recommend</ b > users stick to qualified import, < i > Belt.Sort</ i > , we may hide
206
206
the internal, < i > i.e</ i > , < i > Belt_Set</ i > in the future< br >
207
207
@@ -216,11 +216,11 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
216
216
< a href ="Belt.Id.html "> < code class ="code "> Belt.Id</ code > </ a >
217
217
< p >
218
218
219
- Provide utiliites to create identified comparators or hashes for
219
+ Provide utilities to create identified comparators or hashes for
220
220
data structures used below.
221
221
< p >
222
222
223
- It create a unique identifer per module of
223
+ It create a unique identifier per module of
224
224
functions so that different data structures with slightly different
225
225
comparison functions won't mix< br >
226
226
@@ -231,7 +231,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
231
231
< a href ="Belt.Array.html "> < code class ="code "> Belt.Array</ code > </ a >
232
232
< p >
233
233
234
- < b > mutable array</ b > : Utililites functions< br >
234
+ < b > mutable array</ b > : Utilities functions< br >
235
235
236
236
</ div >
237
237
</ div >
@@ -240,7 +240,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
240
240
< a href ="Belt.SortArray.html "> < code class ="code "> Belt.SortArray</ code > </ a >
241
241
< p >
242
242
243
- The toplevel provides some generic sort related utililties .
243
+ The top level provides some generic sort related utilities .
244
244
< p >
245
245
246
246
It also has two specialized inner modules
@@ -289,15 +289,15 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
289
289
< a href ="Belt.Set.html "> < code class ="code "> Belt.Set</ code > </ a >
290
290
< p >
291
291
292
- The toplevel provides generic < b > immutable</ b > set operations.
292
+ The top level provides generic < b > immutable</ b > set operations.
293
293
< p >
294
294
295
295
It also has three specialized inner modules
296
296
< code class ="code "> Belt.Set.Int</ code > and < code class ="code "> Belt.Set.String</ code >
297
297
< p >
298
298
299
299
< code class ="code "> Belt.Set.Dict</ code > : This module separate date from function
300
- which is more verbbose but slightly more efficient< br >
300
+ which is more verbose but slightly more efficient< br >
301
301
302
302
</ div >
303
303
</ div >
@@ -306,15 +306,15 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
306
306
< a href ="Belt.Map.html "> < code class ="code "> Belt.Map</ code > </ a > ,
307
307
< p >
308
308
309
- The toplevel provides generic < b > immutable</ b > map operations.
309
+ The top level provides generic < b > immutable</ b > map operations.
310
310
< p >
311
311
312
312
It also has three specialized inner modules
313
313
< code class ="code "> Belt.Map.Int</ code > and < code class ="code "> Belt.Map.String</ code >
314
314
< p >
315
315
316
316
< code class ="code "> Belt.Map.Dict</ code > : This module separate date from function
317
- which is more verbbose but slightly more efficient< br >
317
+ which is more verbose but slightly more efficient< br >
318
318
319
319
</ div >
320
320
</ div >
@@ -323,7 +323,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
323
323
< a href ="Belt.MutableSet.html "> < code class ="code "> Belt.MutableSet</ code > </ a >
324
324
< p >
325
325
326
- The toplevel provides generic < b > mutable</ b > set operations.
326
+ The top level provides generic < b > mutable</ b > set operations.
327
327
< p >
328
328
329
329
It also has two specialized inner modules
@@ -336,7 +336,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
336
336
< a href ="Belt.MutableMap.html "> < code class ="code "> Belt.MutableMap</ code > </ a >
337
337
< p >
338
338
339
- The toplevel provides generic < b > mutable</ b > map operations.
339
+ The top level provides generic < b > mutable</ b > map operations.
340
340
< p >
341
341
342
342
It also has two specialized inner modules
@@ -349,7 +349,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
349
349
< a href ="Belt.HashSet.html "> < code class ="code "> Belt.HashSet</ code > </ a >
350
350
< p >
351
351
352
- The toplevel provides generic < b > mutable</ b > hash set operations.
352
+ The top level provides generic < b > mutable</ b > hash set operations.
353
353
< p >
354
354
355
355
It also has two specialized inner modules
@@ -362,7 +362,7 @@ <h1>Module <a href="type_Belt.html">Belt</a></h1>
362
362
< a href ="Belt.HashMap.html "> < code class ="code "> Belt.HashMap</ code > </ a >
363
363
< p >
364
364
365
- The toplevel provides generic < b > mutable</ b > hash map operations.
365
+ The top level provides generic < b > mutable</ b > hash map operations.
366
366
< p >
367
367
368
368
It also has two specialized inner modules
0 commit comments