Topaz.Types

Documentation

data Elem (rs :: [k]) (r :: k) where

Constructors

ElemHere :: Elem (r ': rs) r

ElemThere :: Elem rs r -> Elem (s ': rs) r

data Rec :: forall (k :: Type). (k -> Type) -> [k] -> Type where

Constructors

RecNil :: Rec f '[]

RecCons :: f r -> Rec f rs -> Rec f (r ': rs)

Instances

TestCoercion f => TestCoercion (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

testCoercion :: forall (a :: k0) (b :: k0). Rec f a -> Rec f b -> Maybe (Coercion a b)

TestEquality f => TestEquality (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

testEquality :: forall (a :: k0) (b :: k0). Rec f a -> Rec f b -> Maybe (a :~: b)

BinaryForeach f => BinaryForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

putForeach :: forall (a :: k0). Sing a -> Rec f a -> Put

getForeach :: forall (a :: k0). Sing a -> Get (Rec f a)

EqForall f => EqForall (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

eqForall :: forall (a :: k0). Rec f a -> Rec f a -> Bool

EqForallPoly f => EqForallPoly (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

eqForallPoly :: forall (a :: k0) (b :: k0). Rec f a -> Rec f b -> WitnessedEquality a b

EqForeach f => EqForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

eqForeach :: forall (a :: k0). Sing a -> Rec f a -> Rec f a -> Bool

HashableForall f => HashableForall (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

hashWithSaltForall :: forall (a :: k0). Int -> Rec f a -> Int

MonoidForeach f => MonoidForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

emptyForeach :: forall (a :: k0). Sing a -> Rec f a

OrdForall f => OrdForall (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

compareForall :: forall (a :: k0). Rec f a -> Rec f a -> Ordering

OrdForeach f => OrdForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

compareForeach :: forall (a :: k0). Sing a -> Rec f a -> Rec f a -> Ordering

SemigroupForall f => SemigroupForall (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

appendForall :: forall (a :: k0). Rec f a -> Rec f a -> Rec f a

SemigroupForeach f => SemigroupForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

appendForeach :: forall (a :: k0). Sing a -> Rec f a -> Rec f a -> Rec f a

ShowForall f => ShowForall (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

showsPrecForall :: forall (a :: k0). Int -> Rec f a -> ShowS

ShowForeach f => ShowForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

showsPrecForeach :: forall (a :: k0). Sing a -> Int -> Rec f a -> ShowS

StorableForeach f => StorableForeach (Rec f :: [k] -> Type)

Defined in Topaz.Types

Methods

peekForeach :: forall (a :: k0). Sing a -> Ptr (Rec f a) -> IO (Rec f a)

pokeForeach :: forall (a :: k0). Sing a -> Ptr (Rec f a) -> Rec f a -> IO ()

sizeOfForeach :: forall (a :: k0). Proxy (Rec f) -> Sing a -> Int

(StorableForeach f, Reify as) => Storable (Rec f as)

Defined in Topaz.Types

Methods

sizeOf :: Rec f as -> Int

alignment :: Rec f as -> Int

peekElemOff :: Ptr (Rec f as) -> Int -> IO (Rec f as)

pokeElemOff :: Ptr (Rec f as) -> Int -> Rec f as -> IO ()

peekByteOff :: Ptr b -> Int -> IO (Rec f as)

pokeByteOff :: Ptr b -> Int -> Rec f as -> IO ()

peek :: Ptr (Rec f as) -> IO (Rec f as)

poke :: Ptr (Rec f as) -> Rec f as -> IO ()

SemigroupForall f => Semigroup (Rec f as)

Defined in Topaz.Types

Methods

(<>) :: Rec f as -> Rec f as -> Rec f as

sconcat :: NonEmpty (Rec f as) -> Rec f as

stimes :: Integral b => b -> Rec f as -> Rec f as

ShowForall f => Show (Rec f as)

Defined in Topaz.Types

Methods

showsPrec :: Int -> Rec f as -> ShowS

show :: Rec f as -> String

showList :: [Rec f as] -> ShowS

EqForall f => Eq (Rec f as)

Defined in Topaz.Types

Methods

(==) :: Rec f as -> Rec f as -> Bool

(/=) :: Rec f as -> Rec f as -> Bool

OrdForall f => Ord (Rec f as)

Defined in Topaz.Types

Methods

compare :: Rec f as -> Rec f as -> Ordering

(<) :: Rec f as -> Rec f as -> Bool

(<=) :: Rec f as -> Rec f as -> Bool

(>) :: Rec f as -> Rec f as -> Bool

(>=) :: Rec f as -> Rec f as -> Bool

max :: Rec f as -> Rec f as -> Rec f as

min :: Rec f as -> Rec f as -> Rec f as

(EqForall f, HashableForall f) => Hashable (Rec f as)

Defined in Topaz.Types

Methods

hashWithSalt :: Int -> Rec f as -> Int

hash :: Rec f as -> Int

data NestRec :: forall (k :: Type). (k -> Type) -> Nest k -> Type where

Constructors

NestRec :: Rec f rs -> Rec (NestRec f) ns -> NestRec f ('Nest ns rs)

newtype Fix f

Constructors

Fix (f (Fix f))

Instances

Monoid1 f => Monoid (Fix f)

Defined in Topaz.Types

Methods

mempty :: Fix f

mappend :: Fix f -> Fix f -> Fix f

mconcat :: [Fix f] -> Fix f

Semigroup1 f => Semigroup (Fix f)

Defined in Topaz.Types

Methods

(<>) :: Fix f -> Fix f -> Fix f

sconcat :: NonEmpty (Fix f) -> Fix f

stimes :: Integral b => b -> Fix f -> Fix f

newtype HFix h a

Constructors

HFix (h (HFix h) a)

Instances

TestEqualityHetero h => TestEquality (HFix h :: k -> Type)

Defined in Topaz.Types

Methods

testEquality :: forall (a :: k0) (b :: k0). HFix h a -> HFix h b -> Maybe (a :~: b)

EqHetero h => EqForall (HFix h :: k -> Type)

Defined in Topaz.Types

Methods

eqForall :: forall (a :: k0). HFix h a -> HFix h a -> Bool

EqHetero h => Eq (HFix h a)

Defined in Topaz.Types

Methods

(==) :: HFix h a -> HFix h a -> Bool

(/=) :: HFix h a -> HFix h a -> Bool

data Nest a

Constructors

Nest [Nest a] [a]

class EqHetero h where

Methods

eqHetero :: (forall x. f x -> f x -> Bool) -> h f a -> h f a -> Bool

class TestEqualityHetero h where

Methods

testEqualityHetero :: (forall x y. f x -> f y -> Maybe (x :~: y)) -> h f a -> h f b -> Maybe (a :~: b)

data Nat

Constructors

Succ Nat

Zero

Instances

type Sing

Defined in Topaz.Types

type Sing = SingNat

data SingNat :: Nat -> Type where

Constructors

SingZero :: SingNat 'Zero

SingSucc :: SingNat n -> SingNat ('Succ n)

data Vector :: Nat -> Type -> Type where

Constructors

VectorNil :: Vector 'Zero a

VectorCons :: a -> Vector n a -> Vector ('Succ n) a

Instances

Eq a => Eq (Vector n a)

Defined in Topaz.Types

Methods

(==) :: Vector n a -> Vector n a -> Bool

(/=) :: Vector n a -> Vector n a -> Bool

type family (as :: [k]) ++ (bs :: [k]) :: [k] where ... infixr 5

Equations

'[] ++ bs = bs

(a ': as) ++ bs = a ': (as ++ bs)