aboutsummaryrefslogtreecommitdiff
path: root/stdlib/source/lux/data/collection/dictionary.lux
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--stdlib/source/lux/data/collection/dictionary.lux10
1 files changed, 5 insertions, 5 deletions
diff --git a/stdlib/source/lux/data/collection/dictionary.lux b/stdlib/source/lux/data/collection/dictionary.lux
index 8e967b768..5add5c74a 100644
--- a/stdlib/source/lux/data/collection/dictionary.lux
+++ b/stdlib/source/lux/data/collection/dictionary.lux
@@ -177,12 +177,12 @@
(->bit-position (level-index level hash)))
(def: (bit-position-is-set? bit bitmap)
- (-> BitPosition BitMap Bool)
+ (-> BitPosition BitMap Bit)
(not (n/= clean-bitmap (i64.and bit bitmap))))
## Figures out whether a bitmap only contains a single bit-position.
(def: only-bit-position?
- (-> BitPosition BitMap Bool)
+ (-> BitPosition BitMap Bit)
n/=)
(def: (set-bit-position bit bitmap)
@@ -272,7 +272,7 @@
## used).
## So, this test is introduced to detect them.
(def: (empty?' node)
- (All [k v] (-> (Node k v) Bool))
+ (All [k v] (-> (Node k v) Bit))
(`` (case node
(#Base (~~ (static ..clean-bitmap)) _)
true
@@ -569,7 +569,7 @@
(get' root-level (:: Hash<k> hash key) key Hash<k> node)))
(def: #export (contains? key dict)
- (All [k v] (-> k (Dictionary k v) Bool))
+ (All [k v] (-> k (Dictionary k v) Bit))
(case (get key dict)
#.None false
(#.Some _) true))
@@ -604,7 +604,7 @@
(|>> product.right size'))
(def: #export empty?
- (All [k v] (-> (Dictionary k v) Bool))
+ (All [k v] (-> (Dictionary k v) Bit))
(|>> size (n/= +0)))
(def: #export (entries dict)