Bindings.GLib.DataTypes.BalancedBinaryTrees

http://library.gnome.org/devel/glib/stable/glib-Balanced-Binary-Trees.html

Documentation

data C'GTree

Constructors

C'GTree

c'g_tree_new :: C'GCompareFunc -> IO (Ptr C'GTree)

c'g_tree_ref :: Ptr C'GTree -> IO (Ptr C'GTree)

c'g_tree_unref :: Ptr C'GTree -> IO ()

p'g_tree_new :: FunPtr (C'GCompareFunc -> IO (Ptr C'GTree))

p'g_tree_ref :: FunPtr (Ptr C'GTree -> IO (Ptr C'GTree))

c'g_tree_new_with_data :: C'GCompareDataFunc -> C'gpointer -> IO (Ptr C'GTree)

p'g_tree_unref :: FunPtr (Ptr C'GTree -> IO ())

c'g_tree_new_full :: C'GCompareDataFunc -> C'gpointer -> C'GDestroyNotify -> C'GDestroyNotify -> IO (Ptr C'GTree)

c'g_tree_insert :: Ptr C'GTree -> C'gpointer -> C'gpointer -> IO ()

p'g_tree_new_with_data :: FunPtr (C'GCompareDataFunc -> C'gpointer -> IO (Ptr C'GTree))

c'g_tree_replace :: Ptr C'GTree -> C'gpointer -> C'gpointer -> IO ()

p'g_tree_new_full :: FunPtr (C'GCompareDataFunc -> C'gpointer -> C'GDestroyNotify -> C'GDestroyNotify -> IO (Ptr C'GTree))

c'g_tree_nnodes :: Ptr C'GTree -> IO C'gint

p'g_tree_insert :: FunPtr (Ptr C'GTree -> C'gpointer -> C'gpointer -> IO ())

c'g_tree_height :: Ptr C'GTree -> IO C'gint

p'g_tree_replace :: FunPtr (Ptr C'GTree -> C'gpointer -> C'gpointer -> IO ())

p'g_tree_nnodes :: FunPtr (Ptr C'GTree -> IO C'gint)

c'g_tree_lookup :: Ptr C'GTree -> C'gconstpointer -> IO C'gpointer

p'g_tree_height :: FunPtr (Ptr C'GTree -> IO C'gint)

c'g_tree_lookup_extended :: Ptr C'GTree -> C'gconstpointer -> Ptr C'gpointer -> Ptr C'gpointer -> IO C'gboolean

c'g_tree_foreach :: Ptr C'GTree -> C'GTraverseFunc -> C'gpointer -> IO ()

p'g_tree_lookup :: FunPtr (Ptr C'GTree -> C'gconstpointer -> IO C'gpointer)

c'g_tree_traverse :: Ptr C'GTree -> C'GTraverseFunc -> C'GTraverseType -> C'gpointer -> IO ()

p'g_tree_lookup_extended :: FunPtr (Ptr C'GTree -> C'gconstpointer -> Ptr C'gpointer -> Ptr C'gpointer -> IO C'gboolean)

p'g_tree_foreach :: FunPtr (Ptr C'GTree -> C'GTraverseFunc -> C'gpointer -> IO ())

type C'GTraverseFunc = FunPtr (C'gpointer -> C'gpointer -> C'gpointer -> IO C'gboolean)

p'g_tree_traverse :: FunPtr (Ptr C'GTree -> C'GTraverseFunc -> C'GTraverseType -> C'gpointer -> IO ())

mk'GTraverseFunc :: (C'gpointer -> C'gpointer -> C'gpointer -> IO C'gboolean) -> IO C'GTraverseFunc

type C'GTraverseType = CUInt

mK'GTraverseFunc :: C'GTraverseFunc -> C'gpointer -> C'gpointer -> C'gpointer -> IO C'gboolean

c'G_IN_ORDER :: Num a => a

c'G_PRE_ORDER :: Num a => a

c'G_POST_ORDER :: Num a => a

c'G_LEVEL_ORDER :: Num a => a

c'g_tree_search :: Ptr C'GTree -> C'GCompareFunc -> C'gconstpointer -> IO C'gpointer

c'g_tree_remove :: Ptr C'GTree -> C'gconstpointer -> IO C'gboolean

c'g_tree_steal :: Ptr C'GTree -> C'gconstpointer -> IO C'gboolean

p'g_tree_search :: FunPtr (Ptr C'GTree -> C'GCompareFunc -> C'gconstpointer -> IO C'gpointer)

c'g_tree_destroy :: Ptr C'GTree -> IO ()

p'g_tree_remove :: FunPtr (Ptr C'GTree -> C'gconstpointer -> IO C'gboolean)

p'g_tree_steal :: FunPtr (Ptr C'GTree -> C'gconstpointer -> IO C'gboolean)

p'g_tree_destroy :: FunPtr (Ptr C'GTree -> IO ())