All Downloads are FREE. Search and download functionalities are using the official Maven repository.

it.unimi.dsi.fastutil.shorts.ShortPriorityQueue Maven / Gradle / Ivy

Go to download

fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists and priority queues with a small memory footprint and fast access and insertion; provides also big (64-bit) arrays, sets and lists, and fast, practical I/O classes for binary and text files.

There is a newer version: 8.5.15
Show newest version
/*
	* Copyright (C) 2003-2017 Paolo Boldi and 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.shorts;
import java.util.NoSuchElementException;
import it.unimi.dsi.fastutil.PriorityQueue;
/**
 * A type-specific {@link PriorityQueue}; provides some additional methods that
 * use polymorphism to avoid (un)boxing.
 *
 * 

* Additionally, this interface strengthens {@link #comparator()}. */ public interface ShortPriorityQueue extends PriorityQueue { /** * Enqueues a new element. * * @see PriorityQueue#enqueue(Object) * @param x * the element to enqueue. */ void enqueue(short x); /** * Dequeues the {@linkplain #first() first} element from the queue. * * @see #dequeue() * @return the dequeued element. * @throws NoSuchElementException * if the queue is empty. */ short dequeueShort(); /** * Returns the first element of the queue. * * @see #first() * @return the first element. * @throws NoSuchElementException * if the queue is empty. */ short firstShort(); /** * Returns the last element of the queue, that is, the element the would be * dequeued last (optional operation). *

* This default implementation just throws an * {@link UnsupportedOperationException}. * * @see #last() * @return the last element. * @throws NoSuchElementException * if the queue is empty. */ default short lastShort() { throw new UnsupportedOperationException(); } /** * Returns the comparator associated with this priority queue, or null if it * uses its elements' natural ordering. * *

* Note that this specification strengthens the one given in * {@link PriorityQueue#comparator()}. * * @see PriorityQueue#comparator() * @return the comparator associated with this priority queue. */ @Override ShortComparator comparator(); /** * {@inheritDoc} *

* This default implementation delegates to the corresponding type-specific * method. * * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override default void enqueue(final Short x) { enqueue(x.shortValue()); } /** * {@inheritDoc} *

* This default implementation delegates to the corresponding type-specific * method. * * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override default Short dequeue() { return Short.valueOf(dequeueShort()); } /** * {@inheritDoc} *

* This default implementation delegates to the corresponding type-specific * method. * * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override default Short first() { return Short.valueOf(firstShort()); } /** * {@inheritDoc} *

* This default implementation delegates to the corresponding type-specific * method. * * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override default Short last() { return Short.valueOf(lastShort()); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy