mirror of
				https://github.com/coredns/coredns.git
				synced 2025-10-31 02:03:20 -04:00 
			
		
		
		
	Dep helper (#2151)
* Add dep task to update go dependencies * Update go dependencies
This commit is contained in:
		
				
					committed by
					
						 Miek Gieben
						Miek Gieben
					
				
			
			
				
	
			
			
			
						parent
						
							8f8b81f56b
						
					
				
				
					commit
					0e8977761d
				
			
							
								
								
									
										178
									
								
								vendor/github.com/eapache/queue/queue_test.go
									
									
									
										generated
									
									
										vendored
									
									
								
							
							
						
						
									
										178
									
								
								vendor/github.com/eapache/queue/queue_test.go
									
									
									
										generated
									
									
										vendored
									
									
								
							| @@ -1,178 +0,0 @@ | ||||
| package queue | ||||
|  | ||||
| import "testing" | ||||
|  | ||||
| func TestQueueSimple(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	for i := 0; i < minQueueLen; i++ { | ||||
| 		q.Add(i) | ||||
| 	} | ||||
| 	for i := 0; i < minQueueLen; i++ { | ||||
| 		if q.Peek().(int) != i { | ||||
| 			t.Error("peek", i, "had value", q.Peek()) | ||||
| 		} | ||||
| 		x := q.Remove() | ||||
| 		if x != i { | ||||
| 			t.Error("remove", i, "had value", x) | ||||
| 		} | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func TestQueueWrapping(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	for i := 0; i < minQueueLen; i++ { | ||||
| 		q.Add(i) | ||||
| 	} | ||||
| 	for i := 0; i < 3; i++ { | ||||
| 		q.Remove() | ||||
| 		q.Add(minQueueLen + i) | ||||
| 	} | ||||
|  | ||||
| 	for i := 0; i < minQueueLen; i++ { | ||||
| 		if q.Peek().(int) != i+3 { | ||||
| 			t.Error("peek", i, "had value", q.Peek()) | ||||
| 		} | ||||
| 		q.Remove() | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func TestQueueLength(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	if q.Length() != 0 { | ||||
| 		t.Error("empty queue length not 0") | ||||
| 	} | ||||
|  | ||||
| 	for i := 0; i < 1000; i++ { | ||||
| 		q.Add(i) | ||||
| 		if q.Length() != i+1 { | ||||
| 			t.Error("adding: queue with", i, "elements has length", q.Length()) | ||||
| 		} | ||||
| 	} | ||||
| 	for i := 0; i < 1000; i++ { | ||||
| 		q.Remove() | ||||
| 		if q.Length() != 1000-i-1 { | ||||
| 			t.Error("removing: queue with", 1000-i-i, "elements has length", q.Length()) | ||||
| 		} | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func TestQueueGet(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	for i := 0; i < 1000; i++ { | ||||
| 		q.Add(i) | ||||
| 		for j := 0; j < q.Length(); j++ { | ||||
| 			if q.Get(j).(int) != j { | ||||
| 				t.Errorf("index %d doesn't contain %d", j, j) | ||||
| 			} | ||||
| 		} | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func TestQueueGetNegative(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	for i := 0; i < 1000; i++ { | ||||
| 		q.Add(i) | ||||
| 		for j := 1; j <= q.Length(); j++ { | ||||
| 			if q.Get(-j).(int) != q.Length()-j { | ||||
| 				t.Errorf("index %d doesn't contain %d", -j, q.Length()-j) | ||||
| 			} | ||||
| 		} | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func TestQueueGetOutOfRangePanics(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	q.Add(1) | ||||
| 	q.Add(2) | ||||
| 	q.Add(3) | ||||
|  | ||||
| 	assertPanics(t, "should panic when negative index", func() { | ||||
| 		q.Get(-4) | ||||
| 	}) | ||||
|  | ||||
| 	assertPanics(t, "should panic when index greater than length", func() { | ||||
| 		q.Get(4) | ||||
| 	}) | ||||
| } | ||||
|  | ||||
| func TestQueuePeekOutOfRangePanics(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	assertPanics(t, "should panic when peeking empty queue", func() { | ||||
| 		q.Peek() | ||||
| 	}) | ||||
|  | ||||
| 	q.Add(1) | ||||
| 	q.Remove() | ||||
|  | ||||
| 	assertPanics(t, "should panic when peeking emptied queue", func() { | ||||
| 		q.Peek() | ||||
| 	}) | ||||
| } | ||||
|  | ||||
| func TestQueueRemoveOutOfRangePanics(t *testing.T) { | ||||
| 	q := New() | ||||
|  | ||||
| 	assertPanics(t, "should panic when removing empty queue", func() { | ||||
| 		q.Remove() | ||||
| 	}) | ||||
|  | ||||
| 	q.Add(1) | ||||
| 	q.Remove() | ||||
|  | ||||
| 	assertPanics(t, "should panic when removing emptied queue", func() { | ||||
| 		q.Remove() | ||||
| 	}) | ||||
| } | ||||
|  | ||||
| func assertPanics(t *testing.T, name string, f func()) { | ||||
| 	defer func() { | ||||
| 		if r := recover(); r == nil { | ||||
| 			t.Errorf("%s: didn't panic as expected", name) | ||||
| 		} | ||||
| 	}() | ||||
|  | ||||
| 	f() | ||||
| } | ||||
|  | ||||
| // General warning: Go's benchmark utility (go test -bench .) increases the number of | ||||
| // iterations until the benchmarks take a reasonable amount of time to run; memory usage | ||||
| // is *NOT* considered. On my machine, these benchmarks hit around ~1GB before they've had | ||||
| // enough, but if you have less than that available and start swapping, then all bets are off. | ||||
|  | ||||
| func BenchmarkQueueSerial(b *testing.B) { | ||||
| 	q := New() | ||||
| 	for i := 0; i < b.N; i++ { | ||||
| 		q.Add(nil) | ||||
| 	} | ||||
| 	for i := 0; i < b.N; i++ { | ||||
| 		q.Peek() | ||||
| 		q.Remove() | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func BenchmarkQueueGet(b *testing.B) { | ||||
| 	q := New() | ||||
| 	for i := 0; i < b.N; i++ { | ||||
| 		q.Add(i) | ||||
| 	} | ||||
| 	b.ResetTimer() | ||||
| 	for i := 0; i < b.N; i++ { | ||||
| 		q.Get(i) | ||||
| 	} | ||||
| } | ||||
|  | ||||
| func BenchmarkQueueTickTock(b *testing.B) { | ||||
| 	q := New() | ||||
| 	for i := 0; i < b.N; i++ { | ||||
| 		q.Add(nil) | ||||
| 		q.Peek() | ||||
| 		q.Remove() | ||||
| 	} | ||||
| } | ||||
		Reference in New Issue
	
	Block a user