FM / Stack

/usr/lib64/python2.6/site-packages/mx/Stack/

/usr/lib64/python2.6/site-packages/mx/Stack

Name	Size	Mode	Actions
mxStack/	-	0755	rm
COPYRIGHT	1030	0644	edit dl rm
LICENSE	4587	0644	edit dl rm
README	142	0644	edit dl rm
stackbench.pyc	3749	0644	edit dl rm
stackbench.pyo	3710	0644	edit dl rm
UserStack.py	1172	0644	edit dl rm
UserStack.pyc	2542	0644	edit dl rm
UserStack.pyo	2542	0644	edit dl rm
__init__.py	354	0644	edit dl rm
__init__.pyc	542	0644	edit dl rm
__init__.pyo	542	0644	edit dl rm

Edit: /usr/lib64/python2.6/site-packages/mx/Stack/UserStack.py (1172B)

""" A pure Python Stack implementation modelled after mxStack.

Copyright (c) 2000, Marc-Andre Lemburg; mailto:mal@lemburg.com
    Copyright (c) 2000-2008, eGenix.com Software GmbH; mailto:info@egenix.com
    See the documentation for further information on copyrights,
    or contact the author. All Rights Reserved.
"""

import string

class UserStack:

def __init__(self):

self.stack = ()

def push(self,x):

self.stack = (x,self.stack)

def pop(self):

x, self.stack = self.stack
        return x

def not_empty(self):

return len(self.stack) != 0

def top(self):

return self.stack[0]

def __len__(self):

i = 0
        s = self.stack
        while len(s) != 0:
            s = s[1]
            i = i + 1
        return i

def __repr__(self):

l = []
        s = self.stack
        while len(s) != 0:
            l.append(repr(s[0]))
            s = s[1]
        return '<UserStack [%s]>' % string.join(l,', ')

def __str__(self):

l = []
        s = self.stack
        while len(s) != 0:
            l.append(s[0])
            s = s[1]
        return 's' + repr(l)

""" A pure Python Stack implementation modelled after mxStack. Copyright (c) 2000, Marc-Andre Lemburg; mailto:mal@lemburg.com Copyright (c) 2000-2008, eGenix.com Software GmbH; mailto:info@egenix.com See the documentation for further information on copyrights, or contact the author. All Rights Reserved. """ import string class UserStack: def __init__(self): self.stack = () def push(self,x): self.stack = (x,self.stack) def pop(self): x, self.stack = self.stack return x def not_empty(self): return len(self.stack) != 0 def top(self): return self.stack[0] def __len__(self): i = 0 s = self.stack while len(s) != 0: s = s[1] i = i + 1 return i def __repr__(self): l = [] s = self.stack while len(s) != 0: l.append(repr(s[0])) s = s[1] return '' % string.join(l,', ') def __str__(self): l = [] s = self.stack while len(s) != 0: l.append(s[0]) s = s[1] return 's' + repr(l)