started work on hashtable

FrontEnd/Lib/hashtab32.cw

@@ -0,0 +1,117 @@
+@doc """hashtab32
+
+32 refers to width of the integer returned by the hash function.
+This also limits the max table size to (2^32 - 1).
+
+$ktype:
+$vtype:
+$khash:
+$keq:
+"""
+(module heapsort [(modparam $ktype TYPE)
+                  (modparam $vtype TYPE)
+                  (modparam $khash CONST_EXPR)
+                  (modparam $keq CONST_EXPR)] :
+
+(global FreeEntry u8 0x00)
+(global DeletedEntry u8 0x01)
+(global UsedEntryMark u8 0x80)
+
+@pub (defrec HashTab32 :
+	(field meta (ptr! u8))
+	(field keys	(ptr! $ktype))
+	(field vals	(ptr! $vtype))
+    (field size u32)
+    (field used u32)
+)
+
+(global NotFound u32 0xffffffff)
+
+@pub (fun Lookup [
+    (param ht (ptr HashTab32))
+    (param key (ptr $ktype))] (union [void (ptr! $vtype)]) :
+  (let h u32 (call $khash [key]))
+  (let filter u8 (as (and h 0x7f) u8))
+
+  (let meta auto (-> ht meta))
+  (let keys auto (-> ht keys))
+  (let size auto (-> ht size))
+  (let! i auto (% h size))
+
+  (while true :
+    (let m auto (^ (pinc meta i)))
+    (if (== m FreeEntry) :
+        (return void_val)
+    :)
+    (if (&& (== m filter) (call $keq [key (pinc keys i)])) :
+        (return (pinc (pinc (-> ht vals) i) i))
+    :)
+    (+= i 1)
+    (if (>= i size) : (-= i size) :)
+  )
+)
+
+@pub (fun InsertOrUpdate [
+    (param ht (ptr! HashTab32))
+    (param key (ptr $ktype))
+    (param val (ptr $vtype))] bool :
+  (let h u32 (call $khash [key]))
+  (let filter u8 (as (and h 0x7f) u8))
+
+  (let meta auto (-> ht meta))
+  (let keys auto (-> ht keys))
+  (let size auto (-> ht size))
+  (let! i auto (% h size))
+  (let! seen_deleted auto false)
+  (let! first_deleted u32 0)
+
+  (while true :
+    (let m auto (^ (pinc meta i)))
+    (if (== m FreeEntry) :
+         (if (! seen_deleted) :
+            (= first_deleted i)
+         :)
+         (= (^ (pinc (-> ht vals) first_deleted)) (^ val) )
+         (+= (-> ht used) 1)
+         (return true)
+    :)
+    (if (&& (== m filter) (call $keq [key (pinc keys i)])) :
+        (= (^ (pinc (-> ht vals) i)) (^ val) )
+        (return false)
+    :)
+    (if (&& (! seen_deleted) (== m DeletedEntry)) :
+        (= seen_deleted true)
+        (= first_deleted i)
+    :)
+    (+= i 1)
+    (if (>= i size) : (-= i size) :)
+  )
+)
+
+@pub (fun DeleteIfPresent [
+    (param ht (ptr! HashTab32))
+    (param key (ptr $ktype))] bool :
+  (let h u32 (call $khash [key]))
+  (let filter u8 (as (and h 0x7f) u8))
+
+  (let meta auto (-> ht meta))
+  (let keys auto (-> ht keys))
+  (let size auto (-> ht size))
+  (let! i auto (% h size))
+
+  (while true :
+    (let m auto (^ (pinc meta i)))
+    (if (== m FreeEntry) :
+        (return false)
+    :)
+    (if (&& (== m filter) (call $keq [key (pinc keys i)])) :
+        (= (^ (pinc meta i)) DeletedEntry)
+        (-= (-> ht used) 1)
+        (return true)
+    :)
+    (+= i 1)
+    (if (>= i size) : (-= i size) :)
+  )
+)
+
+)

FrontEnd/TestData/hash_test.cw

@@ -0,0 +1,27 @@
+@doc "hash_test"
+
+(module main [] :
+(import random)
+(import fmt)
+
+
+(fun hash_32 [(param xx (ptr u32))] u32 :
+   (let x u32 (^ xx))
+   (return (or (<< x 16_u32) (! x)))
+)
+
+(fun eq_32 [(param a (ptr u32)) (param b (ptr u32))] bool :
+    (return (== (^ a) (^ b)))
+)
+
+(import hashtab32 hashtab [u32 u32 hash_32 eq_32])
+
+(global SIZE u32 1024)
+
+(global! meta auto (array_val SIZE u8 [0]))
+(global! keys auto (array_val SIZE u32 [0]))
+(global! vals auto (array_val SIZE u32 [0]))
+(global ht auto (rec_val hashtab::HashTab32 [
+    (front! meta) (front! keys) (front! vals) SIZE 0]))
+
+)