Thread: size of buffer

You can't put the cart before the horse. You have to plan in advance for some number of responses, and then act accordingly when that number is exceeded. That number could be 1 or 50 million - you don't know. My point being is that whatever you choose, when you get one more response than you planned for, you'll have to regroup.

The lazy person's choice might be to plan for 100 responses. If that or fewer are received, you are done. If more than 100 are received, then you'll need to pull out the heavy artillery and get some storage from the heap and create a new array that is larger than your initial pick (by some degree larger - you're choice).

Another way might be to get a hunk of heap from the get-go, and instead of defining it as an array, just treat it as an array, and when it's not big enough any more, realloc() that hunk to some amount larger than the first, and keep going with adding more entries.

The read routine you use will set the EOF (end of file) indicator, and you will test it and act accordingly.

The queue idea that I mentioned would be something more like:

Example:

Code:

#include <stdlib.h>

struct item
{
  int value;
  struct item *next;
};

int push(struct item **q, int value)
{
  struct item *node = malloc(sizeof(*node)), *tmp;

  if(!node)
    return EXIT_FAILURE;

  node->value = value;
  node->next = 0;

  if(*q)
  {
    for(tmp = *q; tmp->next; tmp = tmp->next)
      ;
    tmp->next = node;
  } else
    *q = node;

  return EXIT_SUCCESS;
}

int pop(struct item **q, int *r)
{
  struct item *tmp;

  if(!r || !q)
    return EXIT_FAILURE;

  if(!*q)
    return EXIT_FAILURE;

  tmp = *q;
  *q = (*q)->next;
  *r = tmp->value;
  free(tmp);
  
  return EXIT_SUCCESS;
}

int main(int argc, char **argv)
{
  struct item *q = 0;
  int i;

  for(i = 1; i < argc; i++)
    push(&q, atoi(argv[i]);

  while(pop(&q, &i) == EXIT_SUCCESS)
    printf("&#37;d ", i);

 return EXIT_SUCCESS;
}

Let's give it to Salem. I think Salem needs it.

I wish somedays I could just "give up" on a problem I'm working on at work!!