Skip to content

HORIZON HASKELL Docs lts/ghc-10.0.x8fef28d2026-11-02Search packagesCtrl K

Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 8fef28d · 2026-11-02

Modulelrucache-1.2.0.1Haskell98

Data.Cache.LRU.IO

This module contains a mutable wrapping of an LRU in the IO monad, providing atomic access in a concurrent environment. All calls preserve the same semantics as those in Data.Cache.LRU, but perform updates in place. All functions use a single atomic update of the backing structure.

The interface this module provides is opaque. If further control is desired, the Data.Cache.LRU.IO.Internal module can be used in combination with Data.Cache.LRU.Internal.

(This implementation uses an MVar for coarse locking. It's unclear if anything else would give better performance, given that many calls alter the head of the access list.)

Synopsis

newtype AtomicLRU
value newAtomicLRU
value fromList
value toList
value maxSize
value insert
value lookup
value delete
value pop
value size
value modifyAtomicLRU
value modifyAtomicLRU'

Packagelrucache-1.2.0.1
Exports12
LanguageHaskell98
LicenceBSD-3-Clause
SourceIO.hs

newtypenewtype AtomicLRU key val

The opaque wrapper type

valuenewAtomicLRU

:: Ord key
=> Maybe Integer
the optional maximum size
-> IO (AtomicLRU key val)

Make a new AtomicLRU that will not grow beyond the optional maximum size, if specified.

valuefromList

:: Ord key
=> Maybe Integer
the optional maximum size
-> [(key, val)]
-> IO (AtomicLRU key val)

Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.

valuetoList :: Ord key => AtomicLRU key val -> IO [(key, val)]

Retrieve a list view of an AtomicLRU. See toList for the semantics.

valuemaxSize :: AtomicLRU key val -> IO (Maybe Integer)

valueinsert :: Ord key => key -> val -> AtomicLRU key val -> IO ()

Insert a key/value pair into an AtomicLRU. See insert for the semantics.

valuelookup :: Ord key => key -> AtomicLRU key val -> IO (Maybe val)

Look up a key in an AtomicLRU. See lookup for the semantics.

valuedelete :: Ord key => key -> AtomicLRU key val -> IO (Maybe val)

Remove an item from an AtomicLRU. Returns the value for the removed key, if it was present

valuepop :: Ord key => AtomicLRU key val -> IO (Maybe (key, val))

Remove the least-recently accessed item from an AtomicLRU. Returns the (key, val) pair removed, if one was present.

valuesize :: AtomicLRU key val -> IO Int

Returns the number of elements the AtomicLRU currently contains.

valuemodifyAtomicLRU

:: LRU key val -> LRU key val
-> AtomicLRU key val
-> IO ()

Given a function that takes an LRU and returns one of the same type, use it to modify the contents of this AtomicLRU.

valuemodifyAtomicLRU'

:: LRU key val -> IO (LRU key val)
-> AtomicLRU key val
-> IO ()

Given a function that takes an LRU and returns an IO action producting one of the same type, use it to modify the contents of this AtomicLRU.