Jump to content

Lossy Queue Capability


Recommended Posts

See this thread for details...

Queues appear to be implemented as a circular in-memory buffer. There is no way to define the "when full" behaviour of a queue. The current solution from the producer side is to to enqueue -> timeout -> dequeue element -> enqueue element; or get Queue Status, dequeue element if full, enqueue element.

Specifically, I've been finding fairly frequent need for a behavior more like lossy circular buffering. I'd like to fix the size of the circular buffer, and then the freshest data keeps circularly overwriting the oldest data. The UI thread could then asynchronously perform analysis on the most recent N samples, acting like a sliding window. (Kevin P.)

Link to comment
  • 1 year later...

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.