shz.core.queue.a.SArrayQueue Maven / Gradle / Ivy

Go to download
package shz.core.queue.a;

import shz.core.constant.ArrayConstant;
import shz.core.function.ShortConsumer;

import java.util.Objects;

/**
 * 元素类型为short基于循环动态数组的队列
 * 
 * 24+2*n(n为元素个数)=es
 * 
 * B=56+2*n+对齐填充
 */
public class SArrayQueue extends ArrayQueue {
    private static final long serialVersionUID = -6419477393402923479L;
    protected short[] es;

    public SArrayQueue(int capacity) {
        super(capacity);
        es = new short[capacity];
    }

    public SArrayQueue() {
        this(DEFAULT_CAPACITY);
    }

    public static SArrayQueue of(int capacity) {
        return new SArrayQueue(capacity);
    }

    public static SArrayQueue of() {
        return new SArrayQueue();
    }

    @Override
    protected final void resize(int capacity) {
        short[] temp = new short[capacity];
        for (int i = 0; i < size; ++i) temp[i] = es[(i + head) % this.capacity];
        this.capacity = capacity;
        head = 0;
        tail = size;
        es = temp;
    }

    @Override
    protected final void setNull(int i) {
        es[i] = 0;
    }

    public final void offer(short e) {
        beforeOffer();
        es[tail] = e;
        afterOffer();
    }

    public final short poll() {
        checkEmpty();
        short e = es[head];
        afterPoll();
        return e;
    }

    public final short head() {
        checkEmpty();
        return es[head];
    }

    public final short tail() {
        checkEmpty();
        return es[tail == 0 ? capacity - 1 : tail - 1];
    }

    public final short get(int idx) {
        if (idx < 0 || idx >= size) throw new IndexOutOfBoundsException();
        return es[(head + idx) % capacity];
    }

    public final short[] toArray() {
        if (size == 0) return ArrayConstant.EMPTY_SHORT_ARRAY;
        short[] array = new short[size];
        int idx = 0;
        int current = head;
        while (current != tail) {
            array[idx++] = es[current];
            current = (current + 1) % capacity;
        }
        return array;
    }

    public final void forEach(ShortConsumer action) {
        Objects.requireNonNull(action);
        int current = head;
        while (current != tail) {
            action.accept(es[current]);
            current = (current + 1) % capacity;
        }
    }
}