Skip to content

Commit 22e69d2

Browse files
authored
Convert Belt sources to .res (#6271)
* More ninja.js cleanup * Convert to .res * Update artifact list
1 parent bae9420 commit 22e69d2

File tree

181 files changed

+17865
-17090
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

181 files changed

+17865
-17090
lines changed

jscomp/others/belt.ml renamed to jscomp/others/belt.res

Lines changed: 39 additions & 50 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
(* Copyright (C) 2015-2016 Bloomberg Finance L.P.
1+
/* Copyright (C) 2015-2016 Bloomberg Finance L.P.
22
*
33
* This program is free software: you can redistribute it and/or modify
44
* it under the terms of the GNU Lesser General Public License as published by
@@ -20,9 +20,9 @@
2020
*
2121
* You should have received a copy of the GNU Lesser General Public License
2222
* 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. */
2424

25-
(** The ReScript standard library.
25+
/*** The ReScript standard library.
2626
2727
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.
2828
@@ -200,61 +200,61 @@ let mySet2: t<(int, int), Comparable2.identity>
200200
201201
`Comparable1.identity` and `Comparable2.identity` are not the same using our encoding scheme.
202202
203-
*)
203+
*/
204204

205-
[@@@warning "-49"]
205+
@@warning("-49")
206206

207-
(** [`Belt.Id`]()
207+
/** [`Belt.Id`]()
208208
209209
Provide utilities to create identified comparators or hashes for
210210
data structures used below.
211211
212212
It create a unique identifier per module of
213213
functions so that different data structures with slightly different
214214
comparison functions won't mix
215-
*)
215+
*/
216216
module Id = Belt_Id
217217

218-
(** [`Belt.Array`]()
218+
/** [`Belt.Array`]()
219219
220220
**mutable array**: Utilities functions
221-
*)
221+
*/
222222
module Array = Belt_Array
223223

224-
(** [`Belt.SortArray`]()
224+
/** [`Belt.SortArray`]()
225225
226226
The top level provides some generic sort related utilities.
227227
228228
It also has two specialized inner modules
229229
[`Belt.SortArray.Int`]() and [`Belt.SortArray.String`]()
230-
*)
230+
*/
231231
module SortArray = Belt_SortArray
232232

233-
(** [`Belt.MutableQueue`]()
233+
/** [`Belt.MutableQueue`]()
234234
235235
An FIFO(first in first out) queue data structure
236-
*)
236+
*/
237237
module MutableQueue = Belt_MutableQueue
238238

239-
(** [`Belt.MutableStack`]()
239+
/** [`Belt.MutableStack`]()
240240
241241
An FILO(first in last out) stack data structure
242-
*)
242+
*/
243243
module MutableStack = Belt_MutableStack
244244

245-
(** [`Belt.List`]()
245+
/** [`Belt.List`]()
246246
247247
Utilities for List data type
248-
*)
248+
*/
249249
module List = Belt_List
250250

251-
(** [`Belt.Range`]()
251+
/** [`Belt.Range`]()
252252
253253
Utilities for a closed range `(from, start)`
254-
*)
254+
*/
255255
module Range = Belt_Range
256256

257-
(** [`Belt.Set`]()
257+
/** [`Belt.Set`]()
258258
259259
The top level provides generic **immutable** set operations.
260260
@@ -264,11 +264,10 @@ module Range = Belt_Range
264264
[`Belt.Set.Dict`](): This module separates data from function
265265
which is more verbose but slightly more efficient
266266
267-
*)
267+
*/
268268
module Set = Belt_Set
269269

270-
271-
(** [`Belt.Map`](),
270+
/** [`Belt.Map`](),
272271
273272
The top level provides generic **immutable** map operations.
274273
@@ -277,76 +276,66 @@ module Set = Belt_Set
277276
278277
[`Belt.Map.Dict`](): This module separates data from function
279278
which is more verbose but slightly more efficient
280-
*)
279+
*/
281280
module Map = Belt_Map
282281

283-
284-
(** [`Belt.MutableSet`]()
282+
/** [`Belt.MutableSet`]()
285283
286284
The top level provides generic **mutable** set operations.
287285
288286
It also has two specialized inner modules
289287
[`Belt.MutableSet.Int`]() and [`Belt.MutableSet.String`]()
290-
*)
288+
*/
291289
module MutableSet = Belt_MutableSet
292290

293-
(** [`Belt.MutableMap`]()
291+
/** [`Belt.MutableMap`]()
294292
295293
The top level provides generic **mutable** map operations.
296294
297295
It also has two specialized inner modules
298296
[`Belt.MutableMap.Int`]() and [`Belt.MutableMap.String`]()
299297
300-
*)
298+
*/
301299
module MutableMap = Belt_MutableMap
302300

303-
304-
(** [`Belt.HashSet`]()
301+
/** [`Belt.HashSet`]()
305302
306303
The top level provides generic **mutable** hash set operations.
307304
308305
It also has two specialized inner modules
309306
[`Belt.HashSet.Int`]() and [`Belt.HashSet.String`]()
310-
*)
307+
*/
311308
module HashSet = Belt_HashSet
312309

313-
314-
(** [`Belt.HashMap`]()
310+
/** [`Belt.HashMap`]()
315311
316312
The top level provides generic **mutable** hash map operations.
317313
318314
It also has two specialized inner modules
319315
[`Belt.HashMap.Int`]() and [`Belt.HashMap.String`]()
320-
*)
316+
*/
321317
module HashMap = Belt_HashMap
322318

323-
324-
(** [`Belt.Option`]()
319+
/** [`Belt.Option`]()
325320
326321
Utilities for option data type.
327-
*)
322+
*/
328323
module Option = Belt_Option
329324

330-
331-
(** [`Belt.Result`]()
325+
/** [`Belt.Result`]()
332326
333327
Utilities for result data type.
334-
*)
335-
328+
*/
336329
module Result = Belt_Result
337330

338-
(** [`Belt.Int`]()
331+
/** [`Belt.Int`]()
339332
340333
Utilities for Int.
341-
*)
342-
334+
*/
343335
module Int = Belt_Int
344336

345-
(** [`Belt.Float`]()
337+
/** [`Belt.Float`]()
346338
347339
Utilities for Float.
348-
*)
349-
340+
*/
350341
module Float = Belt_Float
351-
352-

0 commit comments

Comments
 (0)