func (s *LRUCache[K, V]) GetKeys() []K {
	keys := make([]K, 0, s.Size())
	currentListElement := s.linkedList.Front()
	for currentListElement != nil {
		entry := currentListElement.Value.(*LRUEntry[K, V])
		keys = append(keys, entry.Key)
		currentListElement = currentListElement.Next()
	}
	return keys
}
// GetKeys returns a list of the cache's keys in most recently used order
GetKeys returns a list of the cache's keys in most recently used order
// GetKeys returns a list of the cache ' s keys in most recently used order
func (s *LRUCache[K, V]) GetKeys() []K {
	keys := make([]K, 0, s.Size())
	currentListElement := s.linkedList.Front()
	for currentListElement != nil {
		entry := currentListElement.Value.(*LRUEntry[K, V])
		keys = append(keys, entry.Key)
		currentListElement = currentListElement.Next()
	}
	return keys
}
func ( s * LRUCache [ K , V ] ) GetKeys ( ) [ ] K { keys := make ( [ ] K , 0 , s . Size ( ) ) currentListElement := s . linkedList . Front ( ) for currentListElement != nil { entry := currentListElement . Value . ( * LRUEntry [ K , V ] ) keys = append ( keys , entry . Key ) currentListElement = currentListElement . Next ( ) } return keys }
GetKeys returns a list of the cache's keys in most recently used order
GetKeys returns a list of the cache ' s keys in most recently used order