insertions. */
void *
-ternary_insert (ternary_tree * root, char *s, void *data, int replace)
+ternary_insert (ternary_tree * root, const char *s, void *data, int replace)
{
int diff;
ternary_tree curr, *pcurr;
/* Non-recursive find of a string in the ternary tree */
void *
-ternary_search (ternary_tree p, char *s)
+ternary_search (ternary_tree p, const char *s)
{
ternary_tree curr;
int diff, spchar;
/* For those who care, the recursive version of the search. Useful if
you want a starting point for pmsearch or nearsearch. */
static void *
-ternary_recursivesearch (ternary_tree p, char *s)
+ternary_recursivesearch (ternary_tree p, const char *s)
{
if (!p)
return 0;
already there, and replace is 0.
Otherwise, replaces if it it exists, inserts if it doesn't, and
returns the data you passed in. */
-void *ternary_insert (ternary_tree *p, char *s, void *data, int replace);
+void *ternary_insert (ternary_tree *p, const char *s, void *data, int replace);
/* Delete the ternary search tree rooted at P.
Does NOT delete the data you associated with the strings. */
/* Search the ternary tree for string S, returning the data associated
with it if found. */
-void *ternary_search (ternary_tree p, char *s);
+void *ternary_search (ternary_tree p, const char *s);
#endif