Sha256: d62d1c7e2897a2738b6b45f60224f30d06dc8ccf5d42d6cc9ca01d9ababd75e3
Contents?: true
Size: 1.61 KB
Versions: 100
Compression:
Stored size: 1.61 KB
Contents
# -*- coding: utf-8 -*-
from collections import Counter
from threading import Lock, Thread
from time import sleep
import sys
if sys.version[0] == '2':
from Queue import Queue
else:
from queue import Queue
total_workers = 3 # Maximum number of threads chosen arbitrarily
class LetterCounter(object):
def __init__(self):
self.lock = Lock()
self.value = Counter()
def add_counter(self, counter_to_add):
self.lock.acquire()
try:
self.value = self.value + counter_to_add
finally:
self.lock.release()
def count_letters(queue_of_texts, letter_to_frequency, worker_id):
while not queue_of_texts.empty():
sleep(worker_id + 1)
line_input = queue_of_texts.get()
if line_input is not None:
letters_in_line = Counter([x for x in line_input.lower() if
x.isalpha()])
letter_to_frequency.add_counter(letters_in_line)
queue_of_texts.task_done()
if line_input is None:
break
def calculate(list_of_texts):
queue_of_texts = Queue()
[queue_of_texts.put(line) for line in list_of_texts]
letter_to_frequency = LetterCounter()
threads = []
for i in range(total_workers):
worker = Thread(target=count_letters, args=(queue_of_texts,
letter_to_frequency, i))
worker.start()
threads.append(worker)
queue_of_texts.join()
for i in range(total_workers):
queue_of_texts.put(None)
for t in threads:
t.join()
return letter_to_frequency.value
Version data entries
100 entries across 100 versions & 1 rubygems