Documentation
¶
Overview ¶
Package db package defines interfaces to implement a caching database. It also custom storage backends such as skip lists. The caching server supports multiple storage backends along with different eviction policies. So it is important to provide a shared behavior for the storage itself and the policies. To implement a caching strategy (i.e.: db + policy), one will have to define a Database and a CachePolicy structs which implement the relevant interfaces respectively. They will then need to define a third structure which combines both. For example, a Cache server using LRU policy with HashMap as backend. It is also possible to just define one structure which implements all the required interfaces.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type CMap ¶
type CMap struct {
// contains filtered or unexported fields
}
func (*CMap) DeleteEntry ¶
type Cache ¶
type Cache struct {
// contains filtered or unexported fields
}
Cache is the storage of our cache server. For now, we apply global lock for simplicity. Later on, we could average RWLocks and fine-grained locking strategy. This means that there is no need for mutexes at the eviction struct side.
type Eviction ¶
type Eviction interface {
// Refresh refreshes an existing elements
Refresh(key string)
// Evict evicts an item and return it key.
// An error is returned if the key is not found.
// This method should not return an error.
Evict() string
// Add a new element not already managed by this policy
Add(key string)
// Delete remove an element from the policy metadata.
Delete(key string)
}
Eviction defines how entries are evicted.
func CreateEvictionPolicy ¶
CreateEvictionPolicy is a factory method for eviction policies.
Source Files
Directories