if (start>=end)
return;
key=node_build(start,end);
- if ((neigh_left =g_tree_search(bad_tree,(GSearchFunc)search_end ,&start))) {
+ if ((neigh_left =g_tree_search(bad_tree,(GCompareFunc)search_end ,&start))) {
g_assert(neigh_left->end==key->start);
key->start=neigh_left->start;
g_tree_remove(bad_tree,neigh_left);
g_mem_chunk_free(node_memchunk,neigh_left);
}
- if ((neigh_right=g_tree_search(bad_tree,(GSearchFunc)search_start,&end ))) {
+ if ((neigh_right=g_tree_search(bad_tree,(GCompareFunc)search_start,&end ))) {
g_assert(neigh_right->start==key->end);
key->end=neigh_right->end;
g_tree_remove(bad_tree,neigh_right);