INNER CODE UNIT · Go

func

duke-git/lancet · algorithm/lrucache.go:42

func (l *LRUCache[K, V]) Get(key K) (V, bool) {
	var value V

	node, ok := l.cache[key]
	if ok {
		l.moveToTail(node)
		return node.value, true
	}

	return value, false
}

// Put value of key into lru cache.
// Play: https://go.dev/play/p/iUynEfOP8G0
func (l *LRUCache[K, V]) Put(key K, value V) {
	node, ok := l.cache[key]
	if !ok {
		newNode := newLruNode(key, value)

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…