mirror of
https://github.com/luxfi/container.git
synced 2026-09-24 00:24:34 +00:00
zeekayandHanzo Dev
adf4508709
Modules declare go 1.27.1 and the build images follow. go fix applied the modernizers: any, WaitGroup.Go, range over int, and a promoted-field key in a struct literal. omitzero is not applied, since it changes what the JSON says. Co-authored-by: Hanzo Dev <[email protected]>
673 lines
14 KiB
Go
673 lines
14 KiB
Go
// Copyright (C) 2019-2025, Lux Industries, Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package buffer
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
func TestUnboundedDeque_InitialCapGreaterThanMin(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
bIntf := NewUnboundedDeque[int](10)
|
|
require.IsType(&unboundedSliceDeque[int]{}, bIntf)
|
|
b := bIntf.(*unboundedSliceDeque[int])
|
|
require.Empty(b.List())
|
|
require.Zero(b.Len())
|
|
_, ok := b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok := b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
_, ok = b.Index(1)
|
|
require.False(ok)
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopRight()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushRight(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopRight()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushRight(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
b.PushLeft(2)
|
|
require.Equal(2, b.Len())
|
|
require.Equal([]int{2, 1}, b.List())
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Equal(1, b.Len())
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushRight(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
b.PushRight(2)
|
|
require.Equal(2, b.Len())
|
|
require.Equal([]int{1, 2}, b.List())
|
|
|
|
got, ok = b.PopRight()
|
|
require.Equal(1, b.Len())
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopRight()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
b.PushLeft(2)
|
|
require.Equal(2, b.Len())
|
|
require.Equal([]int{2, 1}, b.List())
|
|
|
|
got, ok = b.PopRight()
|
|
require.Equal(1, b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Equal([]int{2}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushRight(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
b.PushLeft(2)
|
|
require.Equal(2, b.Len())
|
|
require.Equal([]int{2, 1}, b.List())
|
|
|
|
got, ok = b.PopRight()
|
|
require.Equal(1, b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Equal([]int{2}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1)
|
|
require.Equal(1, b.Len())
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
b.PushRight(2)
|
|
require.Equal(2, b.Len())
|
|
require.Equal([]int{1, 2}, b.List())
|
|
|
|
got, ok = b.PopLeft()
|
|
require.Equal(1, b.Len())
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Equal([]int{2}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PopRight()
|
|
require.Zero(b.Len())
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
}
|
|
|
|
// Cases we test:
|
|
// 1. [left] moves to the left (no wrap around).
|
|
// 2. [left] moves to the right (no wrap around).
|
|
// 3. [left] wrapping around to the left side.
|
|
// 4. [left] wrapping around to the right side.
|
|
// 5. Resize.
|
|
func TestUnboundedSliceDequePushLeftPopLeft(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
// Starts empty.
|
|
bIntf := NewUnboundedDeque[int](2)
|
|
require.IsType(&unboundedSliceDeque[int]{}, bIntf)
|
|
b := bIntf.(*unboundedSliceDeque[int])
|
|
require.Zero(bIntf.Len())
|
|
require.Len(b.data, 2)
|
|
require.Zero(b.left)
|
|
require.Equal(1, b.right)
|
|
require.Empty(b.List())
|
|
// slice is [EMPTY]
|
|
|
|
_, ok := b.PopLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekRight()
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1) // slice is [1,EMPTY]
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 2)
|
|
require.Equal(1, b.left)
|
|
require.Equal(1, b.right)
|
|
require.Equal([]int{1}, b.List())
|
|
|
|
got, ok := b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// This causes a resize
|
|
b.PushLeft(2) // slice is [2,1,EMPTY,EMPTY]
|
|
require.Equal(2, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{2, 1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// Tests left moving left with no wrap around.
|
|
b.PushLeft(3) // slice is [2,1,EMPTY,3]
|
|
require.Equal(3, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(2, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{3, 2, 1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(3, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
got, ok = b.Index(2)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
_, ok = b.Index(3)
|
|
require.False(ok)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(3, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// Tests left moving right with no wrap around.
|
|
got, ok = b.PopLeft() // slice is [2,1,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(3, got)
|
|
require.Equal(2, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{2, 1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// Tests left wrapping around to the left side.
|
|
got, ok = b.PopLeft() // slice is [EMPTY,1,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Zero(b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// Test left wrapping around to the right side.
|
|
b.PushLeft(2) // slice is [2,1,EMPTY,EMPTY]
|
|
require.Equal(2, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{2, 1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopLeft() // slice is [EMPTY,1,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Zero(b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopLeft() // slice is [EMPTY,EMPTY,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Zero(b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(1, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
_, ok = b.PopLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekRight()
|
|
require.False(ok)
|
|
}
|
|
|
|
func TestUnboundedSliceDequePushRightPopRight(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
// Starts empty.
|
|
bIntf := NewUnboundedDeque[int](2)
|
|
require.IsType(&unboundedSliceDeque[int]{}, bIntf)
|
|
b := bIntf.(*unboundedSliceDeque[int])
|
|
require.Zero(bIntf.Len())
|
|
require.Len(b.data, 2)
|
|
require.Zero(b.left)
|
|
require.Equal(1, b.right)
|
|
require.Empty(b.List())
|
|
// slice is [EMPTY]
|
|
|
|
_, ok := b.PopRight()
|
|
require.False(ok)
|
|
_, ok = b.PeekLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekRight()
|
|
require.False(ok)
|
|
|
|
b.PushRight(1) // slice is [1,EMPTY]
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 2)
|
|
require.Zero(b.left)
|
|
require.Zero(b.right)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok := b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// This causes a resize
|
|
b.PushRight(2) // slice is [1,2,EMPTY,EMPTY]
|
|
require.Equal(2, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{1, 2}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
// Tests right moving right with no wrap around
|
|
b.PushRight(3) // slice is [1,2,3,EMPTY]
|
|
require.Equal(3, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(3, b.right)
|
|
require.Equal([]int{1, 2, 3}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
got, ok = b.Index(2)
|
|
require.True(ok)
|
|
require.Equal(3, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(3, got)
|
|
|
|
// Tests right moving left with no wrap around
|
|
got, ok = b.PopRight() // slice is [1,2,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(3, got)
|
|
require.Equal(2, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(2, b.right)
|
|
require.Equal([]int{1, 2}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
got, ok = b.Index(1)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
_, ok = b.Index(2)
|
|
require.False(ok)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PopRight() // slice is [1,EMPTY,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Equal(1, b.right)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
_, ok = b.Index(1)
|
|
require.False(ok)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PopRight() // slice is [EMPTY,EMPTY,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Zero(b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(3, b.left)
|
|
require.Zero(b.right)
|
|
require.Empty(b.List())
|
|
require.Zero(b.Len())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
_, ok = b.PeekLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekRight()
|
|
require.False(ok)
|
|
_, ok = b.PopRight()
|
|
require.False(ok)
|
|
|
|
b.PushLeft(1) // slice is [EMPTY,EMPTY,EMPTY,1]
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(2, b.left)
|
|
require.Zero(b.right)
|
|
require.Equal([]int{1}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
|
|
// Test right wrapping around to the right
|
|
got, ok = b.PopRight() // slice is [EMPTY,EMPTY,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(1, got)
|
|
require.Zero(b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(2, b.left)
|
|
require.Equal(3, b.right)
|
|
require.Empty(b.List())
|
|
require.Zero(b.Len())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
_, ok = b.PeekLeft()
|
|
require.False(ok)
|
|
|
|
_, ok = b.PeekRight()
|
|
require.False(ok)
|
|
|
|
// Tests right wrapping around to the left
|
|
b.PushRight(2) // slice is [EMPTY,EMPTY,EMPTY,2]
|
|
require.Equal(1, b.Len())
|
|
require.Len(b.data, 4)
|
|
require.Equal(2, b.left)
|
|
require.Zero(b.right)
|
|
require.Equal([]int{2}, b.List())
|
|
got, ok = b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PeekLeft()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PeekRight()
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
|
|
got, ok = b.PopRight() // slice is [EMPTY,EMPTY,EMPTY,EMPTY]
|
|
require.True(ok)
|
|
require.Equal(2, got)
|
|
require.Empty(b.List())
|
|
_, ok = b.Index(0)
|
|
require.False(ok)
|
|
|
|
_, ok = b.PeekLeft()
|
|
require.False(ok)
|
|
_, ok = b.PeekRight()
|
|
require.False(ok)
|
|
_, ok = b.PopRight()
|
|
require.False(ok)
|
|
}
|
|
|
|
func FuzzUnboundedSliceDeque(f *testing.F) {
|
|
f.Fuzz(
|
|
func(t *testing.T, initSize uint, input []byte) {
|
|
require := require.New(t)
|
|
b := NewUnboundedDeque[byte](int(initSize))
|
|
for i, n := range input {
|
|
b.PushRight(n)
|
|
gotIndex, ok := b.Index(i)
|
|
require.True(ok)
|
|
require.Equal(n, gotIndex)
|
|
}
|
|
|
|
list := b.List()
|
|
require.Len(list, len(input))
|
|
for i, n := range input {
|
|
require.Equal(n, list[i])
|
|
}
|
|
|
|
for i := range input {
|
|
_, _ = b.PopLeft()
|
|
list = b.List()
|
|
if i == len(input)-1 {
|
|
require.Empty(list)
|
|
_, ok := b.Index(0)
|
|
require.False(ok)
|
|
} else {
|
|
require.Equal(input[i+1:], list)
|
|
got, ok := b.Index(0)
|
|
require.True(ok)
|
|
require.Equal(input[i+1], got)
|
|
}
|
|
}
|
|
},
|
|
)
|
|
}
|