public class

PriorityFibonacciQueue

extends AbstractQueue<E>
java.lang.Object
   ↳ java.util.AbstractCollection<E>
     ↳ java.util.AbstractQueue<E>
       ↳ es.usc.citius.lab.hipster.collections.adapter.PriorityFibonacciQueue<N>

Class Overview

Implementation of java.util.Queue based on the Fibonacci heap concept, described in http://en.wikipedia.org/wiki/Fibonacci_heap.

Summary

Public Constructors
PriorityFibonacciQueue(PriorityEvaluator<N> evaluator)
Public Methods
Iterator<N> iterator()
boolean offer(N n)
N peek()
N poll()
int size()
[Expand]
Inherited Methods
From class java.util.AbstractQueue
From class java.util.AbstractCollection
From class java.lang.Object
From interface java.lang.Iterable
From interface java.util.Collection
From interface java.util.Queue

Public Constructors

public PriorityFibonacciQueue (PriorityEvaluator<N> evaluator)

Public Methods

public Iterator<N> iterator ()

public boolean offer (N n)

public N peek ()

public N poll ()

public int size ()