CareerCup

class Cache():
	def __init__(self, cacheSize=30):
		self.item_keys = []
		self.item_values = []
		self.hits = 0
		self.misses = 0
		self.cacheSize = cacheSize
		
	def cacheResult(self, item_key, item_value):
		if len(self.item_keys) == self.cacheSize:
			self.item_keys.pop()
			self.item_values.pop()
		self.item_keys.insert(0, item_key)
		self.item_values.insert(0, item_value)
		
	def getResult(self, item_key):
		if item_key in self.item_keys:
			self.hits += 1
			return self.item_values[self.item_keys.index(item_key)]
		else:
			self.misses += 1
			return -999
	
	def getHits():
		return self.hits
		
	def getMisses():
		return self.misses

def Demo_f(original_function, cache = Cache(cacheSize = 2)):
	def new_function(*args, **kwargs):
		value = cache.getResult(args[0])
		if(value != -999):
			#Using Cache...
			return value
		else:
			#Computing Value...
			value = original_function(*args, **kwargs)
			cache.cacheResult(args[0], value)
			return value
	return new_function


@Demo_f
def f(n):
	if n < 2:
		return n
	return f(n-1) + f(n-2)

for x in range(10):
	print(f(x))

def cache(f, size):
    cached_vals = {}
    cached_args = []

    def wrapped(*args):
        if args in cached_vals:
            return cached_vals[args]

        result = f(*args)

        if len(cached_args) == size:
            args_of_result_to_remove = cached_args.pop()
            del cached_vals[args_of_result_to_remove]

        cached_vals[args] = result
        cached_args.insert(0, args)

        return result

    return wrapped