int
main (void)
{
int i;
for (i = 1; i < 4000; ++i) {
int a [i];
int j;
for (j = 0; j < i; ++j)
a [j] = i - j - 1;
compare_sorts (a, i, sizeof (int), compare_ints);
}
srandom (time (NULL));
for (i = 0; i < 2000; ++i) {
teststruct_t a [200];
int j;
for (j = 0; j < 200; ++j) {
a [j].key = random ();
a [j].val = random ();
}
compare_sorts (a, 200, sizeof (teststruct_t), compare_teststructs);
}
return 0;
}
static int make_adjective(char *English_word)
{
/* Returns adjective number of the English word supplied, creating
a new adjective number if need be.
Note that (partly for historical reasons) adjectives are numbered
from 0xff downwards. (And partly to make them stand out as tokens.)
This routine is used only in grammar version 1: the corresponding
table is left empty in GV2. */
int i;
uchar new_sort_code[MAX_DICT_WORD_BYTES];
if (no_adjectives >= MAX_ADJECTIVES)
memoryerror("MAX_ADJECTIVES", MAX_ADJECTIVES);
dictionary_prepare(English_word, new_sort_code);
for (i=0; i<no_adjectives; i++)
if (compare_sorts(new_sort_code,
adjective_sort_code+i*DICT_WORD_BYTES) == 0)
return(0xff-i);
adjectives[no_adjectives]
= dictionary_add(English_word,8,0,0xff-no_adjectives);
copy_sorts(adjective_sort_code+no_adjectives*DICT_WORD_BYTES,
new_sort_code);
return(0xff-no_adjectives++);
}
