forked from pmatiello/python-graph
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutils.py
More file actions
89 lines (72 loc) · 2.64 KB
/
Copy pathutils.py
File metadata and controls
89 lines (72 loc) · 2.64 KB
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
# Copyright (c) 2008-2009 Pedro Matiello <pmatiello@gmail.com>
# Roy Smith <roy@panix.com>
# Salim Fadhley <sal@stodge.org>
#
# Permission is hereby granted, free of charge, to any person
# obtaining a copy of this software and associated documentation
# files (the "Software"), to deal in the Software without
# restriction, including without limitation the rights to use,
# copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the
# Software is furnished to do so, subject to the following
# conditions:
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
# OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
# HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
# WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
# OTHER DEALINGS IN THE SOFTWARE.
"""
Miscellaneous useful stuff.
"""
# Imports
from heapq import heappush, heappop, heapify
# Priority Queue
class priority_queue:
"""
Priority queue.
"""
def __init__(self, list=[]):
self.heap = [HeapItem(i, 0) for i in list]
heapify(self.heap)
def __contains__(self, item):
for heap_item in self.heap:
if item == heap_item.item:
return True
return False
def __len__(self):
return len(self.heap)
def empty(self):
return len(self.heap) == 0
def insert(self, item, priority):
"""
Insert item into the queue, with the given priority.
"""
heappush(self.heap, HeapItem(item, priority))
def pop(self):
"""
Return the item with the lowest priority, and remove it from the queue.
"""
return heappop(self.heap).item
def peek(self):
"""
Return the item with the lowest priority. The queue is unchanged.
"""
return self.heap[0].item
def discard(self, item):
new_heap = []
for heap_item in self.heap:
if item != heap_item.item:
new_heap.append(heap_item)
self.heap = new_heap
heapify(self.heap)
class HeapItem:
def __init__(self, item, priority):
self.item = item
self.priority = priority
def __cmp__(self, other):
return cmp(self.priority, other.priority)