usecachekit::policy::fifo::FifoCache;usecachekit::traits::Cache;fnmain(){// Create a FIFO cache with a capacity of 100 entries
letmut cache =FifoCache::new(100);// Insert an item
cache.insert("key1","value1");// Retrieve an item
ifletSome(value)= cache.get(&"key1"){println!("Got from cache: {}", value);}}// Expected output:
// Got from cache: value1
//// Explanation: FIFO preserves insertion order; the inserted key is still present.