Run ormolu

Author: turion

models/HMM.hs

@@ -15,7 +15,7 @@ import Data.Maybe (fromJust, isJust)
 import Data.Vector (fromList)
 import Pipes (MFunctor (hoist), MonadTrans (lift), each, yield, (>->))
 import Pipes.Core (Producer)
-import qualified Pipes.Prelude as Pipes
+import Pipes.Prelude qualified as Pipes
 
 -- | Observed values
 values :: [Double]

src/Control/Monad/Bayes/Inference/MCMC.hs

@@ -12,19 +12,19 @@
 module Control.Monad.Bayes.Inference.MCMC where
 
 import Control.Monad.Bayes.Class (MonadDistribution)
-import qualified Control.Monad.Bayes.Traced.Basic as Basic
+import Control.Monad.Bayes.Traced.Basic qualified as Basic
 import Control.Monad.Bayes.Traced.Common
   ( MHResult (MHResult, trace),
     Trace (probDensity),
     burnIn,
     mhTransWithBool,
   )
-import qualified Control.Monad.Bayes.Traced.Dynamic as Dynamic
-import qualified Control.Monad.Bayes.Traced.Static as Static
+import Control.Monad.Bayes.Traced.Dynamic qualified as Dynamic
+import Control.Monad.Bayes.Traced.Static qualified as Static
 import Control.Monad.Bayes.Weighted (Weighted, unweighted)
 import Pipes ((>->))
-import qualified Pipes as P
-import qualified Pipes.Prelude as P
+import Pipes qualified as P
+import Pipes.Prelude qualified as P
 
 data Proposal = SingleSiteMH
 

src/Control/Monad/Bayes/Inference/TUI.hs

@@ -57,7 +57,9 @@ drawUI handleSamples state = [ui]
               (toDoAttr, B.progressIncompleteAttr)
             ]
         )
-        $ toBar $ fromIntegral $ numSteps state
+        $ toBar
+        $ fromIntegral
+        $ numSteps state
 
     likelihoodBar =
       updateAttrMap

src/Control/Monad/Bayes/Population.hs

@@ -181,11 +181,11 @@ stratified weights = do
       cumulativeSum = V.scanl (+) 0.0 weights
       coalg (i, j)
         | i < bigN =
-          if (positions ! i) < (cumulativeSum ! j)
-            then Just (Just j, (i + 1, j))
-            else Just (Nothing, (i, j + 1))
+            if (positions ! i) < (cumulativeSum ! j)
+              then Just (Just j, (i + 1, j))
+              else Just (Nothing, (i, j + 1))
         | otherwise =
-          Nothing
+            Nothing
   return $ map (\i -> i - 1) $ catMaybes $ unfoldr coalg (0, 0)
 
 -- | Resample the population using the underlying monad and a stratified resampling scheme.

src/Control/Monad/Bayes/Sampler/Lazy.hs

@@ -15,7 +15,7 @@ import System.Random
     getStdGen,
     newStdGen,
   )
-import qualified System.Random as R
+import System.Random qualified as R
 
 -- | A 'Tree' is a lazy, infinitely wide and infinitely deep tree, labelled by Doubles
 -- | Our source of randomness will be a Tree, populated by uniform [0,1] choices for each label.

src/Control/Monad/Bayes/Traced/Basic.hs

@@ -85,6 +85,6 @@ mh n (Traced m d) = fmap (map output . NE.toList) (f n)
     f k
       | k <= 0 = fmap (:| []) d
       | otherwise = do
-        (x :| xs) <- f (k - 1)
-        y <- mhTrans' m x
-        return (y :| x : xs)
+          (x :| xs) <- f (k - 1)
+          y <- mhTrans' m x
+          return (y :| x : xs)

src/Control/Monad/Bayes/Traced/Common.hs

@@ -24,8 +24,8 @@ import Control.Monad.Bayes.Class
   ( MonadDistribution (bernoulli, random),
     discrete,
   )
-import qualified Control.Monad.Bayes.Density.Free as Free
-import qualified Control.Monad.Bayes.Density.State as State
+import Control.Monad.Bayes.Density.Free qualified as Free
+import Control.Monad.Bayes.Density.State qualified as State
 import Control.Monad.Bayes.Weighted as Weighted
   ( Weighted,
     hoist,

src/Control/Monad/Bayes/Traced/Dynamic.hs

@@ -105,7 +105,7 @@ mh n (Traced c) = do
   let f k
         | k <= 0 = return (t :| [])
         | otherwise = do
-          (x :| xs) <- f (k - 1)
-          y <- mhTransFree m x
-          return (y :| x : xs)
+            (x :| xs) <- f (k - 1)
+            y <- mhTransFree m x
+            return (y :| x : xs)
   fmap (map output . NE.toList) (f n)

src/Control/Monad/Bayes/Traced/Static.hs

@@ -117,6 +117,6 @@ mh n (Traced m d) = fmap (map output . NE.toList) (f n)
     f k
       | k <= 0 = fmap (:| []) d
       | otherwise = do
-        (x :| xs) <- f (k - 1)
-        y <- mhTransFree m x
-        return (y :| x : xs)
+          (x :| xs) <- f (k - 1)
+          y <- mhTransFree m x
+          return (y :| x : xs)

src/Math/Integrators/StormerVerlet.hs

@@ -8,7 +8,7 @@ where
 import Control.Lens
 import Control.Monad.Primitive
 import Data.Vector (Vector, (!))
-import qualified Data.Vector as V
+import Data.Vector qualified as V
 import Data.Vector.Mutable
 import Linear (V2 (..))
 
@@ -71,7 +71,7 @@ integrateV integrator initial times = do
     compute y i out
       | i == V.length times = return ()
       | otherwise = do
-        let h = (times ! i) - (times ! (i - 1))
-            y' = integrator h y
-        write out i y'
-        compute y' (i + 1) out
+          let h = (times ! i) - (times ! (i - 1))
+              y' = integrator h y
+          write out i y'
+          compute y' (i + 1) out