# Simple tool for making class-like objects using closures in Python 3
#
# Advantages:
# * cleaner coding style -- internal reference don't use "self.r"
# * faster internal references
# * faster external calls - no bound methods or rewriting arg tuples
# * attributes are automatically "private"
#
# Disadvantages:
# * current version doesn't support magic methods
# * no direct access to attributes
# * no inheritance
# * doesn't work with existing help() function
import sys
class Object(object):
'Holder for anything you want to attach to it'
pass
def classify(local_dict=None):
o = Object()
if local_dict is None:
local_dict = sys._getframe(1).f_locals
vars(o).update(local_dict)
return o
########################################################################
### Simple example ###################################################
def Animal(name):
'Animal-like class'
def speak():
print('I am', name)
def set_name(newname):
nonlocal name
name = newname
return classify()
d = Animal('Fido')
d.speak()
d.set_name('Max')
d.speak()
########################################################################
### Practical example ################################################
import heapq
import itertools
def priority_queue(initial_tasklist):
'Retrieve tasks by priority. Tasks can be removed or reprioritized.'
pq = [] # list of entries arranged in a heap
entry_finder = {} # mapping of tasks to entries
REMOVED = object() # placeholder for a removed task
counter = itertools.count() # unique sequence count
def add(task, priority=0):
'Add a new task or update the priority of an existing task'
if task in entry_finder:
remove(task)
count = next(counter)
entry = [priority, count, task]
entry_finder[task] = entry
heapq.heappush(pq, entry)
def remove(task):
'Mark an existing task as REMOVED. Raise KeyError if not found.'
entry = entry_finder.pop(task)
entry[-1] = REMOVED
def pop():
'Remove and return the lowest priority task. Raise KeyError if empty.'
while pq:
priority, count, task = heapq.heappop(pq)
if task is not REMOVED:
del entry_finder[task]
return task
raise KeyError('pop from an empty priority queue')
def reprioritize(task, priority):
'Change a task priority. Raise KeyError if non found.'
remove(task)
add(task, priority)
def tasklist():
'Show task in order of priority'
pq.sort()
return [task for priority, count, task in pq if task is not REMOVED]
for task, priority in initial_tasklist:
add(task, priority)
return classify()
# note: the following calls would be *exactly* the same
# if the priority_queue had been defined as a regular class
todo = priority_queue([('fish', 5), ('play', 3)])
todo.add('code', 1)
todo.add('sleep', 6)
print(todo.tasklist())
print('Pop the topmost task: %r' % todo.pop())
print("Deprioritize 'play'")
todo.reprioritize('play', 10)
todo.remove('sleep')
print(todo.tasklist())
help(priority_queue)
help(todo.add)
Diff to Previous Revision
--- revision 3 2012-04-02 03:25:14
+++ revision 4 2012-04-02 05:03:22
@@ -96,8 +96,8 @@
return classify()
# note: the following calls would be *exactly* the same
-# if priority_queue were defined as a regular class
-help(priority_queue)
+# if the priority_queue had been defined as a regular class
+
todo = priority_queue([('fish', 5), ('play', 3)])
todo.add('code', 1)
todo.add('sleep', 6)
@@ -107,3 +107,5 @@
todo.reprioritize('play', 10)
todo.remove('sleep')
print(todo.tasklist())
+help(priority_queue)
+help(todo.add)
