04-05-2018 07:47 AM - edited 04-05-2018 07:50 AM
Dear GerdW,
- Why do you need to search for the changed array element when you already know which one gets replaced/changed in the case structure???
You are right! I already have the last updated waveform, so I just have to print it out.
@GerdW- Why do you need to convert the boolean array to an integer array? You can also search a boolean array for a TRUE constant!!!
I convert to integer to find the sum of array and wire it to the second case structure. I cannot wire a boolean array to the case structure.
@GerdWWhich is overly complicated!
My solution is for assuming that I don't know what is the last updated waveform. Because in this VI, I know the waveform in advance so it does not present exactly what I want. That why I think the problem in this VI is trivial.
In your "original" problem you also know which part of your array gets changed: you calculate a (random) position in the left part of your while loop…
But how to extract only the last changed row? In this case the updated row is calculated from the beginning, not from the existed row. Also, the get variant function give me the ordered result so I only get the row corresponding to the largest position, not the last changed one.
Thank you!
Micheal
04-06-2018 02:04 AM
Dear GerdW,
In your "original" problem you also know which part of your array gets changed: you calculate a (random) position in the left part of your while loop…
From your suggestion, I found a solution for my problem in the attached file. Is it efficient enough?
Thank you so much!
Micheal
04-06-2018 02:55 AM
Hi Micheal,
Is it efficient enough?
I don't know. What are your requirements?