| … | |
… | |
| 102 | /* Note in the code below that we make some |
102 | /* Note in the code below that we make some |
| 103 | * presumptions that there will be a colon in the |
103 | * presumptions that there will be a colon in the |
| 104 | * string. given the code above, this is always |
104 | * string. given the code above, this is always |
| 105 | * the case. |
105 | * the case. |
| 106 | */ |
106 | */ |
| 107 | qsort (spell_sort, num_found, MAX_BUF, (int (*)(const void *, const void *)) strcmp); |
107 | qsort (spell_sort, num_found, MAX_BUF, (int (*)(const void *, const void *)) std::strcmp); |
| 108 | strcpy (tmp, "asdfg"); /* Dummy string so initial compare fails */ |
108 | strcpy (tmp, "asdfg"); /* Dummy string so initial compare fails */ |
| 109 | for (i = 0; i < num_found; i++) |
109 | for (i = 0; i < num_found; i++) |
| 110 | { |
110 | { |
| 111 | /* Different skill name, so print banner */ |
111 | /* Different skill name, so print banner */ |
| 112 | if (strncmp (tmp, spell_sort[i], strlen (tmp))) |
112 | if (strncmp (tmp, spell_sort[i], strlen (tmp))) |
