setoid-0.1.0.0: A Haskell implementation of setoid

Copyright(c) Global Access Internet Services GmbH 2017
LicenseBSD3
MaintainerPavlo Kerestey <pavlo@kerestey.net>
Safe HaskellSafe
LanguageHaskell2010

Data.Setoid.Types

Description

 

Documentation

newtype Setoid e a Source #

Constructors

Setoid (Map e a) 

Instances

(Eq a, Eq e) => Eq (Setoid e a) Source # 

Methods

(==) :: Setoid e a -> Setoid e a -> Bool #

(/=) :: Setoid e a -> Setoid e a -> Bool #

(Ord a, Ord e) => Ord (Setoid e a) Source # 

Methods

compare :: Setoid e a -> Setoid e a -> Ordering #

(<) :: Setoid e a -> Setoid e a -> Bool #

(<=) :: Setoid e a -> Setoid e a -> Bool #

(>) :: Setoid e a -> Setoid e a -> Bool #

(>=) :: Setoid e a -> Setoid e a -> Bool #

max :: Setoid e a -> Setoid e a -> Setoid e a #

min :: Setoid e a -> Setoid e a -> Setoid e a #

Generic (Setoid e a) Source # 

Associated Types

type Rep (Setoid e a) :: * -> * #

Methods

from :: Setoid e a -> Rep (Setoid e a) x #

to :: Rep (Setoid e a) x -> Setoid e a #

type Rep (Setoid e a) Source # 
type Rep (Setoid e a) = D1 (MetaData "Setoid" "Data.Setoid.Types" "setoid-0.1.0.0-LxlqWghTWkHKcIuQSe34pB" True) (C1 (MetaCons "Setoid" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Map e a))))