{-# LANGUAGE TypeApplications #-}
#if (MIN_VERSION_haskell_gi_overloading(1,0,0) && !defined(__HADDOCK_VERSION__))
#define ENABLE_OVERLOADING
#endif
module GI.Gsk.Objects.LinearGradientNode
(
LinearGradientNode(..) ,
IsLinearGradientNode ,
toLinearGradientNode ,
#if defined(ENABLE_OVERLOADING)
ResolveLinearGradientNodeMethod ,
#endif
#if defined(ENABLE_OVERLOADING)
LinearGradientNodeGetColorStopsMethodInfo,
#endif
linearGradientNodeGetColorStops ,
#if defined(ENABLE_OVERLOADING)
LinearGradientNodeGetEndMethodInfo ,
#endif
linearGradientNodeGetEnd ,
#if defined(ENABLE_OVERLOADING)
LinearGradientNodeGetNColorStopsMethodInfo,
#endif
linearGradientNodeGetNColorStops ,
#if defined(ENABLE_OVERLOADING)
LinearGradientNodeGetStartMethodInfo ,
#endif
linearGradientNodeGetStart ,
linearGradientNodeNew ,
) 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
import qualified Data.Word as DW
import qualified Data.Int as DI
import qualified System.Posix.Types as SPT
import qualified Foreign.C.Types as FCT
#if MIN_VERSION_base(4,18,0)
import qualified GI.Cairo.Structs.Context as Cairo.Context
import qualified GI.GLib.Structs.Bytes as GLib.Bytes
import qualified GI.Gdk.Structs.RGBA as Gdk.RGBA
import qualified GI.Graphene.Structs.Point as Graphene.Point
import qualified GI.Graphene.Structs.Rect as Graphene.Rect
import qualified GI.Gsk.Callbacks as Gsk.Callbacks
import {-# SOURCE #-} qualified GI.Gsk.Enums as Gsk.Enums
import {-# SOURCE #-} qualified GI.Gsk.Objects.RenderNode as Gsk.RenderNode
import {-# SOURCE #-} qualified GI.Gsk.Structs.ColorStop as Gsk.ColorStop
#else
import qualified GI.Graphene.Structs.Point as Graphene.Point
import qualified GI.Graphene.Structs.Rect as Graphene.Rect
import {-# SOURCE #-} qualified GI.Gsk.Objects.RenderNode as Gsk.RenderNode
import {-# SOURCE #-} qualified GI.Gsk.Structs.ColorStop as Gsk.ColorStop
#endif
newtype LinearGradientNode = LinearGradientNode (SP.ManagedPtr LinearGradientNode)
deriving (LinearGradientNode -> LinearGradientNode -> Bool
(LinearGradientNode -> LinearGradientNode -> Bool)
-> (LinearGradientNode -> LinearGradientNode -> Bool)
-> Eq LinearGradientNode
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: LinearGradientNode -> LinearGradientNode -> Bool
== :: LinearGradientNode -> LinearGradientNode -> Bool
$c/= :: LinearGradientNode -> LinearGradientNode -> Bool
/= :: LinearGradientNode -> LinearGradientNode -> Bool
Eq)
instance SP.ManagedPtrNewtype LinearGradientNode where
toManagedPtr :: LinearGradientNode -> ManagedPtr LinearGradientNode
toManagedPtr (LinearGradientNode ManagedPtr LinearGradientNode
p) = ManagedPtr LinearGradientNode
p
foreign import ccall "gsk_linear_gradient_node_get_type"
c_gsk_linear_gradient_node_get_type :: IO B.Types.GType
instance B.Types.TypedObject LinearGradientNode where
glibType :: IO GType
glibType = IO GType
c_gsk_linear_gradient_node_get_type
class (SP.BoxedPtr o, SP.TypedObject o, O.IsDescendantOf LinearGradientNode o) => IsLinearGradientNode o
instance (SP.BoxedPtr o, SP.TypedObject o, O.IsDescendantOf LinearGradientNode o) => IsLinearGradientNode o
instance O.HasParentTypes LinearGradientNode
type instance O.ParentTypes LinearGradientNode = '[Gsk.RenderNode.RenderNode]
toLinearGradientNode :: (MIO.MonadIO m, IsLinearGradientNode o) => o -> m LinearGradientNode
toLinearGradientNode :: forall (m :: * -> *) o.
(MonadIO m, IsLinearGradientNode o) =>
o -> m LinearGradientNode
toLinearGradientNode = IO LinearGradientNode -> m LinearGradientNode
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
MIO.liftIO (IO LinearGradientNode -> m LinearGradientNode)
-> (o -> IO LinearGradientNode) -> o -> m LinearGradientNode
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (ManagedPtr LinearGradientNode -> LinearGradientNode)
-> o -> IO LinearGradientNode
forall o o'.
(HasCallStack, ManagedPtrNewtype o, TypedObject o,
ManagedPtrNewtype o', TypedObject o') =>
(ManagedPtr o' -> o') -> o -> IO o'
B.ManagedPtr.unsafeCastTo ManagedPtr LinearGradientNode -> LinearGradientNode
LinearGradientNode
#if defined(ENABLE_OVERLOADING)
type family ResolveLinearGradientNodeMethod (t :: Symbol) (o :: DK.Type) :: DK.Type where
ResolveLinearGradientNodeMethod "draw" o = Gsk.RenderNode.RenderNodeDrawMethodInfo
ResolveLinearGradientNodeMethod "ref" o = Gsk.RenderNode.RenderNodeRefMethodInfo
ResolveLinearGradientNodeMethod "serialize" o = Gsk.RenderNode.RenderNodeSerializeMethodInfo
ResolveLinearGradientNodeMethod "unref" o = Gsk.RenderNode.RenderNodeUnrefMethodInfo
ResolveLinearGradientNodeMethod "writeToFile" o = Gsk.RenderNode.RenderNodeWriteToFileMethodInfo
ResolveLinearGradientNodeMethod "getBounds" o = Gsk.RenderNode.RenderNodeGetBoundsMethodInfo
ResolveLinearGradientNodeMethod "getColorStops" o = LinearGradientNodeGetColorStopsMethodInfo
ResolveLinearGradientNodeMethod "getEnd" o = LinearGradientNodeGetEndMethodInfo
ResolveLinearGradientNodeMethod "getNColorStops" o = LinearGradientNodeGetNColorStopsMethodInfo
ResolveLinearGradientNodeMethod "getNodeType" o = Gsk.RenderNode.RenderNodeGetNodeTypeMethodInfo
ResolveLinearGradientNodeMethod "getStart" o = LinearGradientNodeGetStartMethodInfo
ResolveLinearGradientNodeMethod l o = O.MethodResolutionFailed l o
instance (info ~ ResolveLinearGradientNodeMethod t LinearGradientNode, O.OverloadedMethod info LinearGradientNode p) => OL.IsLabel t (LinearGradientNode -> 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 ~ ResolveLinearGradientNodeMethod t LinearGradientNode, O.OverloadedMethod info LinearGradientNode p, R.HasField t LinearGradientNode p) => R.HasField t LinearGradientNode p where
getField = O.overloadedMethod @info
#endif
instance (info ~ ResolveLinearGradientNodeMethod t LinearGradientNode, O.OverloadedMethodInfo info LinearGradientNode) => OL.IsLabel t (O.MethodProxy info LinearGradientNode) where
#if MIN_VERSION_base(4,10,0)
fromLabel = O.MethodProxy
#else
fromLabel _ = O.MethodProxy
#endif
#endif
instance BoxedPtr LinearGradientNode where
boxedPtrCopy :: LinearGradientNode -> IO LinearGradientNode
boxedPtrCopy = LinearGradientNode -> IO LinearGradientNode
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return
boxedPtrFree :: LinearGradientNode -> IO ()
boxedPtrFree = \LinearGradientNode
_x -> () -> IO ()
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return ()
foreign import ccall "gsk_linear_gradient_node_new" gsk_linear_gradient_node_new ::
Ptr Graphene.Rect.Rect ->
Ptr Graphene.Point.Point ->
Ptr Graphene.Point.Point ->
Ptr Gsk.ColorStop.ColorStop ->
FCT.CSize ->
IO (Ptr LinearGradientNode)
linearGradientNodeNew ::
(B.CallStack.HasCallStack, MonadIO m) =>
Graphene.Rect.Rect
-> Graphene.Point.Point
-> Graphene.Point.Point
-> [Gsk.ColorStop.ColorStop]
-> m LinearGradientNode
linearGradientNodeNew :: forall (m :: * -> *).
(HasCallStack, MonadIO m) =>
Rect -> Point -> Point -> [ColorStop] -> m LinearGradientNode
linearGradientNodeNew Rect
bounds Point
start Point
end [ColorStop]
colorStops = IO LinearGradientNode -> m LinearGradientNode
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO LinearGradientNode -> m LinearGradientNode)
-> IO LinearGradientNode -> m LinearGradientNode
forall a b. (a -> b) -> a -> b
$ do
let nColorStops :: CSize
nColorStops = Int -> CSize
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Int -> CSize) -> Int -> CSize
forall a b. (a -> b) -> a -> b
$ [ColorStop] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
P.length [ColorStop]
colorStops
Ptr Rect
bounds' <- Rect -> IO (Ptr Rect)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Rect
bounds
Ptr Point
start' <- Point -> IO (Ptr Point)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Point
start
Ptr Point
end' <- Point -> IO (Ptr Point)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr Point
end
[Ptr ColorStop]
colorStops' <- (ColorStop -> IO (Ptr ColorStop))
-> [ColorStop] -> IO [Ptr ColorStop]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ColorStop -> IO (Ptr ColorStop)
forall a. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr a)
unsafeManagedPtrGetPtr [ColorStop]
colorStops
Ptr ColorStop
colorStops'' <- Int -> [Ptr ColorStop] -> IO (Ptr ColorStop)
forall a. Int -> [Ptr a] -> IO (Ptr a)
packBlockArray Int
20 [Ptr ColorStop]
colorStops'
Ptr LinearGradientNode
result <- Ptr Rect
-> Ptr Point
-> Ptr Point
-> Ptr ColorStop
-> CSize
-> IO (Ptr LinearGradientNode)
gsk_linear_gradient_node_new Ptr Rect
bounds' Ptr Point
start' Ptr Point
end' Ptr ColorStop
colorStops'' CSize
nColorStops
Text -> Ptr LinearGradientNode -> IO ()
forall a. HasCallStack => Text -> Ptr a -> IO ()
checkUnexpectedReturnNULL Text
"linearGradientNodeNew" Ptr LinearGradientNode
result
LinearGradientNode
result' <- ((ManagedPtr LinearGradientNode -> LinearGradientNode)
-> Ptr LinearGradientNode -> IO LinearGradientNode
forall a.
(HasCallStack, BoxedPtr a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
wrapPtr ManagedPtr LinearGradientNode -> LinearGradientNode
LinearGradientNode) Ptr LinearGradientNode
result
Rect -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Rect
bounds
Point -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Point
start
Point -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr Point
end
(ColorStop -> IO ()) -> [ColorStop] -> IO ()
forall (t :: * -> *) (m :: * -> *) a b.
(Foldable t, Monad m) =>
(a -> m b) -> t a -> m ()
mapM_ ColorStop -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr [ColorStop]
colorStops
Ptr ColorStop -> IO ()
forall a. Ptr a -> IO ()
freeMem Ptr ColorStop
colorStops''
LinearGradientNode -> IO LinearGradientNode
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return LinearGradientNode
result'
#if defined(ENABLE_OVERLOADING)
#endif
foreign import ccall "gsk_linear_gradient_node_get_color_stops" gsk_linear_gradient_node_get_color_stops ::
Ptr LinearGradientNode ->
Ptr FCT.CSize ->
IO (Ptr Gsk.ColorStop.ColorStop)
linearGradientNodeGetColorStops ::
(B.CallStack.HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a
-> m [Gsk.ColorStop.ColorStop]
linearGradientNodeGetColorStops :: forall (m :: * -> *) a.
(HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a -> m [ColorStop]
linearGradientNodeGetColorStops a
node = IO [ColorStop] -> m [ColorStop]
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO [ColorStop] -> m [ColorStop])
-> IO [ColorStop] -> m [ColorStop]
forall a b. (a -> b) -> a -> b
$ do
Ptr LinearGradientNode
node' <- a -> IO (Ptr LinearGradientNode)
forall a b. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr b)
unsafeManagedPtrCastPtr a
node
Ptr CSize
nStops <- IO (Ptr CSize)
forall a. Storable a => IO (Ptr a)
allocMem :: IO (Ptr FCT.CSize)
Ptr ColorStop
result <- Ptr LinearGradientNode -> Ptr CSize -> IO (Ptr ColorStop)
gsk_linear_gradient_node_get_color_stops Ptr LinearGradientNode
node' Ptr CSize
nStops
CSize
nStops' <- Ptr CSize -> IO CSize
forall a. Storable a => Ptr a -> IO a
peek Ptr CSize
nStops
Text -> Ptr ColorStop -> IO ()
forall a. HasCallStack => Text -> Ptr a -> IO ()
checkUnexpectedReturnNULL Text
"linearGradientNodeGetColorStops" Ptr ColorStop
result
[Ptr ColorStop]
result' <- (Int -> CSize -> Ptr ColorStop -> IO [Ptr ColorStop]
forall a b. Integral a => Int -> a -> Ptr b -> IO [Ptr b]
unpackBlockArrayWithLength Int
20 CSize
nStops') Ptr ColorStop
result
[ColorStop]
result'' <- (Ptr ColorStop -> IO ColorStop)
-> [Ptr ColorStop] -> IO [ColorStop]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((ManagedPtr ColorStop -> ColorStop)
-> Ptr ColorStop -> IO ColorStop
forall a.
(HasCallStack, BoxedPtr a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
newPtr ManagedPtr ColorStop -> ColorStop
Gsk.ColorStop.ColorStop) [Ptr ColorStop]
result'
a -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr a
node
Ptr CSize -> IO ()
forall a. Ptr a -> IO ()
freeMem Ptr CSize
nStops
[ColorStop] -> IO [ColorStop]
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return [ColorStop]
result''
#if defined(ENABLE_OVERLOADING)
data LinearGradientNodeGetColorStopsMethodInfo
instance (signature ~ (m [Gsk.ColorStop.ColorStop]), MonadIO m, IsLinearGradientNode a) => O.OverloadedMethod LinearGradientNodeGetColorStopsMethodInfo a signature where
overloadedMethod = linearGradientNodeGetColorStops
instance O.OverloadedMethodInfo LinearGradientNodeGetColorStopsMethodInfo a where
overloadedMethodInfo = P.Just (O.ResolvedSymbolInfo {
O.resolvedSymbolName = "GI.Gsk.Objects.LinearGradientNode.linearGradientNodeGetColorStops",
O.resolvedSymbolURL = "https://hackage.haskell.org/package/gi-gsk-4.0.8/docs/GI-Gsk-Objects-LinearGradientNode.html#v:linearGradientNodeGetColorStops"
})
#endif
foreign import ccall "gsk_linear_gradient_node_get_end" gsk_linear_gradient_node_get_end ::
Ptr LinearGradientNode ->
IO (Ptr Graphene.Point.Point)
linearGradientNodeGetEnd ::
(B.CallStack.HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a
-> m Graphene.Point.Point
linearGradientNodeGetEnd :: forall (m :: * -> *) a.
(HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a -> m Point
linearGradientNodeGetEnd a
node = IO Point -> m Point
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO Point -> m Point) -> IO Point -> m Point
forall a b. (a -> b) -> a -> b
$ do
Ptr LinearGradientNode
node' <- a -> IO (Ptr LinearGradientNode)
forall a b. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr b)
unsafeManagedPtrCastPtr a
node
Ptr Point
result <- Ptr LinearGradientNode -> IO (Ptr Point)
gsk_linear_gradient_node_get_end Ptr LinearGradientNode
node'
Text -> Ptr Point -> IO ()
forall a. HasCallStack => Text -> Ptr a -> IO ()
checkUnexpectedReturnNULL Text
"linearGradientNodeGetEnd" Ptr Point
result
Point
result' <- ((ManagedPtr Point -> Point) -> Ptr Point -> IO Point
forall a.
(HasCallStack, GBoxed a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
newBoxed ManagedPtr Point -> Point
Graphene.Point.Point) Ptr Point
result
a -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr a
node
Point -> IO Point
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return Point
result'
#if defined(ENABLE_OVERLOADING)
data LinearGradientNodeGetEndMethodInfo
instance (signature ~ (m Graphene.Point.Point), MonadIO m, IsLinearGradientNode a) => O.OverloadedMethod LinearGradientNodeGetEndMethodInfo a signature where
overloadedMethod = linearGradientNodeGetEnd
instance O.OverloadedMethodInfo LinearGradientNodeGetEndMethodInfo a where
overloadedMethodInfo = P.Just (O.ResolvedSymbolInfo {
O.resolvedSymbolName = "GI.Gsk.Objects.LinearGradientNode.linearGradientNodeGetEnd",
O.resolvedSymbolURL = "https://hackage.haskell.org/package/gi-gsk-4.0.8/docs/GI-Gsk-Objects-LinearGradientNode.html#v:linearGradientNodeGetEnd"
})
#endif
foreign import ccall "gsk_linear_gradient_node_get_n_color_stops" gsk_linear_gradient_node_get_n_color_stops ::
Ptr LinearGradientNode ->
IO FCT.CSize
linearGradientNodeGetNColorStops ::
(B.CallStack.HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a
-> m FCT.CSize
linearGradientNodeGetNColorStops :: forall (m :: * -> *) a.
(HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a -> m CSize
linearGradientNodeGetNColorStops a
node = IO CSize -> m CSize
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO CSize -> m CSize) -> IO CSize -> m CSize
forall a b. (a -> b) -> a -> b
$ do
Ptr LinearGradientNode
node' <- a -> IO (Ptr LinearGradientNode)
forall a b. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr b)
unsafeManagedPtrCastPtr a
node
CSize
result <- Ptr LinearGradientNode -> IO CSize
gsk_linear_gradient_node_get_n_color_stops Ptr LinearGradientNode
node'
a -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr a
node
CSize -> IO CSize
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return CSize
result
#if defined(ENABLE_OVERLOADING)
data LinearGradientNodeGetNColorStopsMethodInfo
instance (signature ~ (m FCT.CSize), MonadIO m, IsLinearGradientNode a) => O.OverloadedMethod LinearGradientNodeGetNColorStopsMethodInfo a signature where
overloadedMethod = linearGradientNodeGetNColorStops
instance O.OverloadedMethodInfo LinearGradientNodeGetNColorStopsMethodInfo a where
overloadedMethodInfo = P.Just (O.ResolvedSymbolInfo {
O.resolvedSymbolName = "GI.Gsk.Objects.LinearGradientNode.linearGradientNodeGetNColorStops",
O.resolvedSymbolURL = "https://hackage.haskell.org/package/gi-gsk-4.0.8/docs/GI-Gsk-Objects-LinearGradientNode.html#v:linearGradientNodeGetNColorStops"
})
#endif
foreign import ccall "gsk_linear_gradient_node_get_start" gsk_linear_gradient_node_get_start ::
Ptr LinearGradientNode ->
IO (Ptr Graphene.Point.Point)
linearGradientNodeGetStart ::
(B.CallStack.HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a
-> m Graphene.Point.Point
linearGradientNodeGetStart :: forall (m :: * -> *) a.
(HasCallStack, MonadIO m, IsLinearGradientNode a) =>
a -> m Point
linearGradientNodeGetStart a
node = IO Point -> m Point
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (IO Point -> m Point) -> IO Point -> m Point
forall a b. (a -> b) -> a -> b
$ do
Ptr LinearGradientNode
node' <- a -> IO (Ptr LinearGradientNode)
forall a b. (HasCallStack, ManagedPtrNewtype a) => a -> IO (Ptr b)
unsafeManagedPtrCastPtr a
node
Ptr Point
result <- Ptr LinearGradientNode -> IO (Ptr Point)
gsk_linear_gradient_node_get_start Ptr LinearGradientNode
node'
Text -> Ptr Point -> IO ()
forall a. HasCallStack => Text -> Ptr a -> IO ()
checkUnexpectedReturnNULL Text
"linearGradientNodeGetStart" Ptr Point
result
Point
result' <- ((ManagedPtr Point -> Point) -> Ptr Point -> IO Point
forall a.
(HasCallStack, GBoxed a) =>
(ManagedPtr a -> a) -> Ptr a -> IO a
newBoxed ManagedPtr Point -> Point
Graphene.Point.Point) Ptr Point
result
a -> IO ()
forall a. ManagedPtrNewtype a => a -> IO ()
touchManagedPtr a
node
Point -> IO Point
forall a. a -> IO a
forall (m :: * -> *) a. Monad m => a -> m a
return Point
result'
#if defined(ENABLE_OVERLOADING)
data LinearGradientNodeGetStartMethodInfo
instance (signature ~ (m Graphene.Point.Point), MonadIO m, IsLinearGradientNode a) => O.OverloadedMethod LinearGradientNodeGetStartMethodInfo a signature where
overloadedMethod = linearGradientNodeGetStart
instance O.OverloadedMethodInfo LinearGradientNodeGetStartMethodInfo a where
overloadedMethodInfo = P.Just (O.ResolvedSymbolInfo {
O.resolvedSymbolName = "GI.Gsk.Objects.LinearGradientNode.linearGradientNodeGetStart",
O.resolvedSymbolURL = "https://hackage.haskell.org/package/gi-gsk-4.0.8/docs/GI-Gsk-Objects-LinearGradientNode.html#v:linearGradientNodeGetStart"
})
#endif