Source
committed c226e58005f88
88
num_uniq_words++;89
89
for(v=0; v<u; v++)90
90
/* If word is already found in words looked at, decrement unique count */91
91
if(!HDstrcmp(words[u],words[v])) {92
92
num_uniq_words--;93
93
break;94
94
} /* end if */95
95
} /* end for */96
96
97
97
/* Allocate space for the array of unique words */98
-
uniq_words=HDmalloc(sizeof(char *)*num_uniq_words);98
+
uniq_words = (char **)HDmalloc(sizeof(char *)*num_uniq_words);99
99
100
100
/* Allocate space for the array of randomized order unique words also */101
-
rand_uniq_words=HDmalloc(sizeof(char *)*num_uniq_words);101
+
rand_uniq_words = (char **)HDmalloc(sizeof(char *)*num_uniq_words);102
102
103
103
/* Allocate space for the array of sorted order unique words also */104
-
sort_uniq_words=HDmalloc(sizeof(char *)*num_uniq_words);104
+
sort_uniq_words = (char **)HDmalloc(sizeof(char *)*num_uniq_words);105
105
106
106
/* Insert unique words from test set into unique word set */107
107
w=0;108
108
for(u=0; u<num_words; u++) {109
109
/* Assume word is unique */110
110
tmp_word=(char *)words[u];111
111
for(v=0; v<u; v++)112
112
/* If word is already found in words looked at, decrement unique count */113
113
if(!HDstrcmp(words[u],words[v])) {114
114
tmp_word=NULL;