[DOC] fix haddock errors

src/Gargantext/API/Ngrams.hs

@@ -854,8 +854,8 @@ ngramsStatePatchConflictResolution
   -> ConflictResolutionNgramsPatch
 ngramsStatePatchConflictResolution _ngramsType _nodeId _ngramsTerm
   = (ours, (const ours, ours), (False, False))
-                             -- ^------^------- they mean that Mod has always priority.
-                             --(True, False) <- would mean priority to the left (same as ours).
+                             -- (False, False) mean here that Mod has always priority.
+                             -- (True, False) <- would mean priority to the left (same as ours).
 
   -- undefined {- TODO think this through -}, listTypeConflictResolution)
 

src/Gargantext/API/Public.hs

@@ -50,7 +50,7 @@ selectPublic :: HasNodeError err
              => Cmd err [( Node HyperdataFolder, Maybe Int)] 
 selectPublic = selectPublicNodes
 
-  -- | For tests only
+  -- For tests only
   -- pure $ replicate 6 defaultPublicData
 
 filterPublicDatas :: [( Node HyperdataFolder, Maybe Int)] -> [(Node HyperdataFolder, [NodeId])]

src/Gargantext/Core/Text/List/Learn.hs

@@ -131,6 +131,3 @@ grid s e tr te = do
   --fp <- saveFile (ModelSVM model')
   --save best result
   pure $ snd <$> r
-
-
-

src/Gargantext/Core/Text/Metrics.hs

@@ -35,7 +35,7 @@ import qualified Data.Map  as Map
 
 import qualified Data.Vector.Storable as Vec
 
-type GraphListSize = Int
+type MapListSize = Int
 type InclusionSize = Int
 
 {-
@@ -73,8 +73,7 @@ localMetrics' m = Map.fromList $ zipWith (\(_,t) (inc,spe) -> (t, Vec.fromList [
              $ DAA.run
              $ DAA.zip (DAA.use is) (DAA.use ss)
 
-
--- TODO Code to be remove below
+-- TODO Code to be removed below
 -- TODO in the textflow we end up needing these indices , it might be
 -- better to compute them earlier and pass them around.
 scored' :: Ord t => Map (t,t) Int -> [Scored t]
@@ -87,20 +86,20 @@ scored' m = zipWith (\(_,t) (inc,spe) -> Scored t (inc) (spe)) (Map.toList fi) s
              $ DAA.zip (DAA.use is) (DAA.use ss)
 
 
-takeScored :: Ord t => GraphListSize -> InclusionSize -> Map (t,t) Int -> ([t],[t])
+takeScored :: Ord t => MapListSize -> InclusionSize -> Map (t,t) Int -> ([t],[t])
 takeScored listSize incSize = both (map _scored_terms)
-                            . linearTakes listSize incSize _scored_speGen
+                            . takeLinear listSize incSize _scored_speGen
                                                           _scored_incExc
                             . scored
 
 
 -- | Filter Scored data
--- >>> linearTakes 2 3 fst snd $ Prelude.zip ([1..10] :: [Int]) (reverse $ [1..10] :: [Int])
+-- >>> takeLinear 2 3 fst snd $ Prelude.zip ([1..10] :: [Int]) (reverse $ [1..10] :: [Int])
 -- [(3,8),(6,5)]
-linearTakes :: (Ord b1, Ord b2)
-            => GraphListSize -> InclusionSize
+takeLinear :: (Ord b1, Ord b2)
+            => MapListSize -> InclusionSize
             -> (a -> b2) -> (a -> b1) -> [a] -> ([a],[a])
-linearTakes mls incSize speGen incExc = (List.splitAt mls)
+takeLinear mls incSize speGen incExc = (List.splitAt mls)
                       . List.concat
                       . map (take $ round
                                   $ (fromIntegral mls     :: Double)

src/Gargantext/Core/Viz/Graph/Distances/Matrice.hs

@@ -245,8 +245,8 @@ conditional' m = ( run $ ie $ map fromIntegral $ use m
 --            \[N_{m} = \sum_{i,i \neq i}^{m} \sum_{j, j \neq j}^{m} S_{ij}\]
 --
 distributional :: Matrix Int -> Matrix Double
-distributional m = run -- $ matMiniMax
-                       $ diagNull n
+distributional m = -- run {- $ matMiniMax -}
+                   run  $ diagNull n
                        $ rIJ n
                        $ filterWith 0 100
                        $ filter' 0

src/Gargantext/Core/Viz/Phylo/PhyloExport.hs

@@ -247,7 +247,7 @@ exportToDot phylo export =
                 toDotEdge (groupIdToDotId k) (groupIdToDotId k') "" GroupToAncestor
           ) $ mergeAncestors $ export ^. export_groups
 
-        -- | 10) create the edges between the periods 
+        -- 10) create the edges between the periods 
         _ <- mapM (\(prd,prd') ->
                 toDotEdge (periodIdToDotId prd) (periodIdToDotId prd') "" PeriodToPeriod
             ) $ nubBy (\combi combi' -> fst combi == fst combi') $ listToCombi' $ getPeriodIds phylo

src/Gargantext/Core/Viz/Phylo/PhyloTools.hs

@@ -417,13 +417,13 @@ mergeMeta bId groups =
 
 groupsToBranches :: Map PhyloGroupId PhyloGroup -> [[PhyloGroup]]
 groupsToBranches groups =
-    -- | run the related component algorithm
+    {- run the related component algorithm -}
     let egos  = map (\g -> [getGroupId g] 
                         ++ (map fst $ g ^. phylo_groupPeriodParents)
                         ++ (map fst $ g ^. phylo_groupPeriodChilds)
                         ++ (map fst $ g ^. phylo_groupAncestors)) $ elems groups
         graph = relatedComponents egos
-    -- | update each group's branch id
+    {- update each group's branch id -}
     in map (\ids ->
         let groups' = elems $ restrictKeys groups (Set.fromList ids)
             bId = mergeBranchIds $ map (\g -> snd $ g ^. phylo_groupBranchId) groups'

src/Gargantext/Core/Viz/Phylo/TemporalMatching.hs

@@ -343,7 +343,7 @@ toPhyloQuality beta freq branches =
 
 groupsToBranches' :: Map PhyloGroupId PhyloGroup -> [[PhyloGroup]]
 groupsToBranches' groups =
-    -- | run the related component algorithm
+    {- run the related component algorithm -}
     let egos = groupBy (\gs gs' -> (fst $ fst $ head' "egos" gs) == (fst $ fst $ head' "egos" gs'))
              $ sortOn  (\gs -> fst $ fst $ head' "egos" gs)
              $ map (\group -> [getGroupId group]