lru/lru.go
func (c *LRU) Keys() []string {
	keys := make([]string, len(c.items))
	i := 0
	for ent := c.evictList.Back(); ent != nil; ent = ent.Prev() {
		keys[i] = ent.Value.(*entry).key
		i++
	}
	return keys
}
func (c *LRU) Keys() []string {
	keys := make([]string, len(c.items))
	i := 0
	for ent := c.evictList.Back(); ent != nil; ent = ent.Prev() {
		keys[i] = ent.Value.(*entry).key
		i++
	}
	return keys
}
func ( c * LRU ) Keys ( ) [ ] string { keys := make ( [ ] string , len ( c . items ) ) i := 0 for ent := c . evictList . Back ( ) ; ent != nil ; ent = ent . Prev ( ) { keys [ i ] = ent . Value . ( * entry ) . key i ++ } return keys }
// Keys returns a slice of the keys in the cache, from oldest to newest.
Keys returns a slice of the keys in the cache from oldest to newest .