Push button which gives data: how to store it?

[CISG]

this give me an idea how to do it... of course this is not the solution in fact

[altenbach]

OK, here's one with a numeric control.

(I also implemented it as a solution with several buttons, but I still think an array of buttons is better)

[Harold_Timmis]

Altenbach solution is a better one mine is not bad but his is more modulare and uses less event so there is not as much overhead. the biuld array can give you a little overhead tht is why I chose the insert into array function rather then the build array function. you could use the reshape array function and it should work like the biuld array function.

[CISG]

wow I see... it is a very good job!! thank you collegues. I have no much experience in labview, I'm learning by myself, ythat's why I'm asking you, I was two weeks with this little problem. Thank you so much to both!!

[altenbach]

---

@Harold_Timmis wrote:

the biuld array can give you a little overhead tht is why I chose the insert into array function rather then the build array function.

---

The "insert into array" gives you the same overhead as the "built array" function. Both might force a new array allocation due to a change in array size. The most eficient way would be to initialize the shift register at the full final size with an impossible value (-1, NaN, etc. as suitable), then use "replace array subset" to fill with the real data without ever changing the array size again. 🙂

[CISG]

I have a last little problem, when I select a limit number and I finish my array, obvious, it is full, but if I select one more number (of push button) the sequence is erased... how can I avoid it?? I just want to store the sequence 🙂

[altenbach]

Which code are you using? Are you re-running the VI? In this case the shift regsiter gets re-initialzied of course. You could use an uninitialized shift register, for example.

[CISG]

the last one you published

[altenbach]

Try this (of course you would need to increase the max size number before re-running).