code: func (l *LRUNoTS) Get(key string) (interface{}, error) {
  	res, err := l.cache.Get(key)
  	if err != nil {
  		return nil, err
  	}
  
  	elem := res.(*list.Element)
  	// move found item to the head
  	l.list.MoveToFront(elem)
  
  	return elem.Value.(*kv).v, nil
  }
docs: // Get returns the value of a given key if it exists, every get item will be
  // moved to the head of the linked list for keeping track of least recent used
  // item