2012-01-02 02:01:04 -08:00
|
|
|
package cache
|
|
|
|
|
2012-01-15 10:16:10 -08:00
|
|
|
import (
|
2012-01-28 18:16:59 -08:00
|
|
|
"encoding/gob"
|
2012-01-15 10:16:10 -08:00
|
|
|
"fmt"
|
2012-01-28 18:16:59 -08:00
|
|
|
"io"
|
|
|
|
"os"
|
2012-01-15 10:16:10 -08:00
|
|
|
"runtime"
|
|
|
|
"sync"
|
|
|
|
"time"
|
|
|
|
)
|
|
|
|
|
2013-08-08 11:53:02 -07:00
|
|
|
type Item struct {
|
2012-01-28 18:16:59 -08:00
|
|
|
Object interface{}
|
|
|
|
Expiration *time.Time
|
2015-02-27 12:57:16 -08:00
|
|
|
Ctime *time.Time
|
|
|
|
Atime *time.Time
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Returns true if the item has expired.
|
2013-08-08 11:53:02 -07:00
|
|
|
func (item *Item) Expired() bool {
|
|
|
|
if item.Expiration == nil {
|
2012-01-28 18:16:59 -08:00
|
|
|
return false
|
|
|
|
}
|
2013-08-08 11:53:02 -07:00
|
|
|
return item.Expiration.Before(time.Now())
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
|
2015-02-27 12:57:16 -08:00
|
|
|
// Return the Atime
|
|
|
|
func (item *Item) LastAccessed() *time.Time {
|
|
|
|
return item.Atime
|
|
|
|
}
|
|
|
|
|
|
|
|
func (item *Item) Accessed() {
|
|
|
|
now := time.Now()
|
|
|
|
item.Atime = &now
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return the Ctime
|
|
|
|
func (item *Item) Created() *time.Time {
|
|
|
|
return item.Ctime
|
|
|
|
}
|
|
|
|
|
2014-12-21 22:46:22 -08:00
|
|
|
const (
|
2014-12-21 23:47:08 -08:00
|
|
|
// For use with functions that take an expiration time.
|
2014-12-21 23:48:52 -08:00
|
|
|
NoExpiration time.Duration = -1
|
2014-12-21 23:47:08 -08:00
|
|
|
// For use with functions that take an expiration time. Equivalent to
|
|
|
|
// passing in the same expiration duration as was given to New() or
|
|
|
|
// NewFrom() when the cache was created (e.g. 5 minutes.)
|
2014-12-21 22:46:22 -08:00
|
|
|
DefaultExpiration time.Duration = 0
|
|
|
|
)
|
|
|
|
|
2012-01-02 02:01:04 -08:00
|
|
|
type Cache struct {
|
|
|
|
*cache
|
2012-06-21 19:56:12 -07:00
|
|
|
// If this is confusing, see the comment at the bottom of New()
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
type cache struct {
|
2013-06-30 17:11:57 -07:00
|
|
|
sync.RWMutex
|
2012-07-04 11:34:37 -07:00
|
|
|
defaultExpiration time.Duration
|
2013-08-08 11:53:02 -07:00
|
|
|
items map[string]*Item
|
2012-01-02 02:01:04 -08:00
|
|
|
janitor *janitor
|
2015-02-27 12:57:16 -08:00
|
|
|
maxItems int
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
2014-12-21 22:46:22 -08:00
|
|
|
// Add an item to the cache, replacing any existing item. If the duration is 0
|
|
|
|
// (DefaultExpiration), the cache's default expiration time is used. If it is -1
|
|
|
|
// (NoExpiration), the item never expires.
|
2012-01-04 00:11:27 -08:00
|
|
|
func (c *cache) Set(k string, x interface{}, d time.Duration) {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
2012-01-03 23:54:01 -08:00
|
|
|
c.set(k, x, d)
|
2012-06-21 19:51:34 -07:00
|
|
|
// TODO: Calls to mu.Unlock are currently not deferred because defer
|
|
|
|
// adds ~200 ns (as of go1.)
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-03 23:54:01 -08:00
|
|
|
}
|
|
|
|
|
2012-01-04 00:11:27 -08:00
|
|
|
func (c *cache) set(k string, x interface{}, d time.Duration) {
|
|
|
|
var e *time.Time
|
2015-02-27 12:57:16 -08:00
|
|
|
t := time.Now()
|
|
|
|
at := &t
|
|
|
|
ct := &t
|
|
|
|
|
2014-12-21 22:46:22 -08:00
|
|
|
if d == DefaultExpiration {
|
2012-07-04 11:34:37 -07:00
|
|
|
d = c.defaultExpiration
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
2012-01-02 08:13:29 -08:00
|
|
|
if d > 0 {
|
2015-02-27 12:57:16 -08:00
|
|
|
t = time.Now().Add(d)
|
2012-01-02 02:01:04 -08:00
|
|
|
e = &t
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 {
|
|
|
|
// We don't want to hit the expiration if we're updating.
|
|
|
|
_, found := c.get(k)
|
|
|
|
if ! found {
|
|
|
|
// Create, means maybe expire
|
|
|
|
c.ExpireLRU()
|
|
|
|
} else {
|
|
|
|
// Update, means don't expire, or change the Ctime
|
|
|
|
ct = c.items[k].Created()
|
|
|
|
}
|
|
|
|
c.items[k] = &Item{
|
|
|
|
Object: x,
|
|
|
|
Expiration: e,
|
|
|
|
Ctime: ct,
|
|
|
|
Atime: at,
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Not using maxItems
|
|
|
|
c.items[k] = &Item{
|
|
|
|
Object: x,
|
|
|
|
Expiration: e,
|
|
|
|
}
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Add an item to the cache only if an item doesn't already exist for the given
|
|
|
|
// key, or if the existing item has expired. Returns an error otherwise.
|
2012-01-04 00:11:27 -08:00
|
|
|
func (c *cache) Add(k string, x interface{}, d time.Duration) error {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
2012-01-03 23:54:01 -08:00
|
|
|
_, found := c.get(k)
|
2012-01-02 05:04:47 -08:00
|
|
|
if found {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2013-04-18 11:24:30 -07:00
|
|
|
return fmt.Errorf("Item %s already exists", k)
|
2012-01-02 05:04:47 -08:00
|
|
|
}
|
2012-01-03 23:54:01 -08:00
|
|
|
c.set(k, x, d)
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-02 05:04:47 -08:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2013-06-30 17:11:57 -07:00
|
|
|
// Set a new value for the cache key only if it already exists, and the existing
|
|
|
|
// item hasn't expired. Returns an error otherwise.
|
2012-01-04 00:11:27 -08:00
|
|
|
func (c *cache) Replace(k string, x interface{}, d time.Duration) error {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
2012-01-03 23:54:01 -08:00
|
|
|
_, found := c.get(k)
|
2012-01-02 05:04:47 -08:00
|
|
|
if !found {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2013-04-18 11:24:30 -07:00
|
|
|
return fmt.Errorf("Item %s doesn't exist", k)
|
2012-01-02 05:04:47 -08:00
|
|
|
}
|
2012-01-03 23:54:01 -08:00
|
|
|
c.set(k, x, d)
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-02 05:04:47 -08:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Get an item from the cache. Returns the item or nil, and a bool indicating
|
|
|
|
// whether the key was found.
|
2012-01-02 04:52:43 -08:00
|
|
|
func (c *cache) Get(k string) (interface{}, bool) {
|
2013-06-30 17:11:57 -07:00
|
|
|
c.RLock()
|
2012-02-16 16:40:55 -08:00
|
|
|
x, found := c.get(k)
|
2013-06-30 17:11:57 -07:00
|
|
|
c.RUnlock()
|
2012-02-16 16:40:55 -08:00
|
|
|
return x, found
|
2012-01-03 23:54:01 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
func (c *cache) get(k string) (interface{}, bool) {
|
2012-07-04 11:34:37 -07:00
|
|
|
item, found := c.items[k]
|
2013-06-30 17:11:57 -07:00
|
|
|
if !found || item.Expired() {
|
2012-01-02 02:01:04 -08:00
|
|
|
return nil, false
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { item.Accessed() }
|
|
|
|
|
2012-01-02 02:01:04 -08:00
|
|
|
return item.Object, true
|
|
|
|
}
|
|
|
|
|
2012-06-21 19:56:12 -07:00
|
|
|
// Increment an item of type int, int8, int16, int32, int64, uintptr, uint,
|
2012-08-17 04:39:02 -07:00
|
|
|
// uint8, uint32, or uint64, float32 or float64 by n. Returns an error if the
|
2012-06-21 19:56:12 -07:00
|
|
|
// item's value is not an integer, if it was not found, or if it is not
|
2013-04-18 11:24:30 -07:00
|
|
|
// possible to increment it by n. To retrieve the incremented value, use one
|
|
|
|
// of the specialized methods, e.g. IncrementInt64.
|
2012-08-17 04:39:02 -07:00
|
|
|
func (c *cache) Increment(k string, n int64) error {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
2012-01-04 02:37:02 -08:00
|
|
|
if !found || v.Expired() {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2013-04-18 11:24:30 -07:00
|
|
|
return fmt.Errorf("Item %s not found", k)
|
2012-01-02 04:52:43 -08:00
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2012-08-17 02:35:20 -07:00
|
|
|
switch v.Object.(type) {
|
|
|
|
case int:
|
|
|
|
v.Object = v.Object.(int) + int(n)
|
|
|
|
case int8:
|
|
|
|
v.Object = v.Object.(int8) + int8(n)
|
|
|
|
case int16:
|
|
|
|
v.Object = v.Object.(int16) + int16(n)
|
|
|
|
case int32:
|
|
|
|
v.Object = v.Object.(int32) + int32(n)
|
|
|
|
case int64:
|
2012-08-17 04:39:02 -07:00
|
|
|
v.Object = v.Object.(int64) + n
|
2012-08-17 02:35:20 -07:00
|
|
|
case uint:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(uint) + uint(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case uintptr:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(uintptr) + uintptr(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case uint8:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(uint8) + uint8(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case uint16:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(uint16) + uint16(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case uint32:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(uint32) + uint32(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case uint64:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(uint64) + uint64(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case float32:
|
2012-01-02 04:52:43 -08:00
|
|
|
v.Object = v.Object.(float32) + float32(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
case float64:
|
2012-08-17 04:39:02 -07:00
|
|
|
v.Object = v.Object.(float64) + float64(n)
|
2012-08-17 02:35:20 -07:00
|
|
|
default:
|
|
|
|
c.Unlock()
|
2012-08-17 04:39:02 -07:00
|
|
|
return fmt.Errorf("The value for %s is not an integer", k)
|
2012-01-02 04:52:43 -08:00
|
|
|
}
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-02 04:52:43 -08:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
// Increment an item of type float32 or float64 by n. Returns an error if the
|
|
|
|
// item's value is not floating point, if it was not found, or if it is not
|
|
|
|
// possible to increment it by n. Pass a negative number to decrement the
|
|
|
|
// value. To retrieve the incremented value, use one of the specialized methods,
|
|
|
|
// e.g. IncrementFloat64.
|
|
|
|
func (c *cache) IncrementFloat(k string, n float64) error {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
switch v.Object.(type) {
|
|
|
|
case float32:
|
|
|
|
v.Object = v.Object.(float32) + float32(n)
|
|
|
|
case float64:
|
|
|
|
v.Object = v.Object.(float64) + n
|
|
|
|
default:
|
|
|
|
c.Unlock()
|
|
|
|
return fmt.Errorf("The value for %s does not have type float32 or float64", k)
|
|
|
|
}
|
|
|
|
c.Unlock()
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type int by n. Returns an error if the item's value is
|
|
|
|
// not an int, or if it was not found. If there is no error, the incremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) IncrementInt(k string, n int) (int, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type int8 by n. Returns an error if the item's value is
|
|
|
|
// not an int8, or if it was not found. If there is no error, the incremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) IncrementInt8(k string, n int8) (int8, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int8)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int8", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type int16 by n. Returns an error if the item's value is
|
|
|
|
// not an int16, or if it was not found. If there is no error, the incremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) IncrementInt16(k string, n int16) (int16, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int16)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int16", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type int32 by n. Returns an error if the item's value is
|
|
|
|
// not an int32, or if it was not found. If there is no error, the incremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) IncrementInt32(k string, n int32) (int32, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int32)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int32", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type int64 by n. Returns an error if the item's value is
|
|
|
|
// not an int64, or if it was not found. If there is no error, the incremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) IncrementInt64(k string, n int64) (int64, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int64)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int64", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type uint by n. Returns an error if the item's value is
|
|
|
|
// not an uint, or if it was not found. If there is no error, the incremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) IncrementUint(k string, n uint) (uint, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type uintptr by n. Returns an error if the item's value
|
|
|
|
// is not an uintptr, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementUintptr(k string, n uintptr) (uintptr, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uintptr)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uintptr", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type uint8 by n. Returns an error if the item's value
|
|
|
|
// is not an uint8, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementUint8(k string, n uint8) (uint8, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint8)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint8", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type uint16 by n. Returns an error if the item's value
|
|
|
|
// is not an uint16, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementUint16(k string, n uint16) (uint16, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint16)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint16", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type uint32 by n. Returns an error if the item's value
|
|
|
|
// is not an uint32, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementUint32(k string, n uint32) (uint32, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint32)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint32", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type uint64 by n. Returns an error if the item's value
|
|
|
|
// is not an uint64, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementUint64(k string, n uint64) (uint64, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint64)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint64", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type float32 by n. Returns an error if the item's value
|
|
|
|
// is not an float32, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementFloat32(k string, n float32) (float32, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(float32)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an float32", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Increment an item of type float64 by n. Returns an error if the item's value
|
|
|
|
// is not an float64, or if it was not found. If there is no error, the
|
|
|
|
// incremented value is returned.
|
|
|
|
func (c *cache) IncrementFloat64(k string, n float64) (float64, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(float64)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an float64", k)
|
|
|
|
}
|
|
|
|
nv := rv + n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
2012-06-21 19:56:12 -07:00
|
|
|
// Decrement an item of type int, int8, int16, int32, int64, uintptr, uint,
|
|
|
|
// uint8, uint32, or uint64, float32 or float64 by n. Returns an error if the
|
|
|
|
// item's value is not an integer, if it was not found, or if it is not
|
2013-04-18 11:24:30 -07:00
|
|
|
// possible to decrement it by n. To retrieve the decremented value, use one
|
|
|
|
// of the specialized methods, e.g. DecrementInt64.
|
2012-01-04 00:11:27 -08:00
|
|
|
func (c *cache) Decrement(k string, n int64) error {
|
2012-08-17 04:39:02 -07:00
|
|
|
// TODO: Implement Increment and Decrement more cleanly.
|
|
|
|
// (Cannot do Increment(k, n*-1) for uints.)
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
2013-04-18 11:24:30 -07:00
|
|
|
return fmt.Errorf("Item not found")
|
2012-08-17 04:39:02 -07:00
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2012-08-17 04:39:02 -07:00
|
|
|
switch v.Object.(type) {
|
|
|
|
case int:
|
|
|
|
v.Object = v.Object.(int) - int(n)
|
|
|
|
case int8:
|
|
|
|
v.Object = v.Object.(int8) - int8(n)
|
|
|
|
case int16:
|
|
|
|
v.Object = v.Object.(int16) - int16(n)
|
|
|
|
case int32:
|
|
|
|
v.Object = v.Object.(int32) - int32(n)
|
|
|
|
case int64:
|
|
|
|
v.Object = v.Object.(int64) - n
|
|
|
|
case uint:
|
|
|
|
v.Object = v.Object.(uint) - uint(n)
|
|
|
|
case uintptr:
|
|
|
|
v.Object = v.Object.(uintptr) - uintptr(n)
|
|
|
|
case uint8:
|
|
|
|
v.Object = v.Object.(uint8) - uint8(n)
|
|
|
|
case uint16:
|
|
|
|
v.Object = v.Object.(uint16) - uint16(n)
|
|
|
|
case uint32:
|
|
|
|
v.Object = v.Object.(uint32) - uint32(n)
|
|
|
|
case uint64:
|
|
|
|
v.Object = v.Object.(uint64) - uint64(n)
|
|
|
|
case float32:
|
|
|
|
v.Object = v.Object.(float32) - float32(n)
|
|
|
|
case float64:
|
|
|
|
v.Object = v.Object.(float64) - float64(n)
|
|
|
|
default:
|
|
|
|
c.Unlock()
|
|
|
|
return fmt.Errorf("The value for %s is not an integer", k)
|
|
|
|
}
|
|
|
|
c.Unlock()
|
|
|
|
return nil
|
2012-01-02 04:52:43 -08:00
|
|
|
}
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
// Decrement an item of type float32 or float64 by n. Returns an error if the
|
|
|
|
// item's value is not floating point, if it was not found, or if it is not
|
|
|
|
// possible to decrement it by n. Pass a negative number to decrement the
|
|
|
|
// value. To retrieve the decremented value, use one of the specialized methods,
|
|
|
|
// e.g. DecrementFloat64.
|
|
|
|
func (c *cache) DecrementFloat(k string, n float64) error {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
switch v.Object.(type) {
|
|
|
|
case float32:
|
|
|
|
v.Object = v.Object.(float32) - float32(n)
|
|
|
|
case float64:
|
|
|
|
v.Object = v.Object.(float64) - n
|
|
|
|
default:
|
|
|
|
c.Unlock()
|
|
|
|
return fmt.Errorf("The value for %s does not have type float32 or float64", k)
|
|
|
|
}
|
|
|
|
c.Unlock()
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type int by n. Returns an error if the item's value is
|
|
|
|
// not an int, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementInt(k string, n int) (int, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type int8 by n. Returns an error if the item's value is
|
|
|
|
// not an int8, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementInt8(k string, n int8) (int8, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int8)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int8", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type int16 by n. Returns an error if the item's value is
|
|
|
|
// not an int16, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementInt16(k string, n int16) (int16, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int16)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int16", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type int32 by n. Returns an error if the item's value is
|
|
|
|
// not an int32, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementInt32(k string, n int32) (int32, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int32)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int32", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type int64 by n. Returns an error if the item's value is
|
|
|
|
// not an int64, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementInt64(k string, n int64) (int64, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(int64)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an int64", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type uint by n. Returns an error if the item's value is
|
|
|
|
// not an uint, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementUint(k string, n uint) (uint, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type uintptr by n. Returns an error if the item's value
|
|
|
|
// is not an uintptr, or if it was not found. If there is no error, the
|
|
|
|
// decremented value is returned.
|
|
|
|
func (c *cache) DecrementUintptr(k string, n uintptr) (uintptr, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uintptr)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uintptr", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type uint8 by n. Returns an error if the item's value is
|
|
|
|
// not an uint8, or if it was not found. If there is no error, the decremented
|
|
|
|
// value is returned.
|
|
|
|
func (c *cache) DecrementUint8(k string, n uint8) (uint8, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint8)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint8", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type uint16 by n. Returns an error if the item's value
|
|
|
|
// is not an uint16, or if it was not found. If there is no error, the
|
|
|
|
// decremented value is returned.
|
|
|
|
func (c *cache) DecrementUint16(k string, n uint16) (uint16, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint16)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint16", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type uint32 by n. Returns an error if the item's value
|
|
|
|
// is not an uint32, or if it was not found. If there is no error, the
|
|
|
|
// decremented value is returned.
|
|
|
|
func (c *cache) DecrementUint32(k string, n uint32) (uint32, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint32)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint32", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type uint64 by n. Returns an error if the item's value
|
|
|
|
// is not an uint64, or if it was not found. If there is no error, the
|
|
|
|
// decremented value is returned.
|
|
|
|
func (c *cache) DecrementUint64(k string, n uint64) (uint64, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(uint64)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an uint64", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type float32 by n. Returns an error if the item's value
|
|
|
|
// is not an float32, or if it was not found. If there is no error, the
|
|
|
|
// decremented value is returned.
|
|
|
|
func (c *cache) DecrementFloat32(k string, n float32) (float32, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(float32)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an float32", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Decrement an item of type float64 by n. Returns an error if the item's value
|
|
|
|
// is not an float64, or if it was not found. If there is no error, the
|
|
|
|
// decremented value is returned.
|
|
|
|
func (c *cache) DecrementFloat64(k string, n float64) (float64, error) {
|
|
|
|
c.Lock()
|
|
|
|
v, found := c.items[k]
|
|
|
|
if !found || v.Expired() {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("Item %s not found", k)
|
|
|
|
}
|
2015-02-27 12:57:16 -08:00
|
|
|
|
|
|
|
if c.maxItems > 0 { v.Accessed() }
|
|
|
|
|
2013-04-18 11:24:30 -07:00
|
|
|
rv, ok := v.Object.(float64)
|
|
|
|
if !ok {
|
|
|
|
c.Unlock()
|
|
|
|
return 0, fmt.Errorf("The value for %s is not an float64", k)
|
|
|
|
}
|
|
|
|
nv := rv - n
|
|
|
|
v.Object = nv
|
|
|
|
c.Unlock()
|
|
|
|
return nv, nil
|
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Delete an item from the cache. Does nothing if the key is not in the cache.
|
2012-01-02 04:52:43 -08:00
|
|
|
func (c *cache) Delete(k string) {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
2012-01-03 23:54:01 -08:00
|
|
|
c.delete(k)
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-03 23:54:01 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
func (c *cache) delete(k string) {
|
2012-07-04 11:34:37 -07:00
|
|
|
delete(c.items, k)
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Delete all expired items from the cache.
|
2012-01-02 02:01:04 -08:00
|
|
|
func (c *cache) DeleteExpired() {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
|
|
|
for k, v := range c.items {
|
2012-01-02 02:01:04 -08:00
|
|
|
if v.Expired() {
|
2012-01-03 23:54:01 -08:00
|
|
|
c.delete(k)
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
}
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Write the cache's items (using Gob) to an io.Writer.
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
|
|
|
// NOTE: This method is deprecated in favor of c.Items() and NewFrom() (see the
|
2014-12-21 23:37:46 -08:00
|
|
|
// documentation for NewFrom().)
|
2012-02-18 16:21:07 -08:00
|
|
|
func (c *cache) Save(w io.Writer) (err error) {
|
2012-01-28 18:16:59 -08:00
|
|
|
enc := gob.NewEncoder(w)
|
|
|
|
defer func() {
|
|
|
|
if x := recover(); x != nil {
|
2012-02-16 15:22:46 -08:00
|
|
|
err = fmt.Errorf("Error registering item types with Gob library")
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
}()
|
2013-06-30 17:11:57 -07:00
|
|
|
c.RLock()
|
2013-06-30 19:05:40 -07:00
|
|
|
defer c.RUnlock()
|
|
|
|
for _, v := range c.items {
|
2012-01-28 18:16:59 -08:00
|
|
|
gob.Register(v.Object)
|
|
|
|
}
|
2013-06-30 19:05:40 -07:00
|
|
|
err = enc.Encode(&c.items)
|
2012-02-18 16:21:07 -08:00
|
|
|
return
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Save the cache's items to the given filename, creating the file if it
|
2012-01-28 18:34:14 -08:00
|
|
|
// doesn't exist, and overwriting it if it does.
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
|
|
|
// NOTE: This method is deprecated in favor of c.Items() and NewFrom() (see the
|
2014-12-21 23:37:46 -08:00
|
|
|
// documentation for NewFrom().)
|
2012-01-28 18:16:59 -08:00
|
|
|
func (c *cache) SaveFile(fname string) error {
|
|
|
|
fp, err := os.Create(fname)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2012-09-18 16:25:42 -07:00
|
|
|
err = c.Save(fp)
|
|
|
|
if err != nil {
|
|
|
|
fp.Close()
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
return fp.Close()
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Add (Gob-serialized) cache items from an io.Reader, excluding any items with
|
2013-06-30 17:11:57 -07:00
|
|
|
// keys that already exist (and haven't expired) in the current cache.
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
|
|
|
// NOTE: This method is deprecated in favor of c.Items() and NewFrom() (see the
|
2014-12-21 23:37:46 -08:00
|
|
|
// documentation for NewFrom().)
|
2012-01-28 18:16:59 -08:00
|
|
|
func (c *cache) Load(r io.Reader) error {
|
|
|
|
dec := gob.NewDecoder(r)
|
2013-08-08 11:53:02 -07:00
|
|
|
items := map[string]*Item{}
|
2012-01-28 18:16:59 -08:00
|
|
|
err := dec.Decode(&items)
|
|
|
|
if err == nil {
|
2013-06-30 17:11:57 -07:00
|
|
|
c.Lock()
|
|
|
|
defer c.Unlock()
|
2012-01-28 18:16:59 -08:00
|
|
|
for k, v := range items {
|
2013-06-30 17:11:57 -07:00
|
|
|
ov, found := c.items[k]
|
|
|
|
if !found || ov.Expired() {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.items[k] = v
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Load and add cache items from the given filename, excluding any items with
|
|
|
|
// keys that already exist in the current cache.
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
|
|
|
// NOTE: This method is deprecated in favor of c.Items() and NewFrom() (see the
|
2014-12-21 23:37:46 -08:00
|
|
|
// documentation for NewFrom().)
|
2012-01-28 18:16:59 -08:00
|
|
|
func (c *cache) LoadFile(fname string) error {
|
|
|
|
fp, err := os.Open(fname)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2012-09-18 16:25:42 -07:00
|
|
|
err = c.Load(fp)
|
|
|
|
if err != nil {
|
|
|
|
fp.Close()
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
return fp.Close()
|
2012-01-28 18:16:59 -08:00
|
|
|
}
|
|
|
|
|
2013-08-08 11:53:02 -07:00
|
|
|
// Returns the items in the cache. This may include items that have expired,
|
|
|
|
// but have not yet been cleaned up. If this is significant, the Expiration
|
2013-08-08 12:10:54 -07:00
|
|
|
// fields of the items should be checked. Note that explicit synchronization
|
|
|
|
// is needed to use a cache and its corresponding Items() return value at
|
|
|
|
// the same time, as the map is shared.
|
2013-08-08 11:53:02 -07:00
|
|
|
func (c *cache) Items() map[string]*Item {
|
|
|
|
c.RLock()
|
|
|
|
defer c.RUnlock()
|
|
|
|
return c.items
|
|
|
|
}
|
|
|
|
|
2013-04-18 11:32:01 -07:00
|
|
|
// Returns the number of items in the cache. This may include items that have
|
2013-08-08 11:54:03 -07:00
|
|
|
// expired, but have not yet been cleaned up. Equivalent to len(c.Items()).
|
2013-04-18 11:32:01 -07:00
|
|
|
func (c *cache) ItemCount() int {
|
2013-06-30 17:11:57 -07:00
|
|
|
c.RLock()
|
2013-04-18 11:32:01 -07:00
|
|
|
n := len(c.items)
|
2013-06-30 17:11:57 -07:00
|
|
|
c.RUnlock()
|
2013-04-18 11:32:01 -07:00
|
|
|
return n
|
|
|
|
}
|
|
|
|
|
2015-02-27 12:57:16 -08:00
|
|
|
// Returns the number of items in the cache *that have not expired*
|
|
|
|
func (c *cache) itemCount() int {
|
|
|
|
n := 0
|
|
|
|
now := time.Now()
|
|
|
|
|
|
|
|
for _, v := range c.items {
|
|
|
|
if v.Expiration == nil || ! v.Expiration.Before(now) {
|
|
|
|
n++
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return n
|
|
|
|
}
|
|
|
|
|
2012-06-21 20:24:48 -07:00
|
|
|
// Delete all items from the cache.
|
2012-01-02 02:32:05 -08:00
|
|
|
func (c *cache) Flush() {
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Lock()
|
2013-08-08 11:53:02 -07:00
|
|
|
c.items = map[string]*Item{}
|
2012-07-04 11:34:37 -07:00
|
|
|
c.Unlock()
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
2015-02-27 12:57:16 -08:00
|
|
|
// Find oldest N items, and Expire them.
|
|
|
|
// Returns the number "expired".
|
|
|
|
// BIG HAIRY ALERT: This function assumes it is called
|
|
|
|
// from inside a c.Lock() .. c.Unlock() block.
|
|
|
|
func (c *cache) ExpireLRU() {
|
|
|
|
|
|
|
|
// We need the number of UNexpired Items
|
|
|
|
itemCount := c.itemCount()
|
|
|
|
|
|
|
|
if itemCount >= c.maxItems {
|
|
|
|
|
|
|
|
// Cache the current time.
|
|
|
|
// We do this "early" so that when we set an Expiration,
|
|
|
|
// it is definitely "do" when the janitor ticks
|
|
|
|
notw := time.Now()
|
|
|
|
|
|
|
|
var lastTime int64 = 0
|
|
|
|
var lastName string = ""
|
|
|
|
|
|
|
|
for k, v := range c.items {
|
|
|
|
if v.Expired() == false {
|
|
|
|
// unexpired item
|
|
|
|
|
|
|
|
atime := v.LastAccessed().UnixNano()
|
|
|
|
if lastTime == 0 {
|
|
|
|
// We need to expire something, so let's start with the first item
|
|
|
|
lastTime = atime
|
|
|
|
lastName = k
|
|
|
|
} else if atime < lastTime {
|
|
|
|
// We found a least-recently-used item
|
|
|
|
lastTime = atime
|
|
|
|
lastName = k
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if lastTime > 0 {
|
|
|
|
// We expire the item, but making it look .Expired(),
|
|
|
|
// so the janitor will clean it up for us
|
|
|
|
c.items[lastName].Expiration = ¬w
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-28 18:16:59 -08:00
|
|
|
type janitor struct {
|
|
|
|
Interval time.Duration
|
|
|
|
stop chan bool
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
func (j *janitor) Run(c *cache) {
|
|
|
|
j.stop = make(chan bool)
|
|
|
|
tick := time.Tick(j.Interval)
|
|
|
|
for {
|
|
|
|
select {
|
|
|
|
case <-tick:
|
|
|
|
c.DeleteExpired()
|
|
|
|
case <-j.stop:
|
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-22 01:24:09 -07:00
|
|
|
func stopJanitor(c *Cache) {
|
|
|
|
c.janitor.stop <- true
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
2012-06-22 01:24:09 -07:00
|
|
|
func runJanitor(c *cache, ci time.Duration) {
|
|
|
|
j := &janitor{
|
|
|
|
Interval: ci,
|
|
|
|
}
|
|
|
|
c.janitor = j
|
|
|
|
go j.Run(c)
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
|
|
|
|
2015-02-27 12:57:16 -08:00
|
|
|
func newCache(de time.Duration, m map[string]*Item, mi int) *cache {
|
2012-01-02 02:01:04 -08:00
|
|
|
if de == 0 {
|
|
|
|
de = -1
|
|
|
|
}
|
|
|
|
c := &cache{
|
2012-07-04 11:34:37 -07:00
|
|
|
defaultExpiration: de,
|
2015-02-27 12:57:16 -08:00
|
|
|
maxItems: mi,
|
2014-12-21 22:12:10 -08:00
|
|
|
items: m,
|
2012-01-02 02:01:04 -08:00
|
|
|
}
|
2012-06-22 01:24:09 -07:00
|
|
|
return c
|
|
|
|
}
|
|
|
|
|
2015-02-27 12:57:16 -08:00
|
|
|
func newCacheWithJanitor(de time.Duration, ci time.Duration, m map[string]*Item, mi int) *Cache {
|
|
|
|
c := newCache(de, m, mi)
|
2012-06-21 19:50:10 -07:00
|
|
|
// This trick ensures that the janitor goroutine (which--granted it
|
|
|
|
// was enabled--is running DeleteExpired on c forever) does not keep
|
|
|
|
// the returned C object from being garbage collected. When it is
|
|
|
|
// garbage collected, the finalizer stops the janitor goroutine, after
|
|
|
|
// which c can be collected.
|
2012-01-02 02:01:04 -08:00
|
|
|
C := &Cache{c}
|
2014-12-21 22:12:10 -08:00
|
|
|
if ci > 0 {
|
|
|
|
runJanitor(c, ci)
|
2012-01-02 02:01:04 -08:00
|
|
|
runtime.SetFinalizer(C, stopJanitor)
|
|
|
|
}
|
|
|
|
return C
|
|
|
|
}
|
2014-12-21 22:12:10 -08:00
|
|
|
|
|
|
|
// Return a new cache with a given default expiration duration and cleanup
|
2014-12-21 22:46:22 -08:00
|
|
|
// interval. If the expiration duration is less than one (or NoExpiration),
|
|
|
|
// the items in the cache never expire (by default), and must be deleted
|
|
|
|
// manually. If the cleanup interval is less than one, expired items are not
|
2014-12-21 23:06:10 -08:00
|
|
|
// deleted from the cache before calling c.DeleteExpired().
|
2015-02-27 12:57:16 -08:00
|
|
|
func New(defaultExpiration, cleanupInterval time.Duration, maxItems int) *Cache {
|
2014-12-21 22:12:10 -08:00
|
|
|
items := make(map[string]*Item)
|
2015-02-27 12:57:16 -08:00
|
|
|
return newCacheWithJanitor(defaultExpiration, cleanupInterval, items, maxItems)
|
2014-12-21 22:12:10 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Return a new cache with a given default expiration duration and cleanup
|
2014-12-21 23:04:11 -08:00
|
|
|
// interval. If the expiration duration is less than one (or NoExpiration),
|
|
|
|
// the items in the cache never expire (by default), and must be deleted
|
|
|
|
// manually. If the cleanup interval is less than one, expired items are not
|
2014-12-21 23:06:10 -08:00
|
|
|
// deleted from the cache before calling c.DeleteExpired().
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
2014-12-21 23:39:59 -08:00
|
|
|
// NewFrom() also accepts an items map which will serve as the underlying map
|
2014-12-21 23:15:12 -08:00
|
|
|
// for the cache. This is useful for starting from a deserialized cache
|
|
|
|
// (serialized using e.g. gob.Encode() on c.Items()), or passing in e.g.
|
|
|
|
// make(map[string]*Item, 500) to improve startup performance when the cache
|
|
|
|
// is expected to reach a certain minimum size.
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
|
|
|
// Only the cache's methods synchronize access to this map, so it is not
|
|
|
|
// recommended to keep any references to the map around after creating a cache.
|
2014-12-21 23:09:42 -08:00
|
|
|
// If need be, the map can be accessed at a later point using c.Items() (subject
|
|
|
|
// to the same caveat.)
|
2014-12-21 22:12:10 -08:00
|
|
|
//
|
2014-12-21 23:30:02 -08:00
|
|
|
// Note regarding serialization: When using e.g. gob, make sure to
|
|
|
|
// gob.Register() the individual types stored in the cache before encoding a
|
|
|
|
// map retrieved with c.Items(), and to register those same types before
|
|
|
|
// decoding a blob containing an items map.
|
2015-02-27 12:57:16 -08:00
|
|
|
func NewFrom(defaultExpiration, cleanupInterval time.Duration, items map[string]*Item, maxItems int) *Cache {
|
|
|
|
return newCacheWithJanitor(defaultExpiration, cleanupInterval, items, maxItems)
|
2014-12-21 22:12:10 -08:00
|
|
|
}
|