modularity-0.2.0.3: Find the modularity of a network.

Safe HaskellNone
LanguageHaskell2010

Math.Modularity.Types

Documentation

newtype Q Source #

Constructors

Q 

Fields

Instances
Eq Q Source # 
Instance details

Defined in Math.Modularity.Types

Methods

(==) :: Q -> Q -> Bool #

(/=) :: Q -> Q -> Bool #

Num Q Source # 
Instance details

Defined in Math.Modularity.Types

Methods

(+) :: Q -> Q -> Q #

(-) :: Q -> Q -> Q #

(*) :: Q -> Q -> Q #

negate :: Q -> Q #

abs :: Q -> Q #

signum :: Q -> Q #

fromInteger :: Integer -> Q #

Ord Q Source # 
Instance details

Defined in Math.Modularity.Types

Methods

compare :: Q -> Q -> Ordering #

(<) :: Q -> Q -> Bool #

(<=) :: Q -> Q -> Bool #

(>) :: Q -> Q -> Bool #

(>=) :: Q -> Q -> Bool #

max :: Q -> Q -> Q #

min :: Q -> Q -> Q #

Read Q Source # 
Instance details

Defined in Math.Modularity.Types

Show Q Source # 
Instance details

Defined in Math.Modularity.Types

Methods

showsPrec :: Int -> Q -> ShowS #

show :: Q -> String #

showList :: [Q] -> ShowS #

Generic Q Source # 
Instance details

Defined in Math.Modularity.Types

Associated Types

type Rep Q :: Type -> Type #

Methods

from :: Q -> Rep Q x #

to :: Rep Q x -> Q #

type Rep Q Source # 
Instance details

Defined in Math.Modularity.Types

type Rep Q = D1 (MetaData "Q" "Math.Modularity.Types" "modularity-0.2.0.3-Dg3Rgzdv0cg4GSQRrAmM1e" True) (C1 (MetaCons "Q" PrefixI True) (S1 (MetaSel (Just "unQ") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Double)))