-
Notifications
You must be signed in to change notification settings - Fork 0
/
Container Bag.py
71 lines (62 loc) · 1.75 KB
/
Container Bag.py
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
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Jul 31 11:40:37 2017
@author: thelma
"""
class Container(object):
""" Holds hashable objects. Objects may occur 0 or more times """
def __init__(self):
""" Creates a new container with no objects in it. I.e., any object
occurs 0 times in self. """
self.vals = {}
def insert(self, e):
""" assumes e is hashable
Increases the number times e occurs in self by 1. """
try:
self.vals[e] += 1
except:
self.vals[e] = 1
def __str__(self):
s = ""
for i in sorted(self.vals.keys()):
if self.vals[i] != 0:
s += str(i)+":"+str(self.vals[i])+"\n"
return s
class Bag(Container):
def remove(self, e):
""" assumes e is hashable
If e occurs in self, reduces the number of
times it occurs in self by 1. Otherwise does nothing. """
try:
self.vals[e] -= 1
except:
None
def count(self, e):
""" assumes e is hashable
Returns the number of times e occurs in self. """
try:
return self.vals[e]
except:
return 0
def __add__(self, other):
s = ""
dict_sum = {}
for i in sorted(self.vals.keys()):
dict_sum[i] = self.vals[i]
for j in sorted(other.vals.keys()):
if j in dict_sum:
dict_sum[j] += other.vals[j]
else:
dict_sum[j] = other.vals[j]
for k in dict_sum:
s += str(k)+":"+str(dict_sum[k])+"\n"
return s
# print 3:1, 4:2
a = Bag()
a.insert(4)
b = Bag()
b.insert(4)
a.insert(3)
a.remove(3)
print(a+b)