aboutsummaryrefslogtreecommitdiff
path: root/stdlib/source/library/lux/control/function/memo.lux
blob: 5d25cae50edc9a02229626695c5a8cfbafaf6393 (plain)
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
... Inspired by;
... "The Different Aspects of Monads and Mixins" by Bruno C. d. S. Oliveira
(.using
  [library
   [lux "*"
    [abstract
     [hash {"+" Hash}]
     [monad {"+" do}]]
    [control
     ["[0]" state {"+" State}]]
    [data
     ["[0]" product]
     [collection
      ["[0]" dictionary {"+" Dictionary}]]]]]
  ["[0]" // "_"
   ["[1]" mixin {"+" Mixin Recursive}]])

(def: .public memoization
  (All (_ i o)
    (Mixin i (State (Dictionary i o) o)))
  (function (_ delegate recur)
    (function (_ input)
      (do [! state.monad]
        [memory state.get]
        (case (dictionary.value input memory)
          {.#Some output}
          (in output)

          {.#None}
          (do !
            [output (delegate input)
             _ (state.update (dictionary.has input output))]
            (in output)))))))

(type: .public (Memo i o)
  (Recursive i (State (Dictionary i o) o)))

(def: .public (open memo)
  (All (_ i o)
    (:let [Memory (Dictionary i o)]
      (-> (Memo i o) (-> [Memory i] [Memory o]))))
  (let [memo (//.fixed (//.mixed ..memoization (//.of_recursive memo)))]
    (function (_ [memory input])
      (|> input memo (state.result memory)))))

(def: .public (closed hash memo)
  (All (_ i o)
    (-> (Hash i) (Memo i o) (-> i o)))
  (let [memo (//.fixed (//.mixed ..memoization (//.of_recursive memo)))
        empty (dictionary.empty hash)]
    (|>> memo (state.result empty) product.right)))

(def: .public (none hash memo)
  (All (_ i o)
    (-> (Hash i) (Memo i o) (-> i o)))
  (let [memo (//.fixed (//.of_recursive memo))
        empty (dictionary.empty hash)]
    (|>> memo (state.result empty) product.right)))