Re: unbound array?

[tmoran@acm.org]

>The problem I am facing is that I don't know how many words I will encounter
>in the text file. I do not want to constrain size to 100 as I have above. I

> But it would be a little ridiculous assigning "size" = "number of
> characters in text file".
   If "words" must be separated by blanks or other punctuation, then
size := size of text file/2 will always do.
   If it's real text, with a known statistical word length distribution,
you can use
size = a large but reasonable size + file_size/(avg_word_and_punctuation_size)
and, by choosing the first parameter you can make it arbitrarily
improbable that the data will overflow your array.

A q&d approach for small files could use recursion:

 type word_lengths is range 1 .. whatever is reasonable

 type length_type is array (integer range <>) of word_lengths;

 function add_a_count(current_list : length_type) return length_type is
 begin
   if end of file then
     return current_list;
   else
     return add_a_count(current_list & (read_next_length));
   end if;
 end add_a_count;

 null_length : length_type(1 .. 0);
 word_length : length_type := add_a_count(null_length);

Perhaps more practical would be to do it in chunks of some suitable
size, recursing only if the current chunk became full.