automatically run ormolu

Author: dolio

parser-typechecker/src/Unison/Codebase/Runtime/Profile.hs

@@ -11,8 +11,9 @@ module Unison.Codebase.Runtime.Profile
     aggregatePruned,
     fullProfile,
     miniProfile,
-    foldedProfile
-  ) where
+    foldedProfile,
+  )
+where
 
 import Data.Bifunctor (second)
 import Data.Functor.Identity (Identity (..))
@@ -21,9 +22,7 @@ import Data.Map.Strict qualified as M
 import Data.Set (Set)
 import Data.Set qualified as S
 import Data.String
-
 import Numeric
-
 import Unison.PrettyPrintEnv
 import Unison.Reference
 import Unison.Referent
@@ -43,7 +42,7 @@ newtype ProfTrie k a = ProfT (Map k (a, ProfTrie k a))
 data Profile k = Prof !Int !(ProfTrie k Int) !(Map k Reference)
 
 -- Abstracts over the exact key type used in a profile.
-data SomeProfile = forall k. Ord k => SomeProf (Profile k)
+data SomeProfile = forall k. (Ord k) => SomeProf (Profile k)
 
 data ProfileSpec = NoProf | MiniProf | FullProf String
   deriving (Eq, Ord, Show)
@@ -52,42 +51,42 @@ emptyProfile :: Profile k
 emptyProfile = Prof 0 (ProfT M.empty) M.empty
 
 -- Creates a singleton profile trie from a path.
-singlePath :: Ord k => [k] -> (Int, ProfTrie k Int)
+singlePath :: (Ord k) => [k] -> (Int, ProfTrie k Int)
 singlePath [] = (1, ProfT M.empty)
-singlePath (i:is) = (0,) . ProfT $! M.singleton i (singlePath is)
+singlePath (i : is) = (0,) . ProfT $! M.singleton i (singlePath is)
 
-addPath0 :: Ord k => [k] -> (Int, ProfTrie k Int) -> (Int, ProfTrie k Int)
-addPath0 [] (m, p) = (,p) $! m+1
-addPath0 (i:is) (m, ProfT p) = (m,) . ProfT $! M.alter f i p
+addPath0 :: (Ord k) => [k] -> (Int, ProfTrie k Int) -> (Int, ProfTrie k Int)
+addPath0 [] (m, p) = (,p) $! m + 1
+addPath0 (i : is) (m, ProfT p) = (m,) . ProfT $! M.alter f i p
   where
     f Nothing = Just $ singlePath is
     f (Just q) = Just $ addPath0 is q
 
 -- Adds a path to a profile trie, incrementing the count for the given
 -- path.
-addPath :: Ord k => [k] -> ProfTrie k Int -> ProfTrie k Int
+addPath :: (Ord k) => [k] -> ProfTrie k Int -> ProfTrie k Int
 addPath [] p = p
-addPath (i:is) (ProfT m) = ProfT $ M.alter f i m
+addPath (i : is) (ProfT m) = ProfT $ M.alter f i m
   where
     f Nothing = Just $ singlePath is
     f (Just q) = Just $ addPath0 is q
 
-data AggInfo k = Ag {
-    -- inherited sample count
+data AggInfo k = Ag
+  { -- inherited sample count
     inherited :: Int,
     -- total sample for all occurrences of a key
     allOccs :: Map k Int
   }
 
-instance Ord k => Semigroup (AggInfo k) where
+instance (Ord k) => Semigroup (AggInfo k) where
   Ag il al <> Ag ir ar =
     Ag (il + ir) (M.unionWith (+) al ar)
 
-instance Ord k => Monoid (AggInfo k) where
+instance (Ord k) => Monoid (AggInfo k) where
   mempty = Ag 0 M.empty
 
 aggregateWith ::
-  Ord k =>
+  (Ord k) =>
   (AggInfo k -> Int -> r) ->
   k ->
   (Int, ProfTrie k Int) ->
@@ -96,10 +95,10 @@ aggregateWith f k (m, ProfT t) =
   case M.traverseWithKey (aggregateWith f) t of
     (ag, t) -> (ag', (f ag' m, ProfT t))
       where
-      ag' = ag <> Ag m (M.singleton k m)
+        ag' = ag <> Ag m (M.singleton k m)
 
 prune0 ::
-  Ord k =>
+  (Ord k) =>
   Set k ->
   k ->
   (a, ProfTrie k a) ->
@@ -110,22 +109,22 @@ prune0 keep k (a, ProfT sub) =
       | null sub, k `S.notMember` keep -> pure Nothing
       | otherwise -> pure $ Just (a, ProfT sub)
 
-prune :: Ord k => Set k -> ProfTrie k a -> ProfTrie k a
+prune :: (Ord k) => Set k -> ProfTrie k a -> ProfTrie k a
 prune keep (ProfT m) = case M.traverseMaybeWithKey (prune0 keep) m of
   Identity sub -> ProfT sub
 
-topN :: Ord k => Int -> Map k Int -> [(k, Int)]
+topN :: (Ord k) => Int -> Map k Int -> [(k, Int)]
 topN n0 = M.foldlWithKey (ins n0) []
   where
     ins 0 _ _ _ = []
     ins _ [] k i = [(k, i)]
     ins n pss@((k1, j) : ps) k0 i
-      | i > j = (k0, i) : pop (n-1) pss
-      | otherwise = (k1, j) : ins (n-1) ps k0 i
+      | i > j = (k0, i) : pop (n - 1) pss
+      | otherwise = (k1, j) : ins (n - 1) ps k0 i
 
     pop 0 _ = []
     pop _ [] = []
-    pop n (p:ps) = p : pop (n-1) ps
+    pop n (p : ps) = p : pop (n - 1) ps
 
 fraction :: Int -> Int -> Double
 fraction n d = fromIntegral n / fromIntegral d
@@ -141,15 +140,15 @@ topNum = 25
 -- cost fractions of the positions in the trie, and prunes it to the
 -- hottest spots.
 aggregatePruned ::
-  Ord k => Int -> ProfTrie k Int -> ProfTrie k (Double, Double)
+  (Ord k) => Int -> ProfTrie k Int -> ProfTrie k (Double, Double)
 aggregatePruned total (ProfT t) =
   case M.traverseWithKey (aggregateWith (fractions total)) t of
     (ag, t)
       | top <- topN topNum (allOccs ag) ->
           prune (S.fromList $ fst <$> top) $ ProfT t
 
 aggregate ::
-  Ord k =>
+  (Ord k) =>
   Int ->
   ProfTrie k Int ->
   ([(k, Double)], ProfTrie k (Double, Double))
@@ -163,12 +162,12 @@ aggregate total (ProfT t) =
 -- Folds over a profile trie. The mapping function receives a reversed
 -- path to the node, which can be used e.g. to see the node's key and to
 -- calculate the depth in the trie.
-foldMapTrie :: Monoid m => ((k,[k]) -> v -> m) -> ProfTrie k v -> m
+foldMapTrie :: (Monoid m) => ((k, [k]) -> v -> m) -> ProfTrie k v -> m
 foldMapTrie f = descend []
   where
     descend ks (ProfT m) =
       M.foldMapWithKey
-        (\k (v, sub) -> f (k,ks) v <> descend (k:ks) sub)
+        (\k (v, sub) -> f (k, ks) v <> descend (k : ks) sub)
         m
 
 showPercent :: Double -> String
@@ -177,17 +176,17 @@ showPercent d = pad $ showFFloat (Just 2) (100 * d) "%"
     pad s = replicate (7 - length s) ' ' <> s
 
 dispProfEntry ::
-  Ord k =>
+  (Ord k) =>
   PrettyPrintEnv ->
   Map k Reference ->
-  (k,[k]) ->
+  (k, [k]) ->
   (Double, Double) ->
   Pretty ColorText
-dispProfEntry ppe refs (k,ks) (inh, self) =
+dispProfEntry ppe refs (k, ks) (inh, self) =
   mconcat
     [ P.indentN 2 . fromString $ showPercent inh,
       P.indentN 4 . fromString $ showPercent self,
-      P.indentN (2*ind + 4) $ dispKey ppe refs k,
+      P.indentN (2 * ind + 4) $ dispKey ppe refs k,
       "\n"
     ]
   where
@@ -198,21 +197,21 @@ dispFunc ppe =
   syntaxToColor . prettyHashQualified . termName ppe . Ref
 
 dispKey ::
-  Ord k => PrettyPrintEnv -> Map k Reference -> k -> Pretty ColorText
+  (Ord k) => PrettyPrintEnv -> Map k Reference -> k -> Pretty ColorText
 dispKey ppe refs k
   | Just r <- M.lookup k refs = dispFunc ppe r
   | otherwise = "<unknown>"
 
 dispProfTrie ::
-  Ord k =>
+  (Ord k) =>
   PrettyPrintEnv ->
   Map k Reference ->
   ProfTrie k (Double, Double) ->
   Pretty ColorText
 dispProfTrie ppe refs ag = foldMapTrie (dispProfEntry ppe refs) ag
 
 dispTopEntry ::
-  Ord k =>
+  (Ord k) =>
   PrettyPrintEnv ->
   Map k Reference ->
   (k, Double) ->
@@ -225,11 +224,12 @@ dispTopEntry ppe refs (k, frac) =
     ]
   where
     dr :: Pretty ColorText
-    dr | Just r <- M.lookup k refs = dispFunc ppe r
-       | otherwise = "<unknown>"
+    dr
+      | Just r <- M.lookup k refs = dispFunc ppe r
+      | otherwise = "<unknown>"
 
 dispTop ::
-  Ord k =>
+  (Ord k) =>
   PrettyPrintEnv ->
   Map k Reference ->
   [(k, Double)] ->
@@ -243,34 +243,34 @@ profileTopHeader =
 profileTreeHeader :: Pretty ColorText
 profileTreeHeader =
   P.lines
-    [ P.indentN 9 "Costs"
-    , "Inherited      Local    Function Call Tree"
-    , ""
+    [ P.indentN 9 "Costs",
+      "Inherited      Local    Function Call Tree",
+      ""
     ]
 
-miniProfile :: Ord k => PrettyPrintEnv -> Profile k -> Pretty ColorText
+miniProfile :: (Ord k) => PrettyPrintEnv -> Profile k -> Pretty ColorText
 miniProfile ppe (Prof total tr refs) =
-  profileTreeHeader <>
-  dispProfTrie ppe refs ag
+  profileTreeHeader
+    <> dispProfTrie ppe refs ag
   where
     ag = aggregatePruned total tr
 
 fullProfile ::
-  Ord k =>
+  (Ord k) =>
   PrettyPrintEnv ->
   Profile k ->
   Pretty ColorText
 fullProfile ppe (Prof total tr refs) =
-  profileTopHeader <>
-  dispTop ppe refs top <>
-  "\n\n" <>
-  profileTreeHeader <>
-  dispProfTrie ppe refs ag
+  profileTopHeader
+    <> dispTop ppe refs top
+    <> "\n\n"
+    <> profileTreeHeader
+    <> dispProfTrie ppe refs ag
   where
     (top, ag) = aggregate total tr
 
 foldedProfile ::
-  Ord k =>
+  (Ord k) =>
   PrettyPrintEnv ->
   Profile k ->
   String
@@ -279,10 +279,10 @@ foldedProfile ppe (Prof _ tr refs) =
   where
     dk = dispKey ppe refs
 
-    f (k,ks) n =
+    f (k, ks) n =
       mconcat
-        [ foldl (\tx k -> dk k <> ";" <> tx) (dk k) ks
-        , " "
-        , fromString $ show n
-        , "\n"
+        [ foldl (\tx k -> dk k <> ";" <> tx) (dk k) ks,
+          " ",
+          fromString $ show n,
+          "\n"
         ]

unison-cli/src/Unison/Codebase/Editor/HandleInput/Load.hs

@@ -30,7 +30,9 @@ import Unison.Codebase qualified as Codebase
 import Unison.Codebase.Branch qualified as Branch
 import Unison.Codebase.Branch.Names qualified as Branch
 import Unison.Codebase.Editor.HandleInput.RuntimeUtils
-  (EvalMode (..), modeProfSpec)
+  ( EvalMode (..),
+    modeProfSpec,
+  )
 import Unison.Codebase.Editor.HandleInput.RuntimeUtils qualified as RuntimeUtils
 import Unison.Codebase.Editor.Output qualified as Output
 import Unison.Codebase.Editor.SlurpResult (SlurpEntry (..), TermSlurp (..))

unison-cli/src/Unison/Codebase/Editor/HandleInput/RuntimeUtils.hs

@@ -6,7 +6,7 @@ module Unison.Codebase.Editor.HandleInput.RuntimeUtils
     displayResponse,
     selectRuntime,
     EvalMode (..),
-    modeProfSpec
+    modeProfSpec,
   )
 where
 

unison-cli/src/Unison/Codebase/Editor/Input.hs

@@ -40,9 +40,9 @@ import Unison.Codebase.Path qualified as Path
 import Unison.Codebase.Path.Parse qualified as Path
 import Unison.Codebase.ProjectPath (ProjectPath)
 import Unison.Codebase.PushBehavior (PushBehavior)
+import Unison.Codebase.Runtime.Profile (ProfileSpec)
 import Unison.Codebase.ShortCausalHash (ShortCausalHash)
 import Unison.Codebase.ShortCausalHash qualified as SCH
-import Unison.Codebase.Runtime.Profile (ProfileSpec)
 import Unison.CommandLine.BranchRelativePath (BranchRelativePath, parseBranchRelativePath)
 import Unison.HashQualified qualified as HQ
 import Unison.HashQualifiedPrime qualified as HQ'