#quote from MIT 'introduction to computation and programming using python, Revised'
class IntSet(object):
"""An IntSet is a set of integers"""
#Information about the implementation (not the abstraction)
#The value of the set is represented by a list of ints, self.vals
#Each int in the set occurs in self.vals exactly once.
def __init__(self):
"""Create an empty set of integers"""
self.vals = []
def insert(self, e):
"""Assumes e is an integer and inserts e into self"""
if not e in self.vals:
self.vals.append(e)
def member(self, e):
"""Assumes e is an integer
Returns True if e is in self, and False otherwise"""
return e in self.vals
def remove(self, e):
"""Assumes e is an integer and removes e from self
Raises ValueError if e is not in self"""
try:
self.vals.remove(e)
except:
raise ValueError(str(e) + ' not found')
def getMembers(self):
"""Returns a list containing the elements of self.
Nothing can be assumed about the order of the elements"""
return self.vals[:]
def __str__(self):
"""Returns a string representation of self"""
self.vals.sort()
result = ''
for e in self.vals:
result += str(e) + ','
return '{' + result[:-1] + '}' #-1 omits trailing comma
%run "C:\Users\Administrator\test.py"
s = IntSet()
s.insert(100)
s.insert(200)
s.member(100)
Out[27]: True
s.member(10000)
Out[28]: False
print s
{100,200}
s.insert(9999)
s.remove(200)
print s
{100,9999}
s.getMembers()
Out[33]: [100, 9999]
sum = 0
for e in s.getMembers():
sum += e
print sum
10099