什么是数据结构，类似哈希表，但不常用的键被删除?

I am looking for a data structure that operates similar to a hash table, but where the table has a size limit. When the number of items in the hash reaches the size limit, a culling function should be called to get rid of the least-retrieved key/value pairs in the table.I am looking for a data structure that operates