{-# LANGUAGE TypeApplications #-}
#if (MIN_VERSION_haskell_gi_overloading(1,0,0) && !defined(__HADDOCK_VERSION__))
#define ENABLE_OVERLOADING
#endif
module GI.Gtk.Structs.TextBTree
(
TextBTree(..) ,
#if defined(ENABLE_OVERLOADING)
ResolveTextBTreeMethod ,
#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.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
newtype TextBTree = TextBTree (SP.ManagedPtr TextBTree)
deriving (TextBTree -> TextBTree -> Bool
(TextBTree -> TextBTree -> Bool)
-> (TextBTree -> TextBTree -> Bool) -> Eq TextBTree
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: TextBTree -> TextBTree -> Bool
$c/= :: TextBTree -> TextBTree -> Bool
== :: TextBTree -> TextBTree -> Bool
$c== :: TextBTree -> TextBTree -> Bool
Eq)
instance SP.ManagedPtrNewtype TextBTree where
toManagedPtr :: TextBTree -> ManagedPtr TextBTree
toManagedPtr (TextBTree ManagedPtr TextBTree
p) = ManagedPtr TextBTree
p
instance BoxedPtr TextBTree where
boxedPtrCopy :: TextBTree -> IO TextBTree
boxedPtrCopy = TextBTree -> IO TextBTree
forall (m :: * -> *) a. Monad m => a -> m a
return
boxedPtrFree :: TextBTree -> IO ()
boxedPtrFree = \TextBTree
_x -> () -> IO ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
#if defined(ENABLE_OVERLOADING)
instance O.HasAttributeList TextBTree
type instance O.AttributeList TextBTree = TextBTreeAttributeList
type TextBTreeAttributeList = ('[ ] :: [(Symbol, *)])
#endif
#if defined(ENABLE_OVERLOADING)
type family ResolveTextBTreeMethod (t :: Symbol) (o :: *) :: * where
ResolveTextBTreeMethod l o = O.MethodResolutionFailed l o
instance (info ~ ResolveTextBTreeMethod t TextBTree, O.OverloadedMethod info TextBTree p) => OL.IsLabel t (TextBTree -> 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 ~ ResolveTextBTreeMethod t TextBTree, O.OverloadedMethod info TextBTree p, R.HasField t TextBTree p) => R.HasField t TextBTree p where
getField = O.overloadedMethod @info
#endif
instance (info ~ ResolveTextBTreeMethod t TextBTree, O.OverloadedMethodInfo info TextBTree) => OL.IsLabel t (O.MethodProxy info TextBTree) where
#if MIN_VERSION_base(4,10,0)
fromLabel = O.MethodProxy
#else
fromLabel _ = O.MethodProxy
#endif
#endif