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