REPOSITORY / ScuroNeko/extypes

Compare commits

DIFF REPOSITORY
5 Commits
Author SHA1 Message Date
ScuroNeko 156fa3153c fix: align slice/set equality and harden queue API 2026-03-17 14:37:35 +03:00
ScuroNeko 4232591fcc join 2026-02-19 15:05:01 +03:00
ScuroNeko 6d2ef61432 tuple immutable 2026-02-12 13:46:53 +03:00
ScuroNeko ce8c5b516e some tests 2026-02-09 17:39:41 +03:00
ScuroNeko 8e203ed8d5 some tests 2026-02-09 16:44:16 +03:00
8 changed files with 265 additions and 39 deletions
+29 -17
View File
@@ -6,6 +6,7 @@ import (
)
var QueueFullErr = errors.New("queue full")
var QueueEmptyErr = errors.New("queue empty")
type Queue[T any] struct {
size uint64
@@ -27,37 +28,48 @@ func (q *Queue[T]) IsFull() bool { return q.Len() == q.size }
func (q *Queue[T]) Size() uint64 { return q.size }
func (q *Queue[T]) Enqueue(el T) error {
if q.IsFull() {
q.mu.Lock()
defer q.mu.Unlock()
if uint64(len(q.queue)) == q.size {
return QueueFullErr
}
q.queue = q.queue.Push(el)
return nil
}
func (q *Queue[T]) Dequeue() T {
q.mu.RLock()
el := q.queue.Get(0)
q.mu.RUnlock()
func (q *Queue[T]) Dequeue() (T, error) {
q.mu.Lock()
defer q.mu.Unlock()
if q.Len() == 1 {
q.mu.Lock()
q.queue = make(Slice[T], 0)
q.mu.Unlock()
return el
var zero T
if len(q.queue) == 0 {
return zero, QueueEmptyErr
}
q.mu.Lock()
q.queue = q.queue.Pop(0)
q.mu.Unlock()
return el
el := q.queue[0]
copy(q.queue, q.queue[1:])
q.queue[len(q.queue)-1] = zero
q.queue = q.queue[:len(q.queue)-1]
return el, nil
}
func (q *Queue[T]) Peak() T {
func (q *Queue[T]) Peak() (T, error) {
q.mu.RLock()
defer q.mu.RUnlock()
return q.queue.Get(0)
var zero T
if len(q.queue) == 0 {
return zero, QueueEmptyErr
}
return q.queue[0], nil
}
func (q *Queue[T]) Raw() Slice[T] {
return q.queue
q.mu.RLock()
defer q.mu.RUnlock()
return NewSliceFrom(q.queue)
}
+86 -6
View File
@@ -11,14 +11,19 @@ func ExampleCreateQueue() {
if err != nil {
panic(err)
}
i := q.Dequeue() // <- Here we got 1
i, err := q.Dequeue() // <- Here we got 1
if err != nil {
panic(err)
}
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)
if err := q.Enqueue(i); err != nil {
b.Fatal(err)
}
}
b.StopTimer()
b.ReportAllocs()
@@ -26,11 +31,15 @@ func BenchmarkQueue_Enqueue(b *testing.B) {
func BenchmarkQueue_Dequeue(b *testing.B) {
q := CreateQueue[int](uint64(b.N))
for i := 0; i < b.N; i++ {
q.Enqueue(i)
if err := q.Enqueue(i); err != nil {
b.Fatal(err)
}
}
b.StartTimer()
for i := 0; i < b.N; i++ {
q.Dequeue()
if _, err := q.Dequeue(); err != nil {
b.Fatal(err)
}
}
b.StopTimer()
b.ReportAllocs()
@@ -39,11 +48,82 @@ func BenchmarkQueue_EnqueueDequeue(b *testing.B) {
b.StartTimer()
q := CreateQueue[int](uint64(b.N))
for i := 0; i < b.N; i++ {
q.Enqueue(i)
if err := q.Enqueue(i); err != nil {
b.Fatal(err)
}
}
for i := 0; i < b.N; i++ {
q.Dequeue()
if _, err := q.Dequeue(); err != nil {
b.Fatal(err)
}
}
b.StopTimer()
b.ReportAllocs()
}
func TestQueue_Empty(t *testing.T) {
q := CreateQueue[int](1)
if _, err := q.Peak(); err != QueueEmptyErr {
t.Fatalf("Peak() error = %v, want %v", err, QueueEmptyErr)
}
if _, err := q.Dequeue(); err != QueueEmptyErr {
t.Fatalf("Dequeue() error = %v, want %v", err, QueueEmptyErr)
}
}
func TestQueue_BasicOperations(t *testing.T) {
q := CreateQueue[int](2)
if err := q.Enqueue(1); err != nil {
t.Fatal(err)
}
if err := q.Enqueue(2); err != nil {
t.Fatal(err)
}
if err := q.Enqueue(3); err != QueueFullErr {
t.Fatalf("Enqueue() error = %v, want %v", err, QueueFullErr)
}
head, err := q.Peak()
if err != nil {
t.Fatal(err)
}
if head != 1 {
t.Fatalf("Peak() = %d, want 1", head)
}
first, err := q.Dequeue()
if err != nil {
t.Fatal(err)
}
if first != 1 {
t.Fatalf("Dequeue() = %d, want 1", first)
}
second, err := q.Dequeue()
if err != nil {
t.Fatal(err)
}
if second != 2 {
t.Fatalf("Dequeue() = %d, want 2", second)
}
}
func TestQueue_RawReturnsCopy(t *testing.T) {
q := CreateQueue[int](2)
if err := q.Enqueue(1); err != nil {
t.Fatal(err)
}
raw := q.Raw()
raw[0] = 99
head, err := q.Peak()
if err != nil {
t.Fatal(err)
}
if head != 1 {
t.Fatalf("Peak() = %d, want 1", head)
}
}
+10 -3
View File
@@ -1,7 +1,9 @@
package extypes
import (
"fmt"
"reflect"
"strings"
)
type Set[T any] []T
@@ -60,9 +62,6 @@ 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
@@ -108,3 +107,11 @@ func (s Set[T]) Map(f func(e T) T) Set[T] {
}
return s
}
func (s Set[T]) Join(sep string) string {
st := make([]string, len(s))
for i, v := range s {
st[i] = fmt.Sprintf("%v", v)
}
return strings.Join(st, sep)
}
+31
View File
@@ -0,0 +1,31 @@
package extypes
import "testing"
func TestSet(t *testing.T) {
s1 := make(Set[int], 0)
s2 := make(Set[int], 0)
s1 = s1.Add(1)
s1 = s1.Add(2)
s1 = s1.Add(2)
s2 = s2.Add(1)
s2 = s2.Add(2)
if !s1.Equal(s2) {
t.Error("s1 and s2 not equal")
}
}
func TestSet_EqualIgnoresCapacity(t *testing.T) {
s1 := make(Set[int], 2, 2)
s2 := make(Set[int], 2, 4)
s1[0], s1[1] = 1, 2
s2[0], s2[1] = 1, 2
if !s1.Equal(s2) {
t.Error("s1 and s2 not equal")
}
}
+10 -3
View File
@@ -1,7 +1,9 @@
package extypes
import (
"fmt"
"reflect"
"strings"
)
type Slice[T any] []T
@@ -54,9 +56,6 @@ func (s Slice[T]) Equal(s2 Slice[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
@@ -103,3 +102,11 @@ func (s Slice[T]) Map(f func(e T) T) Slice[T] {
}
return s
}
func (s Slice[T]) Join(sep string) string {
st := make([]string, len(s))
for i, v := range s {
st[i] = fmt.Sprintf("%v", v)
}
return strings.Join(st, sep)
}
+26
View File
@@ -56,6 +56,18 @@ func TestSlice_Equal(t *testing.T) {
}
}
func TestSlice_EqualIgnoresCapacity(t *testing.T) {
a1 := make(Slice[int], 2, 2)
a2 := make(Slice[int], 2, 4)
a1[0], a1[1] = 1, 2
a2[0], a2[1] = 1, 2
if !a1.Equal(a2) {
t.Errorf("a1 != a2")
}
}
func TestSlice_Pop(t *testing.T) {
a1 := make(Slice[int], 10)
a2 := make(Slice[int], 9)
@@ -76,3 +88,17 @@ func TestSlice_Pop(t *testing.T) {
t.Errorf("a1 != a2")
}
}
func TestSlice_PopFrontEqual(t *testing.T) {
a1 := make(Slice[int], 3, 5)
a2 := make(Slice[int], 2, 2)
a1[0], a1[1], a1[2] = 0, 1, 2
a2[0], a2[1] = 1, 2
a1 = a1.Pop(0)
if !a1.Equal(a2) {
t.Errorf("a1 != a2")
}
}
+24 -10
View File
@@ -1,24 +1,26 @@
package extypes
import "reflect"
import (
"encoding/json"
"fmt"
"reflect"
"strings"
)
type Tuple[T any] struct {
s Slice[T]
}
func NewTupleFrom[T any](src []T) Tuple[T] {
return Tuple[T]{src}
}
func (t Tuple[T]) Len() int { return t.s.Len() }
func (t Tuple[T]) Cap() int { return t.s.Cap() }
func (t Tuple[T]) Get(index int) T { return t.s.Get(index) }
func NewTupleFrom[T any](src []T) Tuple[T] { return Tuple[T]{src} }
func NewTuple[T any]() Tuple[T] { return Tuple[T]{make(Slice[T], 0)} }
func (t Tuple[T]) Len() int { return t.s.Len() }
func (t Tuple[T]) Cap() int { return t.s.Cap() }
func (t Tuple[T]) Get(index int) T { return t.s.Get(index) }
func (t Tuple[T]) Equal(t2 Tuple[T]) bool {
if t.Len() != t2.Len() {
return false
}
if t.Cap() != t2.Cap() {
return false
}
for i := range t.s {
if !reflect.DeepEqual(t.s[i], t2.s[i]) {
return false
@@ -58,3 +60,15 @@ func (t Tuple[T]) ForEach(f func(int, T)) Tuple[T] {
}
return t
}
func (t Tuple[T]) Join(sep string) string {
st := make([]string, len(t.s))
for i, v := range t.s {
st[i] = fmt.Sprintf("%v", v)
}
return strings.Join(st, sep)
}
func (t Tuple[T]) String() string { return fmt.Sprint(t.s) }
func (t *Tuple[T]) UnmarshalJSON(data []byte) error { return json.Unmarshal(data, &t.s) }
func (t Tuple[T]) MarshalJSON() ([]byte, error) { return json.Marshal(t.s) }
+49
View File
@@ -0,0 +1,49 @@
package extypes
import (
"encoding/json"
"testing"
)
func TestTuple(t *testing.T) {
t1 := NewTupleFrom([]int{1, 2, 3})
t2 := NewTupleFrom([]int{1, 2, 3})
if !t1.Equal(t2) {
t.Error("t1 and t2 should be equal")
}
}
func TestTuple_MarshalJSON(t *testing.T) {
t1 := NewTupleFrom([]int{1, 2, 3})
data, err := json.Marshal(t1)
if err != nil {
t.Fatal(err)
}
s := "[1,2,3]"
if string(data) != s {
t.Error("t1 and t2 should be equal")
}
}
func TestTuple_UnmarshalJSON(t *testing.T) {
s := "[1,2,3]"
t1 := NewTuple[int]()
err := json.Unmarshal([]byte(s), &t1)
if err != nil {
t.Fatal(err)
}
t2 := NewTupleFrom([]int{1, 2, 3})
t.Log(t1, t2)
if !t1.Equal(t2) {
t.Error("t1 and t2 should be equal")
}
st1 := struct {
A int `json:"a"`
B Tuple[int] `json:"b"`
}{}
s2 := `{"a":1,"b":[1,2,3]}`
if err := json.Unmarshal([]byte(s2), &st1); err != nil {
t.Fatal(err)
}
t.Log(st1)
}