README
¶
A go implemementation of Aadaptive Replacement Cache (ARC)
In performance, ARC is at least as good as LRU, and better in most real-world workloads.
The original algorithm is presented in the paper: http://www.almaden.ibm.com/cs/people/dmodha/arclogin.pdf. We adapt the algorithm to support caching objects with different memory sizes.
The original algorithm is implemented in the "classic" branch.
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
View Source
var CacheMiss = errors.New("miss")
View Source
var EmptyKey = errors.New("empty key")
View Source
var ObjectTooBig = errors.New("object too big to fit in the cache")
Functions ¶
This section is empty.
Types ¶
type Cache ¶
type Cache interface {
Set(string, CacheObject) error
Get(string) (CacheObject, error)
Delete(string) error
Check()
Collect() map[string]CacheObject
SetCleanFunc(CacheCleanFunc)
GetHitRate() int
GetUsage() int
GetUsageRate() int
Reset()
}
type CacheCleanFunc ¶
type CacheCleanFunc func(CacheObject) error
type CacheObject ¶
type CacheObject interface {
Size() int
}
Source Files
Directories
Click to show internal directories.
Click to hide internal directories.