diff options
| author | Andreas Källberg <anka.213@gmail.com> | 2020-09-05 20:23:07 +0200 |
|---|---|---|
| committer | Andreas Källberg <anka.213@gmail.com> | 2020-09-05 20:23:07 +0200 |
| commit | 7268253f5ae4b4883d28faa87b3e63295f04abfd (patch) | |
| tree | fb95bb40e3f8dece1deb018857b948a645003993 /src/compiler/GF/Compile/Update.hs | |
| parent | 1234c715fc6fe19d0c9fce794e4dfedf190b8d18 (diff) | |
MonadFail: Make backwards-compatible
Diffstat (limited to 'src/compiler/GF/Compile/Update.hs')
| -rw-r--r-- | src/compiler/GF/Compile/Update.hs | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/src/compiler/GF/Compile/Update.hs b/src/compiler/GF/Compile/Update.hs index 93e281b6a..4399405b8 100644 --- a/src/compiler/GF/Compile/Update.hs +++ b/src/compiler/GF/Compile/Update.hs @@ -27,9 +27,10 @@ import Data.List import qualified Data.Map as Map import Control.Monad import GF.Text.Pretty +import qualified Control.Monad.Fail as Fail -- | combine a list of definitions into a balanced binary search tree -buildAnyTree :: MonadFail m => ModuleName -> [(Ident,Info)] -> m (Map.Map Ident Info) +buildAnyTree :: Fail.MonadFail m => ModuleName -> [(Ident,Info)] -> m (Map.Map Ident Info) buildAnyTree m = go Map.empty where go map [] = return map |