From: Brian G. <bri...@da...> - 2005-05-11 00:41:41
|
Brian Gangloff wrote: > As I was writing this I got an idea, use a temporary queue to store > the last data (see > http://downloads.dataact.com/dqGOOP/dqClass(Last).zip). The benefit > of this approach is that the new functions behave and perform about > the same as the originals. However, this comes at the expense of > enabling the last data. I threw this together quickly so there may be > some errors, but at least everyone can get a preview of another > possible solution. Here's a better performing concept. This time use uninitialized shift reg to store the last data when needed. The new getDataToModifyStoreLast could be sped even more up by eliminating the preview to get the data before it is removed from the queue. It would then be possible (very slight) that the getData function could call after the data is removed from the queue, but before the data is put in the shift reg. http://downloads.dataact.com/dqGOOP/dqClass(Last2).zip |