You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: jscomp/others/belt.res
+39-50Lines changed: 39 additions & 50 deletions
Original file line number
Diff line number
Diff line change
@@ -1,4 +1,4 @@
1
-
(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
1
+
/* Copyright (C) 2015-2016 Bloomberg Finance L.P.
2
2
*
3
3
* This program is free software: you can redistribute it and/or modify
4
4
* it under the terms of the GNU Lesser General Public License as published by
@@ -20,9 +20,9 @@
20
20
*
21
21
* You should have received a copy of the GNU Lesser General Public License
22
22
* along with this program; if not, write to the Free Software
23
-
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
23
+
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
24
24
25
-
(** The ReScript standard library.
25
+
/*** The ReScript standard library.
26
26
27
27
Belt is currently mostly covering collection types. It has no string or date functions yet, although Belt.String is in the works. In the meantime, use [Js.String](js/string) for string functions and [Js.Date](js/date) for date functions.
28
28
@@ -200,61 +200,61 @@ let mySet2: t<(int, int), Comparable2.identity>
200
200
201
201
`Comparable1.identity` and `Comparable2.identity` are not the same using our encoding scheme.
202
202
203
-
*)
203
+
*/
204
204
205
-
[@@@warning"-49"]
205
+
@@warning("-49")
206
206
207
-
(** [`Belt.Id`]()
207
+
/** [`Belt.Id`]()
208
208
209
209
Provide utilities to create identified comparators or hashes for
210
210
data structures used below.
211
211
212
212
It create a unique identifier per module of
213
213
functions so that different data structures with slightly different
214
214
comparison functions won't mix
215
-
*)
215
+
*/
216
216
moduleId=Belt_Id
217
217
218
-
(** [`Belt.Array`]()
218
+
/** [`Belt.Array`]()
219
219
220
220
**mutable array**: Utilities functions
221
-
*)
221
+
*/
222
222
moduleArray=Belt_Array
223
223
224
-
(** [`Belt.SortArray`]()
224
+
/** [`Belt.SortArray`]()
225
225
226
226
The top level provides some generic sort related utilities.
227
227
228
228
It also has two specialized inner modules
229
229
[`Belt.SortArray.Int`]() and [`Belt.SortArray.String`]()
230
-
*)
230
+
*/
231
231
moduleSortArray=Belt_SortArray
232
232
233
-
(** [`Belt.MutableQueue`]()
233
+
/** [`Belt.MutableQueue`]()
234
234
235
235
An FIFO(first in first out) queue data structure
236
-
*)
236
+
*/
237
237
moduleMutableQueue=Belt_MutableQueue
238
238
239
-
(** [`Belt.MutableStack`]()
239
+
/** [`Belt.MutableStack`]()
240
240
241
241
An FILO(first in last out) stack data structure
242
-
*)
242
+
*/
243
243
moduleMutableStack=Belt_MutableStack
244
244
245
-
(** [`Belt.List`]()
245
+
/** [`Belt.List`]()
246
246
247
247
Utilities for List data type
248
-
*)
248
+
*/
249
249
moduleList=Belt_List
250
250
251
-
(** [`Belt.Range`]()
251
+
/** [`Belt.Range`]()
252
252
253
253
Utilities for a closed range `(from, start)`
254
-
*)
254
+
*/
255
255
moduleRange=Belt_Range
256
256
257
-
(** [`Belt.Set`]()
257
+
/** [`Belt.Set`]()
258
258
259
259
The top level provides generic **immutable** set operations.
260
260
@@ -264,11 +264,10 @@ module Range = Belt_Range
264
264
[`Belt.Set.Dict`](): This module separates data from function
265
265
which is more verbose but slightly more efficient
266
266
267
-
*)
267
+
*/
268
268
moduleSet=Belt_Set
269
269
270
-
271
-
(** [`Belt.Map`](),
270
+
/** [`Belt.Map`](),
272
271
273
272
The top level provides generic **immutable** map operations.
274
273
@@ -277,76 +276,66 @@ module Set = Belt_Set
277
276
278
277
[`Belt.Map.Dict`](): This module separates data from function
279
278
which is more verbose but slightly more efficient
280
-
*)
279
+
*/
281
280
moduleMap=Belt_Map
282
281
283
-
284
-
(** [`Belt.MutableSet`]()
282
+
/** [`Belt.MutableSet`]()
285
283
286
284
The top level provides generic **mutable** set operations.
287
285
288
286
It also has two specialized inner modules
289
287
[`Belt.MutableSet.Int`]() and [`Belt.MutableSet.String`]()
290
-
*)
288
+
*/
291
289
moduleMutableSet=Belt_MutableSet
292
290
293
-
(** [`Belt.MutableMap`]()
291
+
/** [`Belt.MutableMap`]()
294
292
295
293
The top level provides generic **mutable** map operations.
296
294
297
295
It also has two specialized inner modules
298
296
[`Belt.MutableMap.Int`]() and [`Belt.MutableMap.String`]()
299
297
300
-
*)
298
+
*/
301
299
moduleMutableMap=Belt_MutableMap
302
300
303
-
304
-
(** [`Belt.HashSet`]()
301
+
/** [`Belt.HashSet`]()
305
302
306
303
The top level provides generic **mutable** hash set operations.
307
304
308
305
It also has two specialized inner modules
309
306
[`Belt.HashSet.Int`]() and [`Belt.HashSet.String`]()
310
-
*)
307
+
*/
311
308
moduleHashSet=Belt_HashSet
312
309
313
-
314
-
(** [`Belt.HashMap`]()
310
+
/** [`Belt.HashMap`]()
315
311
316
312
The top level provides generic **mutable** hash map operations.
317
313
318
314
It also has two specialized inner modules
319
315
[`Belt.HashMap.Int`]() and [`Belt.HashMap.String`]()
0 commit comments