diff options
| author | Juan Pablo Ugarte <juanpablougarte@gmail.com> | 2013-12-11 17:25:02 -0300 |
|---|---|---|
| committer | Juan Pablo Ugarte <juanpablougarte@gmail.com> | 2013-12-11 18:07:15 -0300 |
| commit | 2fcad158ebafce63eeccfbfc7756ed6c69d91c3c (patch) | |
| tree | d16b149df7ffe749f058eb23ff3537e909669500 /gladeui/glade-tsort.h | |
| parent | d8353ee66a652e96118d415c12a745937c4051d6 (diff) | |
| download | glade-2fcad158ebafce63eeccfbfc7756ed6c69d91c3c.tar.gz | |
_glade_tsort() simplyfied api by using a GList for edges instead of a
custom linked struct since we do not need the marginal speedup
now that dependencies are only between toplevels.
This allow us to easily sort edges alphabetically.
tests/toplevel-order: Updated to new _glade_tsort() api
Diffstat (limited to 'gladeui/glade-tsort.h')
| -rw-r--r-- | gladeui/glade-tsort.h | 13 |
1 files changed, 6 insertions, 7 deletions
diff --git a/gladeui/glade-tsort.h b/gladeui/glade-tsort.h index 3026e2d5..28ed6e48 100644 --- a/gladeui/glade-tsort.h +++ b/gladeui/glade-tsort.h @@ -34,17 +34,16 @@ struct __NodeEdge { gpointer predecessor; gpointer successor; - _NodeEdge *next; }; -_NodeEdge *_node_edge_prepend (_NodeEdge *node, - gpointer predecessor, - gpointer successor); +GList *_node_edge_prepend (GList *list, + gpointer predecessor, + gpointer successor); -void _node_edge_free (_NodeEdge *node); +void _node_edge_list_free (GList *list); -GList *_glade_tsort (GList **nodes, - _NodeEdge **edges); +GList *_glade_tsort (GList **nodes, + GList **edges); G_END_DECLS |