AdGuardHome/internal/aghalg/ringbuffer_test.go

170 lines
3.2 KiB
Go
Raw Normal View History

2023-10-11 15:31:41 +01:00
package aghalg_test
import (
2024-03-12 14:45:11 +00:00
"slices"
2023-10-11 15:31:41 +01:00
"testing"
"github.com/AdguardTeam/AdGuardHome/internal/aghalg"
"github.com/stretchr/testify/assert"
)
// elements is a helper function that returns n elements of the buffer.
2024-01-30 15:43:51 +00:00
func elements(b *aghalg.RingBuffer[int], n uint, reverse bool) (es []int) {
2023-10-11 15:31:41 +01:00
fn := b.Range
if reverse {
fn = b.ReverseRange
}
2024-01-30 15:43:51 +00:00
var i uint
2023-10-11 15:31:41 +01:00
fn(func(e int) (cont bool) {
if i >= n {
return false
}
es = append(es, e)
i++
return true
})
return es
}
func TestNewRingBuffer(t *testing.T) {
t.Run("success_and_clear", func(t *testing.T) {
b := aghalg.NewRingBuffer[int](5)
2024-05-15 11:34:12 +01:00
for i := range 10 {
2023-10-11 15:31:41 +01:00
b.Append(i)
}
assert.Equal(t, []int{5, 6, 7, 8, 9}, elements(b, b.Len(), false))
b.Clear()
assert.Zero(t, b.Len())
})
t.Run("zero", func(t *testing.T) {
b := aghalg.NewRingBuffer[int](0)
2024-05-15 11:34:12 +01:00
for i := range 10 {
2023-10-11 15:31:41 +01:00
b.Append(i)
2024-01-30 15:43:51 +00:00
bufLen := b.Len()
assert.EqualValues(t, 0, bufLen)
assert.Empty(t, elements(b, bufLen, false))
assert.Empty(t, elements(b, bufLen, true))
2023-10-11 15:31:41 +01:00
}
})
t.Run("single", func(t *testing.T) {
b := aghalg.NewRingBuffer[int](1)
2024-05-15 11:34:12 +01:00
for i := range 10 {
2023-10-11 15:31:41 +01:00
b.Append(i)
2024-01-30 15:43:51 +00:00
bufLen := b.Len()
assert.EqualValues(t, 1, bufLen)
assert.Equal(t, []int{i}, elements(b, bufLen, false))
assert.Equal(t, []int{i}, elements(b, bufLen, true))
2023-10-11 15:31:41 +01:00
}
})
}
func TestRingBuffer_Range(t *testing.T) {
const size = 5
b := aghalg.NewRingBuffer[int](size)
testCases := []struct {
name string
want []int
count int
2024-01-30 15:43:51 +00:00
length uint
2023-10-11 15:31:41 +01:00
}{{
name: "three",
count: 3,
length: 3,
want: []int{0, 1, 2},
}, {
name: "ten",
count: 10,
length: size,
want: []int{5, 6, 7, 8, 9},
}, {
name: "hundred",
count: 100,
length: size,
want: []int{95, 96, 97, 98, 99},
}}
for _, tc := range testCases {
t.Run(tc.name, func(t *testing.T) {
2024-05-15 11:34:12 +01:00
for i := range tc.count {
2023-10-11 15:31:41 +01:00
b.Append(i)
}
bufLen := b.Len()
assert.Equal(t, tc.length, bufLen)
want := tc.want
assert.Equal(t, want, elements(b, bufLen, false))
assert.Equal(t, want[:len(want)-1], elements(b, bufLen-1, false))
assert.Equal(t, want[:len(want)/2], elements(b, bufLen/2, false))
want = want[:cap(want)]
slices.Reverse(want)
assert.Equal(t, want, elements(b, bufLen, true))
assert.Equal(t, want[:len(want)-1], elements(b, bufLen-1, true))
assert.Equal(t, want[:len(want)/2], elements(b, bufLen/2, true))
})
}
}
func TestRingBuffer_Range_increment(t *testing.T) {
const size = 5
b := aghalg.NewRingBuffer[int](size)
testCases := []struct {
name string
want []int
}{{
name: "one",
want: []int{0},
}, {
name: "two",
want: []int{0, 1},
}, {
name: "three",
want: []int{0, 1, 2},
}, {
name: "four",
want: []int{0, 1, 2, 3},
}, {
name: "five",
want: []int{0, 1, 2, 3, 4},
}, {
name: "six",
want: []int{1, 2, 3, 4, 5},
}, {
name: "seven",
want: []int{2, 3, 4, 5, 6},
}, {
name: "eight",
want: []int{3, 4, 5, 6, 7},
}, {
name: "nine",
want: []int{4, 5, 6, 7, 8},
}, {
name: "ten",
want: []int{5, 6, 7, 8, 9},
}}
for i, tc := range testCases {
t.Run(tc.name, func(t *testing.T) {
b.Append(i)
2024-01-30 15:43:51 +00:00
bufLen := b.Len()
assert.Equal(t, tc.want, elements(b, bufLen, false))
2023-10-11 15:31:41 +01:00
slices.Reverse(tc.want)
2024-01-30 15:43:51 +00:00
assert.Equal(t, tc.want, elements(b, bufLen, true))
2023-10-11 15:31:41 +01:00
})
}
}