LAVA 1.0 Content Posted October 2, 2006 Report Share Posted October 2, 2006 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.) Quote Link to comment
Phillip Brooks Posted August 2, 2008 Report Share Posted August 2, 2008 Wish granted in LabVIEW 8.6 See NI LabVIEW 8.6 Reference Quote Link to comment
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.