Java edu.stanford.nlp.util PriorityQueue fields, constructors, methods, implement or subclass

Example usage for Java edu.stanford.nlp.util PriorityQueue fields, constructors, methods, implement or subclass

Introduction

In this page you can find the methods, fields and constructors for edu.stanford.nlp.util PriorityQueue.

The text is from its open source code.

boolean	add(E key, double priority) Convenience method for if you want to pretend relaxPriority doesn't exist, or if you really want to use the return conditions of add().
E	removeFirst() Finds the object with the highest priority, removes it, and returns it.