{-# LANGUAGE TypeApplications #-}


-- | Copyright  : Will Thompson and Iñaki García Etxebarria
-- License    : LGPL-2.1
-- Maintainer : Iñaki García Etxebarria
-- 
-- The opaque t'GI.GstBase.Structs.TypeFindData.TypeFindData' structure.
-- 
-- /Since: 1.22/

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

module GI.GstBase.Structs.TypeFindData
    ( 

-- * Exported types
    TypeFindData(..)                        ,


 -- * Methods

#if defined(ENABLE_OVERLOADING)
    ResolveTypeFindDataMethod               ,
#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


-- | Memory-managed wrapper type.
newtype TypeFindData = TypeFindData (SP.ManagedPtr TypeFindData)
    deriving (TypeFindData -> TypeFindData -> Bool
(TypeFindData -> TypeFindData -> Bool)
-> (TypeFindData -> TypeFindData -> Bool) -> Eq TypeFindData
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: TypeFindData -> TypeFindData -> Bool
== :: TypeFindData -> TypeFindData -> Bool
$c/= :: TypeFindData -> TypeFindData -> Bool
/= :: TypeFindData -> TypeFindData -> Bool
Eq)

instance SP.ManagedPtrNewtype TypeFindData where
    toManagedPtr :: TypeFindData -> ManagedPtr TypeFindData
toManagedPtr (TypeFindData ManagedPtr TypeFindData
p) = ManagedPtr TypeFindData
p

-- XXX Wrapping a foreign struct/union with no known destructor or size, leak?
instance BoxedPtr TypeFindData where
    boxedPtrCopy :: TypeFindData -> IO TypeFindData
boxedPtrCopy = TypeFindData -> IO TypeFindData
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return
    boxedPtrFree :: TypeFindData -> IO ()
boxedPtrFree = \TypeFindData
_x -> () -> IO ()
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return ()


#if defined(ENABLE_OVERLOADING)
instance O.HasAttributeList TypeFindData
type instance O.AttributeList TypeFindData = TypeFindDataAttributeList
type TypeFindDataAttributeList = ('[ ] :: [(Symbol, DK.Type)])
#endif

#if defined(ENABLE_OVERLOADING)
type family ResolveTypeFindDataMethod (t :: Symbol) (o :: DK.Type) :: DK.Type where
    ResolveTypeFindDataMethod l o = O.MethodResolutionFailed l o

instance (info ~ ResolveTypeFindDataMethod t TypeFindData, O.OverloadedMethod info TypeFindData p) => OL.IsLabel t (TypeFindData -> 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 ~ ResolveTypeFindDataMethod t TypeFindData, O.OverloadedMethod info TypeFindData p, R.HasField t TypeFindData p) => R.HasField t TypeFindData p where
    getField = O.overloadedMethod @info

#endif

instance (info ~ ResolveTypeFindDataMethod t TypeFindData, O.OverloadedMethodInfo info TypeFindData) => OL.IsLabel t (O.MethodProxy info TypeFindData) where
#if MIN_VERSION_base(4,10,0)
    fromLabel = O.MethodProxy
#else
    fromLabel _ = O.MethodProxy
#endif

#endif