blob: c9f495c8cb7cbaf5383897aabb0e13ada061f26a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
// Copyright 2006 The Closure Library Authors. All Rights Reserved.
//
// 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.
/**
* @fileoverview Datastructure: Priority Queue.
*
*
* This file provides the implementation of a Priority Queue. Smaller priorities
* move to the front of the queue. If two values have the same priority,
* it is arbitrary which value will come to the front of the queue first.
*/
// TODO(user): Should this rely on natural ordering via some Comparable
// interface?
goog.provide('goog.structs.PriorityQueue');
goog.require('goog.structs');
goog.require('goog.structs.Heap');
/**
* Class for Priority Queue datastructure.
*
* @constructor
* @extends {goog.structs.Heap}
*/
goog.structs.PriorityQueue = function() {
goog.structs.Heap.call(this);
};
goog.inherits(goog.structs.PriorityQueue, goog.structs.Heap);
/**
* Puts the specified value in the queue.
* @param {*} priority The priority of the value. A smaller value here means a
* higher priority.
* @param {*} value The value.
*/
goog.structs.PriorityQueue.prototype.enqueue = function(priority, value) {
this.insert(priority, value);
};
/**
* Retrieves and removes the head of this queue.
* @return {*} The element at the head of this queue. Returns
* undefined if the queue is empty.
*/
goog.structs.PriorityQueue.prototype.dequeue = function() {
return this.remove();
};
|
