#if (MIN_VERSION_haskell_gi_overloading(1,0,0) && !defined(__HADDOCK_VERSION__))
#define ENABLE_OVERLOADING
#endif
module GI.Graphene.Enums
(
EulerOrder(..) ,
) where
import Data.GI.Base.ShortPrelude
import qualified Data.GI.Base.ShortPrelude as SP
import qualified Data.GI.Base.Overloading as O
import qualified Prelude as P
import qualified Data.GI.Base.Attributes as GI.Attributes
import qualified Data.GI.Base.ManagedPtr as B.ManagedPtr
import qualified Data.GI.Base.GClosure as B.GClosure
import qualified Data.GI.Base.GError as B.GError
import qualified Data.GI.Base.GVariant as B.GVariant
import qualified Data.GI.Base.GValue as B.GValue
import qualified Data.GI.Base.GParamSpec as B.GParamSpec
import qualified Data.GI.Base.CallStack as B.CallStack
import qualified Data.GI.Base.Properties as B.Properties
import qualified Data.GI.Base.Signals as B.Signals
import qualified Data.Text as T
import qualified Data.ByteString.Char8 as B
import qualified Data.Map as Map
import qualified Foreign.Ptr as FP
import qualified GHC.OverloadedLabels as OL
data EulerOrder =
EulerOrderDefault
| EulerOrderXyz
| EulerOrderYzx
| EulerOrderZxy
| EulerOrderXzy
| EulerOrderYxz
| EulerOrderZyx
| EulerOrderSxyz
| EulerOrderSxyx
| EulerOrderSxzy
| EulerOrderSxzx
| EulerOrderSyzx
| EulerOrderSyzy
| EulerOrderSyxz
| EulerOrderSyxy
| EulerOrderSzxy
| EulerOrderSzxz
| EulerOrderSzyx
| EulerOrderSzyz
| EulerOrderRzyx
| EulerOrderRxyx
| EulerOrderRyzx
| EulerOrderRxzx
| EulerOrderRxzy
| EulerOrderRyzy
| EulerOrderRzxy
| EulerOrderRyxy
| EulerOrderRyxz
| EulerOrderRzxz
| EulerOrderRxyz
| EulerOrderRzyz
| AnotherEulerOrder Int
deriving (Int -> EulerOrder -> ShowS
[EulerOrder] -> ShowS
EulerOrder -> String
(Int -> EulerOrder -> ShowS)
-> (EulerOrder -> String)
-> ([EulerOrder] -> ShowS)
-> Show EulerOrder
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [EulerOrder] -> ShowS
$cshowList :: [EulerOrder] -> ShowS
show :: EulerOrder -> String
$cshow :: EulerOrder -> String
showsPrec :: Int -> EulerOrder -> ShowS
$cshowsPrec :: Int -> EulerOrder -> ShowS
Show, EulerOrder -> EulerOrder -> Bool
(EulerOrder -> EulerOrder -> Bool)
-> (EulerOrder -> EulerOrder -> Bool) -> Eq EulerOrder
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: EulerOrder -> EulerOrder -> Bool
$c/= :: EulerOrder -> EulerOrder -> Bool
== :: EulerOrder -> EulerOrder -> Bool
$c== :: EulerOrder -> EulerOrder -> Bool
Eq)
instance P.Enum EulerOrder where
fromEnum :: EulerOrder -> Int
fromEnum EulerOrderDefault = -1
fromEnum EulerOrderXyz = 0
fromEnum EulerOrderYzx = 1
fromEnum EulerOrderZxy = 2
fromEnum EulerOrderXzy = 3
fromEnum EulerOrderYxz = 4
fromEnum EulerOrderZyx = 5
fromEnum EulerOrderSxyz = 6
fromEnum EulerOrderSxyx = 7
fromEnum EulerOrderSxzy = 8
fromEnum EulerOrderSxzx = 9
fromEnum EulerOrderSyzx = 10
fromEnum EulerOrderSyzy = 11
fromEnum EulerOrderSyxz = 12
fromEnum EulerOrderSyxy = 13
fromEnum EulerOrderSzxy = 14
fromEnum EulerOrderSzxz = 15
fromEnum EulerOrderSzyx = 16
fromEnum EulerOrderSzyz = 17
fromEnum EulerOrderRzyx = 18
fromEnum EulerOrderRxyx = 19
fromEnum EulerOrderRyzx = 20
fromEnum EulerOrderRxzx = 21
fromEnum EulerOrderRxzy = 22
fromEnum EulerOrderRyzy = 23
fromEnum EulerOrderRzxy = 24
fromEnum EulerOrderRyxy = 25
fromEnum EulerOrderRyxz = 26
fromEnum EulerOrderRzxz = 27
fromEnum EulerOrderRxyz = 28
fromEnum EulerOrderRzyz = 29
fromEnum (AnotherEulerOrder k :: Int
k) = Int
k
toEnum :: Int -> EulerOrder
toEnum -1 = EulerOrder
EulerOrderDefault
toEnum 0 = EulerOrder
EulerOrderXyz
toEnum 1 = EulerOrder
EulerOrderYzx
toEnum 2 = EulerOrder
EulerOrderZxy
toEnum 3 = EulerOrder
EulerOrderXzy
toEnum 4 = EulerOrder
EulerOrderYxz
toEnum 5 = EulerOrder
EulerOrderZyx
toEnum 6 = EulerOrder
EulerOrderSxyz
toEnum 7 = EulerOrder
EulerOrderSxyx
toEnum 8 = EulerOrder
EulerOrderSxzy
toEnum 9 = EulerOrder
EulerOrderSxzx
toEnum 10 = EulerOrder
EulerOrderSyzx
toEnum 11 = EulerOrder
EulerOrderSyzy
toEnum 12 = EulerOrder
EulerOrderSyxz
toEnum 13 = EulerOrder
EulerOrderSyxy
toEnum 14 = EulerOrder
EulerOrderSzxy
toEnum 15 = EulerOrder
EulerOrderSzxz
toEnum 16 = EulerOrder
EulerOrderSzyx
toEnum 17 = EulerOrder
EulerOrderSzyz
toEnum 18 = EulerOrder
EulerOrderRzyx
toEnum 19 = EulerOrder
EulerOrderRxyx
toEnum 20 = EulerOrder
EulerOrderRyzx
toEnum 21 = EulerOrder
EulerOrderRxzx
toEnum 22 = EulerOrder
EulerOrderRxzy
toEnum 23 = EulerOrder
EulerOrderRyzy
toEnum 24 = EulerOrder
EulerOrderRzxy
toEnum 25 = EulerOrder
EulerOrderRyxy
toEnum 26 = EulerOrder
EulerOrderRyxz
toEnum 27 = EulerOrder
EulerOrderRzxz
toEnum 28 = EulerOrder
EulerOrderRxyz
toEnum 29 = EulerOrder
EulerOrderRzyz
toEnum k :: Int
k = Int -> EulerOrder
AnotherEulerOrder Int
k
instance P.Ord EulerOrder where
compare :: EulerOrder -> EulerOrder -> Ordering
compare a :: EulerOrder
a b :: EulerOrder
b = Int -> Int -> Ordering
forall a. Ord a => a -> a -> Ordering
P.compare (EulerOrder -> Int
forall a. Enum a => a -> Int
P.fromEnum EulerOrder
a) (EulerOrder -> Int
forall a. Enum a => a -> Int
P.fromEnum EulerOrder
b)