it.unimi.dsi.fastutil.objects.ObjectArrayFIFOQueue Maven / Gradle / Ivy
Show all versions of fastutil Show documentation
/*
* Copyright (C) 2010-2020 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.objects;
import java.util.Arrays;
import java.util.Comparator;
import java.io.Serializable;
import it.unimi.dsi.fastutil.HashCommon;
import it.unimi.dsi.fastutil.PriorityQueue;
import java.util.NoSuchElementException;
/**
* A type-specific array-based FIFO queue, supporting also deque operations.
*
*
* Instances of this class represent a FIFO queue using a backing array in a
* circular way. The array is enlarged and shrunk as needed. You can use the
* {@link #trim()} method to reduce its memory usage, if necessary.
*
*
* This class provides additional methods that implement a deque
* (double-ended queue).
*/
public class ObjectArrayFIFOQueue implements PriorityQueue, Serializable {
private static final long serialVersionUID = 0L;
/** The standard initial capacity of a queue. */
public static final int INITIAL_CAPACITY = 4;
/** The backing array. */
protected transient K array[];
/** The current (cached) length of {@link #array}. */
protected transient int length;
/**
* The start position in {@link #array}. It is always strictly smaller than
* {@link #length}.
*/
protected transient int start;
/**
* The end position in {@link #array}. It is always strictly smaller than
* {@link #length}. Might be actually smaller than {@link #start} because
* {@link #array} is used cyclically.
*/
protected transient int end;
/**
* Creates a new empty queue with given capacity.
*
* @param capacity
* the initial capacity of this queue.
*/
@SuppressWarnings("unchecked")
public ObjectArrayFIFOQueue(final int capacity) {
if (capacity < 0)
throw new IllegalArgumentException("Initial capacity (" + capacity + ") is negative");
array = (K[]) new Object[Math.max(1, capacity)]; // Never build a queue with zero-sized backing array.
length = array.length;
}
/**
* Creates a new empty queue with standard {@linkplain #INITIAL_CAPACITY initial
* capacity}.
*/
public ObjectArrayFIFOQueue() {
this(INITIAL_CAPACITY);
}
/**
* {@inheritDoc}
*
* This implementation returns {@code null} (FIFO queues have no comparator).
*/
@Override
public Comparator comparator() {
return null;
}
@Override
public K dequeue() {
if (start == end)
throw new NoSuchElementException();
final K t = array[start];
array[start] = null; // Clean-up for the garbage collector.
if (++start == length)
start = 0;
reduce();
return t;
}
/**
* Dequeues the {@linkplain PriorityQueue#last() last} element from the queue.
*
* @return the dequeued element.
* @throws NoSuchElementException
* if the queue is empty.
*/
public K dequeueLast() {
if (start == end)
throw new NoSuchElementException();
if (end == 0)
end = length;
final K t = array[--end];
array[end] = null; // Clean-up for the garbage collector.
reduce();
return t;
}
@SuppressWarnings("unchecked")
private final void resize(final int size, final int newLength) {
final K[] newArray = (K[]) new Object[newLength];
if (start >= end) {
if (size != 0) {
System.arraycopy(array, start, newArray, 0, length - start);
System.arraycopy(array, 0, newArray, length - start, end);
}
} else
System.arraycopy(array, start, newArray, 0, end - start);
start = 0;
end = size;
array = newArray;
length = newLength;
}
private final void expand() {
resize(length, (int) Math.min(it.unimi.dsi.fastutil.Arrays.MAX_ARRAY_SIZE, 2L * length));
}
private final void reduce() {
final int size = size();
if (length > INITIAL_CAPACITY && size <= length / 4)
resize(size, length / 2);
}
@Override
public void enqueue(K x) {
array[end++] = x;
if (end == length)
end = 0;
if (end == start)
expand();
}
/**
* Enqueues a new element as the first element (in dequeuing order) of the
* queue.
*
* @param x
* the element to enqueue.
*/
public void enqueueFirst(K x) {
if (start == 0)
start = length;
array[--start] = x;
if (end == start)
expand();
}
@Override
public K first() {
if (start == end)
throw new NoSuchElementException();
return array[start];
}
@Override
public K last() {
if (start == end)
throw new NoSuchElementException();
return array[(end == 0 ? length : end) - 1];
}
@Override
public void clear() {
if (start <= end)
Arrays.fill(array, start, end, null);
else {
Arrays.fill(array, start, length, null);
Arrays.fill(array, 0, end, null);
}
start = end = 0;
}
/** Trims the queue to the smallest possible size. */
@SuppressWarnings("unchecked")
public void trim() {
final int size = size();
final K[] newArray = (K[]) new Object[size + 1];
if (start <= end)
System.arraycopy(array, start, newArray, 0, end - start);
else {
System.arraycopy(array, start, newArray, 0, length - start);
System.arraycopy(array, 0, newArray, length - start, end);
}
start = 0;
length = (end = size) + 1;
array = newArray;
}
@Override
public int size() {
final int apparentLength = end - start;
return apparentLength >= 0 ? apparentLength : length + apparentLength;
}
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException {
s.defaultWriteObject();
int size = size();
s.writeInt(size);
for (int i = start; size-- != 0;) {
s.writeObject(array[i++]);
if (i == length)
i = 0;
}
}
@SuppressWarnings("unchecked")
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, ClassNotFoundException {
s.defaultReadObject();
end = s.readInt();
array = (K[]) new Object[length = HashCommon.nextPowerOfTwo(end + 1)];
for (int i = 0; i < end; i++)
array[i] = (K) s.readObject();
}
}