#include #include -- | module Bindings.GLib.DataTypes.BalancedBinaryTrees where #strict_import import Bindings.GLib.Fundamentals import Bindings.GLib.DataTypes.Datasets import Bindings.GLib.DataTypes.DoublyLinkedLists #opaque_t GTree #ccall g_tree_new , -> IO (Ptr ) #ccall g_tree_ref , Ptr -> IO (Ptr ) #ccall g_tree_unref , Ptr -> IO () #ccall g_tree_new_with_data , -> -> IO (Ptr ) #ccall g_tree_new_full , -> -> -> -> IO (Ptr ) #ccall g_tree_insert , Ptr -> -> -> IO () #ccall g_tree_replace , Ptr -> -> -> IO () #ccall g_tree_nnodes , Ptr -> IO #ccall g_tree_height , Ptr -> IO #ccall g_tree_lookup , Ptr -> -> IO #ccall g_tree_lookup_extended , Ptr -> -> Ptr -> Ptr -> IO #ccall g_tree_foreach , Ptr -> -> -> IO () #ccall g_tree_traverse , Ptr -> -> -> -> IO () #callback GTraverseFunc , -> -> -> IO #integral_t GTraverseType #num G_IN_ORDER #num G_PRE_ORDER #num G_POST_ORDER #num G_LEVEL_ORDER #ccall g_tree_search , Ptr -> -> -> IO #ccall g_tree_remove , Ptr -> -> IO #ccall g_tree_steal , Ptr -> -> IO #ccall g_tree_destroy , Ptr -> IO ()