Copyright | (c) CNRS 2017-Present |
---|---|
License | AGPL + CECILL v3 |
Maintainer | team@gargantext.org |
Stability | experimental |
Portability | POSIX |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Synopsis
- searchInCorpus :: HasDBid NodeType => CorpusId -> IsTrash -> Query -> Maybe Offset -> Maybe Limit -> Maybe OrderBy -> DBCmd err [FacetDoc]
- searchInCorpusWithContacts :: HasDBid NodeType => CorpusId -> AnnuaireId -> Query -> Maybe Offset -> Maybe Limit -> Maybe OrderBy -> DBCmd err [FacetPaired Int UTCTime HyperdataContact Int]
- searchCountInCorpus :: HasDBid NodeType => CorpusId -> IsTrash -> Query -> DBCmd err Int
- searchInCorpusWithNgrams :: HasDBid NodeType => CorpusId -> ListId -> IsTrash -> NgramsType -> [[Text]] -> Maybe Offset -> Maybe Limit -> Maybe OrderBy -> DBCmd err [FacetDoc]
- searchDocInDatabase :: HasDBid NodeType => ParentId -> Text -> DBCmd err [(NodeId, HyperdataDocument)]
Documentation
searchInCorpus :: HasDBid NodeType => CorpusId -> IsTrash -> Query -> Maybe Offset -> Maybe Limit -> Maybe OrderBy -> DBCmd err [FacetDoc] #
todo add limit and offset and order
searchInCorpusWithContacts :: HasDBid NodeType => CorpusId -> AnnuaireId -> Query -> Maybe Offset -> Maybe Limit -> Maybe OrderBy -> DBCmd err [FacetPaired Int UTCTime HyperdataContact Int] #
searchInCorpusWithNgrams :: HasDBid NodeType => CorpusId -> ListId -> IsTrash -> NgramsType -> [[Text]] -> Maybe Offset -> Maybe Limit -> Maybe OrderBy -> DBCmd err [FacetDoc] #
Search ngrams in documents, ranking them by TF-IDF. We narrow our search only to map/candidate terms.
searchDocInDatabase :: HasDBid NodeType => ParentId -> Text -> DBCmd err [(NodeId, HyperdataDocument)] #