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.Viz.Graph.Index

Description

Basically compute takes an accelerate function as first input, a Map of coccurrences as second input and outputs a Map automatically using indexes.

TODO: --cooc2fgl :: Ord t, Integral n => Map (t, t) n -> Graph --fgl2json

Documentation

type Index = Int #

score :: Ord t => MatrixShape -> (Matrix Int -> Matrix Double) -> Map (t, t) Int -> Map (t, t) Double #

cooc2mat :: Ord t => MatrixShape -> Map t Index -> Map (t, t) Int -> Matrix Int #

data MatrixShape #

Constructors

Triangle 
Square 

map2mat :: Elt a => MatrixShape -> a -> Int -> Map (Index, Index) a -> Matrix a #

mat2map :: (Elt a, Shape (Z :. Index)) => Array ((Z :. Index) :. Index) a -> Map (Index, Index) a #

toIndex :: Ord t => Map t Index -> Map (t, t) a -> Map (Index, Index) a #

fromIndex :: Ord t => Map Index t -> Map (Index, Index) a -> Map (t, t) a #

indexConversion :: (Ord b, Ord k) => Map k b -> Map (k, k) a -> Map (b, b) a #

createIndices :: Ord t => Map (t, t) b -> (Map t Index, Map Index t) #

testIndices :: Bool #