This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

Head and Tail Pointers. You definition ???

No, this has nothing to do with '51s, but I want the opinions of some of you tenured chaps:

In a circular queue, what do you consider the head and what do you consider the tail?

I've always know the tail as the point (index, whatever) that points to the next available free space in the buffer. That is, data is placed IN at the tail, and removed from the head position. I learned this definition years ago when digging into the IBM PC's keyboard buffer and a book on the topic listed the pointers as I describe above. That's how I've thought of them ever since and is how several google results describes them as well.

You?

Parents
  • I can not make head or tail of these names and have thus abandoned them. I use fetch_ptr and store_ptr or fetch_offs and store_offs. If someone reading your program can not immediateley figure out which is which, then names contradict good programming practice.

    Erik

Reply
  • I can not make head or tail of these names and have thus abandoned them. I use fetch_ptr and store_ptr or fetch_offs and store_offs. If someone reading your program can not immediateley figure out which is which, then names contradict good programming practice.

    Erik

Children