-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmapparser.py
executable file
·43 lines (35 loc) · 1.14 KB
/
mapparser.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
#!/home/sgrosu/anaconda2/bin/python
# -*- coding: utf-8 -*-
"""
Your task is to use the iterative parsing to process the map file and
find out not only what tags are there, but also how many, to get the
feeling on how much of which data you can expect to have in the map.
Fill out the count_tags function. It should return a dictionary with the
tag name as the key and number of times this tag can be encountered in
the map as value.
Note that your code will be tested with a different data file than the 'example.osm'
"""
import xml.etree.cElementTree as ET
from collections import defaultdict
import pprint
def count_tags(filename):
d = defaultdict(int)
for event, elem in ET.iterparse(filename):
d[elem.tag] += 1
return d
'''
def test():
tags = count_tags('example.osm')
pprint.pprint(tags)
assert tags == {'bounds': 1,
'member': 3,
'nd': 4,
'node': 20,
'osm': 1,
'relation': 1,
'tag': 7,
'way': 1}
if __name__ == "__main__":
test()
'''
print count_tags('example.osm')