| Copyright | Will Thompson and Iñaki García Etxebarria |
|---|---|
| License | LGPL-2.1 |
| Maintainer | Iñaki García Etxebarria |
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
GI.GLib.Structs.TreeNode
Description
An opaque type which identifies a specific node in a Tree.
Since: 2.68
Synopsis
- newtype TreeNode = TreeNode (ManagedPtr TreeNode)
- treeNodeKey :: (HasCallStack, MonadIO m) => TreeNode -> m (Ptr ())
- treeNodeNext :: (HasCallStack, MonadIO m) => TreeNode -> m (Maybe TreeNode)
- treeNodePrevious :: (HasCallStack, MonadIO m) => TreeNode -> m (Maybe TreeNode)
- treeNodeValue :: (HasCallStack, MonadIO m) => TreeNode -> m (Ptr ())
Exported types
Memory-managed wrapper type.
Instances
| Eq TreeNode Source # | |
| BoxedPtr TreeNode Source # | |
Defined in GI.GLib.Structs.TreeNode | |
| ManagedPtrNewtype TreeNode Source # | |
Defined in GI.GLib.Structs.TreeNode Methods toManagedPtr :: TreeNode -> ManagedPtr TreeNode | |
Methods
Click to display all available methods, including inherited ones
key
Arguments
| :: (HasCallStack, MonadIO m) | |
| => TreeNode |
|
| -> m (Ptr ()) | Returns: the key at the node. |
Gets the key stored at a particular tree node.
Since: 2.68
next
Arguments
| :: (HasCallStack, MonadIO m) | |
| => TreeNode |
|
| -> m (Maybe TreeNode) | Returns: the next node in the tree |
Returns the next in-order node of the tree, or Nothing
if the passed node was already the last one.
Since: 2.68
previous
Arguments
| :: (HasCallStack, MonadIO m) | |
| => TreeNode |
|
| -> m (Maybe TreeNode) | Returns: the previous node in the tree |
Returns the previous in-order node of the tree, or Nothing
if the passed node was already the first one.
Since: 2.68
value
Arguments
| :: (HasCallStack, MonadIO m) | |
| => TreeNode |
|
| -> m (Ptr ()) | Returns: the value at the node. |
Gets the value stored at a particular tree node.
Since: 2.68