mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-23 00:41:19 -04:00
Delete simple_queue.py
This commit is contained in:
parent
c176257c26
commit
5ab9d7582a
1 changed files with 0 additions and 120 deletions
|
@ -1,120 +0,0 @@
|
||||||
#!/usr/bin/env python3
|
|
||||||
# -*- coding: utf-8 -*-
|
|
||||||
# author: bt3gl
|
|
||||||
|
|
||||||
import heapq
|
|
||||||
|
|
||||||
|
|
||||||
class Queue:
|
|
||||||
|
|
||||||
def __init__(self):
|
|
||||||
self._in = []
|
|
||||||
self._out = []
|
|
||||||
|
|
||||||
######################
|
|
||||||
# Private methods
|
|
||||||
######################
|
|
||||||
def _transfer_in_to_out(self):
|
|
||||||
while self._in:
|
|
||||||
self._out.append(self._in.pop())
|
|
||||||
|
|
||||||
def __repr__(self):
|
|
||||||
if not self._out:
|
|
||||||
self._transfer_in_to_out()
|
|
||||||
|
|
||||||
return f'{self._out}'
|
|
||||||
|
|
||||||
######################
|
|
||||||
# Properties
|
|
||||||
######################
|
|
||||||
@property
|
|
||||||
def size(self):
|
|
||||||
return len(self._in) + len(self._out)
|
|
||||||
|
|
||||||
@property
|
|
||||||
def peek(self):
|
|
||||||
if not self._out:
|
|
||||||
self._transfer_in_to_out()
|
|
||||||
if self._out:
|
|
||||||
return self._out[-1]
|
|
||||||
else:
|
|
||||||
print('❌ Queue is empty, cannot peek.')
|
|
||||||
|
|
||||||
@property
|
|
||||||
def is_empty(self):
|
|
||||||
return not (bool(self._in) or bool(self._out))
|
|
||||||
|
|
||||||
######################
|
|
||||||
# Public methods
|
|
||||||
######################
|
|
||||||
def enqueue(self, item):
|
|
||||||
self._in.append(item)
|
|
||||||
|
|
||||||
def dequeue(self):
|
|
||||||
if not self._out:
|
|
||||||
while self._in:
|
|
||||||
self.out.append(self._in.pop())
|
|
||||||
|
|
||||||
if self._out:
|
|
||||||
self._out.pop()
|
|
||||||
else:
|
|
||||||
print('❌ Queue is empty, cannot dequeue.')
|
|
||||||
|
|
||||||
|
|
||||||
class PriorityQueue:
|
|
||||||
|
|
||||||
def __init__(self):
|
|
||||||
self.queue = []
|
|
||||||
self.index = 0
|
|
||||||
|
|
||||||
def push(self, item, priority):
|
|
||||||
heapq.heappush(self.queue, (-priority, self.index, item))
|
|
||||||
self.index += 1
|
|
||||||
|
|
||||||
def pop(self):
|
|
||||||
return heapq.heappop(self.queue)[-1]
|
|
||||||
|
|
||||||
class Item:
|
|
||||||
|
|
||||||
def __init__(self, name):
|
|
||||||
self.name = name
|
|
||||||
|
|
||||||
def __repr__(self):
|
|
||||||
return f'{self.name}'
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
if __name__ == '__main__':
|
|
||||||
|
|
||||||
######################
|
|
||||||
# Simple Queue
|
|
||||||
######################
|
|
||||||
print('🧪 Testing Queue...')
|
|
||||||
queue = Queue()
|
|
||||||
print(f"Is the queue empty? {queue.is_empty}")
|
|
||||||
print("Adding 1 to 10 in the queue...")
|
|
||||||
for i in range(1, 11):
|
|
||||||
queue.enqueue(i)
|
|
||||||
|
|
||||||
print(f"Queue: {queue}")
|
|
||||||
print(f"\nQueue size: {queue.size}")
|
|
||||||
print(f"Queue peek : {queue.peek}")
|
|
||||||
print(f"Is the queue empty? {queue.is_empty}")
|
|
||||||
print(f"\nDequeue...")
|
|
||||||
queue.dequeue()
|
|
||||||
print(f"Queue: {queue}")
|
|
||||||
print(f"\nQueue size: {queue.size}")
|
|
||||||
print(f"Queue peek: {queue.peek}")
|
|
||||||
print(f"Is the queue empty? {queue.is_empty}")
|
|
||||||
|
|
||||||
######################
|
|
||||||
# Priority Queue
|
|
||||||
######################
|
|
||||||
print('\n\n🧪 Testing Priority Queue...')
|
|
||||||
q = PriorityQueue()
|
|
||||||
q.push(Item('Item 1'), 1)
|
|
||||||
q.push(Item('Item 4'), 4)
|
|
||||||
q.push(Item('Item 3'), 3)
|
|
||||||
print(f"Priority Queue: {q.queue}")
|
|
||||||
print(f"Pop: {q.pop()}")
|
|
||||||
print(f"Priority Queue: {q.queue}")
|
|
Loading…
Add table
Add a link
Reference in a new issue