We are now around 6/7 times slower than the LLVM code.

This also changes the cabal.project to not pull the accelerate-llvm or
the llvm-hs dependencies.

There are some rounding errors in the tests, but otherwise
the implementation seems correct.

It's crucial to be able to understand the API surface area when porting
the old code to `massiv`. It turns out that other than distributional,
the other piece of code using the LLVM interpreter is
`logDistributional2`.

This commit starts introducing `massiv` in the codebase,
initially for simple functions like `termDivNan`. The main
goal is to extend the linear algebra toolkit up to the
point where we can implement `distributional` in terms of
`massive` and measure its performance.

The previous code was sometimes yielding a matrix of NaN numbers as
it was attempting the division of the input matrix with the diagonal,
which would be 0 in case of an input matrix of 0, resulting in a
division by 0 error.

The main idea is trying to refactor/improve the existing linear algebra
functions one function at the time, using reference implementations and
benchmarks along the way.

[graphql] fix droping field prefixes

See merge request !379

Upgrade 'haskell-bee' version, also bump up versions of some packages

See merge request !377

Resolve "Fix test build warnings"

See merge request !376

Also, add -Werror to tests so that no warnings in tests are reported anymore.

Switch to OpenAPI3 from Swagger2, to use proper Bearer token

Closes #427

See merge request !369

This commit adds three major tags to the swagger UI:

* Gargantext (like before): this spells out all the endpoints;
* Private operations: lists private backend ops;
* Public  operations: lists public backend ops.

More can be added, but the machinery used here should serve as a
blueprint.

OpenAPI3 will allow us to properly pass the Bearer Auth to the servant
swagger UI.