Ninlgde LUR Cache

This is a very fast LRU cache implemented by Ninlgde in 2019

Installation

To install LRU cache package, you need to install Go and set your Go workspace first.

1. Download and install it:

$ go get -u github.com/Ninlgde/lrucache

2. Import it in your code:

import "github.com/Ninlgde/lrucache/go"

Quick start

package main

import (
	"fmt"
	"github.com/Ninlgde/lrucache/go"
)

func main() {
	// new a lru cache
	var cache = lru.NewLRUCache(10)

	// add key and value to cache
	cache.Add(10, 10)
	for i:=1; i<9; i++ {
		cache.Add(i, i)
	}

	// print all (k,v) in cache (head -> tail)
	iter := cache.Iterator(true)
	for v := range iter.C {
		fmt.Println(v)
	}

	fmt.Println()

	cache.Add("hhhh", 10)
	cache.Add(10, "hhhhh")
	fmt.Println(cache.Find(10)) // should be "hhhhh"
	fmt.Println(cache.Size())

	// print all (k,v) in cache (tail -> head)
	for v:= range cache.Iter(false) {
		fmt.Println(v)
	}
}

More examples see the test go files

Benchmark

Benchmark on MacBook Pro 2018

goos: darwin
goarch: amd64
pkg: github.com/Ninlgde/lrucache/go
BenchmarkThreadSafeLRU_Add-12            	 1000000	      1285 ns/op
BenchmarkThreadSafeLRU_Add2-12           	 1000000	      1318 ns/op
BenchmarkThreadSafeLRU_Add3-12           	 3000000	       528 ns/op
BenchmarkThreadSafeLRU_Size-12           	30000000	        41.4 ns/op
BenchmarkThreadSafeLRU_Size2-12          	30000000	        41.4 ns/op
BenchmarkThreadSafeLRU_Find-12           	10000000	       230 ns/op
BenchmarkThreadSafeLRU_Find2-12          	10000000	       191 ns/op
BenchmarkThreadSafeLRU_Find3-12          	20000000	        79.8 ns/op
BenchmarkThreadSafeLRU_Remove-12         	10000000	       176 ns/op
BenchmarkThreadSafeLRU_Remove2-12        	10000000	       235 ns/op
BenchmarkThreadSafeLRU_Remove3-12        	20000000	        79.3 ns/op
BenchmarkThreadSafeLRU_Iterator-12       	   10000	    144507 ns/op
BenchmarkThreadSafeLRU_Iterator2-12      	 1000000	      2228 ns/op
BenchmarkThreadSafeLRU_Itera-12          	   10000	    137011 ns/op
BenchmarkThreadSafeLRU_Itera2-12         	 1000000	      1758 ns/op
BenchmarkThreadUnsafeLRU_Add-12          	 2000000	       949 ns/op
BenchmarkThreadUnsafeLRU_Add2-12         	 1000000	      1008 ns/op
BenchmarkThreadUnsafeLRU_Add3-12         	 3000000	       415 ns/op
BenchmarkThreadUnsafeLRU_Size-12         	2000000000	         1.49 ns/op
BenchmarkThreadUnsafeLRU_Size2-12        	2000000000	         1.50 ns/op
BenchmarkThreadUnsafeLRU_Find-12         	20000000	       189 ns/op
BenchmarkThreadUnsafeLRU_Find2-12        	10000000	       183 ns/op
BenchmarkThreadUnsafeLRU_Find3-12        	50000000	        33.6 ns/op
BenchmarkThreadUnsafeLRU_Remove-12       	10000000	       172 ns/op
BenchmarkThreadUnsafeLRU_Remove2-12      	10000000	       181 ns/op
BenchmarkThreadUnsafeLRU_Remove3-12      	50000000	        34.1 ns/op
BenchmarkThreadUnsafeLRU_Iterator-12     	   10000	    150864 ns/op
BenchmarkThreadUnsafeLRU_Iterator2-12    	 1000000	      2391 ns/op
BenchmarkThreadUnsafeLRU_Iter-12         	   10000	    129474 ns/op
BenchmarkThreadUnsafeLRU_Iter2-12        	 1000000	      1758 ns/op