Commit c4b6e85b authored by Alexandre Delanoë's avatar Alexandre Delanoë

[DOC] minor

parent 1888c343
...@@ -7,8 +7,9 @@ Maintainer : team@gargantext.org ...@@ -7,8 +7,9 @@ Maintainer : team@gargantext.org
Stability : experimental Stability : experimental
Portability : POSIX Portability : POSIX
Nice optimization of the Fibonacci function.
Source: Source:
Gabriel Gonzales, Blazing fast Fibonacci numbers using Monoids, 2020-04, Gabriel Gonzales, Blazing fast Fibonacci numbers using Monoids, 2020-04,
http://www.haskellforall.com/2020/04/blazing-fast-fibonacci-numbers-using.html http://www.haskellforall.com/2020/04/blazing-fast-fibonacci-numbers-using.html
(This post illustrates a nifty application of Haskell’s standard library to solve a numeric problem.) (This post illustrates a nifty application of Haskell’s standard library to solve a numeric problem.)
......
...@@ -139,11 +139,10 @@ buildNgramsTermsList :: Lang ...@@ -139,11 +139,10 @@ buildNgramsTermsList :: Lang
-> MasterCorpusId -> MasterCorpusId
-> Cmd err (Map NgramsType [NgramsElement]) -> Cmd err (Map NgramsType [NgramsElement])
buildNgramsTermsList l n m s uCid mCid = do buildNgramsTermsList l n m s uCid mCid = do
candidates <- sortTficf Up <$> getTficf uCid mCid NgramsTerms (ngramsGroup l n m) candidates <- sortTficf Down <$> getTficf uCid mCid NgramsTerms (ngramsGroup l n m)
let let
candidatesSize = 400 candidatesSize = 400
{- {-
a = 50 a = 50
b = 50 b = 50
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment