Commit fa2c713b authored by Alexandre Delanoë's avatar Alexandre Delanoë

[FIX] Warnings unused imports

parent 4ab99758
...@@ -19,7 +19,6 @@ module Gargantext.API.Metrics ...@@ -19,7 +19,6 @@ module Gargantext.API.Metrics
where where
import Control.Lens import Control.Lens
import Data.HashMap.Strict (HashMap)
import Data.Text (Text) import Data.Text (Text)
import Data.Time (UTCTime) import Data.Time (UTCTime)
import Data.Vector (Vector) import Data.Vector (Vector)
...@@ -42,8 +41,7 @@ import Gargantext.Database.Query.Table.Node.UpdateOpaleye (updateHyperdata) ...@@ -42,8 +41,7 @@ import Gargantext.Database.Query.Table.Node.UpdateOpaleye (updateHyperdata)
import Gargantext.Database.Schema.Node (node_hyperdata) import Gargantext.Database.Schema.Node (node_hyperdata)
import Gargantext.Prelude import Gargantext.Prelude
import Servant import Servant
import qualified Data.HashMap.Strict as HM import qualified Data.HashMap.Strict as HashMap
import qualified Data.Vector as Vector
import qualified Gargantext.Database.Action.Metrics as Metrics import qualified Gargantext.Database.Action.Metrics as Metrics
------------------------------------------------------------- -------------------------------------------------------------
...@@ -80,7 +78,7 @@ getScatter cId maybeListId tabType _maybeLimit = do ...@@ -80,7 +78,7 @@ getScatter cId maybeListId tabType _maybeLimit = do
Nothing -> defaultList cId Nothing -> defaultList cId
node <- getNodeWith listId (Proxy :: Proxy HyperdataList) node <- getNodeWith listId (Proxy :: Proxy HyperdataList)
let HyperdataList { _hl_scatter = scatterMap } = node ^. node_hyperdata let HyperdataList { _hl_scatter = scatterMap } = node ^. node_hyperdata
mChart = HM.lookup tabType scatterMap mChart = HashMap.lookup tabType scatterMap
chart <- case mChart of chart <- case mChart of
Just chart -> pure chart Just chart -> pure chart
...@@ -115,7 +113,7 @@ updateScatter' cId maybeListId tabType maybeLimit = do ...@@ -115,7 +113,7 @@ updateScatter' cId maybeListId tabType maybeLimit = do
let let
metrics = fmap (\(Scored t s1 s2) -> Metric (unNgramsTerm t) s1 s2 (listType t ngs')) metrics = fmap (\(Scored t s1 s2) -> Metric (unNgramsTerm t) s1 s2 (listType t ngs'))
$ fmap normalizeLocal scores $ fmap normalizeLocal scores
listType t m = maybe (panic errorMsg) fst $ HM.lookup t m listType t m = maybe (panic errorMsg) fst $ HashMap.lookup t m
errorMsg = "API.Node.metrics: key absent" errorMsg = "API.Node.metrics: key absent"
listId <- case maybeListId of listId <- case maybeListId of
...@@ -124,7 +122,7 @@ updateScatter' cId maybeListId tabType maybeLimit = do ...@@ -124,7 +122,7 @@ updateScatter' cId maybeListId tabType maybeLimit = do
node <- getNodeWith listId (Proxy :: Proxy HyperdataList) node <- getNodeWith listId (Proxy :: Proxy HyperdataList)
let hl = node ^. node_hyperdata let hl = node ^. node_hyperdata
scatterMap = hl ^. hl_scatter scatterMap = hl ^. hl_scatter
_ <- updateHyperdata listId $ hl { _hl_scatter = HM.insert tabType (Metrics metrics) scatterMap } _ <- updateHyperdata listId $ hl { _hl_scatter = HashMap.insert tabType (Metrics metrics) scatterMap }
pure $ Metrics metrics pure $ Metrics metrics
...@@ -174,7 +172,7 @@ getChart cId _start _end maybeListId tabType = do ...@@ -174,7 +172,7 @@ getChart cId _start _end maybeListId tabType = do
Nothing -> defaultList cId Nothing -> defaultList cId
node <- getNodeWith listId (Proxy :: Proxy HyperdataList) node <- getNodeWith listId (Proxy :: Proxy HyperdataList)
let chartMap = node ^. node_hyperdata ^. hl_chart let chartMap = node ^. node_hyperdata ^. hl_chart
mChart = HM.lookup tabType chartMap mChart = HashMap.lookup tabType chartMap
chart <- case mChart of chart <- case mChart of
Just chart -> pure chart Just chart -> pure chart
...@@ -211,7 +209,7 @@ updateChart' cId maybeListId tabType _maybeLimit = do ...@@ -211,7 +209,7 @@ updateChart' cId maybeListId tabType _maybeLimit = do
let hl = node ^. node_hyperdata let hl = node ^. node_hyperdata
chartMap = hl ^. hl_chart chartMap = hl ^. hl_chart
h <- histoData cId h <- histoData cId
_ <- updateHyperdata listId $ hl { _hl_chart = HM.insert tabType (ChartMetrics h) chartMap } _ <- updateHyperdata listId $ hl { _hl_chart = HashMap.insert tabType (ChartMetrics h) chartMap }
pure $ ChartMetrics h pure $ ChartMetrics h
...@@ -260,7 +258,7 @@ getPie cId _start _end maybeListId tabType = do ...@@ -260,7 +258,7 @@ getPie cId _start _end maybeListId tabType = do
Nothing -> defaultList cId Nothing -> defaultList cId
node <- getNodeWith listId (Proxy :: Proxy HyperdataList) node <- getNodeWith listId (Proxy :: Proxy HyperdataList)
let pieMap = node ^. node_hyperdata ^. hl_pie let pieMap = node ^. node_hyperdata ^. hl_pie
mChart = HM.lookup tabType pieMap mChart = HashMap.lookup tabType pieMap
chart <- case mChart of chart <- case mChart of
Just chart -> pure chart Just chart -> pure chart
...@@ -298,7 +296,7 @@ updatePie' cId maybeListId tabType _maybeLimit = do ...@@ -298,7 +296,7 @@ updatePie' cId maybeListId tabType _maybeLimit = do
pieMap = hl ^. hl_pie pieMap = hl ^. hl_pie
p <- chartData cId (ngramsTypeFromTabType tabType) MapTerm p <- chartData cId (ngramsTypeFromTabType tabType) MapTerm
_ <- updateHyperdata listId $ hl { _hl_pie = HM.insert tabType (ChartMetrics p) pieMap } _ <- updateHyperdata listId $ hl { _hl_pie = HashMap.insert tabType (ChartMetrics p) pieMap }
pure $ ChartMetrics p pure $ ChartMetrics p
...@@ -351,7 +349,7 @@ getTree cId _start _end maybeListId tabType listType = do ...@@ -351,7 +349,7 @@ getTree cId _start _end maybeListId tabType listType = do
node <- getNodeWith listId (Proxy :: Proxy HyperdataList) node <- getNodeWith listId (Proxy :: Proxy HyperdataList)
let treeMap = node ^. node_hyperdata ^. hl_tree let treeMap = node ^. node_hyperdata ^. hl_tree
mChart = HM.lookup tabType treeMap mChart = HashMap.lookup tabType treeMap
chart <- case mChart of chart <- case mChart of
Just chart -> pure chart Just chart -> pure chart
...@@ -389,7 +387,7 @@ updateTree' cId maybeListId tabType listType = do ...@@ -389,7 +387,7 @@ updateTree' cId maybeListId tabType listType = do
let hl = node ^. node_hyperdata let hl = node ^. node_hyperdata
treeMap = hl ^. hl_tree treeMap = hl ^. hl_tree
t <- treeData cId (ngramsTypeFromTabType tabType) listType t <- treeData cId (ngramsTypeFromTabType tabType) listType
_ <- updateHyperdata listId $ hl { _hl_tree = HM.insert tabType (ChartMetrics t) treeMap } _ <- updateHyperdata listId $ hl { _hl_tree = HashMap.insert tabType (ChartMetrics t) treeMap }
pure $ ChartMetrics t pure $ ChartMetrics t
......
...@@ -16,7 +16,6 @@ module Gargantext.API.Ngrams.NgramsTree ...@@ -16,7 +16,6 @@ module Gargantext.API.Ngrams.NgramsTree
import Data.Aeson.TH (deriveJSON) import Data.Aeson.TH (deriveJSON)
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Map (Map)
import Data.Maybe (catMaybes) import Data.Maybe (catMaybes)
import Data.Set (Set) import Data.Set (Set)
import Data.Swagger import Data.Swagger
...@@ -30,7 +29,6 @@ import Gargantext.Prelude ...@@ -30,7 +29,6 @@ import Gargantext.Prelude
import Test.QuickCheck import Test.QuickCheck
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.List as List import qualified Data.List as List
import qualified Data.Map as Map
import qualified Data.Set as Set import qualified Data.Set as Set
type Children = Text type Children = Text
......
...@@ -19,9 +19,7 @@ import Control.Lens (_Just, (^.), at, view, At, Index, IxValue) ...@@ -19,9 +19,7 @@ import Control.Lens (_Just, (^.), at, view, At, Index, IxValue)
import Control.Monad.Reader import Control.Monad.Reader
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Hashable (Hashable) import Data.Hashable (Hashable)
import Data.Map.Strict (Map)
import Data.Set (Set) import Data.Set (Set)
import Data.Text (Text)
import Data.Validity import Data.Validity
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Core.Types (ListType(..), NodeId, ListId) import Gargantext.Core.Types (ListType(..), NodeId, ListId)
...@@ -30,7 +28,6 @@ import Gargantext.Prelude ...@@ -30,7 +28,6 @@ import Gargantext.Prelude
import qualified Data.HashMap.Strict as HM import qualified Data.HashMap.Strict as HM
import qualified Data.Map.Strict as Map import qualified Data.Map.Strict as Map
import qualified Data.Set as Set import qualified Data.Set as Set
import qualified Gargantext.Data.HashMap.Strict.Utils as HM
mergeNgramsElement :: NgramsRepoElement -> NgramsRepoElement -> NgramsRepoElement mergeNgramsElement :: NgramsRepoElement -> NgramsRepoElement -> NgramsRepoElement
mergeNgramsElement _neOld neNew = neNew mergeNgramsElement _neOld neNew = neNew
......
...@@ -16,12 +16,9 @@ Main exports of Gargantext: ...@@ -16,12 +16,9 @@ Main exports of Gargantext:
module Gargantext.API.Node.Corpus.Export module Gargantext.API.Node.Corpus.Export
where where
import Data.HashMap.Strict (HashMap)
import Data.Map (Map) import Data.Map (Map)
import Data.Maybe (fromMaybe) import Data.Maybe (fromMaybe)
import Data.Set (Set) import Data.Set (Set)
import Data.Text (Text)
import Gargantext.API.Node.Corpus.Export.Types import Gargantext.API.Node.Corpus.Export.Types
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.API.Ngrams.Tools (filterListWithRoot, mapTermListRoot, getRepo) import Gargantext.API.Ngrams.Tools (filterListWithRoot, mapTermListRoot, getRepo)
......
...@@ -21,7 +21,6 @@ import Data.Map (Map) ...@@ -21,7 +21,6 @@ import Data.Map (Map)
import Data.Monoid (mempty) import Data.Monoid (mempty)
import Data.Ord (Down(..)) import Data.Ord (Down(..))
import Data.Set (Set) import Data.Set (Set)
import Data.Text (Text)
import Data.Tuple.Extra (both) import Data.Tuple.Extra (both)
import Gargantext.API.Ngrams.Types (NgramsElement, RepoCmdM, NgramsTerm(..)) import Gargantext.API.Ngrams.Types (NgramsElement, RepoCmdM, NgramsTerm(..))
import Gargantext.Core.Text (size) import Gargantext.Core.Text (size)
......
...@@ -20,17 +20,14 @@ module Gargantext.Core.Text.List.Group ...@@ -20,17 +20,14 @@ module Gargantext.Core.Text.List.Group
import Control.Lens (view) import Control.Lens (view)
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Map (Map)
import Data.Maybe (fromMaybe) import Data.Maybe (fromMaybe)
import Data.Monoid (Monoid, mempty) import Data.Monoid (Monoid, mempty)
import Data.Text (Text)
import Gargantext.API.Ngrams.Types (NgramsTerm(..)) import Gargantext.API.Ngrams.Types (NgramsTerm(..))
import Gargantext.Core.Text.List.Group.Prelude import Gargantext.Core.Text.List.Group.Prelude
import Gargantext.Core.Text.List.Group.WithScores import Gargantext.Core.Text.List.Group.WithScores
import Gargantext.Core.Text.List.Social.Prelude import Gargantext.Core.Text.List.Social.Prelude
import Gargantext.Prelude import Gargantext.Prelude
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.Map as Map
------------------------------------------------------------------------ ------------------------------------------------------------------------
toGroupedTree :: (Ord a, Monoid a) toGroupedTree :: (Ord a, Monoid a)
=> FlowCont NgramsTerm FlowListScores => FlowCont NgramsTerm FlowListScores
......
...@@ -18,7 +18,6 @@ module Gargantext.Core.Text.List.Group.Prelude ...@@ -18,7 +18,6 @@ module Gargantext.Core.Text.List.Group.Prelude
import Control.Lens (makeLenses, view, set, over) import Control.Lens (makeLenses, view, set, over)
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Map (Map)
import Data.Maybe (fromMaybe) import Data.Maybe (fromMaybe)
import Data.Monoid import Data.Monoid
import Data.Semigroup import Data.Semigroup
...@@ -30,7 +29,6 @@ import Gargantext.Database.Admin.Types.Node (NodeId) ...@@ -30,7 +29,6 @@ import Gargantext.Database.Admin.Types.Node (NodeId)
import Gargantext.Prelude import Gargantext.Prelude
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.List as List import qualified Data.List as List
import qualified Data.Map as Map
import qualified Data.Set as Set import qualified Data.Set as Set
type Stem = NgramsTerm type Stem = NgramsTerm
......
...@@ -17,7 +17,6 @@ module Gargantext.Core.Text.List.Group.WithScores ...@@ -17,7 +17,6 @@ module Gargantext.Core.Text.List.Group.WithScores
import Control.Lens (view, set, over) import Control.Lens (view, set, over)
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Map (Map)
import Data.Maybe (fromMaybe) import Data.Maybe (fromMaybe)
import Data.Monoid (Monoid, mempty) import Data.Monoid (Monoid, mempty)
import Data.Semigroup import Data.Semigroup
...@@ -25,7 +24,6 @@ import Gargantext.API.Ngrams.Types (NgramsTerm(..)) ...@@ -25,7 +24,6 @@ import Gargantext.API.Ngrams.Types (NgramsTerm(..))
import Gargantext.Core.Text.List.Group.Prelude import Gargantext.Core.Text.List.Group.Prelude
import Gargantext.Core.Text.List.Social.Prelude import Gargantext.Core.Text.List.Social.Prelude
import Gargantext.Prelude import Gargantext.Prelude
import qualified Data.Map as Map
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
------------------------------------------------------------------------ ------------------------------------------------------------------------
......
...@@ -20,7 +20,6 @@ module Gargantext.Core.Text.List.Group.WithStem ...@@ -20,7 +20,6 @@ module Gargantext.Core.Text.List.Group.WithStem
import Data.HashSet (HashSet) import Data.HashSet (HashSet)
import Data.Map (Map) import Data.Map (Map)
import Data.Maybe (catMaybes) import Data.Maybe (catMaybes)
import Data.Text (Text)
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Core (Lang(..)) import Gargantext.Core (Lang(..))
import Gargantext.Core.Text.List.Group.Prelude import Gargantext.Core.Text.List.Group.Prelude
......
...@@ -20,7 +20,6 @@ module Gargantext.Core.Text.List.Merge ...@@ -20,7 +20,6 @@ module Gargantext.Core.Text.List.Merge
import Control.Lens (view) import Control.Lens (view)
import Data.Map (Map) import Data.Map (Map)
import Data.Text (Text)
import Gargantext.API.Ngrams import Gargantext.API.Ngrams
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Prelude import Gargantext.Prelude
......
...@@ -14,7 +14,6 @@ module Gargantext.Core.Text.List.Social ...@@ -14,7 +14,6 @@ module Gargantext.Core.Text.List.Social
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Map (Map) import Data.Map (Map)
import Data.Monoid (mconcat) import Data.Monoid (mconcat)
import Data.Text (Text)
import Gargantext.API.Ngrams.Tools import Gargantext.API.Ngrams.Tools
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Core.Text.List.Social.Find import Gargantext.Core.Text.List.Social.Find
......
...@@ -21,7 +21,6 @@ import Gargantext.Database.Schema.Ngrams (NgramsType(..)) ...@@ -21,7 +21,6 @@ import Gargantext.Database.Schema.Ngrams (NgramsType(..))
import Gargantext.Prelude import Gargantext.Prelude
import qualified Data.List as List import qualified Data.List as List
import qualified Data.Map.Strict as Map import qualified Data.Map.Strict as Map
import qualified Data.HashMap.Strict as HashMap
-- TODO put this in Prelude -- TODO put this in Prelude
cons :: a -> [a] cons :: a -> [a]
......
...@@ -17,7 +17,6 @@ import Data.Hashable (Hashable) ...@@ -17,7 +17,6 @@ import Data.Hashable (Hashable)
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Monoid import Data.Monoid
import Data.Semigroup import Data.Semigroup
import Data.Text (Text)
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Core.Text.List.Social.Prelude import Gargantext.Core.Text.List.Social.Prelude
import Gargantext.Core.Types (ListId) import Gargantext.Core.Types (ListId)
......
...@@ -24,7 +24,6 @@ import Data.HashMap.Strict (HashMap) ...@@ -24,7 +24,6 @@ import Data.HashMap.Strict (HashMap)
import Data.Hashable (Hashable) import Data.Hashable (Hashable)
import Data.Monoid import Data.Monoid
import Data.Semigroup (Semigroup(..)) import Data.Semigroup (Semigroup(..))
import Data.Text (Text)
import GHC.Generics (Generic) import GHC.Generics (Generic)
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Core.Types.Main import Gargantext.Core.Types.Main
......
...@@ -21,14 +21,12 @@ import Control.Lens ...@@ -21,14 +21,12 @@ import Control.Lens
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Monoid (mempty) import Data.Monoid (mempty)
import Data.Set (Set) import Data.Set (Set)
import Data.Text (Text)
import Gargantext.API.Ngrams.Types import Gargantext.API.Ngrams.Types
import Gargantext.Core.Text.List.Social.Prelude import Gargantext.Core.Text.List.Social.Prelude
import Gargantext.Core.Types.Main import Gargantext.Core.Types.Main
import Gargantext.Prelude import Gargantext.Prelude
import qualified Gargantext.Data.HashMap.Strict.Utils as HashMap
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.Set as Set import qualified Data.Set as Set
------------------------------------------------------------------------ ------------------------------------------------------------------------
-- | Generates Score from list of HashMap Text NgramsRepoElement -- | Generates Score from list of HashMap Text NgramsRepoElement
......
...@@ -17,7 +17,6 @@ module Gargantext.Core.Viz.Chart ...@@ -17,7 +17,6 @@ module Gargantext.Core.Viz.Chart
import Data.List (sortOn) import Data.List (sortOn)
import Data.Map (toList) import Data.Map (toList)
import qualified Data.List as List import qualified Data.List as List
import qualified Data.Map as Map
import Data.Maybe (catMaybes) import Data.Maybe (catMaybes)
import qualified Data.Vector as V import qualified Data.Vector as V
......
...@@ -48,7 +48,6 @@ import Servant ...@@ -48,7 +48,6 @@ import Servant
import Servant.Job.Async import Servant.Job.Async
import Servant.XML import Servant.XML
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.Map as Map
------------------------------------------------------------------------ ------------------------------------------------------------------------
-- | There is no Delete specific API for Graph since it can be deleted -- | There is no Delete specific API for Graph since it can be deleted
-- as simple Node. -- as simple Node.
......
...@@ -42,7 +42,6 @@ import Gargantext.Prelude hiding (sum) ...@@ -42,7 +42,6 @@ import Gargantext.Prelude hiding (sum)
import Opaleye import Opaleye
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.List as List import qualified Data.List as List
import qualified Data.Map as Map
import qualified Data.Set as Set import qualified Data.Set as Set
import qualified Data.Text as DT import qualified Data.Text as DT
......
...@@ -14,8 +14,6 @@ module Gargantext.Database.Action.Metrics ...@@ -14,8 +14,6 @@ module Gargantext.Database.Action.Metrics
where where
import Data.HashMap.Strict (HashMap) import Data.HashMap.Strict (HashMap)
import Data.Map (Map)
import Data.Text (Text)
import Data.Vector (Vector) import Data.Vector (Vector)
import Gargantext.API.Ngrams.Tools (filterListWithRoot, groupNodesByNgrams, Diagonal(..), getCoocByNgrams, mapTermListRoot, RootTerm, getRepo) import Gargantext.API.Ngrams.Tools (filterListWithRoot, groupNodesByNgrams, Diagonal(..), getCoocByNgrams, mapTermListRoot, RootTerm, getRepo)
import Gargantext.API.Ngrams.Types (TabType(..), ngramsTypeFromTabType, NgramsTerm) import Gargantext.API.Ngrams.Types (TabType(..), ngramsTypeFromTabType, NgramsTerm)
...@@ -29,7 +27,6 @@ import Gargantext.Database.Query.Table.Node (defaultList) ...@@ -29,7 +27,6 @@ import Gargantext.Database.Query.Table.Node (defaultList)
import Gargantext.Database.Query.Table.Node.Select import Gargantext.Database.Query.Table.Node.Select
import Gargantext.Prelude import Gargantext.Prelude
import qualified Data.HashMap.Strict as HM import qualified Data.HashMap.Strict as HM
import qualified Data.Map as Map
getMetrics :: FlowCmdM env err m getMetrics :: FlowCmdM env err m
=> CorpusId -> Maybe ListId -> TabType -> Maybe Limit => CorpusId -> Maybe ListId -> TabType -> Maybe Limit
......
...@@ -19,16 +19,16 @@ Portability : POSIX ...@@ -19,16 +19,16 @@ Portability : POSIX
module Gargantext.Database.Action.Metrics.Lists module Gargantext.Database.Action.Metrics.Lists
where where
import Gargantext.API.Ngrams.Types (TabType(..), NgramsTerm(..)) import Gargantext.API.Ngrams.Types (TabType(..))
import Gargantext.Core.Text.Metrics (Scored(..)) import Gargantext.Core.Text.Metrics (Scored(..))
import Gargantext.Core.Types -- (NodePoly(..), NodeCorpus, ListId) import Gargantext.Core.Types -- (NodePoly(..), NodeCorpus, ListId)
import Gargantext.Database.Action.Flow.Types (FlowCmdM) import Gargantext.Database.Action.Flow.Types (FlowCmdM)
import Gargantext.Prelude hiding (sum, head) import Gargantext.Prelude hiding (sum, head)
import Prelude hiding (null, id, map, sum) import Prelude hiding (null, id, map, sum)
import qualified Data.HashMap.Strict as HashMap
import qualified Data.Map as Map import qualified Data.Map as Map
import qualified Data.Vector as Vec import qualified Data.Vector as Vec
import qualified Gargantext.Database.Action.Metrics as Metrics import qualified Gargantext.Database.Action.Metrics as Metrics
import qualified Data.HashMap.Strict as HashMap
{- {-
trainModel :: FlowCmdM env ServantErr m trainModel :: FlowCmdM env ServantErr m
=> Username -> m Score => Username -> m Score
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment