@rizi wrote:
Hi,
One more thing you have said to me queue should be initiated and released outside the loop to avoid wasting resources but it is not possible in my case i am using event structure it do not update the value on time when i try to bring them out. it is ok or not...
Regards,
Rizi
What does the event structure have to do with obtaining a queue? You put your obtain queue at the beginning of the program. You split the reference wire and run it into all loops where you need it. Pass it through all cases of the event or case structures (that way you don't have a queue reference get returned to a default empty reference.) At the end of the program, you take one of those wires and run it to the Release queue function so that it executes after your loops have stopped.
If an element is put into a queue, there is no reason I can think of that it wouldn't come out of a queue, unless you happen to release the queue before the dequeue function has a chance to get the element. And I think that is very likely to happen since you have essentially created a race condition by the way you are obtaining, enqueuing/dequeueing, and releasing a queue in every loop iteration. It is very likely that you have instances in your code that the queue no longer exists. Once all references to a queue have been released, any data that may have still been in the queue will be lost. I'm actually surprised that you aren't losing more data than you already say you are.
So if you do what I said about putting the obtain queue before your loops, and the release queue after your loops, I bet you'll find your program starts working the way it is supposed to.
If you are still unsure how to do it, look at examples for queues in the example finder, and also the Producer/Consumer architecture template you can find under the File / New... menu choice.
