https://github.com/dchest/lru

Go package lru implements Least Recently Used cache algorithm.
https://github.com/dchest/lru

Last synced: about 1 month ago
JSON representation

Go package lru implements Least Recently Used cache algorithm.

• Host: GitHub
• URL: https://github.com/dchest/lru
• Owner: dchest
• License: bsd-2-clause
• Created: 2015-03-18T16:48:59.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2015-10-22T10:36:05.000Z (about 9 years ago)
• Last Synced: 2024-06-19T00:32:19.291Z (5 months ago)
• Language: Go
• Homepage:
• Size: 110 KB
• Stars: 19
• Watchers: 5
• Forks: 3
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • License: LICENSE

Awesome Lists containing this project

README

        
Go package lru implements Least Recently Used cache algorithm.

Cache capacity can be optionally limited by both size in bytes and a number

of items. Items can keep track of their modification and access time.

INSTALLATION

	$ go get github.com/dchest/lru

DOCUMENTATION

	See http://godoc.org/github.com/dchest/lru

ACKNOWLEDGEMENTS

Some code structure ideas are inspired by YouTube's Vitess implementation of

LRU cache, but no code was taken from it:

https://github.com/youtube/vitess/blob/master/go/cache/lru_cache.go

Thanks to Chaker Nakhli (@nakhli)  for the article:

http://www.sinbadsoft.com/blog/a-lru-cache-implementation/