N-Way Set Associative Cache

A set associative cache is split into sets independent sets, and each set can hold at most ways keys. Every key is assigned to exactly one set, and it can only ever be stored in that set.

To find a key's set, compute this hash over its characters and take h % sets:

h = 0
for each character ch in key:
    h = (h * 31 + ord(ch)) % 1000000007
set_index = h % sets

Process accesses in order. For each key:

• If the key is already in its set, the access is a hit, and the key becomes the most recently used key of that set.
• Otherwise it is a miss. If the set already holds ways keys, first evict the least recently used key of that set (other sets are never affected). Then store the key as the most recently used.

Return a list with one boolean per access: True for a hit, False for a miss.