root->cust_root_node=NULL;\
}\
\
-int cust_prefix##_search_node4(const cust_root_t *root, cust_key_t *key, gavl_node_t **nodep, int mode)\
+int cust_prefix##_search_node4(const cust_root_t *root, cust_key_t const *key, gavl_node_t **nodep, int mode)\
{\
int cmp=1;\
gavl_node_t *n, *p;\
return cmp;\
}\
\
-int cust_prefix##_search_node(const cust_root_t *root, cust_key_t *key, gavl_node_t **nodep)\
+int cust_prefix##_search_node(const cust_root_t *root, cust_key_t const *key, gavl_node_t **nodep)\
{\
return cust_prefix##_search_node4(root, key, nodep, 0);\
}\
\
-cust_item_t *cust_prefix##_find(const cust_root_t *root, cust_key_t *key)\
+cust_item_t *cust_prefix##_find(const cust_root_t *root, cust_key_t const *key)\
{\
gavl_node_t *node;\
if(cust_prefix##_search_node4(root, key, &node, 0))\
return cust_prefix##_node2item(root,node);\
}\
\
-cust_item_t *cust_prefix##_find_first(const cust_root_t *root, cust_key_t *key)\
+cust_item_t *cust_prefix##_find_first(const cust_root_t *root, cust_key_t const *key)\
{\
gavl_node_t *n;\
if(cust_prefix##_search_node4(root, key, &n, GAVL_FFIRST))\
return cust_prefix##_node2item(root,n);\
}\
\
-cust_item_t *cust_prefix##_find_after(const cust_root_t *root, cust_key_t *key)\
+cust_item_t *cust_prefix##_find_after(const cust_root_t *root, cust_key_t const *key)\
{\
gavl_node_t *node;\
if(cust_prefix##_search_node4(root, key, &node, GAVL_FAFTER)<=0){\