~jojo/Carth

bab4ce2e3f6d06062ddfd3a5fabc86c0ad389778 — JoJo 1 year, 1 month ago 039652e
Make some strict Map:s lazy, and some lazy State:s strict

No great reason. Just seemed more reasonable. No obvious performance impact.
M src/Check.hs => src/Check.hs +2 -2
@@ 10,8 10,8 @@ import Data.Bifunctor
import Data.Bitraversable
import Data.Foldable
import Control.Applicative
import qualified Data.Map.Strict as Map
import Data.Map.Strict (Map)
import qualified Data.Map as Map
import Data.Map (Map)
import qualified Data.Set as Set
import Data.Set (Set)


M src/Checked.hs => src/Checked.hs +1 -1
@@ 14,7 14,7 @@ module Checked
    )
where

import Data.Map.Strict (Map)
import Data.Map (Map)
import Data.Word
import Data.Bifunctor


M src/Infer.hs => src/Infer.hs +2 -2
@@ 10,8 10,8 @@ import Control.Monad.Reader
import Control.Monad.State.Strict
import Data.Bifunctor
import Data.Graph (SCC(..), stronglyConnComp)
import qualified Data.Map.Strict as Map
import Data.Map.Strict (Map)
import qualified Data.Map as Map
import Data.Map (Map)
import Data.Maybe
import qualified Data.Set as Set
import Data.Set (Set)

M src/Misc.hs => src/Misc.hs +1 -1
@@ 9,7 9,7 @@ import Data.Maybe
import Data.Bifunctor
import Control.Monad.Reader
import Control.Monad.Writer
import Control.Monad.State
import Control.Monad.State.Strict
import Lens.Micro.Platform (Lens, Lens', over, set, use, modifying)
import Data.Bitraversable
import System.Exit

M src/Monomorphize.hs => src/Monomorphize.hs +2 -2
@@ 10,10 10,10 @@ import Control.Monad.Reader
import Control.Monad.Writer
import Data.Functor
import Data.Bifunctor
import Data.Map.Strict (Map)
import Data.Map (Map)
import Data.Set (Set)
import qualified Data.Set as Set
import qualified Data.Map.Strict as Map
import qualified Data.Map as Map
import Data.Bitraversable

import Misc

M src/Parse.hs => src/Parse.hs +1 -1
@@ 11,7 11,7 @@ module Parse (parse) where

import Control.Applicative hiding (many, some)
import Control.Monad
import Control.Monad.State
import Control.Monad.State.Strict
import Control.Monad.Except
import Control.Monad.Combinators
import Data.Maybe

M src/Parser.hs => src/Parser.hs +1 -1
@@ 5,7 5,7 @@ module Parser (Parser, St (..), runParser, token, end, lookAhead, try, getSrcPos

import Control.Applicative hiding (many, some)
import Control.Monad
import Control.Monad.State
import Control.Monad.State.Strict
import Control.Monad.Except
import Data.Functor
import Data.List

M src/Selections.hs => src/Selections.hs +2 -2
@@ 2,8 2,8 @@

module Selections (Selections, newSelections, select, selectVarBindings) where

import qualified Data.Map.Strict as Map
import Data.Map.Strict (Map)
import qualified Data.Map as Map
import Data.Map (Map)
import Data.Word
import Control.Monad


M src/Subst.hs => src/Subst.hs +2 -2
@@ 2,8 2,8 @@

module Subst (Subst, subst, substTopDefs, substPat, composeSubsts) where

import qualified Data.Map.Strict as Map
import Data.Map.Strict (Map)
import qualified Data.Map as Map
import Data.Map (Map)
import Data.Bifunctor
import Data.Maybe