Resolve "API refactorings"

See merge request !412

Separate ngram extraction from document insertion

Closes #473

See merge request !415

Now the tests pass again, but crucially `insertMasterDocs` runs in a
single atomic DB update, meaning we can rollback cleanly in case
disaster strikes.

The `ExtractNgrams` typeclass _definition_ imposed a redundant
`HasText` constraint, forcing all the _instances_ to have `HasText`
defined even though the instance didn't make any use of that.

That is overly-rigid, and it has been fixed by this commit.

This commit refactors the flow code to generate the ngrams for
the master docs separately, and then it "commits" them later after such
docs have been associated with a `Node`.

706 dev graph parameters display

See merge request !407

Fix a bug in `buildPatterns` and friends

Closes #395

See merge request !413

The final `T` doesn't add anything. It also moves the `HasText`
constraint _outside_ the typeclass definition.

Update IGraph

See merge request !411

Fixes a bug in the implementation of `buildPatterns`. In particular,
when we are building a `Pattern`, we need to do so in a case insenstive
fashion, otherwise later in the call to `replaceTerms` we would be
calling this from `extractTermsWithList` that cast everything into
lowercase due to the use of `monoTextsBySentence`.

This means that before this commit if we tried to search "Map" into
the text "Map is what I use when I'm lost" we wouldn't get a match,
because the latter would be converted into lowercase first
(i.e. "map is what i use when i'm lost") and we were trying to look
for the string "Map" (i.e. the former) into the transformer, yielding
no matches.

Previously the generator was generating all sorts of unicode symbols,
which doesn't play well for things like tab separators, carriage returns
and other things.

Furthermore, we need to be careful to not use the same symbol set of
`isSep` when we generate terms, because we are simulating an ngrams
search in a document and ngrams do not contain those separators
(i.e. `k2(` is not a valid ngram, but `k2` is).

Our IGraph library was updated to fix [this issue](haskell-igraph#5).

The `filterNodes` function's name and type signature were confusing, so
they were changed to make it evident that the filtering function for an
antry is applied to its total number of cooccurrences.

This makes it easier for me to grep code

Route implements Ord so no need to import Internal stuff

Reduce code duplication and simplify a few things.

The changes in this commit were made without relying on any knowledge
about what the code means or does; the changes should be understandable
even without knowing the project.

There's a filter in place to not show nodes not connected to any other
node, however the strict inequality was also filtering out nodes
connected to exactly one other node.

Removed some dead code, renamed some stuff, made exports explicit

Spinglass functions would output incoherent clusters when the input graph
was nonconnected.

`occurrencesWith` takes a function parameter to map over the input
collection before counting occurrences. Every time it's called, though,
it's with `identity`, so I replaced the function with a basic occurence
counting function.

Note that if one needs to apply a function to a collection before counting
occurrences, they can simply `fmap` over the collection first.

Port (almost all) DB operations in GGTX to use the transaction API

Closes #466

See merge request !408