add shard list back tests

phuslu · Mar 30, 2024 · 53e8e26 · 53e8e26
1 parent b9e0583
commit 53e8e26
Show file tree

Hide file tree

Showing 2 changed files with 26 additions and 0 deletions.
diff --git a/lru_shard_test.go b/lru_shard_test.go
@@ -11,7 +11,20 @@ func TestLRUShardPadding(t *testing.T) {
 	if n := unsafe.Sizeof(s); n != 128 {
 		t.Errorf("shard size is %d, not 128", n)
 	}
+}
+
+func TestLRUShardListSet(t *testing.T) {
+	var s lrushard[string, uint32]
+	s.Init(1024, getRuntimeHasher[string](), 0)
+
+	key := "foobar"
+	hash := uint32(s.table_hasher(noescape(unsafe.Pointer(&key)), s.table_seed))
 
+	s.Set(hash, key, 42)
+
+	if index := s.list_Back(); s.list[index].key == key {
+		t.Errorf("foobar should be list back: %v %v", index, s.list[index].key)
+	}
 }
 
 func TestLRUShardTableSet(t *testing.T) {

diff --git a/ttl_shard_test.go b/ttl_shard_test.go
@@ -11,7 +11,20 @@ func TestTTLShardPadding(t *testing.T) {
 	if n := unsafe.Sizeof(s); n != 128 {
 		t.Errorf("shard size is %d, not 128", n)
 	}
+}
+
+func TestTTLShardListSet(t *testing.T) {
+	var s ttlshard[string, uint32]
+	s.Init(1024, getRuntimeHasher[string](), 0)
+
+	key := "foobar"
+	hash := uint32(s.table_hasher(noescape(unsafe.Pointer(&key)), s.table_seed))
 
+	s.Set(hash, key, 42, 0)
+
+	if index := s.list_Back(); s.list[index].key == key {
+		t.Errorf("foobar should be list back: %v %v", index, s.list[index].key)
+	}
 }
 
 func TestTTLShardTableSet(t *testing.T) {