Some compiler warnings cleanup

src/Gargantext/Components/Annotation/AnnotatedField.purs

@@ -27,7 +27,6 @@ import Gargantext.Types (CTabNgramType(..), TermList)
 import Gargantext.Components.Annotation.Utils ( termBootstrapClass )
 import Gargantext.Components.NgramsTable.Core (NgramsTable, NgramsTerm, findNgramTermList, highlightNgrams, normNgram)
 import Gargantext.Components.Annotation.Menu ( AnnotationMenu, annotationMenu, MenuType(..) )
-import Gargantext.Utils.Reactix as R2
 import Gargantext.Utils.Selection as Sel
 
 type Props =

src/Gargantext/Components/DocsTable.purs

@@ -55,7 +55,8 @@ favCategory _        = Favorite
 
 trashCategory :: Category -> Category
 trashCategory _     = Trash
-trashCategory Trash = UnRead
+-- TODO: ?
+--trashCategory Trash = UnRead
 
 decodeCategory :: Int -> Category
 decodeCategory 0 = Trash
@@ -81,17 +82,17 @@ caroussel session nodeId setLocalCategories r cat = H.div {className:"flex"} div
 
                         else
                           H.div { className : icon c (cat == c)
-                            , on: { click: onClick nodeId setLocalCategories r c}
+                            , on: { click: onClick c}
                              } []
                     ) (caroussel' cat)
 
     caroussel' :: Category -> Array Category
     caroussel' Trash = take 2 categories
-    caroussel' cat   = take 3 $ drop (cat2score cat - 1 ) categories
+    caroussel' c   = take 3 $ drop (cat2score c - 1 ) categories
 
-    onClick nodeId setLocalCategories r cat = \_-> do
-      setLocalCategories $ Map.insert r._id cat
-      void $ launchAff $ putCategories session nodeId $ CategoryQuery {nodeIds: [r._id], category: cat}
+    onClick c = \_-> do
+      setLocalCategories $ Map.insert r._id c
+      void $ launchAff $ putCategories session nodeId $ CategoryQuery {nodeIds: [r._id], category: c}
 
 
 icon :: Category -> Boolean -> String

src/Gargantext/Components/Forest/Tree/Node/Action/Add.purs

@@ -6,7 +6,6 @@ import Data.Maybe (Maybe(..), fromMaybe)
 import Data.Tuple.Nested ((/\))
 import Effect.Aff (Aff, launchAff)
 import Effect.Uncurried (mkEffectFn1)
-import FFI.Simple ((..))
 import Gargantext.Components.Forest.Tree.Node.Action (Action(..), ID, Name)
 import Gargantext.Components.Forest.Tree.Node (SettingsBox(..), settingsBox)
 import Gargantext.Types (NodeType(..), readNodeType)

src/Gargantext/Components/Forest/Tree/Node/Action/Upload.purs

@@ -8,7 +8,6 @@ import Data.Tuple.Nested ((/\))
 import Effect.Aff (Aff, launchAff)
 import Effect.Class (liftEffect)
 import Effect.Uncurried (mkEffectFn1)
-import FFI.Simple ((..))
 import Partial.Unsafe (unsafePartial)
 import React.SyntheticEvent as E
 import Reactix as R

src/Gargantext/Components/Nodes/Annuaire.purs

 module Gargantext.Components.Nodes.Annuaire where
 
-import Prelude (bind, identity, pure, const, discard, ($), (<$>), (<>))
+import Prelude (bind, const, identity, pure, ($), (<$>), (<>))
 import Data.Argonaut (class DecodeJson, decodeJson, (.:), (.:?))
 import Data.Array (head)
 import Data.Maybe (Maybe(..), maybe)

src/Gargantext/Components/Search/SearchBar.purs

@@ -2,19 +2,12 @@ module Gargantext.Components.Search.SearchBar
   ( Props, searchBar, searchBarCpt
   ) where
 
-import Prelude (Unit, bind, discard, pure, ($))
-import Data.Maybe (Maybe(..))
-import Data.Newtype (over)
+import Prelude (pure, ($))
 import Data.Tuple.Nested ((/\))
-import Effect.Aff (Aff, launchAff_)
-import Effect (Effect)
-import Effect.Class (liftEffect)
 import Reactix as R
-import DOM.Simple.Console (log2)
 import Reactix.DOM.HTML as H
 
 import Gargantext.Components.Search.Types -- (Database, SearchQuery(..), defaultSearchQuery, performSearch, Lang(..))
-import Gargantext.Components.Modals.Modal (modalShow)
 import Gargantext.Components.Search.SearchField (Search, searchField)
 import Gargantext.Sessions (Session)
 

src/Gargantext/Hooks/Sigmax/Types.purs

@@ -8,7 +8,7 @@ import Data.Map as Map
 import Data.Sequence as Seq
 import Data.Set as Set
 import Data.Tuple (Tuple(..))
-import Prelude (map, ($), (&&), (||), (==), class Eq, class Ord, class Show, Ordering, compare)
+import Prelude (class Eq, class Show, map, ($), (&&), (==), (||))
 
 newtype Graph n e = Graph { nodes :: Seq.Seq {|n}, edges :: Seq.Seq {|e} }