//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes: //ORIGINAL LINE: @Test public void shouldHaveStablePriority() public virtual void ShouldHaveStablePriority() { int count = 100; int priorities = 3; Config config = new Config(0, count, 0); BoundedPriorityQueue <Element> queue = new BoundedPriorityQueue <Element>(config, i => 0L, comparingInt(p => p.priority)); IList <Element> insertionOrder = new List <Element>(count); for (int i = 0; i < count; i++) { insertionOrder.Add(new Element(this, _tlr.Next(priorities))); } Collections.shuffle(insertionOrder, _tlr); insertionOrder.ForEach(queue.offer); for (int p = 0; p < priorities; p++) { List <Element> filteredInsertionOrder = new List <Element>(); foreach (Element element in insertionOrder) { if (element.Priority == p) { filteredInsertionOrder.Add(element); } } foreach (Element element in filteredInsertionOrder) { assertEquals(element, queue.Poll()); } } }
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes: //ORIGINAL LINE: @Test public void shouldReportTotalCountAndSize() public virtual void ShouldReportTotalCountAndSize() { BoundedPriorityQueue <int> queue = new BoundedPriorityQueue <int>(_baseConfig, int?.longValue, _noPriority); assertEquals(0, queue.Bytes()); assertEquals(0, queue.Count()); queue.Offer(10); assertEquals(1, queue.Count()); assertEquals(10, queue.Bytes()); queue.Offer(20); assertEquals(2, queue.Count()); assertEquals(30, queue.Bytes()); queue.Poll(); assertEquals(1, queue.Count()); assertEquals(20, queue.Bytes()); queue.Poll(); assertEquals(0, queue.Count()); assertEquals(0, queue.Bytes()); }
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes: //ORIGINAL LINE: @Test public void shouldRespectPriority() public virtual void ShouldRespectPriority() { int count = 100; Config config = new Config(0, count, 0); BoundedPriorityQueue <int> queue = new BoundedPriorityQueue <int>(config, i => 0L, int?.compare); IList <int> list = new List <int>(count); for (int i = 0; i < count; i++) { list.Add(i); } Collections.shuffle(list, _tlr); list.ForEach(queue.offer); for (int i = 0; i < count; i++) { assertEquals(i, queue.Poll()); } }