]> Git — Sourcephile - gargantext.git/blob - src/Gargantext/Ngrams/List.hs
[CLEAN] Graph: unoptmized distances using Data.Matrix (conditional and
[gargantext.git] / src / Gargantext / Ngrams / List.hs
1 {-|
2 Module : Gargantext.Ngrams.List
3 Description :
4 Copyright : (c) CNRS, 2017-Present
5 License : AGPL + CECILL v3
6 Maintainer : team@gargantext.org
7 Stability : experimental
8 Portability : POSIX
9
10 Here is a longer description of this module, containing some
11 commentary with @some markup@.
12 -}
13
14 {-# LANGUAGE NoImplicitPrelude #-}
15
16 module Gargantext.Ngrams.List where
17
18 import Data.Maybe
19 import Data.List (filter)
20 import Gargantext.Ngrams
21 import Gargantext.Prelude
22
23 graph :: [Ngrams] -> [Ngrams]
24 graph ngs = filter (\ng -> _ngramsListName ng == Just Graph) ngs
25
26 candidates :: [Ngrams] -> [Ngrams]
27 candidates ngs = filter (\ng -> _ngramsListName ng == Just Candidate) ngs
28
29 stop :: [Ngrams] -> [Ngrams]
30 stop ngs = filter (\ng -> _ngramsListName ng == Just Stop) ngs
31