Github User Fetcher 1.0.0
C Application with Server and GUI
Loading...
Searching...
No Matches
gtree.h File Reference
#include <glib/gnode.h>

Go to the source code of this file.

Typedefs

typedef typedefG_BEGIN_DECLS struct _GTree GTree
 
typedef struct _GTreeNode GTreeNode
 
typedef gboolean(* GTraverseFunc) (gpointer key, gpointer value, gpointer data)
 
typedef gboolean(* GTraverseNodeFunc) (GTreeNode *node, gpointer data)
 

Functions

GLIB_AVAILABLE_IN_ALL GTreeg_tree_new (GCompareFunc key_compare_func)
 
GLIB_AVAILABLE_IN_ALL GTreeg_tree_new_with_data (GCompareDataFunc key_compare_func, gpointer key_compare_data)
 
GLIB_AVAILABLE_IN_ALL GTreeg_tree_new_full (GCompareDataFunc key_compare_func, gpointer key_compare_data, GDestroyNotify key_destroy_func, GDestroyNotify value_destroy_func)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_node_first (GTree *tree)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_node_last (GTree *tree)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_node_previous (GTreeNode *node)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_node_next (GTreeNode *node)
 
GLIB_AVAILABLE_IN_ALL GTreeg_tree_ref (GTree *tree)
 
GLIB_AVAILABLE_IN_ALL void g_tree_unref (GTree *tree)
 
GLIB_AVAILABLE_IN_ALL void g_tree_destroy (GTree *tree)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_insert_node (GTree *tree, gpointer key, gpointer value)
 
GLIB_AVAILABLE_IN_ALL void g_tree_insert (GTree *tree, gpointer key, gpointer value)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_replace_node (GTree *tree, gpointer key, gpointer value)
 
GLIB_AVAILABLE_IN_ALL void g_tree_replace (GTree *tree, gpointer key, gpointer value)
 
GLIB_AVAILABLE_IN_ALL gboolean g_tree_remove (GTree *tree, gconstpointer key)
 
GLIB_AVAILABLE_IN_2_70 void g_tree_remove_all (GTree *tree)
 
GLIB_AVAILABLE_IN_ALL gboolean g_tree_steal (GTree *tree, gconstpointer key)
 
GLIB_AVAILABLE_IN_2_68 gpointer g_tree_node_key (GTreeNode *node)
 
GLIB_AVAILABLE_IN_2_68 gpointer g_tree_node_value (GTreeNode *node)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_lookup_node (GTree *tree, gconstpointer key)
 
GLIB_AVAILABLE_IN_ALL gpointer g_tree_lookup (GTree *tree, gconstpointer key)
 
GLIB_AVAILABLE_IN_ALL gboolean g_tree_lookup_extended (GTree *tree, gconstpointer lookup_key, gpointer *orig_key, gpointer *value)
 
GLIB_AVAILABLE_IN_ALL void g_tree_foreach (GTree *tree, GTraverseFunc func, gpointer user_data)
 
GLIB_AVAILABLE_IN_2_68 void g_tree_foreach_node (GTree *tree, GTraverseNodeFunc func, gpointer user_data)
 
GLIB_DEPRECATED void g_tree_traverse (GTree *tree, GTraverseFunc traverse_func, GTraverseType traverse_type, gpointer user_data)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_search_node (GTree *tree, GCompareFunc search_func, gconstpointer user_data)
 
GLIB_AVAILABLE_IN_ALL gpointer g_tree_search (GTree *tree, GCompareFunc search_func, gconstpointer user_data)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_lower_bound (GTree *tree, gconstpointer key)
 
GLIB_AVAILABLE_IN_2_68 GTreeNodeg_tree_upper_bound (GTree *tree, gconstpointer key)
 
GLIB_AVAILABLE_IN_ALL gint g_tree_height (GTree *tree)
 
GLIB_AVAILABLE_IN_ALL gint g_tree_nnodes (GTree *tree)
 

Typedef Documentation

◆ GTraverseFunc

typedef gboolean(* GTraverseFunc) (gpointer key, gpointer value, gpointer data)

Definition at line 51 of file gtree.h.

◆ GTraverseNodeFunc

typedef gboolean(* GTraverseNodeFunc) (GTreeNode *node, gpointer data)

GTraverseNodeFunc: @node: a GTreeNode @data: user data passed to g_tree_foreach_node()

Specifies the type of function passed to g_tree_foreach_node(). It is passed each node, together with the @user_data parameter passed to g_tree_foreach_node(). If the function returns TRUE, the traversal is stopped.

Returns: TRUE to stop the traversal Since: 2.68

Definition at line 68 of file gtree.h.

◆ GTree

typedef typedefG_BEGIN_DECLS struct _GTree GTree

Definition at line 40 of file gtree.h.

◆ GTreeNode

typedef struct _GTreeNode GTreeNode

GTreeNode:

An opaque type which identifies a specific node in a GTree.

Since: 2.68

Definition at line 49 of file gtree.h.

Function Documentation

◆ g_tree_destroy()

GLIB_AVAILABLE_IN_ALL void g_tree_destroy ( GTree * tree)

◆ g_tree_foreach()

GLIB_AVAILABLE_IN_ALL void g_tree_foreach ( GTree * tree,
GTraverseFunc func,
gpointer user_data )

◆ g_tree_foreach_node()

GLIB_AVAILABLE_IN_2_68 void g_tree_foreach_node ( GTree * tree,
GTraverseNodeFunc func,
gpointer user_data )

◆ g_tree_height()

GLIB_AVAILABLE_IN_ALL gint g_tree_height ( GTree * tree)

◆ g_tree_insert()

GLIB_AVAILABLE_IN_ALL void g_tree_insert ( GTree * tree,
gpointer key,
gpointer value )

◆ g_tree_insert_node()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_insert_node ( GTree * tree,
gpointer key,
gpointer value )

◆ g_tree_lookup()

GLIB_AVAILABLE_IN_ALL gpointer g_tree_lookup ( GTree * tree,
gconstpointer key )

◆ g_tree_lookup_extended()

GLIB_AVAILABLE_IN_ALL gboolean g_tree_lookup_extended ( GTree * tree,
gconstpointer lookup_key,
gpointer * orig_key,
gpointer * value )

◆ g_tree_lookup_node()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_lookup_node ( GTree * tree,
gconstpointer key )

◆ g_tree_lower_bound()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_lower_bound ( GTree * tree,
gconstpointer key )

◆ g_tree_new()

GLIB_AVAILABLE_IN_ALL GTree * g_tree_new ( GCompareFunc key_compare_func)

◆ g_tree_new_full()

GLIB_AVAILABLE_IN_ALL GTree * g_tree_new_full ( GCompareDataFunc key_compare_func,
gpointer key_compare_data,
GDestroyNotify key_destroy_func,
GDestroyNotify value_destroy_func )

◆ g_tree_new_with_data()

GLIB_AVAILABLE_IN_ALL GTree * g_tree_new_with_data ( GCompareDataFunc key_compare_func,
gpointer key_compare_data )

◆ g_tree_nnodes()

GLIB_AVAILABLE_IN_ALL gint g_tree_nnodes ( GTree * tree)

◆ g_tree_node_first()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_node_first ( GTree * tree)

◆ g_tree_node_key()

GLIB_AVAILABLE_IN_2_68 gpointer g_tree_node_key ( GTreeNode * node)

◆ g_tree_node_last()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_node_last ( GTree * tree)

◆ g_tree_node_next()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_node_next ( GTreeNode * node)

◆ g_tree_node_previous()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_node_previous ( GTreeNode * node)

◆ g_tree_node_value()

GLIB_AVAILABLE_IN_2_68 gpointer g_tree_node_value ( GTreeNode * node)

◆ g_tree_ref()

GLIB_AVAILABLE_IN_ALL GTree * g_tree_ref ( GTree * tree)

◆ g_tree_remove()

GLIB_AVAILABLE_IN_ALL gboolean g_tree_remove ( GTree * tree,
gconstpointer key )

◆ g_tree_remove_all()

GLIB_AVAILABLE_IN_2_70 void g_tree_remove_all ( GTree * tree)

◆ g_tree_replace()

GLIB_AVAILABLE_IN_ALL void g_tree_replace ( GTree * tree,
gpointer key,
gpointer value )

◆ g_tree_replace_node()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_replace_node ( GTree * tree,
gpointer key,
gpointer value )

◆ g_tree_search()

GLIB_AVAILABLE_IN_ALL gpointer g_tree_search ( GTree * tree,
GCompareFunc search_func,
gconstpointer user_data )

◆ g_tree_search_node()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_search_node ( GTree * tree,
GCompareFunc search_func,
gconstpointer user_data )

◆ g_tree_steal()

GLIB_AVAILABLE_IN_ALL gboolean g_tree_steal ( GTree * tree,
gconstpointer key )

◆ g_tree_traverse()

GLIB_DEPRECATED void g_tree_traverse ( GTree * tree,
GTraverseFunc traverse_func,
GTraverseType traverse_type,
gpointer user_data )

◆ g_tree_unref()

GLIB_AVAILABLE_IN_ALL void g_tree_unref ( GTree * tree)

◆ g_tree_upper_bound()

GLIB_AVAILABLE_IN_2_68 GTreeNode * g_tree_upper_bound ( GTree * tree,
gconstpointer key )