Nonblocking push. If the Evict callback is not set returns the evicted item (if any), otherwise nil.

Set adds an item to the cache overwriting existing one if it exists. O(log(n)) if expiry is set, O(1) when clear.

Get a key from the cache, possibly stale. Update its LRU score. O(1)

Mark an event happening, using given timestamp. The implementation assumes time is monotonic, the behaviour is undefined in the case of time going ba

NewConn creates a connection to an Kyoto Tycoon endpoint.

Get selects an arbitrary item from the Pool, removes it from the Pool, and returns it to the caller. Get may choose to ignore the pool and treat it as

Put the byte slice back in pool.

Set stores the data at key

Methods use time.Now() when neccessary to determine expiry. Add an item to the cache overwriting existing one if it exists.

Get number of entries, for debugging

Number of entries used in the LRU

Number of entries used in the LRU

Create CircularBuffer object with a prealocated buffer of a given size.

Create new LRU cache instance. Allocate all the needed memory. O(capacity)

Methods not needing to know current time. Get a key from the cache, possibly stale. Update its LRU score.

GetBulkBytes retrieves the keys in the map. The results will be filled in on function return. If a key was not found in the database, it will be remov

Initialize already allocated Rate structure. Size stands for number of items to track in the stream. HalfLife determines the time required half-charg

Put adds x to the pool.

Update moving average with the value, using given time as weight Returns updated moving avarage.

insert inserts e after at, increments l.len, and returns e.

Do an RPC call against the KT endpoint.

insertValue is a convenience wrapper for insert(&Element{Value: v}, at).

Equivalent to: uint(math.Ceil(math.Log2(float64(n))))

Move entry from used/lru list to a free list. Clear the entry as well.

Get a byte slice from the pool.

GetAll gets the lower and upper bounds of a range for all tracked elements The items are sorted by decreasing upper bound. Complexity is O(k*log(k))

Remove removes e from l if e is an element of list l. It returns the element value e.Value.

TODO: make this return errors that can be introspected more easily and make it trim components of the error to filter out unused information.

remove removes e from its list, decrements l.len, and returns e.

Evict all items from the cache. O(n*log(n))

Current reads the rate of events per second, with specified current time.

Front returns the first element of list l or nil

Get an item from the beginning of the queue (oldest), blocking.

Initialize BytePool structure. Starts draining regularly if drainPeriod is non zero. MaxSize specifies the maximum length of a byte slice that should

MatchPrefix performs the match_prefix operation against the server It returns a sorted list of strings. The error may be ErrSuccess in the case that n

Equivalent to: uint(math.Floor(math.Log2(float64(n)))) via: http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogDeBruijn

CheckConn can be used to check connection to Kyoto Tycoon endpoint is working as expected.

Del gets and remove a key from the cache. O(log(n)) if the item is using expiry, O(1) otherwise.

Drain removes all items from the pool and make them availabe for garbage collection.

Get retrieves the data stored at key. ErrNotFound is returned if no such data exists

GetBulk retrieves the keys in the map. The results will be filled in on function return. If a key was not found in the database, it will be removed fr

GetBytes retrieves the data stored at key in the format of a byte slice ErrNotFound is returned if no such data is found.

GetNotStale gets a key from the cache, make sure it's not stale. Update its LRU score. O(log(n)) if the item is expired.

Nonblocking push. Push only if there is space. Otherwise evict v.

Next returns the next list element or nil.

Touch finds the token bucket for d, takes a token out of it and reports if there are still tokens left in the bucket.

Back returns the last element of list l or nil.

Stop the drain ticker.

Count returns the number of records in the database

CurrentNow reads the rate of events per second. Uses system clock to determine current time.

Get and remove a key from the cache.

Evict all the expired items. O(n*log(n))

GetQuiet gets a key from the cache, possibly stale. Don't modify its LRU score. O(1)

Allocate a new NewEwma structure halfLife it the time takes for a half charge or half discharge

Allocate a new NewEwmaRate structure halfLife it the time takes for a half charge or half discharge

Blocking pop an item from the end of the queue (newest), blocking.

SetNow adds an item to the cache overwriting existing one if it exists. Allows specifing current time required to expire an item when no more slots ar

Notify of an event happening, with specified current time. Returns current rate.

doGet perform http request to retrieve the value associated with key

doGetBulkBytes retrieves the keys in the map. The results will be filled in on function return. If a key was not found in the database, it will be rem

Give me the entry with lowest expiry field if it's before now.

Give me the least used entry.

KT has 2 interfaces, A restful one and an RPC one. The RESTful interface is usually much faster than the RPC one, but not all methods are implemented.