{-# LANGUAGE TypeApplications #-}
#if (MIN_VERSION_haskell_gi_overloading(1,0,0) && !defined(__HADDOCK_VERSION__))
#define ENABLE_OVERLOADING
#endif
module GI.HarfBuzz.Structs.UserDataKeyT
(
UserDataKeyT(..) ,
newZeroUserDataKeyT ,
#if defined(ENABLE_OVERLOADING)
ResolveUserDataKeyTMethod ,
#endif
) 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.BasicTypes as B.Types
import qualified Data.GI.Base.ManagedPtr as B.ManagedPtr
import qualified Data.GI.Base.GArray as B.GArray
import qualified Data.GI.Base.GClosure as B.GClosure
import qualified Data.GI.Base.GError as B.GError
import qualified Data.GI.Base.GHashTable as B.GHT
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 Control.Monad.IO.Class as MIO
import qualified Data.Coerce as Coerce
import qualified Data.Text as T
import qualified Data.Kind as DK
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
import qualified GHC.Records as R
newtype UserDataKeyT = UserDataKeyT (SP.ManagedPtr UserDataKeyT)
deriving (UserDataKeyT -> UserDataKeyT -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: UserDataKeyT -> UserDataKeyT -> Bool
$c/= :: UserDataKeyT -> UserDataKeyT -> Bool
== :: UserDataKeyT -> UserDataKeyT -> Bool
$c== :: UserDataKeyT -> UserDataKeyT -> Bool
Eq)
instance SP.ManagedPtrNewtype UserDataKeyT where
toManagedPtr :: UserDataKeyT -> ManagedPtr UserDataKeyT
toManagedPtr (UserDataKeyT ManagedPtr UserDataKeyT
p) = ManagedPtr UserDataKeyT
p
foreign import ccall "hb_gobject_user_data_key_get_type" c_hb_gobject_user_data_key_get_type ::
IO GType
type instance O.ParentTypes UserDataKeyT = '[]
instance O.HasParentTypes UserDataKeyT
instance B.Types.TypedObject UserDataKeyT where
glibType :: IO GType
glibType = IO GType
c_hb_gobject_user_data_key_get_type
instance B.Types.GBoxed UserDataKeyT
instance B.GValue.IsGValue (Maybe UserDataKeyT) where
gvalueGType_ :: IO GType
gvalueGType_ = IO GType
c_hb_gobject_user_data_key_get_type
gvalueSet_ :: Ptr GValue -> Maybe UserDataKeyT -> IO ()
gvalueSet_ Ptr GValue
gv Maybe UserDataKeyT
P.Nothing = forall a. Ptr GValue -> Ptr a -> IO ()
B.GValue.set_boxed Ptr GValue
gv (forall a. Ptr a
FP.nullPtr :: FP.Ptr UserDataKeyT)
gvalueSet_ Ptr GValue
gv (P.Just UserDataKeyT
obj) = forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
B.ManagedPtr.withManagedPtr UserDataKeyT
obj (forall a. Ptr GValue -> Ptr a -> IO ()
B.GValue.set_boxed Ptr GValue
gv)
gvalueGet_ :: Ptr GValue -> IO (Maybe UserDataKeyT)
gvalueGet_ Ptr GValue
gv = do
Ptr UserDataKeyT
ptr <- forall b. Ptr GValue -> IO (Ptr b)
B.GValue.get_boxed Ptr GValue
gv :: IO (Ptr UserDataKeyT)
if Ptr UserDataKeyT
ptr forall a. Eq a => a -> a -> Bool
/= forall a. Ptr a
FP.nullPtr
then forall a. a -> Maybe a
P.Just forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall a.
(HasCallStack, GBoxed a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
B.ManagedPtr.newBoxed ManagedPtr UserDataKeyT -> UserDataKeyT
UserDataKeyT Ptr UserDataKeyT
ptr
else forall (m :: * -> *) a. Monad m => a -> m a
return forall a. Maybe a
P.Nothing
newZeroUserDataKeyT :: MonadIO m => m UserDataKeyT
newZeroUserDataKeyT :: forall (m :: * -> *). MonadIO m => m UserDataKeyT
newZeroUserDataKeyT = forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO forall a b. (a -> b) -> a -> b
$ forall a. GBoxed a => Int -> IO (Ptr a)
callocBoxedBytes Int
1 forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= forall a.
(HasCallStack, GBoxed a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
wrapBoxed ManagedPtr UserDataKeyT -> UserDataKeyT
UserDataKeyT
instance tag ~ 'AttrSet => Constructible UserDataKeyT tag where
new :: forall (m :: * -> *).
MonadIO m =>
(ManagedPtr UserDataKeyT -> UserDataKeyT)
-> [AttrOp UserDataKeyT tag] -> m UserDataKeyT
new ManagedPtr UserDataKeyT -> UserDataKeyT
_ [AttrOp UserDataKeyT tag]
attrs = do
UserDataKeyT
o <- forall (m :: * -> *). MonadIO m => m UserDataKeyT
newZeroUserDataKeyT
forall o (m :: * -> *).
MonadIO m =>
o -> [AttrOp o 'AttrSet] -> m ()
GI.Attributes.set UserDataKeyT
o [AttrOp UserDataKeyT tag]
attrs
forall (m :: * -> *) a. Monad m => a -> m a
return UserDataKeyT
o
#if defined(ENABLE_OVERLOADING)
instance O.HasAttributeList UserDataKeyT
type instance O.AttributeList UserDataKeyT = UserDataKeyTAttributeList
type UserDataKeyTAttributeList = ('[ ] :: [(Symbol, DK.Type)])
#endif
#if defined(ENABLE_OVERLOADING)
type family ResolveUserDataKeyTMethod (t :: Symbol) (o :: DK.Type) :: DK.Type where
ResolveUserDataKeyTMethod l o = O.MethodResolutionFailed l o
instance (info ~ ResolveUserDataKeyTMethod t UserDataKeyT, O.OverloadedMethod info UserDataKeyT p) => OL.IsLabel t (UserDataKeyT -> p) where
#if MIN_VERSION_base(4,10,0)
fromLabel = O.overloadedMethod @info
#else
fromLabel _ = O.overloadedMethod @info
#endif
#if MIN_VERSION_base(4,13,0)
instance (info ~ ResolveUserDataKeyTMethod t UserDataKeyT, O.OverloadedMethod info UserDataKeyT p, R.HasField t UserDataKeyT p) => R.HasField t UserDataKeyT p where
getField = O.overloadedMethod @info
#endif
instance (info ~ ResolveUserDataKeyTMethod t UserDataKeyT, O.OverloadedMethodInfo info UserDataKeyT) => OL.IsLabel t (O.MethodProxy info UserDataKeyT) where
#if MIN_VERSION_base(4,10,0)
fromLabel = O.MethodProxy
#else
fromLabel _ = O.MethodProxy
#endif
#endif