public PlanRecord getPointedPlanRecord() { while ( !heap.peek().isFeasible() ) { heap.poll(); if ( heap.isEmpty() ) { throw new RuntimeException( "no more feasible plans for agent "+id ); } } return heap.peek(); }
private void testOddOrder(MinHeap<HasIndex> pq) { DummyHeapEntry entry0 = new DummyHeapEntry(0); DummyHeapEntry entry1 = new DummyHeapEntry(1); DummyHeapEntry entry2 = new DummyHeapEntry(2); DummyHeapEntry entry3 = new DummyHeapEntry(3); pq.add(entry0, 0.0); pq.add(entry3, 3.0); pq.add(entry1, 1.0); pq.add(entry2, 2.0); assertEqualsHE(entry0, pq.poll()); assertEqualsHE(entry1, pq.poll()); assertEqualsHE(entry2, pq.poll()); assertEqualsHE(entry3, pq.poll()); Assert.assertNull(pq.poll()); }
private void testRemoveAndAdd_HigherPriority(MinHeap<HasIndex> pq) { DummyHeapEntry entry0 = new DummyHeapEntry(5); DummyHeapEntry entry1 = new DummyHeapEntry(3); DummyHeapEntry entry2 = new DummyHeapEntry(6); pq.add(entry0, 5.0); pq.add(entry1, 3.0); pq.add(entry2, 6.0); Assert.assertEquals(3, pq.size()); // test removing an element and adding it with higher priority (=lower value) pq.remove(entry0); Assert.assertEquals(2, pq.size()); pq.add(entry0, 2.5); Assert.assertEquals(3, pq.size()); assertEqualsHE(entry0, pq.poll()); assertEqualsHE(entry1, pq.poll()); assertEqualsHE(entry2, pq.poll()); Assert.assertNull(pq.poll()); }
private void testPoll2(MinHeap<HasIndex> pq) { DummyHeapEntry entry0 = new DummyHeapEntry(0); DummyHeapEntry entry1 = new DummyHeapEntry(1); DummyHeapEntry entry2 = new DummyHeapEntry(2); DummyHeapEntry entry3 = new DummyHeapEntry(3); DummyHeapEntry entry4 = new DummyHeapEntry(4); DummyHeapEntry entry5 = new DummyHeapEntry(5); pq.add(entry0, 5.0); pq.add(entry1, 3.0); pq.add(entry2, 6.0); Assert.assertEquals(3, pq.size()); assertEqualsHE(entry1, pq.poll()); Assert.assertEquals(2, pq.size()); pq.add(entry3, 1.0); pq.add(entry4, 4.0); pq.add(entry5, 9.0); Assert.assertEquals(5, pq.size()); assertEqualsHE(entry3, pq.poll()); assertEqualsHE(entry4, pq.poll()); assertEqualsHE(entry0, pq.poll()); assertEqualsHE(entry2, pq.poll()); assertEqualsHE(entry5, pq.poll()); Assert.assertEquals(0, pq.size()); Assert.assertNull(pq.poll()); }
private void testIterator_ConcurrentModification_poll(MinHeap<HasIndex> pq) { DummyHeapEntry entry0 = new DummyHeapEntry(5); DummyHeapEntry entry1 = new DummyHeapEntry(3); DummyHeapEntry entry2 = new DummyHeapEntry(6); pq.add(entry0, 5.0); pq.add(entry1, 3.0); pq.add(entry2, 6.0); Iterator<?> iter = pq.iterator(); Assert.assertTrue(iter.hasNext()); Assert.assertNotNull(iter.next()); pq.poll(); Assert.assertTrue(iter.hasNext()); try { iter.next(); Assert.fail("missing ConcurrentModificationException"); } catch (ConcurrentModificationException e) { log.info("catched expected exception.", e); } iter = pq.iterator(); // but a new iterator must work again Assert.assertTrue(iter.hasNext()); Assert.assertNotNull(iter.next()); }
private void testPoll(MinHeap<HasIndex> pq) { DummyHeapEntry entry0 = new DummyHeapEntry(5); DummyHeapEntry entry1 = new DummyHeapEntry(3); DummyHeapEntry entry2 = new DummyHeapEntry(6); DummyHeapEntry entry3 = new DummyHeapEntry(1); DummyHeapEntry entry4 = new DummyHeapEntry(4); DummyHeapEntry entry5 = new DummyHeapEntry(9); pq.add(entry0, 5.0); pq.add(entry1, 3.0); pq.add(entry2, 6.0); Assert.assertEquals(3, pq.size()); assertEqualsHE(entry1, pq.poll()); Assert.assertEquals(2, pq.size()); pq.add(entry3, 1.0); pq.add(entry4, 4.0); pq.add(entry5, 9.0); Assert.assertEquals(5, pq.size()); assertEqualsHE(entry3, pq.poll()); assertEqualsHE(entry4, pq.poll()); assertEqualsHE(entry0, pq.poll()); assertEqualsHE(entry2, pq.poll()); assertEqualsHE(entry5, pq.poll()); Assert.assertEquals(0, pq.size()); Assert.assertNull(pq.poll()); }
private void testRemoveAndAdd_LowerPriority(MinHeap<HasIndex> pq) { DummyHeapEntry entry0 = new DummyHeapEntry(5); DummyHeapEntry entry1 = new DummyHeapEntry(3); DummyHeapEntry entry2 = new DummyHeapEntry(6); pq.add(entry0, 5.0); pq.add(entry1, 3.0); pq.add(entry2, 6.0); Assert.assertEquals(3, pq.size()); // test removing an element and adding it with lower priority (=higher value) pq.remove(entry0); Assert.assertEquals(2, pq.size()); pq.add(entry0, 7.0); Assert.assertEquals(3, pq.size()); assertEqualsHE(entry1, pq.poll()); assertEqualsHE(entry2, pq.poll()); assertEqualsHE(entry0, pq.poll()); Assert.assertNull(pq.poll()); }
pq.add(entry0, Double.MAX_VALUE); pq.add(entry2, Double.MAX_VALUE); while(!pq.isEmpty()) pq.poll(); assertEqualsHE(entry0, pq.poll()); assertEqualsHE(entry1, pq.poll()); assertEqualsHE(entry2, pq.poll()); Assert.assertNull(pq.poll()); pq.decreaseKey(entry2, 4.0); Assert.assertEquals(3, pq.size()); assertEqualsHE(entry2, pq.poll()); assertEqualsHE(entry1, pq.poll()); assertEqualsHE(entry0, pq.poll()); Assert.assertNull(pq.poll());
pq.add(entry8, Double.MAX_VALUE); pq.add(entry9, Double.MAX_VALUE); while(!pq.isEmpty()) pq.poll(); pq.add(entry0, 5.0); pq.add(entry8, 5.0); assertEqualsHE(entry0, pq.poll()); assertEqualsHE(entry1, pq.poll()); assertEqualsHE(entry2, pq.poll()); assertEqualsHE(entry3, pq.poll()); assertEqualsHE(entry4, pq.poll()); assertEqualsHE(entry5, pq.poll()); assertEqualsHE(entry6, pq.poll()); assertEqualsHE(entry7, pq.poll()); assertEqualsHE(entry8, pq.poll()); assertEqualsHE(entry9, pq.poll()); Assert.assertNull(pq.poll());
pq.add(entry2, Double.MAX_VALUE); pq.add(entry3, Double.MAX_VALUE); while(!pq.isEmpty()) pq.poll(); pq.add(entry0, 5.0); Assert.assertEquals(4, pq.size()); assertEqualsHE(entry0, pq.poll()); Assert.assertEquals(3, pq.size()); assertEqualsHE(entry1, pq.poll()); Assert.assertEquals(2, pq.size()); assertEqualsHE(entry2, pq.poll()); Assert.assertEquals(1, pq.size()); assertEqualsHE(entry3, pq.poll()); Assert.assertEquals(0, pq.size()); Assert.assertNull(pq.poll());