{-# LANGUAGE TypeApplications #-}


-- | Copyright  : Will Thompson and Iñaki García Etxebarria
-- License    : LGPL-2.1
-- Maintainer : Iñaki García Etxebarria
-- 
-- Data structure for holding user-data keys.

#if (MIN_VERSION_haskell_gi_overloading(1,0,0) && !defined(__HADDOCK_VERSION__))
#define ENABLE_OVERLOADING
#endif

module GI.HarfBuzz.Structs.UserDataKeyT
    ( 

-- * Exported types
    UserDataKeyT(..)                        ,
    newZeroUserDataKeyT                     ,


 -- * Methods

#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.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.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


-- | Memory-managed wrapper type.
newtype UserDataKeyT = UserDataKeyT (SP.ManagedPtr UserDataKeyT)
    deriving (UserDataKeyT -> UserDataKeyT -> Bool
(UserDataKeyT -> UserDataKeyT -> Bool)
-> (UserDataKeyT -> UserDataKeyT -> Bool) -> Eq UserDataKeyT
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

-- | Convert 'UserDataKeyT' to and from 'Data.GI.Base.GValue.GValue'. See 'Data.GI.Base.GValue.toGValue' and 'Data.GI.Base.GValue.fromGValue'.
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 = Ptr GValue -> Ptr UserDataKeyT -> IO ()
forall a. Ptr GValue -> Ptr a -> IO ()
B.GValue.set_boxed Ptr GValue
gv (Ptr UserDataKeyT
forall a. Ptr a
FP.nullPtr :: FP.Ptr UserDataKeyT)
    gvalueSet_ Ptr GValue
gv (P.Just UserDataKeyT
obj) = UserDataKeyT -> (Ptr UserDataKeyT -> IO ()) -> IO ()
forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
B.ManagedPtr.withManagedPtr UserDataKeyT
obj (Ptr GValue -> Ptr UserDataKeyT -> IO ()
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 <- Ptr GValue -> IO (Ptr UserDataKeyT)
forall b. Ptr GValue -> IO (Ptr b)
B.GValue.get_boxed Ptr GValue
gv :: IO (Ptr UserDataKeyT)
        if Ptr UserDataKeyT
ptr Ptr UserDataKeyT -> Ptr UserDataKeyT -> Bool
forall a. Eq a => a -> a -> Bool
/= Ptr UserDataKeyT
forall a. Ptr a
FP.nullPtr
        then UserDataKeyT -> Maybe UserDataKeyT
forall a. a -> Maybe a
P.Just (UserDataKeyT -> Maybe UserDataKeyT)
-> IO UserDataKeyT -> IO (Maybe UserDataKeyT)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (ManagedPtr UserDataKeyT -> UserDataKeyT)
-> Ptr UserDataKeyT -> IO UserDataKeyT
forall a.
(HasCallStack, GBoxed a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
B.ManagedPtr.newBoxed ManagedPtr UserDataKeyT -> UserDataKeyT
UserDataKeyT Ptr UserDataKeyT
ptr
        else Maybe UserDataKeyT -> IO (Maybe UserDataKeyT)
forall (m :: * -> *) a. Monad m => a -> m a
return Maybe UserDataKeyT
forall a. Maybe a
P.Nothing
        
    

-- | Construct a `UserDataKeyT` struct initialized to zero.
newZeroUserDataKeyT :: MonadIO m => m UserDataKeyT
newZeroUserDataKeyT :: forall (m :: * -> *). MonadIO m => m UserDataKeyT
newZeroUserDataKeyT = IO UserDataKeyT -> m UserDataKeyT
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO UserDataKeyT -> m UserDataKeyT)
-> IO UserDataKeyT -> m UserDataKeyT
forall a b. (a -> b) -> a -> b
$ Int -> IO (Ptr UserDataKeyT)
forall a. GBoxed a => Int -> IO (Ptr a)
callocBoxedBytes Int
1 IO (Ptr UserDataKeyT)
-> (Ptr UserDataKeyT -> IO UserDataKeyT) -> IO UserDataKeyT
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= (ManagedPtr UserDataKeyT -> UserDataKeyT)
-> Ptr UserDataKeyT -> IO UserDataKeyT
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 <- m UserDataKeyT
forall (m :: * -> *). MonadIO m => m UserDataKeyT
newZeroUserDataKeyT
        UserDataKeyT -> [AttrOp UserDataKeyT 'AttrSet] -> m ()
forall o (m :: * -> *).
MonadIO m =>
o -> [AttrOp o 'AttrSet] -> m ()
GI.Attributes.set UserDataKeyT
o [AttrOp UserDataKeyT tag]
[AttrOp UserDataKeyT 'AttrSet]
attrs
        UserDataKeyT -> m UserDataKeyT
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, *)])
#endif

#if defined(ENABLE_OVERLOADING)
type family ResolveUserDataKeyTMethod (t :: Symbol) (o :: *) :: * 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