gi-glib-2.0.29: GLib bindings
CopyrightWill Thompson and Iñaki García Etxebarria
LicenseLGPL-2.1
MaintainerIñaki García Etxebarria
Safe HaskellSafe-Inferred
LanguageHaskell2010

GI.GLib.Structs.TrashStack

Description

Each piece of memory that is pushed onto the stack is cast to a GTrashStack*.

Synopsis

Exported types

newtype TrashStack Source #

Memory-managed wrapper type.

Constructors

TrashStack (ManagedPtr TrashStack) 

Instances

Instances details
Eq TrashStack Source # 
Instance details

Defined in GI.GLib.Structs.TrashStack

BoxedPtr TrashStack Source # 
Instance details

Defined in GI.GLib.Structs.TrashStack

CallocPtr TrashStack Source # 
Instance details

Defined in GI.GLib.Structs.TrashStack

ManagedPtrNewtype TrashStack Source # 
Instance details

Defined in GI.GLib.Structs.TrashStack

Methods

toManagedPtr :: TrashStack -> ManagedPtr TrashStack

tag ~ 'AttrSet => Constructible TrashStack tag Source # 
Instance details

Defined in GI.GLib.Structs.TrashStack

Methods

new :: MonadIO m => (ManagedPtr TrashStack -> TrashStack) -> [AttrOp TrashStack tag] -> m TrashStack

newZeroTrashStack :: MonadIO m => m TrashStack Source #

Construct a TrashStack struct initialized to zero.

Methods

height

trashStackHeight Source #

Arguments

:: (HasCallStack, MonadIO m) 
=> TrashStack

stackP: a TrashStack

-> m Word32

Returns: the height of the stack

Deprecated: (Since version 2.48)tTrashStack is deprecated without replacement

Returns the height of a TrashStack.

Note that execution of this function is of O(N) complexity where N denotes the number of items on the stack.

peek

trashStackPeek Source #

Arguments

:: (HasCallStack, MonadIO m) 
=> TrashStack

stackP: a TrashStack

-> m (Ptr ())

Returns: the element at the top of the stack

Deprecated: (Since version 2.48)tTrashStack is deprecated without replacement

Returns the element at the top of a TrashStack which may be Nothing.

pop

trashStackPop Source #

Arguments

:: (HasCallStack, MonadIO m) 
=> TrashStack

stackP: a TrashStack

-> m (Ptr ())

Returns: the element at the top of the stack

Deprecated: (Since version 2.48)tTrashStack is deprecated without replacement

Pops a piece of memory off a TrashStack.

push

trashStackPush Source #

Arguments

:: (HasCallStack, MonadIO m) 
=> TrashStack

stackP: a TrashStack

-> Ptr ()

dataP: the piece of memory to push on the stack

-> m () 

Deprecated: (Since version 2.48)tTrashStack is deprecated without replacement

Pushes a piece of memory onto a TrashStack.

Properties

next

pointer to the previous element of the stack, gets stored in the first sizeof (gpointer) bytes of the element

clearTrashStackNext :: MonadIO m => TrashStack -> m () Source #

Set the value of the “next” field to Nothing. When overloading is enabled, this is equivalent to

clear #next

getTrashStackNext :: MonadIO m => TrashStack -> m (Maybe TrashStack) Source #

Get the value of the “next” field. When overloading is enabled, this is equivalent to

get trashStack #next

setTrashStackNext :: MonadIO m => TrashStack -> Ptr TrashStack -> m () Source #

Set the value of the “next” field. When overloading is enabled, this is equivalent to

set trashStack [ #next := value ]