glist.zc

实现树形结构

import "gtypes"

public [name="c"]

struct GList
	data: gpointer
	next: GList
	prev: GList
end

import func g_list_alloc: GList
import func g_list_free           (GList)
import func g_list_free_1         (GList)
import func g_list_append         (GList,gpointer): GList
import func g_list_prepend        (GList,gpointer): GList
import func g_list_insert         (GList,gpointer,gint): GList
import func g_list_insert_sorted  (GList,gpointer,GCompareFunc): GList
import func g_list_insert_before  (GList,GList,gpointer): GList
import func g_list_concat         (GList,GList): GList
import func g_list_remove         (GList,gconstpointer): GList
import func g_list_remove_all     (GList,gconstpointer): GList
import func g_list_remove_link    (GList,GList): GList
import func g_list_delete_link    (GList,GList): GList
import func g_list_reverse        (GList): GList
import func g_list_copy           (GList): GList
import func g_list_nth            (GList,guint): GList
import func g_list_nth_prev       (GList,guint): GList
import func g_list_find           (GList,gconstpointer): GList
import func g_list_find_custom    (GList,gconstpointer,GCompareFunc): GList
import func g_list_position       (GList,GList): gint
import func g_list_index          (GList,gconstpointer): gint
import func g_list_last           (GList): GList
import func g_list_first          (GList): GList
import func g_list_length         (GList): guint
import func g_list_foreach        (GList,GFunc,gpointer)
import func g_list_sort           (GList,GCompareFunc): GList
import func g_list_sort_with_data (GList,GCompareDataFunc,gpointer): GList
import func g_list_nth_data       (GList,guint): gpointer

equ g_list_previous (list: GList) = not nil (list) -> prev (list), nil
equ g_list_next     (list: GList) = not nil (list) -> next (list), nil

end