Implemented pruning

Author: bwbush

analysis/markov/Linleios/Evolve.lean

@@ -74,8 +74,11 @@ def evolve (transition : State → List (State × Probability)) : Probabilities
     ∅
 
 def simulate (transition : State → List (State × Probability)) (start : Probabilities) : Nat → Probabilities
-| 0     => start
-| n + 1 => simulate transition (evolve transition start) n
+  | 0     => start
+  | n + 1 => simulate transition (evolve transition start) n
+
+def prune (ε : Float) : Probabilities → Probabilities :=
+  HashMap.filter (fun _ p => p ≥ ε)
 
 def totalProbability (states : Probabilities) : Probability :=
   states.values.sum

analysis/markov/Main.lean

@@ -5,10 +5,11 @@ import Linleios
 def env : Environment := makeEnvironment 0.05 1 4 7
 
 def s0 : Probabilities := default
-def sn := simulate (@forge env) s0 5
+def sn := simulate (@forge env) s0 50
 def pn := totalProbability sn
 
 def main : IO Unit :=
   do
-    IO.println $ (reprPrec sn 0).pretty
-    IO.println $ (reprPrec pn 0).pretty
+    let print {α : Type} [Repr α]  (x : α) : IO Unit := IO.println $ (reprPrec x 0).pretty
+    print sn
+    print pn