testPoll() — netty Function Reference

Architecture documentation for the testPoll() function in DefaultPriorityQueueTest.java from the netty codebase.

Function java Buffer Search calls 3

Entity Profile

Buffer→ Search→ testPoll() — netty Function Reference

Dependency Diagram

graph TD
  e9b3729d_4b27_d613_c002_bba04978f085["testPoll()"]
  23b282eb_d0ea_c3c7_a597_7a1f2dd6296d["DefaultPriorityQueueTest"]
  e9b3729d_4b27_d613_c002_bba04978f085 -->|defined in| 23b282eb_d0ea_c3c7_a597_7a1f2dd6296d
  4e25103c_6e8f_a58b_a07c_3ee0c1c46f88["assertEmptyQueue()"]
  e9b3729d_4b27_d613_c002_bba04978f085 -->|calls| 4e25103c_6e8f_a58b_a07c_3ee0c1c46f88
  b6bcf60b_3e0d_b5a5_66f5_198b003d58f1["TestElement()"]
  e9b3729d_4b27_d613_c002_bba04978f085 -->|calls| b6bcf60b_3e0d_b5a5_66f5_198b003d58f1
  1d5045c6_01ae_270f_c58f_430ee227c7ea["assertOffer()"]
  e9b3729d_4b27_d613_c002_bba04978f085 -->|calls| 1d5045c6_01ae_270f_c58f_430ee227c7ea
  style e9b3729d_4b27_d613_c002_bba04978f085 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

common/src/test/java/io/netty/util/internal/DefaultPriorityQueueTest.java lines 36–76

    @Test
    public void testPoll() {
        PriorityQueue<TestElement> queue = new DefaultPriorityQueue<TestElement>(TestElementComparator.INSTANCE, 0);
        assertEmptyQueue(queue);

        TestElement a = new TestElement(5);
        TestElement b = new TestElement(10);
        TestElement c = new TestElement(2);
        TestElement d = new TestElement(7);
        TestElement e = new TestElement(6);

        assertOffer(queue, a);
        assertOffer(queue, b);
        assertOffer(queue, c);
        assertOffer(queue, d);

        // Remove the first element
        assertSame(c, queue.peek());
        assertSame(c, queue.poll());
        assertEquals(3, queue.size());

        // Test that offering another element preserves the priority queue semantics.
        assertOffer(queue, e);
        assertEquals(4, queue.size());
        assertSame(a, queue.peek());
        assertSame(a, queue.poll());
        assertEquals(3, queue.size());

        // Keep removing the remaining elements
        assertSame(e, queue.peek());
        assertSame(e, queue.poll());
        assertEquals(2, queue.size());

        assertSame(d, queue.peek());
        assertSame(d, queue.poll());
        assertEquals(1, queue.size());

        assertSame(b, queue.peek());
        assertSame(b, queue.poll());
        assertEmptyQueue(queue);
    }