README
¶
golang-rlogc
R+log(C) Cache policy. I am the author of this algorithm BTW.
Why another cache algorithm?
I was annoyed of the lack of proper cache algorithms, so I invented my own.
Whereas other cache policies like LRU-2, 2Q, LIRS and ARC are implemented using two queues and/or a victim cache. R+log(C), on the other hand, only requires a single priority queue.
May I rip off this cache policy?
Please do!
And what about commercial applications?
Great! I'd appreciate it.
Directories
¶
| Path | Synopsis |
|---|---|
|
This package implements a fixed-size thread safe *R+log(C)* cache.
|
This package implements a fixed-size thread safe *R+log(C)* cache. |
|
A goleveldb cache backend.
|
A goleveldb cache backend. |
|
A simple, non-synchronized RlogC implementation.
|
A simple, non-synchronized RlogC implementation. |
|
Timer implementations for RlogC
|
Timer implementations for RlogC |
Click to show internal directories.
Click to hide internal directories.