Home | History | Annotate | Download | only in glib

Lines Matching full:node

60 typedef gboolean	(*GNodeTraverseFunc)	(GNode	       *node,
62 typedef void (*GNodeForeachFunc) (GNode *node,
70 * A function of this signature is used to copy the node data
93 * @node: a #GNode
100 #define G_NODE_IS_ROOT(node) (((GNode*) (node))->parent == NULL && \
101 ((GNode*) (node))->prev == NULL && \
102 ((GNode*) (node))->next == NULL)
106 * @node: a #GNode
108 * Returns %TRUE if a #GNode is a leaf node.
110 * Returns: %TRUE if the #GNode is a leaf node
113 #define G_NODE_IS_LEAF(node) (((GNode*) (node))->children == NULL)
117 void g_node_unlink (GNode *node);
118 GNode* g_node_copy_deep (GNode *node,
121 GNode* g_node_copy (GNode *node);
124 GNode *node);
127 GNode *node);
130 GNode *node);
132 GNode *node);
135 GNode* g_node_get_root (GNode *node);
136 gboolean g_node_is_ancestor (GNode *node,
138 guint g_node_depth (GNode *node);
148 * @node: the #GNode to insert
154 #define g_node_append(parent, node) \
155 g_node_insert_before ((parent), NULL, (node))
208 /* traversal function, assumes that `node' is root
209 * (only traverses `node' and its subtree).
220 /* return the maximum tree height starting with `node', this is an expensive
227 void g_node_children_foreach (GNode *node,
231 void g_node_reverse_children (GNode *node);
232 guint g_node_n_children (GNode *node);
233 GNode* g_node_nth_child (GNode *node,
235 GNode* g_node_last_child (GNode *node);
236 GNode* g_node_find_child (GNode *node,
239 gint g_node_child_position (GNode *node,
241 gint g_node_child_index (GNode *node,
244 GNode* g_node_first_sibling (GNode *node);
245 GNode* g_node_last_sibling (GNode *node);
249 * @node: a #GNode
253 * Returns: the previous sibling of @node, or %NULL if @node is %NULL
255 #define g_node_prev_sibling(node) ((node) ? \
256 ((GNode*) (node))->prev : NULL)
260 * @node: a #GNode
264 * Returns: the next sibling of @node, or %NULL if @node is %NULL
266 #define g_node_next_sibling(node) ((node) ? \
267 ((GNode*) (node))->next : NULL)
271 * @node: a #GNode
275 * Returns: the first child of @node, or %NULL if @node is %NULL
278 #define g_node_first_child(node) ((node) ? \
279 ((GNode*) (node))->children : NULL)