/* */ public int dequeue() {
/* 176 */ if (this.size == 0) throw new NoSuchElementException();
/* 177 */ int result = this.heap[0];
/* 178 */ this.heap[0] = this.heap[(--this.size)];
/* 179 */ if (this.size != 0)
CharSemiIndirectHeaps.downHeap(this.refArray, this.heap, this.size, 0, this.c);
/* 180 */ return result;
/* */ }
/* */ public CharHeapSemiIndirectPriorityQueue(
char[] refArray, int[] a, int size, CharComparator c)
/* */ {
/* 112 */ this(refArray, 0, c);
/* 113 */ this.heap = a;
/* 114 */ this.size = size;
/* 115 */ CharSemiIndirectHeaps.makeHeap(refArray, a, size, c);
/* */ }
/* */ public void enqueue(int x) /* */ {
/* 167 */ ensureElement(x);
/* */
/* 169 */ if (this.size == this.heap.length)
this.heap = IntArrays.grow(this.heap, this.size + 1);
/* */
/* 171 */ this.heap[(this.size++)] = x;
/* 172 */ CharSemiIndirectHeaps.upHeap(
this.refArray, this.heap, this.size, this.size - 1, this.c);
/* */ }
/* */ public void allChanged() /* */ {
/* 204 */ CharSemiIndirectHeaps.makeHeap(this.refArray, this.heap, this.size, this.c);
/* */ }
/* */ public void changed() /* */ {
/* 197 */ CharSemiIndirectHeaps.downHeap(this.refArray, this.heap, this.size, 0, this.c);
/* */ }
/* */ public int front(int[] a) {
/* 221 */ return CharSemiIndirectHeaps.front(this.refArray, this.heap, this.size, a);
/* */ }
