{-# LANGUAGE TypeApplications #-}
#if (MIN_VERSION_haskell_gi_overloading(1,0,0) && !defined(__HADDOCK_VERSION__))
#define ENABLE_OVERLOADING
#endif
module GI.GLib.Structs.Tree
(
Tree(..) ,
#if defined(ENABLE_OVERLOADING)
ResolveTreeMethod ,
#endif
#if defined(ENABLE_OVERLOADING)
TreeDestroyMethodInfo ,
#endif
treeDestroy ,
#if defined(ENABLE_OVERLOADING)
TreeHeightMethodInfo ,
#endif
treeHeight ,
#if defined(ENABLE_OVERLOADING)
TreeInsertMethodInfo ,
#endif
treeInsert ,
#if defined(ENABLE_OVERLOADING)
TreeLookupMethodInfo ,
#endif
treeLookup ,
#if defined(ENABLE_OVERLOADING)
TreeLookupExtendedMethodInfo ,
#endif
treeLookupExtended ,
#if defined(ENABLE_OVERLOADING)
TreeNnodesMethodInfo ,
#endif
treeNnodes ,
#if defined(ENABLE_OVERLOADING)
TreeRemoveMethodInfo ,
#endif
treeRemove ,
#if defined(ENABLE_OVERLOADING)
TreeReplaceMethodInfo ,
#endif
treeReplace ,
#if defined(ENABLE_OVERLOADING)
TreeStealMethodInfo ,
#endif
treeSteal ,
#if defined(ENABLE_OVERLOADING)
TreeUnrefMethodInfo ,
#endif
treeUnref ,
) 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 Tree = Tree (SP.ManagedPtr Tree)
deriving (Tree -> Tree -> Bool
(Tree -> Tree -> Bool) -> (Tree -> Tree -> Bool) -> Eq Tree
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Tree -> Tree -> Bool
$c/= :: Tree -> Tree -> Bool
== :: Tree -> Tree -> Bool
$c== :: Tree -> Tree -> Bool
Eq)
instance SP.ManagedPtrNewtype Tree where
toManagedPtr :: Tree -> ManagedPtr Tree
toManagedPtr (Tree ManagedPtr Tree
p) = ManagedPtr Tree
p
instance BoxedPtr Tree where
boxedPtrCopy :: Tree -> IO Tree
boxedPtrCopy = Tree -> IO Tree
forall (m :: * -> *) a. Monad m => a -> m a
return
boxedPtrFree :: Tree -> IO ()
boxedPtrFree = \Tree
_x -> () -> IO ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
#if defined(ENABLE_OVERLOADING)
instance O.HasAttributeList Tree
type instance O.AttributeList Tree = TreeAttributeList
type TreeAttributeList = ('[ ] :: [(Symbol, *)])
#endif
foreign import ccall "g_tree_destroy" g_tree_destroy ::
Ptr Tree ->
IO ()
treeDestroy ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> m ()
treeDestroy :: forall (m :: * -> *). (HasCallStack, MonadIO m) => Tree -> m ()
treeDestroy Tree
tree = IO () -> m ()
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO () -> m ()) -> IO () -> m ()
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Ptr Tree -> IO ()
g_tree_destroy Ptr Tree
tree'
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
() -> IO ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
#if defined(ENABLE_OVERLOADING)
data TreeDestroyMethodInfo
instance (signature ~ (m ()), MonadIO m) => O.OverloadedMethod TreeDestroyMethodInfo Tree signature where
overloadedMethod = treeDestroy
instance O.OverloadedMethodInfo TreeDestroyMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeDestroy",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeDestroy"
}
#endif
foreign import ccall "g_tree_height" g_tree_height ::
Ptr Tree ->
IO Int32
treeHeight ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> m Int32
treeHeight :: forall (m :: * -> *). (HasCallStack, MonadIO m) => Tree -> m Int32
treeHeight Tree
tree = IO Int32 -> m Int32
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO Int32 -> m Int32) -> IO Int32 -> m Int32
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Int32
result <- Ptr Tree -> IO Int32
g_tree_height Ptr Tree
tree'
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
Int32 -> IO Int32
forall (m :: * -> *) a. Monad m => a -> m a
return Int32
result
#if defined(ENABLE_OVERLOADING)
data TreeHeightMethodInfo
instance (signature ~ (m Int32), MonadIO m) => O.OverloadedMethod TreeHeightMethodInfo Tree signature where
overloadedMethod = treeHeight
instance O.OverloadedMethodInfo TreeHeightMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeHeight",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeHeight"
}
#endif
foreign import ccall "g_tree_insert" g_tree_insert ::
Ptr Tree ->
Ptr () ->
Ptr () ->
IO ()
treeInsert ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> Ptr ()
-> Ptr ()
-> m ()
treeInsert :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Tree -> Ptr () -> Ptr () -> m ()
treeInsert Tree
tree Ptr ()
key Ptr ()
value = IO () -> m ()
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO () -> m ()) -> IO () -> m ()
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Ptr Tree -> Ptr () -> Ptr () -> IO ()
g_tree_insert Ptr Tree
tree' Ptr ()
key Ptr ()
value
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
() -> IO ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
#if defined(ENABLE_OVERLOADING)
data TreeInsertMethodInfo
instance (signature ~ (Ptr () -> Ptr () -> m ()), MonadIO m) => O.OverloadedMethod TreeInsertMethodInfo Tree signature where
overloadedMethod = treeInsert
instance O.OverloadedMethodInfo TreeInsertMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeInsert",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeInsert"
}
#endif
foreign import ccall "g_tree_lookup" g_tree_lookup ::
Ptr Tree ->
Ptr () ->
IO (Ptr ())
treeLookup ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> Ptr ()
-> m (Ptr ())
treeLookup :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Tree -> Ptr () -> m (Ptr ())
treeLookup Tree
tree Ptr ()
key = IO (Ptr ()) -> m (Ptr ())
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO (Ptr ()) -> m (Ptr ())) -> IO (Ptr ()) -> m (Ptr ())
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Ptr ()
result <- Ptr Tree -> Ptr () -> IO (Ptr ())
g_tree_lookup Ptr Tree
tree' Ptr ()
key
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
Ptr () -> IO (Ptr ())
forall (m :: * -> *) a. Monad m => a -> m a
return Ptr ()
result
#if defined(ENABLE_OVERLOADING)
data TreeLookupMethodInfo
instance (signature ~ (Ptr () -> m (Ptr ())), MonadIO m) => O.OverloadedMethod TreeLookupMethodInfo Tree signature where
overloadedMethod = treeLookup
instance O.OverloadedMethodInfo TreeLookupMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeLookup",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeLookup"
}
#endif
foreign import ccall "g_tree_lookup_extended" g_tree_lookup_extended ::
Ptr Tree ->
Ptr () ->
Ptr (Ptr ()) ->
Ptr (Ptr ()) ->
IO CInt
treeLookupExtended ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> Ptr ()
-> m ((Bool, Ptr (), Ptr ()))
treeLookupExtended :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Tree -> Ptr () -> m (Bool, Ptr (), Ptr ())
treeLookupExtended Tree
tree Ptr ()
lookupKey = IO (Bool, Ptr (), Ptr ()) -> m (Bool, Ptr (), Ptr ())
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO (Bool, Ptr (), Ptr ()) -> m (Bool, Ptr (), Ptr ()))
-> IO (Bool, Ptr (), Ptr ()) -> m (Bool, Ptr (), Ptr ())
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Ptr (Ptr ())
origKey <- IO (Ptr (Ptr ()))
forall a. Storable a => IO (Ptr a)
callocMem :: IO (Ptr (Ptr ()))
Ptr (Ptr ())
value <- IO (Ptr (Ptr ()))
forall a. Storable a => IO (Ptr a)
callocMem :: IO (Ptr (Ptr ()))
CInt
result <- Ptr Tree -> Ptr () -> Ptr (Ptr ()) -> Ptr (Ptr ()) -> IO CInt
g_tree_lookup_extended Ptr Tree
tree' Ptr ()
lookupKey Ptr (Ptr ())
origKey Ptr (Ptr ())
value
let result' :: Bool
result' = (CInt -> CInt -> Bool
forall a. Eq a => a -> a -> Bool
/= CInt
0) CInt
result
Ptr ()
origKey' <- Ptr (Ptr ()) -> IO (Ptr ())
forall a. Storable a => Ptr a -> IO a
peek Ptr (Ptr ())
origKey
Ptr ()
value' <- Ptr (Ptr ()) -> IO (Ptr ())
forall a. Storable a => Ptr a -> IO a
peek Ptr (Ptr ())
value
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
Ptr (Ptr ()) -> IO ()
forall a. Ptr a -> IO ()
freeMem Ptr (Ptr ())
origKey
Ptr (Ptr ()) -> IO ()
forall a. Ptr a -> IO ()
freeMem Ptr (Ptr ())
value
(Bool, Ptr (), Ptr ()) -> IO (Bool, Ptr (), Ptr ())
forall (m :: * -> *) a. Monad m => a -> m a
return (Bool
result', Ptr ()
origKey', Ptr ()
value')
#if defined(ENABLE_OVERLOADING)
data TreeLookupExtendedMethodInfo
instance (signature ~ (Ptr () -> m ((Bool, Ptr (), Ptr ()))), MonadIO m) => O.OverloadedMethod TreeLookupExtendedMethodInfo Tree signature where
overloadedMethod = treeLookupExtended
instance O.OverloadedMethodInfo TreeLookupExtendedMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeLookupExtended",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeLookupExtended"
}
#endif
foreign import ccall "g_tree_nnodes" g_tree_nnodes ::
Ptr Tree ->
IO Int32
treeNnodes ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> m Int32
treeNnodes :: forall (m :: * -> *). (HasCallStack, MonadIO m) => Tree -> m Int32
treeNnodes Tree
tree = IO Int32 -> m Int32
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO Int32 -> m Int32) -> IO Int32 -> m Int32
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Int32
result <- Ptr Tree -> IO Int32
g_tree_nnodes Ptr Tree
tree'
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
Int32 -> IO Int32
forall (m :: * -> *) a. Monad m => a -> m a
return Int32
result
#if defined(ENABLE_OVERLOADING)
data TreeNnodesMethodInfo
instance (signature ~ (m Int32), MonadIO m) => O.OverloadedMethod TreeNnodesMethodInfo Tree signature where
overloadedMethod = treeNnodes
instance O.OverloadedMethodInfo TreeNnodesMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeNnodes",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeNnodes"
}
#endif
foreign import ccall "g_tree_remove" g_tree_remove ::
Ptr Tree ->
Ptr () ->
IO CInt
treeRemove ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> Ptr ()
-> m Bool
treeRemove :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Tree -> Ptr () -> m Bool
treeRemove Tree
tree Ptr ()
key = IO Bool -> m Bool
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO Bool -> m Bool) -> IO Bool -> m Bool
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
CInt
result <- Ptr Tree -> Ptr () -> IO CInt
g_tree_remove Ptr Tree
tree' Ptr ()
key
let result' :: Bool
result' = (CInt -> CInt -> Bool
forall a. Eq a => a -> a -> Bool
/= CInt
0) CInt
result
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
Bool -> IO Bool
forall (m :: * -> *) a. Monad m => a -> m a
return Bool
result'
#if defined(ENABLE_OVERLOADING)
data TreeRemoveMethodInfo
instance (signature ~ (Ptr () -> m Bool), MonadIO m) => O.OverloadedMethod TreeRemoveMethodInfo Tree signature where
overloadedMethod = treeRemove
instance O.OverloadedMethodInfo TreeRemoveMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeRemove",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeRemove"
}
#endif
foreign import ccall "g_tree_replace" g_tree_replace ::
Ptr Tree ->
Ptr () ->
Ptr () ->
IO ()
treeReplace ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> Ptr ()
-> Ptr ()
-> m ()
treeReplace :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Tree -> Ptr () -> Ptr () -> m ()
treeReplace Tree
tree Ptr ()
key Ptr ()
value = IO () -> m ()
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO () -> m ()) -> IO () -> m ()
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Ptr Tree -> Ptr () -> Ptr () -> IO ()
g_tree_replace Ptr Tree
tree' Ptr ()
key Ptr ()
value
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
() -> IO ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
#if defined(ENABLE_OVERLOADING)
data TreeReplaceMethodInfo
instance (signature ~ (Ptr () -> Ptr () -> m ()), MonadIO m) => O.OverloadedMethod TreeReplaceMethodInfo Tree signature where
overloadedMethod = treeReplace
instance O.OverloadedMethodInfo TreeReplaceMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeReplace",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeReplace"
}
#endif
foreign import ccall "g_tree_steal" g_tree_steal ::
Ptr Tree ->
Ptr () ->
IO CInt
treeSteal ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> Ptr ()
-> m Bool
treeSteal :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Tree -> Ptr () -> m Bool
treeSteal Tree
tree Ptr ()
key = IO Bool -> m Bool
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO Bool -> m Bool) -> IO Bool -> m Bool
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
CInt
result <- Ptr Tree -> Ptr () -> IO CInt
g_tree_steal Ptr Tree
tree' Ptr ()
key
let result' :: Bool
result' = (CInt -> CInt -> Bool
forall a. Eq a => a -> a -> Bool
/= CInt
0) CInt
result
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
Bool -> IO Bool
forall (m :: * -> *) a. Monad m => a -> m a
return Bool
result'
#if defined(ENABLE_OVERLOADING)
data TreeStealMethodInfo
instance (signature ~ (Ptr () -> m Bool), MonadIO m) => O.OverloadedMethod TreeStealMethodInfo Tree signature where
overloadedMethod = treeSteal
instance O.OverloadedMethodInfo TreeStealMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeSteal",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeSteal"
}
#endif
foreign import ccall "g_tree_unref" g_tree_unref ::
Ptr Tree ->
IO ()
treeUnref ::
(B.CallStack.HasCallStack, MonadIO m) =>
Tree
-> m ()
treeUnref :: forall (m :: * -> *). (HasCallStack, MonadIO m) => Tree -> m ()
treeUnref Tree
tree = IO () -> m ()
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO () -> m ()) -> IO () -> m ()
forall a b. (a -> b) -> a -> b
$ do
Ptr Tree
tree' <- Tree -> IO (Ptr Tree)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Tree
tree
Ptr Tree -> IO ()
g_tree_unref Ptr Tree
tree'
Tree -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Tree
tree
() -> IO ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
#if defined(ENABLE_OVERLOADING)
data TreeUnrefMethodInfo
instance (signature ~ (m ()), MonadIO m) => O.OverloadedMethod TreeUnrefMethodInfo Tree signature where
overloadedMethod = treeUnref
instance O.OverloadedMethodInfo TreeUnrefMethodInfo Tree where
overloadedMethodInfo = O.MethodInfo {
O.overloadedMethodName = "GI.GLib.Structs.Tree.treeUnref",
O.overloadedMethodURL = "https://hackage.haskell.org/package/gi-glib-2.0.25/docs/GI-GLib-Structs-Tree.html#v:treeUnref"
}
#endif
#if defined(ENABLE_OVERLOADING)
type family ResolveTreeMethod (t :: Symbol) (o :: *) :: * where
ResolveTreeMethod "destroy" o = TreeDestroyMethodInfo
ResolveTreeMethod "height" o = TreeHeightMethodInfo
ResolveTreeMethod "insert" o = TreeInsertMethodInfo
ResolveTreeMethod "lookup" o = TreeLookupMethodInfo
ResolveTreeMethod "lookupExtended" o = TreeLookupExtendedMethodInfo
ResolveTreeMethod "nnodes" o = TreeNnodesMethodInfo
ResolveTreeMethod "remove" o = TreeRemoveMethodInfo
ResolveTreeMethod "replace" o = TreeReplaceMethodInfo
ResolveTreeMethod "steal" o = TreeStealMethodInfo
ResolveTreeMethod "unref" o = TreeUnrefMethodInfo
ResolveTreeMethod l o = O.MethodResolutionFailed l o
instance (info ~ ResolveTreeMethod t Tree, O.OverloadedMethod info Tree p) => OL.IsLabel t (Tree -> 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 ~ ResolveTreeMethod t Tree, O.OverloadedMethod info Tree p, R.HasField t Tree p) => R.HasField t Tree p where
getField = O.overloadedMethod @info
#endif
instance (info ~ ResolveTreeMethod t Tree, O.OverloadedMethodInfo info Tree) => OL.IsLabel t (O.MethodProxy info Tree) where
#if MIN_VERSION_base(4,10,0)
fromLabel = O.MethodProxy
#else
fromLabel _ = O.MethodProxy
#endif
#endif