Agda-2.6.1.1: A dependently typed functional programming language and proof assistant
Safe HaskellNone
LanguageHaskell2010

Agda.Utils.Memo

Synopsis

Documentation

memo :: MonadState s m => Lens' (Maybe a) s -> m a -> m a Source #

Simple, non-reentrant memoisation.

memoRec :: MonadState s m => Lens' (Maybe a) s -> a -> m a -> m a Source #

Recursive memoisation, second argument is the value you get on recursive calls.

memoUnsafe :: Ord a => (a -> b) -> a -> b Source #

memoUnsafeH :: (Eq a, Hashable a) => (a -> b) -> a -> b Source #