Replying to a message of Tim Hutzler to Benjamin L Mcgee:
TH> What you are describing is a FIFO, or queue. They both work
TH> the same in that the first element in will be the first
TH> element out. Since you mentioned the word, "buffer", then I
TH> will presume that you are thinking of a FIFO stack.
You mean "LIFO stack" (a redundant term, because a "stack" is a LIFO buffer).
A buffer is simply a place to hold data before it is needed. Yes, what he
wants is a queue.. ie. a FIFO buffer.
TH> Also, when you stated. "Any data that could not fit in the
TH> buffer would fall off the top." Are you saying that
TH> (overflow) data will be lost? I don't think you want that,
TH> but I need to ask.
That is how a UART operates :)
--- FleetStreet 1.21 NR
---------------
* Origin: BIG BANG Burger Bar: Regina SK Canada (1:140/86)
|