-
Notifications
You must be signed in to change notification settings - Fork 465
/
Copy pathbelt_internalBucketsType.ml
60 lines (54 loc) · 2.13 KB
/
belt_internalBucketsType.ml
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
(* Copyright (C) 2017 Authors of BuckleScript
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* In addition to the permissions granted to you by the LGPL, you may combine
* or link a "work that uses the Library" with a publicly distributed version
* of this file to produce a combined library or application, then distribute
* that combined work under the terms of your choosing, with no requirement
* to comply with the obligations normally placed on you by section 4 of the
* LGPL version 3 (or the corresponding section of a later version of the LGPL
* should you choose to use a later version).
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)
type 'a opt = 'a Js.undefined
type ('hash, 'eq, 'c) container =
{ mutable size: int; (* number of entries *)
mutable buckets: 'c opt array; (* the buckets *)
hash: 'hash;
eq: 'eq
}
[@@bs.deriving abstract]
module A = Belt_Array
external toOpt : 'a opt -> 'a option = "#undefined_to_opt"
external return : 'a -> 'a opt = "%identity"
let emptyOpt = Js.undefined
let rec power_2_above x n =
if x >= n then x
else if x * 2 < x then x (* overflow *)
else power_2_above (x * 2) n
let make ~hash ~eq ~hintSize =
let s = power_2_above 16 hintSize in
container
~size:0
~buckets:(A.makeUninitialized s)
~hash
~eq
let clear h =
sizeSet h 0;
let h_buckets = bucketsGet h in
let len = A.length h_buckets in
for i = 0 to len - 1 do
A.setUnsafe h_buckets i emptyOpt
done
let isEmpty h = sizeGet h = 0