about summary refs log tree commit diff
path: root/users/grfn/xanthous/src/Xanthous/Data/Memo.hs
blob: 2b2ee0f9602801f376acab4c49e9ba2b1f088740 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
--------------------------------------------------------------------------------
-- | Memoized values
--------------------------------------------------------------------------------
module Xanthous.Data.Memo
  ( Memoized(UnMemoized)
  , memoizeWith
  , getMemoized
  , runMemoized
  , fillWith
  , fillWithM
  ) where
--------------------------------------------------------------------------------
import Xanthous.Prelude
import Data.Aeson (FromJSON, ToJSON)
import Test.QuickCheck (Arbitrary (arbitrary), oneof, CoArbitrary, Function)
import Test.QuickCheck.Checkers (EqProp)
import Xanthous.Util (EqEqProp(EqEqProp))
import Control.Monad.State.Class (MonadState)
--------------------------------------------------------------------------------

-- | A memoized value, keyed by a key
--
-- If key is different than what is stored here, then val is invalid
data Memoized key val = Memoized key val | UnMemoized
  deriving stock (Show, Eq, Generic)
  deriving anyclass (Hashable, FromJSON, ToJSON, NFData, CoArbitrary, Function)
  deriving EqProp via EqEqProp (Memoized key val)

instance (Arbitrary k, Arbitrary v) => Arbitrary (Memoized k v) where
  arbitrary = oneof [ pure UnMemoized
                    , Memoized <$> arbitrary <*> arbitrary
                    ]

-- | Construct a memoized value with the given key
memoizeWith :: forall key val. key -> val -> Memoized key val
memoizeWith = Memoized
{-# INLINE memoizeWith #-}

-- | Retrieve a memoized value providing the key. If the value is unmemoized or
-- the keys do not match, returns Nothing.
--
-- >>> getMemoized 1 (memoizeWith @Int @Int 1 2)
-- Just 2
--
-- >>> getMemoized 2 (memoizeWith @Int @Int 1 2)
-- Nothing
--
-- >>> getMemoized 1 (UnMemoized :: Memoized Int Int)
-- Nothing
getMemoized :: Eq key => key -> Memoized key val -> Maybe val
getMemoized key (Memoized key' v)
  | key == key' = Just v
  | otherwise = Nothing
getMemoized _ UnMemoized = Nothing
{-# INLINE getMemoized #-}

-- | Get a memoized value using an applicative action to obtain the key
runMemoized
  :: (Eq key, Applicative m)
  => Memoized key val
  -> m key
  -> m (Maybe val)
runMemoized m mk = getMemoized <$> mk <*> pure m

-- | In a monadic state containing a 'MemoState', look up the current memoized
-- target of some lens keyed by k, filling it with v if not present and
-- returning either the new or old value
fillWith
  :: forall m s k v.
    (MonadState s m, Eq k)
  => Lens' s (Memoized k v)
  -> k
  -> v
  -> m v
fillWith l k v' = do
  uses l (getMemoized k) >>= \case
    Just v -> pure v
    Nothing -> do
      l .= memoizeWith k v'
      pure v'

-- | In a monadic state, look up the current memoized target of some lens keyed
-- by k, filling it with the result of some monadic action v if not present and
-- returning either the new or old value
fillWithM
  :: forall m s k v.
    (MonadState s m, Eq k)
  => Lens' s (Memoized k v)
  -> k
  -> m v
  -> m v
fillWithM l k mv = do
  uses l (getMemoized k) >>= \case
    Just v -> pure v
    Nothing -> do
      v' <- mv
      l .= memoizeWith k v'
      pure v'