2 Module : Gargantext.Graph.Distances
3 Description : Distance management tools
4 Copyright : (c) CNRS, 2017-Present
5 License : AGPL + CECILL v3
6 Maintainer : team@gargantext.org
7 Stability : experimental
12 {-# LANGUAGE Strict #-}
14 module Gargantext.Core.Methods.Distances
17 import Debug.Trace (trace)
19 import Data.Array.Accelerate (Matrix)
21 import GHC.Generics (Generic)
22 import Gargantext.Core.Methods.Distances.Accelerate.Conditional (measureConditional)
23 import Gargantext.Core.Methods.Distances.Accelerate.Distributional (logDistributional)
24 import Gargantext.Prelude (Ord, Eq, Int, Double, Show, ($), show)
25 import Prelude (Enum, Bounded, minBound, maxBound)
26 import Test.QuickCheck (elements)
27 import Test.QuickCheck.Arbitrary
29 ------------------------------------------------------------------------
30 data Distance = Conditional | Distributional
33 measure :: Distance -> Matrix Int -> Matrix Double
34 measure Conditional x = measureConditional x
35 measure Distributional x = trace (show y) $ y
37 y = logDistributional x
39 ------------------------------------------------------------------------
40 withMetric :: GraphMetric -> Distance
41 withMetric Order1 = Conditional
42 withMetric Order2 = Distributional
44 ------------------------------------------------------------------------
45 data GraphMetric = Order1 | Order2
46 deriving (Generic, Eq, Ord, Enum, Bounded, Show)
48 instance FromJSON GraphMetric
49 instance ToJSON GraphMetric
50 instance ToSchema GraphMetric
51 instance Arbitrary GraphMetric where
52 arbitrary = elements [ minBound .. maxBound ]
54 ------------------------------------------------------------------------