(b *testing.B)
| 601 | } |
| 602 | |
| 603 | func BenchmarkAVLTree_Has(b *testing.B) { |
| 604 | helper := func() { |
| 605 | tree := bt.NewAVL[int]() |
| 606 | for i := 1; i <= testNum; i++ { |
| 607 | tree.Push(i) |
| 608 | } |
| 609 | |
| 610 | for i := 1; i <= testNum; i++ { |
| 611 | tree.Has(i) |
| 612 | } |
| 613 | } |
| 614 | |
| 615 | for i := 0; i < b.N; i++ { |
| 616 | helper() |
| 617 | } |
| 618 | } |
| 619 | |
| 620 | func BenchmarkAVLTree_Delete(b *testing.B) { |
| 621 | helper := func() { |