some testing ang enchancments

map.go

@@ -34,6 +34,20 @@ func (m HashMap[K, V]) Contains(key K) bool {
 	_, ok := m[key]
 	return ok
 }
+func (m HashMap[K, V]) Keys() []K {
+	keys := make([]K, 0, m.Len())
+	for k := range m {
+		keys = append(keys, k)
+	}
+	return keys
+}
+func (m HashMap[K, V]) Values() []V {
+	values := make([]V, 0, m.Len())
+	for _, v := range m {
+		values = append(values, v)
+	}
+	return values
+}
 func (m HashMap[K, V]) Filter(f func(K, V) bool) HashMap[K, V] {
 	out := make(HashMap[K, V])
 	for k, v := range m {

map_test.go

@@ -0,0 +1,23 @@
+package extypes
+
+import (
+	"fmt"
+	"testing"
+)
+
+func BenchmarkHashMap_Add(b *testing.B) {
+	b.StartTimer()
+	m := make(HashMap[string, string])
+	for i := 0; i < b.N; i++ {
+		m.Add(fmt.Sprint(i), fmt.Sprint(i))
+	}
+	b.StopTimer()
+}
+func BenchmarkGoMap_Add(b *testing.B) {
+	b.StartTimer()
+	m := make(map[string]string)
+	for i := 0; i < b.N; i++ {
+		m[fmt.Sprint(i)] = fmt.Sprint(i)
+	}
+	b.StopTimer()
+}

queue.go

@@ -1,4 +1,4 @@
-package extypes 
+package extypes
 
 import (
 	"errors"
@@ -15,7 +15,7 @@ type Queue[T any] struct {
 
 func CreateQueue[T any](size uint64) *Queue[T] {
 	return &Queue[T]{
-		queue: make([]T, 0),
+		queue: make([]T, 0, size),
 		size:  size,
 	}
 }

queue_test.go

@@ -0,0 +1,49 @@
+package extypes
+
+import (
+	"log"
+	"testing"
+)
+
+func ExampleCreateQueue() {
+	q := CreateQueue[int](16)
+	err := q.Enqueue(1)
+	if err != nil {
+		panic(err)
+	}
+	i := q.Dequeue() // <- Here we got 1
+	log.Println(i)
+}
+func BenchmarkQueue_Enqueue(b *testing.B) {
+	b.StartTimer()
+	q := CreateQueue[int](uint64(b.N))
+	for i := 0; i < b.N; i++ {
+		q.Enqueue(i)
+	}
+	b.StopTimer()
+	b.ReportAllocs()
+}
+func BenchmarkQueue_Dequeue(b *testing.B) {
+	q := CreateQueue[int](uint64(b.N))
+	for i := 0; i < b.N; i++ {
+		q.Enqueue(i)
+	}
+	b.StartTimer()
+	for i := 0; i < b.N; i++ {
+		q.Dequeue()
+	}
+	b.StopTimer()
+	b.ReportAllocs()
+}
+func BenchmarkQueue_EnqueueDequeue(b *testing.B) {
+	b.StartTimer()
+	q := CreateQueue[int](uint64(b.N))
+	for i := 0; i < b.N; i++ {
+		q.Enqueue(i)
+	}
+	for i := 0; i < b.N; i++ {
+		q.Dequeue()
+	}
+	b.StopTimer()
+	b.ReportAllocs()
+}

set.go

@@ -0,0 +1,105 @@
+package extypes
+
+import (
+	"reflect"
+)
+
+type Set[T any] []T
+
+func NewSetFrom[T any](slice []T) Set[T] {
+	s := make(Set[T], 0)
+	for _, v := range slice {
+		if s.Index(v) >= 0 {
+			continue
+		}
+		s = append(s, v)
+	}
+	return s
+}
+func (s Set[T]) Len() int {
+	return len(s)
+}
+func (s Set[T]) Cap() int {
+	return cap(s)
+}
+func (s Set[T]) Get(index int) T {
+	return s[index]
+}
+func (s Set[T]) Last() T {
+	return s[s.Len()-1]
+}
+func (s Set[T]) Index(el T) int {
+	for i := range s {
+		if reflect.DeepEqual(s[i], el) {
+			return i
+		}
+	}
+	return -1
+}
+func (s Set[T]) Swap(i, j int) {
+	s[i], s[j] = s[j], s[i]
+}
+func (s Set[T]) Add(v T) Set[T] {
+	index := s.Index(v)
+	if index >= 0 {
+		return s
+	}
+	return append(s, v)
+}
+func (s Set[T]) Pop(index int) Set[T] {
+	if index == 0 {
+		return s[1:]
+	}
+	out := make(Set[T], s.Len()-1)
+	copy(out, s[:index])
+	copy(out[index:], s[index+1:])
+	return out
+}
+func (s Set[T]) Remove(el T) Set[T] {
+	index := s.Index(el)
+	if index == -1 {
+		return s
+	}
+	return s.Pop(index)
+}
+func (s Set[T]) Filter(f func(e T) bool) Set[T] {
+	out := make(Set[T], 0)
+	for _, v := range s {
+		if f(v) {
+			out = append(out, v)
+		}
+	}
+	return out
+}
+func (s Set[T]) ToSlice() Slice[T] {
+	out := make(Slice[T], s.Len())
+	copy(out, s)
+	return out
+}
+func (s Set[T]) ToArray() []T {
+	out := make([]T, len(s))
+	copy(out, s)
+	return out
+}
+func (s Set[T]) ToAnyArray() []any {
+	out := make([]any, len(s))
+	for i, v := range s {
+		out[i] = v
+	}
+	return out
+}
+
+func (s Set[T]) Equal(s2 Set[T]) bool {
+	if s.Len() != s2.Len() {
+		return false
+	}
+	if s.Cap() != s2.Cap() {
+		return false
+	}
+	for i := range s {
+		if !reflect.DeepEqual(s[i], s2[i]) {
+			return false
+		}
+	}
+	return true
+}

slice.go

@@ -1,10 +1,12 @@
 package extypes
 
-import "slices"
+import (
+	"reflect"
+)
 
-type Slice[T comparable] []T
+type Slice[T any] []T
 
-func NewSliceFrom[T comparable](slice []T) Slice[T] {
+func NewSliceFrom[T any](slice []T) Slice[T] {
 	s := make(Slice[T], len(slice))
 	copy(s, slice)
 	return s
@@ -22,7 +24,12 @@ func (s Slice[T]) Last() T {
 	return s.Get(s.Len() - 1)
 }
 func (s Slice[T]) Index(el T) int {
-	return slices.Index(s, el)
+	for i := range s {
+		if reflect.DeepEqual(s[i], el) {
+			return i
+		}
+	}
+	return -1
 }
 
 // Swap is mutable func
@@ -50,13 +57,9 @@ func (s Slice[T]) Pop(index int) Slice[T] {
 	if index == 0 {
 		return s[1:]
 	}
-	out := make(Slice[T], 0, s.Len()-1)
-	for i, e := range s {
-		if i == index {
-			continue
-		}
-		out = append(out, e)
-	}
+	out := make(Slice[T], s.Len()-1)
+	copy(out, s[:index])
+	copy(out[index:], s[index+1:])
 	return out
 }
 func (s Slice[T]) Remove(el T) Slice[T] {
@@ -82,6 +85,9 @@ func (s Slice[T]) ToAnyArray() []any {
 	}
 	return out
 }
+func (s Slice[T]) ToSet() Set[T] {
+	return NewSetFrom(s)
+}
 
 // ForEach is mutable func
 func (s Slice[T]) ForEach(f func(e T) T) Slice[T] {
@@ -91,86 +97,17 @@ func (s Slice[T]) ForEach(f func(e T) T) Slice[T] {
 	return s
 }
 
-type Set[T comparable] []T
-
-func NewSetFrom[T comparable](slice []T) Set[T] {
-	s := make(Set[T], 0)
-	for _, v := range slice {
-		if s.Index(v) >= 0 {
-			continue
-		}
-		s = append(s, v)
+func (s Slice[T]) Equal(s2 Slice[T]) bool {
+	if s.Len() != s2.Len() {
+		return false
 	}
-	return s
-}
-func (s Set[T]) Len() int {
-	return len(s)
-}
-func (s Set[T]) Cap() int {
-	return cap(s)
-}
-func (s Set[T]) Get(index int) T {
-	return s[index]
-}
-func (s Set[T]) Last() T {
-	return s[s.Len()-1]
-}
-func (s Set[T]) Index(el T) int {
-	return slices.Index(s, el)
-}
-func (s Set[T]) Swap(i, j int) {
-	s[i], s[j] = s[j], s[i]
-}
-func (s Set[T]) Add(v T) Set[T] {
-	index := s.Index(v)
-	if index >= 0 {
-		return s
+	if s.Cap() != s2.Cap() {
+		return false
 	}
-	return append(s, v)
-}
-func (s Set[T]) Pop(index int) Set[T] {
-	if index == 0 {
-		return s[1:]
-	}
-	out := make(Set[T], 0, s.Len()-1)
-	for i, e := range s {
-		if i == index {
-			continue
-		}
-		out = append(out, e)
-	}
-	return out
-}
-func (s Set[T]) Remove(el T) Set[T] {
-	index := s.Index(el)
-	if index == -1 {
-		return s
-	}
-	return s.Pop(index)
-}
-func (s Set[T]) Filter(f func(e T) bool) Set[T] {
-	out := make(Set[T], 0)
-	for _, v := range s {
-		if f(v) {
-			out = append(out, v)
+	for i := range s {
+		if !reflect.DeepEqual(s[i], s2[i]) {
+			return false
 		}
 	}
-	return out
-}
-func (s Set[T]) ToSlice() Slice[T] {
-	out := make(Slice[T], s.Len())
-	copy(out, s)
-	return out
-}
-func (s Set[T]) ToArray() []T {
-	out := make([]T, len(s))
-	copy(out, s)
-	return out
-}
-func (s Set[T]) ToAnyArray() []any {
-	out := make([]any, len(s))
-	for i, v := range s {
-		out[i] = v
-	}
-	return out
+	return true
 }

slice_test.go

@@ -0,0 +1,78 @@
+package extypes
+
+import (
+	"fmt"
+	"testing"
+)
+
+type A struct {
+	i int
+	b bool
+	s string
+}
+
+func TestSlice_Index(t *testing.T) {
+	s := make(Slice[int], 10)
+	for i := 0; i < 10; i++ {
+		s[i] = i + 1
+	}
+
+	if s.Index(0) != -1 {
+		t.Errorf("s.Index(0) != -1")
+	}
+	if s.Index(5) != 4 {
+		t.Errorf("s.Index(5) != 4")
+	}
+
+	s2 := make(Slice[A], 5)
+	for i := 0; i < 5; i++ {
+		s2[i] = A{i + 1, false, fmt.Sprint(i)}
+	}
+	if s2.Index(A{2, false, "1"}) != 1 {
+		t.Errorf("s2 wrong index")
+	}
+}
+func TestSlice_Equal(t *testing.T) {
+	a1 := make(Slice[int], 10)
+	a2 := make(Slice[int], 10)
+	a3 := make(Slice[int], 5)
+
+	for i := 0; i < 10; i++ {
+		a1[i] = i
+		a2[i] = i + 1
+	}
+	for i := 0; i < 5; i++ {
+		a3[i] = i
+	}
+
+	if a1.Equal(a2) {
+		t.Errorf("a1 == a2")
+	}
+	if a1.Equal(a3) {
+		t.Errorf("a1 == a3")
+	}
+	if a2.Equal(a3) {
+		t.Errorf("a2 == a3")
+	}
+}
+
+func TestSlice_Pop(t *testing.T) {
+	a1 := make(Slice[int], 10)
+	a2 := make(Slice[int], 9)
+
+	for i := 0; i < 10; i++ {
+		a1[i] = i
+	}
+	for i := 0; i < 9; i++ {
+		a2[i] = i
+	}
+
+	a1 = a1.Pop(a1.Len() - 1)
+
+	if a1.Len() != 9 {
+		t.Errorf("a1.Len() != 9")
+	}
+	if !a1.Equal(a2) {
+		t.Errorf("a1 != a2")
+	}
+}