Change a way to initialize the cache instance

Author: scalalang2

README.md

@@ -10,6 +10,18 @@ This is a modern cache implementation, **inspired** by the following papers, pro
 
 This offers state-of-the-art efficiency and scalability compared to other LRU-based cache algorithms.
 
+## Basic Usage
+```go
+import "github.com/scalalang2/golang-fifo/sieve"
+
+size := 1e5
+cache := sieve.New[string, string](size)
+
+cache.Set("hello", "world")
+val, _ := cache.Get("hello") 
+fmt.Printf("value: %s", val) // => "world"
+```
+
 ## Benchmark Result
 The benchmark result were obtained using [go-cache-benchmark](https://github.com/scalalang2/go-cache-benchmark)
 
@@ -40,18 +52,6 @@ requiring a potentially slow lock acquisition,
 SIEVE only needs to update a single bit upon a cache hit. 
 This update can be done with a significantly faster reader lock, leading to increased performance.
 
-## Usage
-```go
-import "github.com/scalalang2/golang-fifo/v2"
-
-size := 1e5
-cache := fifo.NewSieve[string, string](size)
-
-cache.Set("hello", "world")
-val, _ := cache.Get("hello") 
-fmt.Printf("value: %s", val) // => "world"
-```
-
 ## Apendix
 
 <details>

s3fifo/s3fifo.go

@@ -25,7 +25,7 @@ type S3FIFO[K comparable, V any] struct {
 	ghost *bucketTable[K]
 }
 
-func NewS3FIFO[K comparable, V any](size int) fifo.Cache[K, V] {
+func New[K comparable, V any](size int) fifo.Cache[K, V] {
 	return &S3FIFO[K, V]{
 		size:  size,
 		items: make(map[K]*s3fifoEntry[V]),

s3fifo/s3fifo_test.go

@@ -7,7 +7,7 @@ import (
 )
 
 func TestSetAndGetOnCache(t *testing.T) {
-	cache := NewS3FIFO[string, string](10)
+	cache := New[string, string](10)
 	cache.Set("hello", "world")
 
 	value, ok := cache.Get("hello")
@@ -16,7 +16,7 @@ func TestSetAndGetOnCache(t *testing.T) {
 }
 
 func TestEvictOneHitWonders(t *testing.T) {
-	cache := NewS3FIFO[int, int](10)
+	cache := New[int, int](10)
 	oneHitWonders := []int{1, 2}
 	popularObjects := []int{3, 4, 5, 6, 7, 8, 9, 10}
 
@@ -61,7 +61,7 @@ func TestEvictOneHitWonders(t *testing.T) {
 }
 
 func TestPeekOnCache(t *testing.T) {
-	cache := NewS3FIFO[int, int](5)
+	cache := New[int, int](5)
 	entries := []int{1, 2, 3, 4, 5}
 
 	for _, v := range entries {
@@ -93,7 +93,7 @@ func TestPeekOnCache(t *testing.T) {
 }
 
 func TestContainsOnCache(t *testing.T) {
-	cache := NewS3FIFO[int, int](5)
+	cache := New[int, int](5)
 	entries := []int{1, 2, 3, 4, 5}
 
 	for _, v := range entries {
@@ -111,7 +111,7 @@ func TestContainsOnCache(t *testing.T) {
 }
 
 func TestLengthOnCache(t *testing.T) {
-	cache := NewS3FIFO[string, string](10)
+	cache := New[string, string](10)
 
 	cache.Set("hello", "world")
 	require.Equal(t, 1, cache.Len())
@@ -126,7 +126,7 @@ func TestLengthOnCache(t *testing.T) {
 }
 
 func TestCleanOnCache(t *testing.T) {
-	cache := NewS3FIFO[int, int](10)
+	cache := New[int, int](10)
 	entries := []int{1, 2, 3, 4, 5}
 
 	for _, v := range entries {

sieve/sieve.go

@@ -21,7 +21,7 @@ type Sieve[K comparable, V any] struct {
 	hand  *list.Element
 }
 
-func NewSieve[K comparable, V any](size int) fifo.Cache[K, V] {
+func New[K comparable, V any](size int) fifo.Cache[K, V] {
 	return &Sieve[K, V]{
 		size:  size,
 		items: make(map[K]*list.Element),

sieve/sieve_test.go

@@ -8,7 +8,7 @@ import (
 
 func TestGetAndSetOnSieve(t *testing.T) {
 	items := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
-	cache := NewSieve[int, int](10)
+	cache := New[int, int](10)
 
 	for _, v := range items {
 		cache.Set(v, v*10)
@@ -22,15 +22,15 @@ func TestGetAndSetOnSieve(t *testing.T) {
 }
 
 func TestContainsOnSieve(t *testing.T) {
-	cache := NewSieve[string, string](10)
+	cache := New[string, string](10)
 	require.False(t, cache.Contains("hello"))
 
 	cache.Set("hello", "world")
 	require.True(t, cache.Contains("hello"))
 }
 
 func TestLenOnSieve(t *testing.T) {
-	cache := NewSieve[int, int](10)
+	cache := New[int, int](10)
 	require.Equal(t, 0, cache.Len())
 
 	cache.Set(1, 1)