{-# LANGUAGE TypeApplications #-}


-- | Copyright  : Will Thompson and Iñaki García Etxebarria
-- License    : LGPL-2.1
-- Maintainer : Iñaki García Etxebarria
-- 
-- /No description available in the introspection data./

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

module GI.OSTree.Structs.MutableTreeIter
    ( 

-- * Exported types
    MutableTreeIter(..)                     ,
    newZeroMutableTreeIter                  ,


 -- * Methods

#if defined(ENABLE_OVERLOADING)
    ResolveMutableTreeIterMethod            ,
#endif



 -- * Properties


-- ** inFiles #attr:inFiles#
-- | /No description available in the introspection data./

    getMutableTreeIterInFiles               ,
#if defined(ENABLE_OVERLOADING)
    mutableTreeIter_inFiles                 ,
#endif
    setMutableTreeIterInFiles               ,


-- ** iter #attr:iter#
-- | /No description available in the introspection data./

    getMutableTreeIterIter                  ,
#if defined(ENABLE_OVERLOADING)
    mutableTreeIter_iter                    ,
#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.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

import qualified GI.GLib.Structs.HashTableIter as GLib.HashTableIter

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

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

instance BoxedPtr MutableTreeIter where
    boxedPtrCopy :: MutableTreeIter -> IO MutableTreeIter
boxedPtrCopy = \MutableTreeIter
p -> forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
B.ManagedPtr.withManagedPtr MutableTreeIter
p (forall a. (HasCallStack, CallocPtr a) => Int -> Ptr a -> IO (Ptr a)
copyBytes Int
8 forall (m :: * -> *) a b c.
Monad m =>
(a -> m b) -> (b -> m c) -> a -> m c
>=> forall a.
(HasCallStack, BoxedPtr a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
B.ManagedPtr.wrapPtr ManagedPtr MutableTreeIter -> MutableTreeIter
MutableTreeIter)
    boxedPtrFree :: MutableTreeIter -> IO ()
boxedPtrFree = \MutableTreeIter
x -> forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
SP.withManagedPtr MutableTreeIter
x forall a. Ptr a -> IO ()
SP.freeMem
instance CallocPtr MutableTreeIter where
    boxedPtrCalloc :: IO (Ptr MutableTreeIter)
boxedPtrCalloc = forall a. Int -> IO (Ptr a)
callocBytes Int
8


-- | Construct a `MutableTreeIter` struct initialized to zero.
newZeroMutableTreeIter :: MonadIO m => m MutableTreeIter
newZeroMutableTreeIter :: forall (m :: * -> *). MonadIO m => m MutableTreeIter
newZeroMutableTreeIter = forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO forall a b. (a -> b) -> a -> b
$ forall a. CallocPtr a => IO (Ptr a)
boxedPtrCalloc forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= forall a.
(HasCallStack, BoxedPtr a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
wrapPtr ManagedPtr MutableTreeIter -> MutableTreeIter
MutableTreeIter

instance tag ~ 'AttrSet => Constructible MutableTreeIter tag where
    new :: forall (m :: * -> *).
MonadIO m =>
(ManagedPtr MutableTreeIter -> MutableTreeIter)
-> [AttrOp MutableTreeIter tag] -> m MutableTreeIter
new ManagedPtr MutableTreeIter -> MutableTreeIter
_ [AttrOp MutableTreeIter tag]
attrs = do
        MutableTreeIter
o <- forall (m :: * -> *). MonadIO m => m MutableTreeIter
newZeroMutableTreeIter
        forall o (m :: * -> *).
MonadIO m =>
o -> [AttrOp o 'AttrSet] -> m ()
GI.Attributes.set MutableTreeIter
o [AttrOp MutableTreeIter tag]
attrs
        forall (m :: * -> *) a. Monad m => a -> m a
return MutableTreeIter
o


-- | Get the value of the “@in_files@” field.
-- When <https://github.com/haskell-gi/haskell-gi/wiki/Overloading overloading> is enabled, this is equivalent to
-- 
-- @
-- 'Data.GI.Base.Attributes.get' mutableTreeIter #inFiles
-- @
getMutableTreeIterInFiles :: MonadIO m => MutableTreeIter -> m Bool
getMutableTreeIterInFiles :: forall (m :: * -> *). MonadIO m => MutableTreeIter -> m Bool
getMutableTreeIterInFiles MutableTreeIter
s = forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO forall a b. (a -> b) -> a -> b
$ forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
withManagedPtr MutableTreeIter
s forall a b. (a -> b) -> a -> b
$ \Ptr MutableTreeIter
ptr -> do
    CInt
val <- forall a. Storable a => Ptr a -> IO a
peek (Ptr MutableTreeIter
ptr forall a b. Ptr a -> Int -> Ptr b
`plusPtr` Int
0) :: IO CInt
    let val' :: Bool
val' = (forall a. Eq a => a -> a -> Bool
/= CInt
0) CInt
val
    forall (m :: * -> *) a. Monad m => a -> m a
return Bool
val'

-- | Set the value of the “@in_files@” field.
-- When <https://github.com/haskell-gi/haskell-gi/wiki/Overloading overloading> is enabled, this is equivalent to
-- 
-- @
-- 'Data.GI.Base.Attributes.set' mutableTreeIter [ #inFiles 'Data.GI.Base.Attributes.:=' value ]
-- @
setMutableTreeIterInFiles :: MonadIO m => MutableTreeIter -> Bool -> m ()
setMutableTreeIterInFiles :: forall (m :: * -> *). MonadIO m => MutableTreeIter -> Bool -> m ()
setMutableTreeIterInFiles MutableTreeIter
s Bool
val = forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO forall a b. (a -> b) -> a -> b
$ forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
withManagedPtr MutableTreeIter
s forall a b. (a -> b) -> a -> b
$ \Ptr MutableTreeIter
ptr -> do
    let val' :: CInt
val' = (forall a b. (Integral a, Num b) => a -> b
fromIntegral forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Enum a => a -> Int
fromEnum) Bool
val
    forall a. Storable a => Ptr a -> a -> IO ()
poke (Ptr MutableTreeIter
ptr forall a b. Ptr a -> Int -> Ptr b
`plusPtr` Int
0) (CInt
val' :: CInt)

#if defined(ENABLE_OVERLOADING)
data MutableTreeIterInFilesFieldInfo
instance AttrInfo MutableTreeIterInFilesFieldInfo where
    type AttrBaseTypeConstraint MutableTreeIterInFilesFieldInfo = (~) MutableTreeIter
    type AttrAllowedOps MutableTreeIterInFilesFieldInfo = '[ 'AttrSet, 'AttrGet]
    type AttrSetTypeConstraint MutableTreeIterInFilesFieldInfo = (~) Bool
    type AttrTransferTypeConstraint MutableTreeIterInFilesFieldInfo = (~)Bool
    type AttrTransferType MutableTreeIterInFilesFieldInfo = Bool
    type AttrGetType MutableTreeIterInFilesFieldInfo = Bool
    type AttrLabel MutableTreeIterInFilesFieldInfo = "in_files"
    type AttrOrigin MutableTreeIterInFilesFieldInfo = MutableTreeIter
    attrGet = getMutableTreeIterInFiles
    attrSet = setMutableTreeIterInFiles
    attrConstruct = undefined
    attrClear = undefined
    attrTransfer _ v = do
        return v
    dbgAttrInfo = P.Just (O.ResolvedSymbolInfo {
        O.resolvedSymbolName = "GI.OSTree.Structs.MutableTreeIter.inFiles"
        , O.resolvedSymbolURL = "https://hackage.haskell.org/package/gi-ostree-1.0.16/docs/GI-OSTree-Structs-MutableTreeIter.html#g:attr:inFiles"
        })

mutableTreeIter_inFiles :: AttrLabelProxy "inFiles"
mutableTreeIter_inFiles = AttrLabelProxy

#endif


-- | Get the value of the “@iter@” field.
-- When <https://github.com/haskell-gi/haskell-gi/wiki/Overloading overloading> is enabled, this is equivalent to
-- 
-- @
-- 'Data.GI.Base.Attributes.get' mutableTreeIter #iter
-- @
getMutableTreeIterIter :: MonadIO m => MutableTreeIter -> m GLib.HashTableIter.HashTableIter
getMutableTreeIterIter :: forall (m :: * -> *).
MonadIO m =>
MutableTreeIter -> m HashTableIter
getMutableTreeIterIter MutableTreeIter
s = forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO forall a b. (a -> b) -> a -> b
$ forall a c.
(HasCallStack, ManagedPtrNewtype a) =>
a -> (Ptr a -> IO c) -> IO c
withManagedPtr MutableTreeIter
s forall a b. (a -> b) -> a -> b
$ \Ptr MutableTreeIter
ptr -> do
    let val :: Ptr HashTableIter
val = Ptr MutableTreeIter
ptr forall a b. Ptr a -> Int -> Ptr b
`plusPtr` Int
4 :: (Ptr GLib.HashTableIter.HashTableIter)
    HashTableIter
val' <- (forall a.
(HasCallStack, BoxedPtr a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
newPtr ManagedPtr HashTableIter -> HashTableIter
GLib.HashTableIter.HashTableIter) Ptr HashTableIter
val
    forall (m :: * -> *) a. Monad m => a -> m a
return HashTableIter
val'

#if defined(ENABLE_OVERLOADING)
data MutableTreeIterIterFieldInfo
instance AttrInfo MutableTreeIterIterFieldInfo where
    type AttrBaseTypeConstraint MutableTreeIterIterFieldInfo = (~) MutableTreeIter
    type AttrAllowedOps MutableTreeIterIterFieldInfo = '[ 'AttrGet]
    type AttrSetTypeConstraint MutableTreeIterIterFieldInfo = (~) (Ptr GLib.HashTableIter.HashTableIter)
    type AttrTransferTypeConstraint MutableTreeIterIterFieldInfo = (~)(Ptr GLib.HashTableIter.HashTableIter)
    type AttrTransferType MutableTreeIterIterFieldInfo = (Ptr GLib.HashTableIter.HashTableIter)
    type AttrGetType MutableTreeIterIterFieldInfo = GLib.HashTableIter.HashTableIter
    type AttrLabel MutableTreeIterIterFieldInfo = "iter"
    type AttrOrigin MutableTreeIterIterFieldInfo = MutableTreeIter
    attrGet = getMutableTreeIterIter
    attrSet = undefined
    attrConstruct = undefined
    attrClear = undefined
    attrTransfer = undefined
    dbgAttrInfo = P.Just (O.ResolvedSymbolInfo {
        O.resolvedSymbolName = "GI.OSTree.Structs.MutableTreeIter.iter"
        , O.resolvedSymbolURL = "https://hackage.haskell.org/package/gi-ostree-1.0.16/docs/GI-OSTree-Structs-MutableTreeIter.html#g:attr:iter"
        })

mutableTreeIter_iter :: AttrLabelProxy "iter"
mutableTreeIter_iter = AttrLabelProxy

#endif



#if defined(ENABLE_OVERLOADING)
instance O.HasAttributeList MutableTreeIter
type instance O.AttributeList MutableTreeIter = MutableTreeIterAttributeList
type MutableTreeIterAttributeList = ('[ '("inFiles", MutableTreeIterInFilesFieldInfo), '("iter", MutableTreeIterIterFieldInfo)] :: [(Symbol, *)])
#endif

#if defined(ENABLE_OVERLOADING)
type family ResolveMutableTreeIterMethod (t :: Symbol) (o :: *) :: * where
    ResolveMutableTreeIterMethod l o = O.MethodResolutionFailed l o

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

#endif

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

#endif