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

it.unimi.dsi.fastutil.ints.IntPriorityQueue Maven / Gradle / Ivy

Go to download

fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists, and queues with a small memory footprint and fast access and insertion; it provides also big (64-bit) arrays, sets and lists, sorting algorithms, fast, practical I/O classes for binary and text files, and facilities for memory mapping large files. Note that if you have both this jar and fastutil-core.jar in your dependencies, fastutil-core.jar should be excluded.

There is a newer version: 8.5.13
Show newest version
/*
	* Copyright (C) 2003-2023 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.ints;

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 IntPriorityQueue extends PriorityQueue { /** * Enqueues a new element. * * @see PriorityQueue#enqueue(Object) * @param x the element to enqueue. */ void enqueue(int x); /** * Dequeues the {@linkplain #first() first} element from the queue. * * @see #dequeue() * @return the dequeued element. * @throws NoSuchElementException if the queue is empty. */ int dequeueInt(); /** * Returns the first element of the queue. * * @see #first() * @return the first element. * @throws NoSuchElementException if the queue is empty. */ int firstInt(); /** * 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 int lastInt() { throw new UnsupportedOperationException(); } /** * Returns the comparator associated with this priority queue, or null if it uses its elements' * natural ordering. * * @apiNote Note that this specification strengthens the one given in * {@link PriorityQueue#comparator()}. * @see PriorityQueue#comparator() * @return the comparator associated with this priority queue. */ @Override IntComparator 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 Integer x) { enqueue(x.intValue()); } /** * {@inheritDoc} *

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

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

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





© 2015 - 2024 Weber Informatics LLC | Privacy Policy