Core.purs 41.7 KB
Newer Older
1 2
module Gargantext.Components.NgramsTable.Core
  ( PageParams
3
  , CoreParams
4 5
  , NgramsElement(..)
  , _NgramsElement
6
  , NgramsRepoElementT
7 8 9
  , NgramsRepoElement(..)
  , _NgramsRepoElement
  , ngramsRepoElementToNgramsElement
10
  , NgramsTable(..)
11
  , NewElems
12
  , NgramsPatch(..)
13
  , NgramsPatches
14
  , _NgramsTable
15
  , NgramsTerm(..)
16
  , normNgram
17
  , ngramsTermText
18
  , findNgramRoot
19
  , findNgramTermList
20 21
  , Version
  , Versioned(..)
22 23 24
  , Count
  , VersionedWithCount(..)
  , toVersioned
25
  , VersionedNgramsPatches
26
  , AsyncNgramsChartsUpdate(..)
27
  , VersionedNgramsTable
28
  , VersionedWithCountNgramsTable
29
  , NgramsTablePatch
30
  , CoreState
31
  , HighlightElement
32 33 34
  , highlightNgrams
  , initialPageParams
  , loadNgramsTable
35
  , loadNgramsTableAll
36 37 38 39 40
  , convOrderBy
  , Replace(..) -- Ideally we should keep the constructors hidden
  , replace
  , PatchSet(..)
  , PatchMap(..)
41
  , _PatchMap
42 43
  , patchSetFromMap
  , applyPatchSet
44
--, applyNgramsTablePatch -- re-export only if we have a good reason not to use applyNgramsPatches
45
  , applyNgramsPatches
46
  , rootsOf
47 48 49
  , singletonPatchMap
  , fromNgramsPatches
  , singletonNgramsTablePatch
50
  , isEmptyNgramsTablePatch
51 52 53 54 55 56
  , _list
  , _occurrences
  , _children
  , _ngrams
  , _parent
  , _root
Nicolas Pouillard's avatar
Nicolas Pouillard committed
57 58
  , _ngrams_repo_elements
  , _ngrams_scores
59
  , commitPatch
60
  , putNgramsPatches
61
  , postNgramsChartsAsync
62
  , syncPatches
63 64 65 66 67 68
  , addNewNgramP
  , addNewNgramA
  , setTermListP
  , setTermListA
  , CoreAction(..)
  , CoreDispatch
69 70
  , Action(..)
  , Dispatch
71
  , coreDispatch
72 73
  , isSingleNgramsTerm
  , filterTermSize
74 75

  -- Reset Button TODO put elsewhere this file is too big
76 77
  , SyncResetButtonsProps
  , syncResetButtons
78
  , chartsAfterSync
79 80 81
  )
  where

82
import Control.Monad.State (class MonadState, execState)
83
import DOM.Simple.Console (log2)
84 85
import Data.Array (head)
import Data.Array as A
86
import Data.Bifunctor (lmap)
87
import Data.Either (Either(..))
88
import Data.Eq.Generic (genericEq)
89 90
import Data.Foldable (class Foldable, foldMap, foldl, foldr)
import Data.FoldableWithIndex (class FoldableWithIndex, foldMapWithIndex, foldlWithIndex, foldrWithIndex)
91
import Data.Generic.Rep (class Generic)
James Laver's avatar
James Laver committed
92
import Data.Lens (Iso', Lens', use, view, (%=), (%~), (.~), (?=), (^?))
93
import Data.Lens.At (class At, at)
94
import Data.Lens.Common (_Just)
95
import Data.Lens.Fold (folded, traverseOf_)
96
import Data.Lens.Index (class Index, ix)
97
import Data.Lens.Iso.Newtype (_Newtype)
98
import Data.Lens.Record (prop)
99
import Data.List ((:), List(Nil))
100
import Data.List as L
101 102
import Data.Map (Map)
import Data.Map as Map
Nicolas Pouillard's avatar
Nicolas Pouillard committed
103
import Data.Maybe (Maybe(..), fromMaybe, fromMaybe', isJust)
Nicolas Pouillard's avatar
Nicolas Pouillard committed
104
import Data.Monoid.Additive (Additive(..))
105
import Data.Newtype (class Newtype)
106
import Data.Ord.Generic (genericCompare)
107 108
import Data.Set (Set)
import Data.Set as Set
109
import Data.Show.Generic (genericShow)
110
import Data.String as S
111
import Data.String.Common as DSC
112 113
import Data.String.Regex (Regex, regex, replace) as R
import Data.String.Regex.Flags (global, multiline) as R
114
import Data.String.Utils as SU
115
import Data.Symbol (SProxy(..))
116
import Data.These (These(..))
Nicolas Pouillard's avatar
Nicolas Pouillard committed
117
import Data.Traversable (for, traverse_, traverse)
118
import Data.TraversableWithIndex (traverseWithIndex)
119
import Data.Tuple (Tuple(..))
120 121
import Data.Tuple.Nested ((/\))
import Effect (Effect)
122
import Effect.Aff (Aff, launchAff_)
123
import Effect.Class (liftEffect)
124
import Effect.Exception.Unsafe (unsafeThrow)
125
import FFI.Simple.Functions (delay)
126
import Foreign as F
127
import Foreign.Object as FO
128
import Reactix (Component, Element, createElement) as R
129
import Reactix.DOM.HTML as H
130 131
import Partial (crashWith)
import Partial.Unsafe (unsafePartial)
132
import Gargantext.AsyncTasks as GAT
133
import Gargantext.Components.Table as T
134
import Gargantext.Components.Table.Types as T
135
import Gargantext.Config.REST (RESTError)
136
import Gargantext.Config.Utils (handleRESTError)
137
import Gargantext.Prelude
138
import Gargantext.Routes (SessionRoute(..))
139
import Gargantext.Sessions (Session, get, post, put)
140
import Gargantext.Types (AsyncTask, AsyncTaskType(..), AsyncTaskWithType(..), CTabNgramType(..), FrontendError, ListId, OrderBy(..), ScoreType(..), TabSubType(..), TabType(..), TermList(..), TermSize(..))
141
import Gargantext.Utils.Either (eitherMap)
142
import Gargantext.Utils.KarpRabin (indicesOfAny)
James Laver's avatar
James Laver committed
143
import Gargantext.Utils.Reactix as R2
144 145 146
import Reactix as R
import Simple.JSON as JSON
import Toestand as T
147

James Laver's avatar
James Laver committed
148 149
here :: R2.Here
here = R2.here "Gargantext.Components.NgramsTable.Core"
150

151 152
type Endo a = a -> a

153 154 155 156 157 158 159 160

-- | Main Types
type Version = Int

newtype Versioned a = Versioned
  { version :: Version
  , data    :: a
  }
161
derive instance Generic (Versioned a) _
162 163 164 165
derive instance Newtype (Versioned a) _
instance Eq a => Eq (Versioned a) where eq = genericEq
derive newtype instance JSON.ReadForeign a => JSON.ReadForeign (Versioned a)
derive newtype instance JSON.WriteForeign a => JSON.WriteForeign (Versioned a)
166 167 168 169 170 171 172 173
------------------------------------------------------------------------
type Count = Int

newtype VersionedWithCount a = VersionedWithCount
  { version :: Version
  , count   :: Count
  , data    :: a
  }
174
derive instance Generic (VersionedWithCount a) _
175 176 177 178
derive instance Newtype (VersionedWithCount a) _
instance Eq a => Eq (VersionedWithCount a) where eq = genericEq
derive newtype instance JSON.ReadForeign a => JSON.ReadForeign (VersionedWithCount a)
derive newtype instance JSON.WriteForeign a => JSON.WriteForeign (VersionedWithCount a)
179 180 181

toVersioned :: forall a. VersionedWithCount a -> Tuple Count (Versioned a)
toVersioned (VersionedWithCount { count, data: d, version }) = Tuple count $ Versioned { data: d, version }
182 183 184 185 186 187 188

------------------------------------------------------------------------
-- TODO replace by NgramsPatches directly
type NgramsTablePatch = { ngramsPatches :: NgramsPatches }

newtype PatchMap k p = PatchMap (Map k p)

189 190 191 192 193 194 195 196 197 198 199 200 201 202
derive instance Generic (PatchMap k p) _
derive instance Newtype (PatchMap k p) _
derive instance (Eq k, Eq p) => Eq (PatchMap k p)

-- TODO generalize
instance JSON.WriteForeign p => JSON.WriteForeign (PatchMap NgramsTerm p) where
  writeImpl (PatchMap m) =
    JSON.writeImpl $ FO.fromFoldable $ map (lmap ngramsTermText) (Map.toUnfoldable m :: Array _)
instance (JSON.ReadForeign p, Monoid p) => JSON.ReadForeign (PatchMap NgramsTerm p) where
  readImpl f = do
    inst <- JSON.readImpl f
    pure $ PatchMap $ foldlWithIndex (\k m v -> Map.insert (NormNgramsTerm k) v m) Map.empty (inst :: FO.Object p)
    -- TODO we assume that the ngrams are already normalized ^^^^^^^^^^^^^

203 204 205 206 207 208 209 210 211 212 213
type NgramsPatches = PatchMap NgramsTerm NgramsPatch

data NgramsPatch
  = NgramsReplace
      { patch_old :: Maybe NgramsRepoElement
      , patch_new :: Maybe NgramsRepoElement
      }
  | NgramsPatch
      { patch_children :: PatchSet NgramsTerm
      , patch_list     :: Replace TermList
      }
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242
derive instance Generic NgramsPatch _
derive instance Eq NgramsPatch
instance Monoid NgramsPatch where
  mempty = NgramsPatch { patch_children: mempty, patch_list: mempty }
instance Semigroup NgramsPatch where
  append (NgramsReplace p) (NgramsReplace q)
    | p.patch_old /= q.patch_new = unsafeThrow "append/NgramsPatch: old != new"
    | otherwise                  = ngramsReplace q.patch_old p.patch_new
  append (NgramsPatch p)   (NgramsPatch q) = NgramsPatch
    { patch_children: p.patch_children <> q.patch_children
    , patch_list:     p.patch_list     <> q.patch_list
    }
  append (NgramsPatch p) (NgramsReplace q) = ngramsReplace q.patch_old (q.patch_new # _Just <<< _Newtype %~ applyNgramsPatch' p)
  append (NgramsReplace p) (NgramsPatch q) = ngramsReplace (p.patch_old # _Just <<< _Newtype %~ applyNgramsPatch' (invert q)) p.patch_new
instance JSON.WriteForeign NgramsPatch where
  writeImpl (NgramsReplace { patch_old, patch_new }) = JSON.writeImpl { patch_old, patch_new }
  writeImpl (NgramsPatch { patch_children, patch_list }) = JSON.writeImpl { patch_children, patch_list }
instance JSON.ReadForeign NgramsPatch where
  readImpl f = do
    inst :: { patch_old :: Maybe NgramsRepoElement
            , patch_new :: Maybe NgramsRepoElement
            , patch_children :: PatchSet NgramsTerm
            , patch_list :: Replace TermList } <- JSON.readImpl f
    -- TODO handle empty fields
    -- TODO handle patch_new
    if isJust inst.patch_new || isJust inst.patch_old then
      pure $ NgramsReplace { patch_old: inst.patch_old, patch_new: inst.patch_new }
    else do
      pure $ NgramsPatch { patch_list: inst.patch_list, patch_children: inst.patch_children }
243 244 245

------------------------------------------------------------------------
newtype NgramsTerm = NormNgramsTerm String
246
derive instance Generic NgramsTerm _
247 248 249 250 251 252 253
derive instance Newtype NgramsTerm _
instance Eq NgramsTerm where eq = genericEq
instance Ord NgramsTerm where compare = genericCompare
instance Show NgramsTerm where show = genericShow
derive newtype instance JSON.ReadForeign NgramsTerm
derive newtype instance JSON.WriteForeign NgramsTerm
derive newtype instance Monoid NgramsTerm
254 255 256

------------------------------------------------------------------------

257 258
type CoreParams s =
  { nodeId  :: Int
259
    -- ^ This node can be a corpus or contact.
260 261
  , listIds :: Array Int
  , tabType :: TabType
262
  , session :: Session
263
  | s
264 265
  }

266 267
type PageParams =
  CoreParams
268 269
    ( params         :: T.Params
    , searchQuery    :: String
270 271
    , termListFilter :: Maybe TermList -- Nothing means all
    , termSizeFilter :: Maybe TermSize -- Nothing means all
272
    , scoreType      :: ScoreType
273 274
    )

275 276
initialPageParams :: Session -> Int -> Array Int -> TabType -> PageParams
initialPageParams session nodeId listIds tabType =
277 278
  { listIds
  , nodeId
279
  , params
280 281
  , tabType
  , termSizeFilter: Nothing
282
  , termListFilter: Just MapTerm
283
  , searchQuery: ""
284
  , scoreType: Occurrences
285
  , session
286
  }
287 288
  where
    params = T.initialParams { orderBy = Just (T.DESC $ T.ColumnName "Score") }
289

290 291 292 293 294 295 296 297 298 299 300 301 302



ngramsTermText :: NgramsTerm -> String
ngramsTermText (NormNgramsTerm t) = t

-- TODO
normNgramInternal :: CTabNgramType -> String -> String
normNgramInternal CTabAuthors    = identity
normNgramInternal CTabSources    = identity
normNgramInternal CTabInstitutes = identity
normNgramInternal CTabTerms      = S.toLower <<< R.replace wordBoundaryReg " "

303 304 305
normNgramWithTrim :: CTabNgramType -> String -> String
normNgramWithTrim nt = DSC.trim <<< normNgramInternal nt

306
normNgram :: CTabNgramType -> String -> NgramsTerm
307
normNgram tabType = NormNgramsTerm <<< normNgramWithTrim tabType
308 309 310

-----------------------------------------------------------------------------------
newtype NgramsElement = NgramsElement
311 312 313 314 315 316 317
  { ngrams      :: NgramsTerm -- HERE
  , size        :: Int -- MISSING
  , list        :: TermList -- ok
  , root        :: Maybe NgramsTerm -- ok
  , parent      :: Maybe NgramsTerm -- ok
  , children    :: Set NgramsTerm -- ok
  , occurrences :: Int -- HERE
318 319
  }

320
derive instance Eq NgramsElement
321 322


323
_parent :: forall parent row. Lens' { parent :: parent | row } parent
324
_parent = prop (SProxy :: SProxy "parent")
325 326

_root :: forall root row. Lens' { root :: root | row } root
327
_root   = prop (SProxy :: SProxy "root")
328 329

_ngrams :: forall row. Lens' { ngrams :: NgramsTerm | row } NgramsTerm
330 331 332 333 334 335 336 337 338 339 340
_ngrams = prop (SProxy :: SProxy "ngrams")

_children :: forall row. Lens' { children :: Set NgramsTerm | row } (Set NgramsTerm)
_children = prop (SProxy :: SProxy "children")

_occurrences :: forall row. Lens' { occurrences :: Int | row } Int
_occurrences = prop (SProxy :: SProxy "occurrences")

_list :: forall a row. Lens' { list :: a | row } a
_list = prop (SProxy :: SProxy "list")

Nicolas Pouillard's avatar
Nicolas Pouillard committed
341 342 343 344 345 346
_ngrams_repo_elements :: forall a row. Lens' { ngrams_repo_elements :: a | row } a
_ngrams_repo_elements = prop (SProxy :: SProxy "ngrams_repo_elements")

_ngrams_scores :: forall a row. Lens' { ngrams_scores :: a | row } a
_ngrams_scores = prop (SProxy :: SProxy "ngrams_scores")

347 348
derive instance Newtype NgramsElement _
derive instance Generic NgramsElement _
349
instance Show NgramsElement where show = genericShow
350

351 352
_NgramsElement  :: Iso' NgramsElement {
    children    :: Set NgramsTerm
353
  , size        :: Int
354 355 356 357 358 359
  , list        :: TermList
  , ngrams      :: NgramsTerm
  , occurrences :: Int
  , parent      :: Maybe NgramsTerm
  , root        :: Maybe NgramsTerm
  }
360 361
_NgramsElement = _Newtype

362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377
instance JSON.ReadForeign NgramsElement where
  readImpl f = do
    inst :: { children :: Array NgramsTerm
            , size :: Int
            , list :: TermList
            , ngrams :: NgramsTerm
            , occurrences :: Int
            , parent :: Maybe NgramsTerm
            , root :: Maybe NgramsTerm }<- JSON.readImpl f
    pure $ NgramsElement $ inst { children = Set.fromFoldable inst.children }
instance JSON.WriteForeign NgramsElement where
  writeImpl (NgramsElement ne) =
    JSON.writeImpl $ ne { children = Set.toUnfoldable ne.children :: Array _ }

type NgramsRepoElementT =
  ( size :: Int
378 379 380
  , list     :: TermList
  , root     :: Maybe NgramsTerm
  , parent   :: Maybe NgramsTerm
381 382 383 384
  )
newtype NgramsRepoElement = NgramsRepoElement
  { children :: Set NgramsTerm
  | NgramsRepoElementT }
385
derive instance Generic NgramsRepoElement _
386 387 388 389 390 391 392 393 394 395
derive instance Newtype NgramsRepoElement _
derive instance Eq NgramsRepoElement
instance JSON.ReadForeign NgramsRepoElement where
  readImpl f = do
    inst :: { children :: Array NgramsTerm | NgramsRepoElementT } <- JSON.readImpl f
    pure $ NgramsRepoElement $ inst { children = Set.fromFoldable inst.children }
instance JSON.WriteForeign NgramsRepoElement where
  writeImpl (NgramsRepoElement nre) =
    JSON.writeImpl $ nre { children = Set.toUnfoldable nre.children :: Array _ }
instance Show NgramsRepoElement where show = genericShow
396 397 398 399 400 401 402 403 404 405 406

_NgramsRepoElement  :: Iso' NgramsRepoElement {
    children    :: Set NgramsTerm
  , size        :: Int
  , list        :: TermList
  , parent      :: Maybe NgramsTerm
  , root        :: Maybe NgramsTerm
--  , occurrences :: Int
  }
_NgramsRepoElement = _Newtype

Nicolas Pouillard's avatar
Nicolas Pouillard committed
407
ngramsRepoElementToNgramsElement :: NgramsTerm -> Int -> NgramsRepoElement -> NgramsElement
408
ngramsRepoElementToNgramsElement ngrams occurrences (NgramsRepoElement { children, list, parent, root, size }) =
409
  NgramsElement
410
  { children
411
  , list
412
  , ngrams
Nicolas Pouillard's avatar
Nicolas Pouillard committed
413
  , occurrences
414 415 416
  , parent
  , root
  , size -- TODO should we assert that size(ngrams) == size?
417 418
  }

419
-----------------------------------------------------------------------------------
Nicolas Pouillard's avatar
Nicolas Pouillard committed
420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435
{-
  NgramsRepoElement does not have the occurrences field.
  Instead NgramsTable has a ngrams_scores map.

  Pro:
  * Does not encumber NgramsRepoElement with the score which is not part of repo.
  * Enables for multiple scores through multiple maps.
  Cons:
  * Having a map on the side is equivalent to a `occurrences :: Maybe Int`, which is
    less precise.
  * It is a tiny bit less performant to access the score.
-}
newtype NgramsTable = NgramsTable
  { ngrams_repo_elements :: Map NgramsTerm NgramsRepoElement
  , ngrams_scores        :: Map NgramsTerm (Additive Int)
  }
436

437 438
derive instance Newtype NgramsTable _
derive instance Generic NgramsTable _
439 440
instance Eq NgramsTable where eq = genericEq
instance Show NgramsTable where show = genericShow
441

Nicolas Pouillard's avatar
Nicolas Pouillard committed
442 443 444 445
_NgramsTable :: Iso' NgramsTable
                     { ngrams_repo_elements :: Map NgramsTerm NgramsRepoElement
                     , ngrams_scores        :: Map NgramsTerm (Additive Int)
                     }
446 447
_NgramsTable = _Newtype

448
instance Index NgramsTable NgramsTerm NgramsRepoElement where
Nicolas Pouillard's avatar
Nicolas Pouillard committed
449
  ix k = _NgramsTable <<< _ngrams_repo_elements <<< ix k
450

451
instance At NgramsTable NgramsTerm NgramsRepoElement where
Nicolas Pouillard's avatar
Nicolas Pouillard committed
452
  at k = _NgramsTable <<< _ngrams_repo_elements <<< at k
453

454 455 456
instance JSON.ReadForeign NgramsTable where
  readImpl ff = do
    inst <- JSON.readImpl ff
457
    pure $ NgramsTable
458 459
      { ngrams_repo_elements: Map.fromFoldable $ f <$> (inst :: Array NgramsElement)
      , ngrams_scores:        Map.fromFoldable $ g <$> inst
Nicolas Pouillard's avatar
Nicolas Pouillard committed
460
      }
461
    where
Nicolas Pouillard's avatar
Nicolas Pouillard committed
462 463 464
      f (NgramsElement {ngrams, size, list, root, parent, children}) =
        Tuple ngrams (NgramsRepoElement {size, list, root, parent, children})
      g (NgramsElement e) = Tuple e.ngrams (Additive e.occurrences)
465

Nicolas Pouillard's avatar
Nicolas Pouillard committed
466
{- NOT USED
467
instance EncodeJson NgramsTable where
Nicolas Pouillard's avatar
Nicolas Pouillard committed
468 469
  encodeJson (NgramsTable {ngrams_repo_elements, ngrams_scores}) = encodeJson $ Map.values ... TODO
-}
470 471
-----------------------------------------------------------------------------------

Nicolas Pouillard's avatar
Nicolas Pouillard committed
472 473 474 475 476 477 478 479 480 481
lookupRootList :: NgramsTerm -> NgramsTable -> Maybe TermList
lookupRootList ngram (NgramsTable {ngrams_repo_elements: elts}) =
  case Map.lookup ngram elts of
    Nothing -> Nothing
    Just (NgramsRepoElement {list, root: Nothing}) -> Just list
    Just (NgramsRepoElement {root: Just root}) ->
      case Map.lookup root elts of
        Nothing -> Nothing
        Just (NgramsRepoElement {list}) -> Just list -- assert root == Nothing

482 483 484
wordBoundaryChars :: String
wordBoundaryChars = "[ .,;:!?'\\{}()]"

485
wordBoundaryReg :: R.Regex
486
wordBoundaryReg = case R.regex ("(" <> wordBoundaryChars <> ")") (R.global <> R.multiline) of
487 488
  Left e  -> unsafePartial $ crashWith e
  Right r -> r
489

490
wordBoundaryReg2 :: R.Regex
491
wordBoundaryReg2 = case R.regex ("(" <> wordBoundaryChars <> ")\\1") (R.global <> R.multiline) of
492 493 494
  Left e  -> unsafePartial $ crashWith e
  Right r -> r

495 496
type HighlightElement = Tuple String (List (Tuple NgramsTerm TermList))
type HighlightAccumulator = List HighlightElement
497

498 499
-- TODO: while this function works well with word boundaries,
--       it inserts too many spaces.
500
highlightNgrams :: CTabNgramType -> NgramsTable -> String -> Array HighlightElement
Nicolas Pouillard's avatar
Nicolas Pouillard committed
501
highlightNgrams ntype table@(NgramsTable {ngrams_repo_elements: elts}) input0 =
502
    -- trace {pats, input0, input, ixs} \_ ->
503
    A.fromFoldable ((\(s /\ ls)-> undb s /\ ls) <$> unsafePartial (foldl goFold ((input /\ Nil) : Nil) ixs))
504
  where
505
    spR x = " " <> R.replace wordBoundaryReg "$1$1" x <> " "
506
    -- reR = R.replace wordBoundaryReg " "
507
    db = S.replaceAll (S.Pattern " ") (S.Replacement "  ")
508
    sp x = " " <> db x <> " "
509
    undb = R.replace wordBoundaryReg2 "$1"
510
    input = spR input0
Nicolas Pouillard's avatar
Nicolas Pouillard committed
511
    pats = A.fromFoldable (Map.keys elts)
512
    ixs = indicesOfAny (sp <<< ngramsTermText <$> pats) (normNgramInternal ntype input)
513

514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540
    splitAcc :: Partial => Int -> HighlightAccumulator
             -> Tuple HighlightAccumulator HighlightAccumulator
    splitAcc i = go 0 Nil
      where
      go j pref acc =
        case compare i j of
          LT -> crashWith "highlightNgrams: splitAcc': i < j"
          EQ -> L.reverse pref /\ acc
          GT ->
            case acc of
              Nil -> crashWith "highlightNgrams: splitAcc': acc=Nil" -- pref /\ Nil
              elt@(s /\ ls) : elts ->
                let slen = S.length s in
                case compare i (j + slen) of
                  LT -> let {before: s0, after: s1} = S.splitAt (i - j) s in
                        L.reverse ((s0 /\ ls) : pref) /\ ((s1 /\ ls) : elts)
                  EQ -> L.reverse (elt : pref) /\ elts
                  GT -> go (j + slen) (elt : pref) elts


    extractInputTextMatch :: Int -> Int -> String -> String
    extractInputTextMatch i len input = undb $ S.take len $ S.drop (i + 1) input

    addNgramElt ng ne_list (elt /\ elt_lists) = (elt /\ ((ng /\ ne_list) : elt_lists))

    goAcc :: Partial => Int -> HighlightAccumulator -> Tuple NgramsTerm Int -> HighlightAccumulator
    goAcc i acc (pat /\ lpat) =
541
      case lookupRootList pat table of
542
        Nothing ->
543 544 545
          crashWith "highlightNgrams: pattern missing from table"
        Just ne_list ->
          let
546 547 548 549
            (acc0 /\ acc1_2) = splitAcc i acc
            (acc1 /\ acc2) = splitAcc (lpat + 1) acc1_2
            text = extractInputTextMatch i lpat input
            ng = normNgram ntype text
550
          in
551 552
            acc0 <> (addNgramElt ng ne_list <$> acc1) <> acc2

553
    goFold :: Partial => HighlightAccumulator -> Tuple Int (Array Int) -> HighlightAccumulator
554 555 556 557 558
    goFold acc (Tuple i pis) = foldl (goAcc i) acc $
                           --  A.sortWith snd $
                               map (\pat -> pat /\ S.length (db (ngramsTermText pat))) $
                               fromMaybe' (\_ -> crashWith "highlightNgrams: out of bounds pattern") $
                               traverse (A.index pats) pis
559 560 561 562

-----------------------------------------------------------------------------------

type VersionedNgramsTable = Versioned NgramsTable
563
type VersionedWithCountNgramsTable = VersionedWithCount NgramsTable
564 565 566 567 568 569

-----------------------------------------------------------------------------------
data Replace a
  = Keep
  | Replace { old :: a, new :: a }

570 571
derive instance Generic (Replace a) _

572 573 574 575 576
replace :: forall a. Eq a => a -> a -> Replace a
replace old new
  | old == new = Keep
  | otherwise  = Replace { old, new }

577
derive instance Eq a => Eq (Replace a)
578

579
instance Eq a => Semigroup (Replace a) where
580 581
  append Keep p = p
  append p Keep = p
582
  append (Replace { old }) (Replace { new }) | old /= new = unsafeThrow "old != new"
583
  append (Replace { new }) (Replace { old }) = replace old new
584

585
instance Eq a => Monoid (Replace a) where mempty = Keep
586 587 588 589 590 591 592

applyReplace :: forall a. Eq a => Replace a -> a -> a
applyReplace Keep a = a
applyReplace (Replace { old, new }) a
  | a == old  = new
  | otherwise = a

593 594 595 596 597 598 599
instance JSON.WriteForeign a => JSON.WriteForeign (Replace a) where
  writeImpl Keep = JSON.writeImpl { tag: "Keep" }
  writeImpl (Replace {old, new}) = JSON.writeImpl { old, new, tag: "Replace" }
instance (JSON.ReadForeign a, Eq a) => JSON.ReadForeign (Replace a) where
  readImpl f = do
    impl :: { old :: Maybe a, new :: Maybe a }  <- JSON.readImpl f
    case Tuple impl.old impl.new of
600 601
      Tuple (Just old) (Just new) -> pure $ replace old new
      Tuple Nothing Nothing       -> pure Keep
602
      _                           -> F.fail $ F.ForeignError "decodeJsonReplace"
603 604 605 606 607 608 609 610

-- Representing a PatchSet as `Map a Boolean` would have the advantage
-- of enforcing rem and add to be disjoint.
newtype PatchSet a = PatchSet
  { rem :: Set a
  , add :: Set a
  }

611 612 613
derive instance Generic (PatchSet a) _
derive instance Newtype (PatchSet a) _

614
instance Ord a => Semigroup (PatchSet a) where
615 616 617 618 619
  append (PatchSet p) (PatchSet q) = PatchSet
    { rem: q.rem <> p.rem
    , add: Set.difference q.add p.rem <> p.add
    }

620
instance Ord a => Monoid (PatchSet a) where
621 622
  mempty = PatchSet { rem: Set.empty, add: Set.empty }

623 624 625
instance JSON.WriteForeign a => JSON.WriteForeign (PatchSet a) where
  writeImpl (PatchSet {rem, add}) = JSON.writeImpl { rem: (Set.toUnfoldable rem :: Array a)
                                                   , add: (Set.toUnfoldable add :: Array a) }
626

627 628
instance (Ord a, JSON.ReadForeign a) => JSON.ReadForeign (PatchSet a) where
  readImpl f = do
629
    -- TODO handle empty fields
630 631 632
    inst :: { rem :: Array a, add :: Array a } <- JSON.readImpl f
    let rem = mkSet inst.rem
        add = mkSet inst.add
633 634 635 636 637 638 639 640 641 642 643 644 645
    pure $ PatchSet { rem, add }
   where
    mkSet :: forall b. Ord b => Array b -> Set b
    mkSet = Set.fromFoldable

applyPatchSet :: forall a. Ord a => PatchSet a -> Set a -> Set a
applyPatchSet (PatchSet p) s = Set.difference s p.rem <> p.add

patchSetFromMap :: forall a. Ord a => Map a Boolean -> PatchSet a
patchSetFromMap m = PatchSet { rem: Map.keys (Map.filter not m)
                             , add: Map.keys (Map.filter identity m) }
  -- TODO Map.partition would be nice here

646 647 648
-- TODO shall we normalise as in replace? shall we make a type class Replaceable?
ngramsReplace :: Maybe NgramsRepoElement -> Maybe NgramsRepoElement -> NgramsPatch
ngramsReplace patch_old patch_new = NgramsReplace {patch_old, patch_new}
649

650
derive instance Eq (PatchSet NgramsTerm)
651

652 653 654 655 656 657
-- TODO
invert :: forall a. a -> a
invert _ = unsafeThrow "invert: TODO"



658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673
applyNgramsPatch' :: forall row.
                          { patch_children :: PatchSet NgramsTerm
                          , patch_list     :: Replace TermList
                          } ->
                     Endo { list     :: TermList
                          , children :: Set NgramsTerm
                          | row
                          }
applyNgramsPatch' p e =
  e { list     = applyReplace p.patch_list e.list
    , children = applyPatchSet p.patch_children e.children
    }

applyNgramsPatch :: NgramsPatch -> Maybe NgramsRepoElement -> Maybe NgramsRepoElement
applyNgramsPatch (NgramsReplace {patch_new}) _ = patch_new
applyNgramsPatch (NgramsPatch p)           m = m # _Just <<< _Newtype %~ applyNgramsPatch' p
674 675


676 677 678
fromMap :: forall k p. Ord k => Eq p => Monoid p => Map k p -> PatchMap k p
fromMap = PatchMap <<< Map.filter (\v -> v /= mempty)

679
instance (Ord k, Eq p, Monoid p) => Semigroup (PatchMap k p) where
680
  append (PatchMap p) (PatchMap q) = fromMap $ Map.unionWith append p q
681

682
instance (Ord k, Eq p, Monoid p) => Monoid (PatchMap k p) where
683 684 685 686 687
  mempty = PatchMap Map.empty

_PatchMap :: forall k p. Iso' (PatchMap k p) (Map k p)
_PatchMap = _Newtype

688
{-
689
instance Functor (PatchMap k) where
690
  map f (PatchMap m) = PatchMap (map f m) -- NO NORM: fromMap would not typecheck
691

692
instance FunctorWithIndex k (PatchMap k) where
693 694
  mapWithIndex f (PatchMap m) = PatchMap (mapWithIndex f m) -- NO NORM: fromMap would not typecheck
-}
695

696
instance Foldable (PatchMap k) where
697 698 699 700
  foldr f z (PatchMap m) = foldr f z m
  foldl f z (PatchMap m) = foldl f z m
  foldMap f (PatchMap m) = foldMap f m

701
instance FoldableWithIndex k (PatchMap k) where
702 703 704 705
  foldrWithIndex f z (PatchMap m) = foldrWithIndex f z m
  foldlWithIndex f z (PatchMap m) = foldlWithIndex f z m
  foldMapWithIndex f (PatchMap m) = foldMapWithIndex f m

706 707
{- fromMap is preventing these to type check:

708
instance Ord k => Traversable (PatchMap k) where
709 710 711
  traverse f (PatchMap m) = fromMap <$> traverse f m
  sequence (PatchMap m) = fromMap <$> sequence m

712
instance Ord k => TraversableWithIndex k (PatchMap k) where
713 714
  traverseWithIndex f (PatchMap m) = fromMap <$> traverseWithIndex f m
-}
715

716 717 718 719
traversePatchMapWithIndex :: forall f a b k.
                             Applicative f => Ord k => Eq b => Monoid b =>
                             (k -> a -> f b) -> PatchMap k a -> f (PatchMap k b)
traversePatchMapWithIndex f (PatchMap m) = fromMap <$> traverseWithIndex f m
720

721 722 723
singletonPatchMap :: forall k p. k -> p -> PatchMap k p
singletonPatchMap k p = PatchMap (Map.singleton k p)

724 725 726
isEmptyPatchMap :: forall k p. PatchMap k p -> Boolean
isEmptyPatchMap (PatchMap p) = Map.isEmpty p

727 728
mergeMap :: forall k a b c. Ord k => (k -> These a b -> Maybe c) -> Map k a -> Map k b -> Map k c
mergeMap f m1 m2 = Map.mapMaybeWithKey f (Map.unionWith g (This <$> m1) (That <$> m2))
729
  where
730 731 732 733
    g (This p) (That v) = Both p v
    g x _ = x -- impossible

applyPatchMap :: forall k p v. Ord k => (p -> Maybe v -> Maybe v) -> PatchMap k p -> Map k v -> Map k v
734
{-
735 736 737 738 739
applyPatchMap applyPatchValue (PatchMap pm) m = mergeMap f pm m
  where
    f _ (This pv)   = applyPatchValue pv Nothing
    f _ (That v)    = Just v
    f _ (Both pv v) = applyPatchValue pv (Just v)
740 741 742 743
-}
applyPatchMap applyPatchValue (PatchMap pm) m =
    foldl go m (Map.toUnfoldable pm :: List (Tuple k p))
  where
James Laver's avatar
James Laver committed
744
    go m' (Tuple k pv) = Map.alter (applyPatchValue pv) k m'
745

746
type VersionedNgramsPatches = Versioned NgramsPatches
747

748 749 750 751
newtype AsyncNgramsChartsUpdate = AsyncNgramsChartsUpdate {
    listId  :: Maybe ListId
  , tabType :: TabType
  }
752 753 754 755 756
derive instance Generic AsyncNgramsChartsUpdate _
derive instance Newtype AsyncNgramsChartsUpdate _
instance JSON.WriteForeign AsyncNgramsChartsUpdate where
  writeImpl (AsyncNgramsChartsUpdate { listId, tabType }) =
    JSON.writeImpl { list_id: listId, tab_type: tabType }
757 758 759

type NewElems = Map NgramsTerm TermList

760
----------------------------------------------------------------------------------
761 762 763
isEmptyNgramsTablePatch :: NgramsTablePatch -> Boolean
isEmptyNgramsTablePatch {ngramsPatches} = isEmptyPatchMap ngramsPatches

764
fromNgramsPatches :: NgramsPatches -> NgramsTablePatch
765
fromNgramsPatches ngramsPatches = {ngramsPatches}
766

767 768 769 770
findNgramRoot :: NgramsTable -> NgramsTerm -> NgramsTerm
findNgramRoot (NgramsTable m) n =
  fromMaybe n (m.ngrams_repo_elements ^? at n <<< _Just <<< _NgramsRepoElement <<< _root <<< _Just)

771
findNgramTermList :: NgramsTable -> NgramsTerm -> Maybe TermList
772 773 774
findNgramTermList (NgramsTable m) n = m.ngrams_repo_elements ^? at r <<< _Just <<< _NgramsRepoElement <<< _list
  where
    r = findNgramRoot (NgramsTable m) n
775

776 777
singletonNgramsTablePatch :: NgramsTerm -> NgramsPatch -> NgramsTablePatch
singletonNgramsTablePatch n p = fromNgramsPatches $ singletonPatchMap n p
778

779
rootsOf :: NgramsTable -> Set NgramsTerm
Nicolas Pouillard's avatar
Nicolas Pouillard committed
780
rootsOf (NgramsTable m) = Map.keys $ Map.mapMaybe isRoot m.ngrams_repo_elements
781
  where
782
    isRoot (NgramsRepoElement { parent }) = parent
783 784 785 786 787

type RootParent = { root :: NgramsTerm, parent :: NgramsTerm }

type ReParent a = forall m. MonadState NgramsTable m => a -> m Unit

788 789 790 791 792 793
reRootMaxDepth :: Int
reRootMaxDepth = 100 -- TODO: this is a hack

reRootChildren :: Int -> NgramsTerm -> ReParent NgramsTerm
reRootChildren 0         _    _     = pure unit -- TODO: this is a hack
reRootChildren max_depth root ngram = do
794
  nre <- use (at ngram)
795 796
  traverseOf_ (_Just <<< _NgramsRepoElement <<< _children <<< folded) (\child -> do
    at child <<< _Just <<< _NgramsRepoElement <<< _root ?= root
797
    reRootChildren (max_depth - 1) root child) nre
798 799 800

reParent :: Maybe RootParent -> ReParent NgramsTerm
reParent mrp child = do
801 802
  at child <<< _Just <<< _NgramsRepoElement %= ((_parent .~ (view _parent <$> mrp)) <<<
                                                (_root   .~ (view _root   <$> mrp)))
803
  reRootChildren reRootMaxDepth (fromMaybe child (mrp ^? _Just <<< _root)) child
804 805 806 807 808 809

-- reParentNgramsPatch :: NgramsTerm -> ReParent NgramsPatch
-- ^ GHC would have accepted this type. Here reParentNgramsPatch checks but
--   not its usage in reParentNgramsTablePatch.
reParentNgramsPatch :: forall m. MonadState NgramsTable m
                    => NgramsTerm -> NgramsPatch -> m Unit
810
reParentNgramsPatch _      (NgramsReplace _) = pure unit -- TODO
811 812 813 814
reParentNgramsPatch parent (NgramsPatch {patch_children: PatchSet {rem, add}}) = do
  -- root_of_parent <- use (at parent <<< _Just <<< _NgramsElement <<< _root)
  -- ^ TODO this does not type checks, we do the following two lines instead:
  s <- use (at parent)
815
  let root_of_parent = s ^? (_Just <<< _NgramsRepoElement <<< _root <<< _Just)
816
  let rp = { root: fromMaybe parent root_of_parent, parent }
817 818 819
  traverse_ (reParent Nothing) rem
  traverse_ (reParent $ Just rp) add

820
reParentNgramsTablePatch :: ReParent NgramsPatches
821
reParentNgramsTablePatch = void <<< traversePatchMapWithIndex reParentNgramsPatch
822

823
{-
824 825 826 827 828 829 830 831 832 833 834 835
newElemsTable :: NewElems -> Map NgramsTerm NgramsElement
newElemsTable = mapWithIndex newElem
  where
    newElem ngrams list =
      NgramsElement
        { ngrams
        , list
        , occurrences: 1
        , parent:      Nothing
        , root:        Nothing
        , children:    mempty
        }
836
-}
837

838
applyNgramsTablePatch :: NgramsTablePatch -> NgramsTable -> NgramsTable
839
applyNgramsTablePatch { ngramsPatches } (NgramsTable m) =
840
  execState (reParentNgramsTablePatch ngramsPatches) $
Nicolas Pouillard's avatar
Nicolas Pouillard committed
841 842
  NgramsTable $ m { ngrams_repo_elements =
                      applyPatchMap applyNgramsPatch ngramsPatches m.ngrams_repo_elements }
843

844 845 846
applyNgramsPatches :: forall s. CoreState s -> NgramsTable -> NgramsTable
applyNgramsPatches {ngramsLocalPatch, ngramsStagePatch, ngramsValidPatch} =
  applyNgramsTablePatch (ngramsLocalPatch <> ngramsStagePatch <> ngramsValidPatch)
847
  -- First the valid patch, then the stage patch, and finally the local patch.
848 849 850
-----------------------------------------------------------------------------------

type CoreState s =
851 852 853 854 855 856 857
  { ngramsLocalPatch :: NgramsTablePatch
                     -- ^ These patches are local and not yet staged.
  , ngramsStagePatch :: NgramsTablePatch
                     -- ^ These patches are staged (scheduled for synchronization).
                     --   Requests are being performed at the moment.
  , ngramsValidPatch :: NgramsTablePatch
                     -- ^ These patches have been synchronized with the server.
858 859 860 861
  , ngramsVersion    :: Version
  | s
  }

862
{-
863 864
postNewNgrams :: forall s. Array NgramsTerm -> Maybe TermList -> CoreParams s -> Aff Unit
postNewNgrams newNgrams mayList {nodeId, listIds, tabType, session} =
865
  when (not (A.null newNgrams)) $ do
866
    (_ :: Array Unit) <- post session p newNgrams
867
    pure unit
868
  where p = PutNgrams tabType (head listIds) mayList (Just nodeId)
869

870 871
postNewElems :: forall s. NewElems -> CoreParams s -> Aff Unit
postNewElems newElems params = void $ traverseWithIndex postNewElem newElems
872
  where
873
    postNewElem ngrams list = postNewNgrams [ngrams] (Just list) params
874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889
-}

newNgramPatch :: TermList -> NgramsPatch
newNgramPatch list =
  NgramsReplace
  { patch_old: Nothing
  , patch_new:
      Just $ NgramsRepoElement
      { size: 1 -- TODO
      , list
      , root:     Nothing
      , parent:   Nothing
      , children: mempty
      -- , occurrences: 0 -- TODO
      }
  }
890

891 892
addNewNgramP :: NgramsTerm -> TermList -> NgramsTablePatch
addNewNgramP ngrams list =
893
  { ngramsPatches: singletonPatchMap ngrams (newNgramPatch list) }
894

895 896 897 898 899 900 901 902 903 904 905
addNewNgramA :: NgramsTerm -> TermList -> CoreAction
addNewNgramA ngrams list = CommitPatch $ addNewNgramP ngrams list

setTermListP :: NgramsTerm -> Replace TermList -> NgramsTablePatch
setTermListP ngram patch_list = singletonNgramsTablePatch ngram pe
  where
    pe = NgramsPatch { patch_list, patch_children: mempty }

setTermListA :: NgramsTerm -> Replace TermList -> CoreAction
setTermListA ngram termList = CommitPatch $ setTermListP ngram termList

906
putNgramsPatches :: forall s. CoreParams s -> VersionedNgramsPatches -> Aff (Either RESTError VersionedNgramsPatches)
907
putNgramsPatches { listIds, nodeId, session, tabType } = put session putNgrams
908
  where putNgrams = PutNgrams tabType (head listIds) Nothing (Just nodeId)
909

910 911 912 913 914
syncPatches :: forall p s. CoreParams p -> T.Box (CoreState s) -> (Unit -> Aff Unit) -> Effect Unit
syncPatches props state callback = do
  { ngramsLocalPatch: ngramsLocalPatch@{ ngramsPatches }
  , ngramsStagePatch
  , ngramsVersion } <- T.read state
915
  when (isEmptyNgramsTablePatch ngramsStagePatch) $ do
916
    let pt = Versioned { data: ngramsPatches, version: ngramsVersion }
917
    launchAff_ $ do
918 919 920 921 922 923 924 925 926 927 928 929 930 931 932
      ePatches <- putNgramsPatches props pt
      case ePatches of
        Left err -> liftEffect $ log2 "[syncPatches] RESTError" err
        Right (Versioned { data: newPatch, version: newVersion }) -> do
          callback unit
          liftEffect $ do
            log2 "[syncPatches] setting state, newVersion" newVersion
            T.modify_ (\s ->
              -- I think that sometimes this setState does not fully go through.
              -- This is an issue because the version number does not get updated and the subsequent calls
              -- can mess up the patches.
              s {
                  ngramsLocalPatch = fromNgramsPatches mempty
                , ngramsStagePatch = fromNgramsPatches mempty
                , ngramsValidPatch = fromNgramsPatches newPatch <> ngramsLocalPatch <> s.ngramsValidPatch
933
                              -- First the already valid patch, then the local patch, then the newly received newPatch.
934 935 936
                , ngramsVersion    = newVersion
                }) state
            log2 "[syncPatches] ngramsVersion" newVersion
937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963
    pure unit

{-
syncPatchesAsync :: forall p s. CoreParams p -> R.State (CoreState s) -> (Unit -> Aff Unit) -> Effect Unit
syncPatchesAsync props@{ listIds, tabType }
                 ({ ngramsLocalPatch: ngramsLocalPatch@{ ngramsPatches }
                  , ngramsStagePatch
                  , ngramsValidPatch
                  , ngramsVersion
                  } /\ setState) callback = do
  when (isEmptyNgramsTablePatch ngramsStagePatch) $ do
    let patch = Versioned { data: ngramsPatches, version: ngramsVersion }
    launchAff_ $ do
      Versioned { data: newPatch, version: newVersion } <- postNgramsPatchesAsync props patch
      callback unit
      liftEffect $ do
        log2 "[syncPatches] setting state, newVersion" newVersion
        setState $ \s ->
          s {
              ngramsLocalPatch = fromNgramsPatches mempty
            , ngramsStagePatch = fromNgramsPatches mempty
            , ngramsValidPatch = fromNgramsPatches newPatch <> ngramsLocalPatch <> s.ngramsValidPatch
                              -- First the already valid patch, then the local patch, then the newly received newPatch.
            , ngramsVersion    = newVersion
            }
        log2 "[syncPatches] ngramsVersion" newVersion
-}
964

965 966 967
commitPatch :: forall s. NgramsTablePatch -> T.Box (CoreState s) -> Effect Unit
commitPatch tablePatch state = do
  T.modify_ (\s -> s { ngramsLocalPatch = tablePatch <> s.ngramsLocalPatch }) state
968
    -- First we apply the patches we have locally and then the new patch (tablePatch).
969

970
loadNgramsTable :: PageParams -> Aff (Either RESTError VersionedNgramsTable)
971
loadNgramsTable
972 973 974 975
  { nodeId
  , listIds
  , session
  , tabType }
976
  = get session query
977 978 979 980 981 982 983 984 985 986 987
    where
      query = GetNgramsTableAll { listIds
                                , tabType } (Just nodeId)
  -- where query = GetNgrams { limit
  --                         , offset: Just offset
  --                         , listIds
  --                         , orderBy: convOrderBy <$> orderBy
  --                         , searchQuery
  --                         , tabType
  --                         , termListFilter
  --                         , termSizeFilter } (Just nodeId)
988

989 990
type NgramsListByTabType = Map TabType VersionedNgramsTable

991
loadNgramsTableAll :: PageParams -> Aff (Either RESTError NgramsListByTabType)
992
loadNgramsTableAll { nodeId, listIds, session } = do
993 994 995 996 997 998 999
  let
    cTagNgramTypes =
      [ CTabTerms
      , CTabSources
      , CTabAuthors
      , CTabInstitutes
      ]
1000
    query tabType = GetNgramsTableAll { listIds, tabType } (Just nodeId)
1001

1002
  ret <- Map.fromFoldable <$> for cTagNgramTypes \cTagNgramType -> do
1003
    let tabType = TabCorpus $ TabNgramType cTagNgramType
1004
    result :: Either RESTError VersionedNgramsTable <- get session $ query tabType
1005
    pure $ Tuple tabType result
1006

1007 1008
  pure $ eitherMap ret

1009
convOrderBy :: T.OrderByDirection T.ColumnName -> OrderBy
1010 1011
convOrderBy (T.ASC  (T.ColumnName "Score")) = ScoreAsc
convOrderBy (T.DESC (T.ColumnName "Score")) = ScoreDesc
1012 1013
convOrderBy (T.ASC  _) = TermAsc
convOrderBy (T.DESC _) = TermDesc
1014

1015 1016
data CoreAction
  = CommitPatch NgramsTablePatch
1017
  | Synchronize { afterSync  :: Unit -> Aff Unit }
1018
  | ResetPatches
1019 1020

data Action
1021
  = CoreAction CoreAction
1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033
  | SetParentResetChildren (Maybe NgramsTerm)
  -- ^ This sets `ngramsParent` and resets `ngramsChildren`.
  | ToggleChild Boolean NgramsTerm
  -- ^ Toggles the NgramsTerm in the `PatchSet` `ngramsChildren`.
  -- If the `Boolean` is `true` it means we want to add it if it is not here,
  -- if it is `false` it is meant to be removed if not here.
  | AddTermChildren
  | ToggleSelect NgramsTerm
  -- ^ Toggles the NgramsTerm in the `Set` `ngramsSelection`.
  | ToggleSelectAll


1034
type CoreDispatch = CoreAction -> Effect Unit
1035
type Dispatch = Action -> Effect Unit
1036

1037
coreDispatch :: forall p s. CoreParams p -> T.Box (CoreState s) -> CoreDispatch
1038 1039
coreDispatch path state (Synchronize { afterSync }) =
  syncPatches path state afterSync
1040 1041 1042
coreDispatch _ state (CommitPatch pt) =
  commitPatch pt state
coreDispatch _ state ResetPatches =
1043
  T.modify_ (_ { ngramsLocalPatch = { ngramsPatches: mempty } }) state
1044

1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055
isSingleNgramsTerm :: NgramsTerm -> Boolean
isSingleNgramsTerm nt = isSingleTerm $ ngramsTermText nt
  where
    isSingleTerm :: String -> Boolean
    isSingleTerm s = A.length words == 1
      where
        words = A.filter (not S.null) $ DSC.trim <$> (SU.words s)

filterTermSize :: Maybe TermSize -> NgramsTerm -> Boolean
filterTermSize (Just MonoTerm)  nt = isSingleNgramsTerm nt
filterTermSize (Just MultiTerm) nt = not $ isSingleNgramsTerm nt
1056
filterTermSize _                _  = true
1057

1058 1059 1060

------------------------------------------------------------------------
-- | Reset Button
1061
type SyncResetButtonsProps =
1062
  ( afterSync        :: Unit -> Aff Unit
1063
  , ngramsLocalPatch :: NgramsTablePatch
1064
  , performAction    :: CoreDispatch
1065 1066 1067 1068
  )

syncResetButtons :: Record SyncResetButtonsProps -> R.Element
syncResetButtons p = R.createElement syncResetButtonsCpt p []
1069

1070
syncResetButtonsCpt :: R.Component SyncResetButtonsProps
James Laver's avatar
James Laver committed
1071
syncResetButtonsCpt = here.component "syncResetButtons" cpt
1072
  where
1073
    cpt { afterSync, ngramsLocalPatch, performAction } _ = do
1074 1075
      synchronizing <- T.useBox false
      synchronizing' <- T.useLive T.unequal synchronizing
1076 1077 1078

      let
        hasChanges = ngramsLocalPatch /= mempty
1079
        hasChangesClass = if hasChanges then "" else " disabled"
1080

1081 1082
        synchronizingClass = if synchronizing' then " disabled" else ""

1083 1084
        resetClick _ = do
          performAction ResetPatches
1085 1086

        synchronizeClick _ = delay unit $ \_ -> do
1087
          T.write_ true synchronizing
1088 1089
          performAction $ Synchronize { afterSync: newAfterSync }

1090 1091
        newAfterSync x = do
          afterSync x
1092
          liftEffect $ T.write_ false synchronizing
1093

1094 1095
      pure $ H.div { className: "btn-toolbar" }
        [ H.div { className: "btn-group mr-2" }
1096
          [ H.button { className: "btn btn-danger " <> hasChangesClass <> synchronizingClass
1097 1098 1099 1100
                     , on: { click: resetClick }
                     } [ H.text "Reset" ]
          ]
        , H.div { className: "btn-group mr-2" }
1101
          [ H.button { className: "btn btn-primary " <> hasChangesClass <> synchronizingClass
1102 1103
                     , on: { click: synchronizeClick }
                     } [ H.text "Sync" ]
1104
          ]
1105
        ]
1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119


type ResetButton = (Unit -> Aff Unit)
               -> { ngramsPatches :: PatchMap NgramsTerm NgramsPatch }
               -> (Action -> Effect Unit)
               -> Array R.Element

chartsAfterSync :: forall props discard.
  { listIds :: Array Int
  , nodeId  :: Int
  , session :: Session
  , tabType :: TabType
  | props
  }
1120
  -> T.Box (Array FrontendError)
1121
  -> T.Box GAT.Storage
1122 1123
  -> discard
  -> Aff Unit
1124 1125 1126
chartsAfterSync path'@{ nodeId } errors tasks _ = do
  eTask <- postNgramsChartsAsync path'
  handleRESTError errors eTask $ \task -> liftEffect $ do
1127
    log2 "[chartsAfterSync] Synchronize task" task
1128
    GAT.insert nodeId task tasks
1129

1130
postNgramsChartsAsync :: forall s. CoreParams s -> Aff (Either RESTError AsyncTaskWithType)
1131
postNgramsChartsAsync { listIds, nodeId, session, tabType } = do
1132
    eTask :: Either RESTError AsyncTask <- post session putNgramsAsync acu
1133
    pure $ (\task -> AsyncTaskWithType { task, typ: UpdateNgramsCharts }) <$> eTask
1134 1135 1136 1137 1138
  where
    acu = AsyncNgramsChartsUpdate { listId: head listIds
                                  , tabType }
    putNgramsAsync = PostNgramsChartsAsync (Just nodeId)