aches 1.0.0 · OCaml Package

A Mutable structure akin to a hash-table, but with a size bound. When an element is added that would cause the size to overflow the bound, a different element is removed.

TRANSFER caches are intended to hold resources (think file-descriptors or database connections). To that end, a TRANSFER cleans-up resources when they are removed. When using this cache, be mindful about ownership and ownership transfer as detailed in the documentation of each function bellow.

Note that, different caches have different policies towards the size bounds: some uphold the bound strictly, some treat the bound as a suggestion. In addition, some caches count their elements somewhat sloppily.

In general, the caches of Rache are intended to be used in settings that do not require strict, by-the-number, extremely-predictable behaviors.

See Rache (or Functors) for more information.

Parameters

module H : Stdlib.Hashtbl.HashedType

Signature

type key = H.t

The type of keys on which resources in the cache are indexed.

type 'resource t

The type of caches holding bindings from key to 'resource

val create : (key -> 'resource -> unit) -> int -> 'resource t

create destroy n creates a cache with a size-bound of n. Remember that the size-bound is not upheld strictly by all caches.

Transfering ownership

val put : 'resource t -> key -> 'resource -> unit

put c k v binds the key k to the resource r in the cache c and transfer the ownership of r to the cache. After put, it is the cache's responsibility (not yours) to clean-up the resource.

If k is already bound to a value in c, the previous binding disappears and is replaced by the new binding to r. If this happens, the resource for the previous binding is cleaned-up by the cache.

If the cache is already at capacity, put may cause another binding to be removed from the cache to make room for the new one. If this happens, the resource of the removed binding is cleaned-up by the cache.

val take : 'resource t -> key -> 'resource option

take c k removes the binding of k from c and returns it to the caller along with the ownership of the associated resource: you are now responsible for cleaning-up the resource.

If k is not bound in c, then take c k does nothing.

val take_all : 'resource t -> (key * 'resource) list

take_all c returns the list of bindings held by the cache along with the ownership of their resources (you are now responsible for cleaning-up) and clears the cache entirely.

val take_some : 
  'resource t ->
  (key -> 'resource -> bool) ->
  (key * 'resource) list

take_some c f returns a list of bindings (k,r) such that f k r is true. The returned bindings are removed from the cache and the ownership of their resources is transfered to the caller (you).

Borrowing resources

val borrow : 'resource t -> key -> ('resource -> 'b) -> 'b option

borrow c k f calls f with r if k is bound to r in c. This does not remove the resource from the cache: the cache is still responsible for cleaning-up the resource.

It is unsafe to clean-up the borrowed resource from within f.

It is unsafe to use the cache c from within the function f. If you need to do so, you can adopt either of these two approaches:

use take, use the resource, and use put,
make f returns a list of operations to perform on the cache and process this after f has returned.

Note that the in caches with a non-FIFO replacement policy, this may have a side effect on the k-to-r binding. Specifically, in those caches, it might make it less likely to be removed when supernumerary bindings are inserted.

val fold : (key -> 'resource -> 'b -> 'b) -> 'resource t -> 'b -> 'b

fold f c init folds the function f and value init over the bindings of c from newest to oldest.

At each called to f, the resource of the traversed binding is borrowed by f. Consequently, the same limitations apply for fold as for borrow.

It is unsafe to clean-up any of the borrowed resources.

It is unsafe to use the cache from within f. If you need to do so, you can adopt either of these two approaches:

use take_all, fold over the list of bindings, use put on each binding,
maintain a list of operations to perform on the cache within the fold accumulator and process this list once the folding is over.

val fold_oldest_first : 
  (key -> 'resource -> 'b -> 'b) ->
  'resource t ->
  'b ->
  'b

fold_oldest_first is like fold but in reversed order: the elements that would be the first to be removed are traversed first. In a FIFO cache, it is oldest-first traversal.

The same limitations and warning applies as for fold.

Removing elements from the cache

The removal functions (remove, clear, and filter) remove the specified elements from the cache. In all cases, the resources are cleaned-up by the cache.

Calling removal functions is equivalent to calling the take* functions and cleaning up the resources yourself.

val remove : 'resource t -> key -> unit

remove c k removes and cleans-up the binding from k in c. If k is not bound in c, it does nothing.

val clear : 'resource t -> unit

clear c removes and cleans-up all bindings from c.

val filter : 'resource t -> (key -> 'resource -> bool) -> unit

filter c f removes and cleans-up all the bindings (k, v) such that f k v = false.

Introspecting the cache's state

val length : 'resource t -> int

length c is the number of bindings held by c.

val capacity : 'resource t -> int

capacity c is the number of bindings c can hold: capacity (create n) = n

module H : Stdlib.Hashtbl.HashedType with type t = key