gargantext-0.0.7.1.5.3: Search, map, share
Copyright(c) CNRS 2017-Present
LicenseAGPL + CECILL v3
Maintainerteam@gargantext.org
Stabilityexperimental
PortabilityPOSIX
Safe HaskellSafe-Inferred
LanguageHaskell2010

Gargantext.Core.Utils

Description

Here is a longer description of this module, containing some commentary with some markup.

Synopsis

Documentation

something :: Monoid a => Maybe a -> a #

choices :: Int -> [a] -> IO [a] #

groupWithCounts :: (Ord a, Eq a) => [a] -> [(a, Int)] #

Given a list of items of type a, return list with unique items (like List.nub) but tuple-d with their counts in the original list

addTuples :: (Num a, Num b) => (a, b) -> (a, b) -> (a, b) #