lrucache

• 不再维护，使用更好的平替🦄【ecache 】轻量本地内存缓存
  • 🤏 代码量<300行、30s完成接入
  • 🚀 高性能、极简设计、并发安全
  • 🏳️‍🌈 支持LRU 和 LRU-2两种模式
  • 🦖 额外小组件支持分布式一致性

• No more maintenance, please use better 🦄【ecache】 instead.
  • 🤏 Less than 300 lines, cost only ~30s to assemble
  • 🚀 Extremely easy, ultra fast and concurrency-safe
  • 🏳️‍🌈 Support both LRU mode and LRU-2 mode inside
  • 🦖 Extra plugin that support distributed consistency

lrucache

• Other Language
  • JavaScript
  • C++

Result at leetcode.com

Usage

	lc := lrucache.New(5)
	lc.Put(4, "1")
	lc.Put(1, "2")
	lc.Put(2, "3")
	lc.Put(3, "4")
	lc.Put(4, "5")

	fmt.Println("Range demo:")
	i := 1
	lc.Range(func(key, value interface{}) bool {
		fmt.Printf("[%d] %d => %s\r\n", i, key.(int), value.(string))
		i++
		return true
	})

	fmt.Println("Get demo:")
	if e, ok := lc.Get(1); ok {
		fmt.Printf("%d => %s\r\n", 1, e.(string))
	}

	fmt.Println("Reverse iteration after Get demo:")
	i = 1
	for e := lc.Back(); e != nil; e = e.Prev() {
		fmt.Printf("[%d] %d => %s\r\n", lc.Len()-i+1, e.Key.(int), e.Value.(string))
		i++
	}

	lc.Delete(4)
	fmt.Println("Iteration after Delete demo:")
	i = 1
	for e := lc.Front(); e != nil; e = e.Next() {
		fmt.Printf("[%d] %d => %s\r\n", i, e.Key.(int), e.Value.(string))
		i++
	}

Output:

Range demo:
[1] 4 => 5
[2] 3 => 4
[3] 2 => 3
[4] 1 => 2
Get demo:
1 => 2
Reverse iteration after Get demo:
[4] 2 => 3
[3] 3 => 4
[2] 4 => 5
[1] 1 => 2
Iteration after Delete demo:
[1] 1 => 2
[2] 3 => 4
[3] 2 => 3