Simple Least Recently Used Cache data structure implementation in Go(lang).
// Makes a new LRU Cache of size 100
newLruCache := createLRU(100)
// Gets element from LRU Cache with key of "key"
elem, err := newLRUCache.GetElem("key)
if err != nil {
log.Println(err.Error)
}
// Adds element to LRU Cache with key "k" and value "v"
newLruCache.SetElem("k", "v")