File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -24,16 +24,16 @@ func BenchmarkNewLockFreeQ(b *testing.B) {
2424 }
2525}
2626
27- // BenchmarkLockFreeQ_Enqueue benchmarks adding items to the queue.
28- func BenchmarkLockFreeQ_Enqueue (b * testing.B ) {
27+ // BenchmarkLockFreeQEnqueue benchmarks adding items to the queue.
28+ func BenchmarkLockFreeQEnqueue (b * testing.B ) {
2929 q := NewLockFreeQ [int ]()
3030 for i := 0 ; i < b .N ; i ++ {
3131 q .Enqueue (i )
3232 }
3333}
3434
35- // BenchmarkLockFreeQ_Dequeue benchmarks removing items from the queue.
36- func BenchmarkLockFreeQ_Dequeue (b * testing.B ) {
35+ // BenchmarkLockFreeQDequeue benchmarks removing items from the queue.
36+ func BenchmarkLockFreeQDequeue (b * testing.B ) {
3737 q := NewLockFreeQ [int ]()
3838 for i := 0 ; i < b .N ; i ++ {
3939 q .Enqueue (i )
@@ -46,8 +46,8 @@ func BenchmarkLockFreeQ_Dequeue(b *testing.B) {
4646 }
4747}
4848
49- // BenchmarkLockFreeQ_IsEmpty benchmarks the IsEmpty check.
50- func BenchmarkLockFreeQ_IsEmpty (b * testing.B ) {
49+ // BenchmarkLockFreeQIsEmpty benchmarks the IsEmpty check.
50+ func BenchmarkLockFreeQIsEmpty (b * testing.B ) {
5151 q := NewLockFreeQ [int ]()
5252 for i := 0 ; i < b .N ; i ++ {
5353 _ = q .IsEmpty ()
You can’t perform that action at this time.
0 commit comments