A Generic Circular Buffer(www.blackwasp.co.uk)

submitted by BlackWaspBlackWasp(4212) 6 months, 18 days ago

A circular buffer is a type of fixed size, first in, first out queue. The spaces in the buffer can be thought of as connected in a ring. Items in the buffer are never moved. Instead, changeable pointers are used to identify the head and tail of the queue.

1 comment |category: |Views: 29

tags: another

new Add a live kick counter to your blog >> liveImage

You can even customize the image by choosing your own colors, and then clicking the button below to update the preview and the html code:

  • "Kick It" text
  • "Kick It" background
  • kick count text
  • kick count background
  • border

Simply copy and paste this HTML into your blog post.


Users who kicked this story:
Comments:

posted by dpetersondpeterson(4397) 6 months, 17 days ago 0

I haven't seen this particular data structure implemented very often, probably because I haven't worked with programs that require real-time processing. I'm sure that there are lots of data structures just like this one that most programmers have never used before.

Reply

information Login or create an account to comment on this story