luc14n0/glib
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/glib.git synced 2025-10-28 23:12:17 +01:00
Code Issues Packages Projects Releases Wiki Activity

Eradicate links and xrefs

Browse Source 
These are all replaced by markdown ref links.
This commit is contained in:
Matthias Clasen
2014-02-08 12:26:56 -05:00
parent 1448e619b5
commit e7fd3de86d
70 changed files with 460 additions and 521 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
glib/gnode.c
View File

@@ -86,8 +86,7 @@
* children are accessed by using the @next pointer of each
* child.
*
* The #GNode struct represents one node in a
* <link linkend="glib-N-ary-Trees">N-ary Tree</link>. fields
* The #GNode struct represents one node in a [n-ary tree][glib-N-ary-Trees].
**/
#define g_node_alloc0() g_slice_new0 (GNode)
@@ -851,10 +850,9 @@ g_node_depth_traverse_level (GNode *node,
* <caption>Post order: A, C, E, D, B, H, I, G, F</caption>
* </mediaobject>
* </informalfigure>
* @G_LEVEL_ORDER: is not implemented for <link
* linkend="glib-Balanced-Binary-Trees">Balanced Binary
* Trees</link>. For <link
* linkend="glib-N-ary-Trees">N-ary Trees</link>, it
* @G_LEVEL_ORDER: is not implemented for
* [balanced binary trees][glib-Balanced-Binary-Trees].
* For [n-ary trees][glib-N-ary-Trees], it
* vists the root node first, then its children, then
* its grandchildren, and so on. Note that this is less
* efficient than the other orders.