"Design a cache system that can store key-value pairs with a fixed capacity, where when the cache reaches its limit, it should evict the least recently used (LRU) entry using a data structure of your choice. Implement methods to 'get' a value by key, 'set' a new key-value pair, and 'delete' a specific key from the cache.