Jump to content

Arka Dipta Das

Members
  • Content Count

    4
  • Joined

  • Last visited

Community Reputation

0

About Arka Dipta Das

  • Rank
    LAVA groupie

LabVIEW Information

  • Version
    LabVIEW 2019
  • Since
    2017
  1. They work when I save them and drag them back locally but the snippet you shared is not working. I have tried saving your snippet and then dragging it but still did not work...
  2. this implementation seems interesting. Thank you for the suggestion. I realize now the mistake of initializing with a 1000 element array. I am not sure if you mean "initializing the array" when you say "preallocating the array". I was talking about memory allocation for the array rather then the initial values of the array. VI Snippets is something I did not know about. Thank you for bringing it to my notice.
  3. I use this method to do a couple of things:- 1. to create a stream of historical data points (say values generated in the last 1000 iterations of the loop) and then find the highest value in that array. Data points older than 1000 iterations are not required and I would want them to get overwritten. Does this code (Fig.1) work as an alternative of what you mentioned about pre-allocation of the size of the memory that the Build Array block will use? Since I am using a while loop here, i can not achieve this with a indexing tunnel. If (Fig.1) does not achieve this, will (Fig.2)
  4. Building an array with a while loop is never a good idea but I somehow am guilty of that practice and now it has come back to bite me. I started using such a method after I read in a forum discussion that is a simple way to track changes due to a looped structure and that the "build array" block itself optimizes the memory so that the Vi does not get bogged down when run for long periods. My state of my code says otherwise and therefore I want to know for certain how building such an array is handled in LV. I have attached a sample VI to demonstrate what I mean.
×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.