Class IntPriorityQueue

java.lang.Object
io.netty.buffer.IntPriorityQueue
final class IntPriorityQueue extends Object
Internal primitive priority queue, used by PoolChunk. The implementation is based on the binary heap, as described in Algorithms by Sedgewick and Wayne.

  • Field Details

    • NO_VALUE

      public static final int NO_VALUE
      See Also:

    • array

      private int[] array

    • size

      private int size

  • Constructor Details

    • IntPriorityQueue

      IntPriorityQueue()

  • Method Details

    • offer

      public void offer(int handle)

    • remove

      public void remove(int value)

    • peek

      public int peek()

    • poll

      public int poll()

    • isEmpty

      public boolean isEmpty()

    • lift

      private void lift(int index)

    • sink

      private void sink(int index)

    • subord

      private boolean subord(int a, int b)

    • swap

      private void swap(int a, int b)