Chris Huff <chr### [at] maccom> wrote:
: Well, the unlimited version will parse a little slower, since it will 
: have to resize the array every so often, but unless you have some really 
: huge blend maps it won't be noticeable, and it will only affect parse 
: time. I took the approach of resizing the array when needed for 
: simplicity.

  Wouldn't a better and faster approach be to read all the entries into
a temporary list and then allocate an proper-sized array, copy the entries
in there and then free the list?
  I think that a temporary list would take less memory than a temporary
dynamic array.

-- 
char*i="b[7FK@`3NB6>B:b3O6>:B:b3O6><`3:;8:6f733:>::b?7B>:>^B>C73;S1";
main(_,c,m){for(m=32;c=*i++-49;c&m?puts(""):m)for(_=(
c/4)&7;putchar(m),_--?m:(_=(1<<(c&3))-1,(m^=3)&3););}    /*- Warp -*/

Post a reply to this message