There are two functions in cache.h that have not been implemented. They are obviously vital, called calculateRelativeScore() and calculateTotalScoreForEntries(), located in the entries class and cache class respectively. They both need to be implemented using some fragment of the scoring function invented in Ideas.txt. Note that a cache does not hold all relevant possible entries, but rather all relevant possible entries of the same length. All relevant possible entries would be held in a container class which it may be redundant to create.
There are two functions in cache.h that have not been implemented. They are obviously vital, called
calculateRelativeScore()andcalculateTotalScoreForEntries(), located in the entries class and cache class respectively. They both need to be implemented using some fragment of the scoring function invented in Ideas.txt. Note that a cache does not hold all relevant possible entries, but rather all relevant possible entries of the same length. All relevant possible entries would be held in a container class which it may be redundant to create.