{-# LANGUAGE DeriveAnyClass #-}

-- {-# OPTIONS_GHC -fforce-recomp #-}

module Global.Resource.CubeMap.Base
  ( Collection(..)
  , sources
  ) where

import RIO

import GHC.Generics (Generic1)
import Resource.Source (Source)
import Resource.Source qualified as Source
import Resource.Collection (Generically1(..))

import Global.Resource.CubeMap.Base.Paths qualified as Paths

data Collection a = Collection
  { forall a. Collection a -> a
black        :: a
  }
  deriving stock (Int -> Collection a -> ShowS
[Collection a] -> ShowS
Collection a -> String
(Int -> Collection a -> ShowS)
-> (Collection a -> String)
-> ([Collection a] -> ShowS)
-> Show (Collection a)
forall a. Show a => Int -> Collection a -> ShowS
forall a. Show a => [Collection a] -> ShowS
forall a. Show a => Collection a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Collection a] -> ShowS
$cshowList :: forall a. Show a => [Collection a] -> ShowS
show :: Collection a -> String
$cshow :: forall a. Show a => Collection a -> String
showsPrec :: Int -> Collection a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Collection a -> ShowS
Show, (forall a b. (a -> b) -> Collection a -> Collection b)
-> (forall a b. a -> Collection b -> Collection a)
-> Functor Collection
forall a b. a -> Collection b -> Collection a
forall a b. (a -> b) -> Collection a -> Collection b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Collection b -> Collection a
$c<$ :: forall a b. a -> Collection b -> Collection a
fmap :: forall a b. (a -> b) -> Collection a -> Collection b
$cfmap :: forall a b. (a -> b) -> Collection a -> Collection b
Functor, (forall m. Monoid m => Collection m -> m)
-> (forall m a. Monoid m => (a -> m) -> Collection a -> m)
-> (forall m a. Monoid m => (a -> m) -> Collection a -> m)
-> (forall a b. (a -> b -> b) -> b -> Collection a -> b)
-> (forall a b. (a -> b -> b) -> b -> Collection a -> b)
-> (forall b a. (b -> a -> b) -> b -> Collection a -> b)
-> (forall b a. (b -> a -> b) -> b -> Collection a -> b)
-> (forall a. (a -> a -> a) -> Collection a -> a)
-> (forall a. (a -> a -> a) -> Collection a -> a)
-> (forall a. Collection a -> [a])
-> (forall a. Collection a -> Bool)
-> (forall a. Collection a -> Int)
-> (forall a. Eq a => a -> Collection a -> Bool)
-> (forall a. Ord a => Collection a -> a)
-> (forall a. Ord a => Collection a -> a)
-> (forall a. Num a => Collection a -> a)
-> (forall a. Num a => Collection a -> a)
-> Foldable Collection
forall a. Eq a => a -> Collection a -> Bool
forall a. Num a => Collection a -> a
forall a. Ord a => Collection a -> a
forall m. Monoid m => Collection m -> m
forall a. Collection a -> Bool
forall a. Collection a -> Int
forall a. Collection a -> [a]
forall a. (a -> a -> a) -> Collection a -> a
forall m a. Monoid m => (a -> m) -> Collection a -> m
forall b a. (b -> a -> b) -> b -> Collection a -> b
forall a b. (a -> b -> b) -> b -> Collection a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Collection a -> a
$cproduct :: forall a. Num a => Collection a -> a
sum :: forall a. Num a => Collection a -> a
$csum :: forall a. Num a => Collection a -> a
minimum :: forall a. Ord a => Collection a -> a
$cminimum :: forall a. Ord a => Collection a -> a
maximum :: forall a. Ord a => Collection a -> a
$cmaximum :: forall a. Ord a => Collection a -> a
elem :: forall a. Eq a => a -> Collection a -> Bool
$celem :: forall a. Eq a => a -> Collection a -> Bool
length :: forall a. Collection a -> Int
$clength :: forall a. Collection a -> Int
null :: forall a. Collection a -> Bool
$cnull :: forall a. Collection a -> Bool
toList :: forall a. Collection a -> [a]
$ctoList :: forall a. Collection a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Collection a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Collection a -> a
foldr1 :: forall a. (a -> a -> a) -> Collection a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Collection a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Collection a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Collection a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Collection a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Collection a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Collection a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Collection a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Collection a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Collection a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Collection a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Collection a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Collection a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Collection a -> m
fold :: forall m. Monoid m => Collection m -> m
$cfold :: forall m. Monoid m => Collection m -> m
Foldable, Functor Collection
Foldable Collection
Functor Collection
-> Foldable Collection
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Collection a -> f (Collection b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    Collection (f a) -> f (Collection a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Collection a -> m (Collection b))
-> (forall (m :: * -> *) a.
    Monad m =>
    Collection (m a) -> m (Collection a))
-> Traversable Collection
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a.
Monad m =>
Collection (m a) -> m (Collection a)
forall (f :: * -> *) a.
Applicative f =>
Collection (f a) -> f (Collection a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Collection a -> m (Collection b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Collection a -> f (Collection b)
sequence :: forall (m :: * -> *) a.
Monad m =>
Collection (m a) -> m (Collection a)
$csequence :: forall (m :: * -> *) a.
Monad m =>
Collection (m a) -> m (Collection a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Collection a -> m (Collection b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Collection a -> m (Collection b)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
Collection (f a) -> f (Collection a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Collection (f a) -> f (Collection a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Collection a -> f (Collection b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Collection a -> f (Collection b)
Traversable, (forall a. Collection a -> Rep1 Collection a)
-> (forall a. Rep1 Collection a -> Collection a)
-> Generic1 Collection
forall a. Rep1 Collection a -> Collection a
forall a. Collection a -> Rep1 Collection a
forall k (f :: k -> *).
(forall (a :: k). f a -> Rep1 f a)
-> (forall (a :: k). Rep1 f a -> f a) -> Generic1 f
$cto1 :: forall a. Rep1 Collection a -> Collection a
$cfrom1 :: forall a. Collection a -> Rep1 Collection a
Generic1)
  deriving Functor Collection
Functor Collection
-> (forall a. a -> Collection a)
-> (forall a b.
    Collection (a -> b) -> Collection a -> Collection b)
-> (forall a b c.
    (a -> b -> c) -> Collection a -> Collection b -> Collection c)
-> (forall a b. Collection a -> Collection b -> Collection b)
-> (forall a b. Collection a -> Collection b -> Collection a)
-> Applicative Collection
forall a. a -> Collection a
forall a b. Collection a -> Collection b -> Collection a
forall a b. Collection a -> Collection b -> Collection b
forall a b. Collection (a -> b) -> Collection a -> Collection b
forall a b c.
(a -> b -> c) -> Collection a -> Collection b -> Collection c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
<* :: forall a b. Collection a -> Collection b -> Collection a
$c<* :: forall a b. Collection a -> Collection b -> Collection a
*> :: forall a b. Collection a -> Collection b -> Collection b
$c*> :: forall a b. Collection a -> Collection b -> Collection b
liftA2 :: forall a b c.
(a -> b -> c) -> Collection a -> Collection b -> Collection c
$cliftA2 :: forall a b c.
(a -> b -> c) -> Collection a -> Collection b -> Collection c
<*> :: forall a b. Collection (a -> b) -> Collection a -> Collection b
$c<*> :: forall a b. Collection (a -> b) -> Collection a -> Collection b
pure :: forall a. a -> Collection a
$cpure :: forall a. a -> Collection a
Applicative via Generically1 Collection

sources :: Collection Source
sources :: Collection Source
sources = Collection :: forall a. a -> Collection a
Collection
  { $sel:black:Collection :: Source
black        = $(Source.embedFile Paths.BLACK_KTX_ZST)
  }