05-29-2007 10:14 AM
I've never seen any difference (speed, memory, buffer allocation, etc.) if you swap the inputs to the multiplication. I think they are equivalent in recent LaVIEW versions.
Now I have not checked recently but in LV 5 or there-abouts, the top input of the math operators was re-used...
06-02-2007 09:14 PM
06-15-2007 04:37 AM - edited 06-15-2007 04:37 AM
Message Edited by Odd_Modem on 06-15-2007 05:38 AM
06-15-2007 09:25 AM - edited 06-15-2007 09:25 AM
Message Edited by smercurio_fc on 06-15-2007 09:25 AM
06-15-2007 12:18 PM
It just means that "to upper" and "to lower" both loose information. The "rube-ish" part is the fact that the loop runs for 1023 iterations (why not 1024), while we only have 256 characters.
Plot "toUpper-ToLower" vs "ToLower-ToUpper" for some real mess.
08-03-2007 02:07 AM - edited 08-03-2007 02:07 AM
Here are some literal simplifications:
(Of course we could configure the file dialog to select a folder, so we don't even have to strip anything! )
(adapted from http://forums.ni.com/ni/board/message?board.id=170
Message Edited by altenbach on 08-03-2007 12:09 AM
08-11-2007 02:43 PM - edited 08-11-2007 02:43 PM
We need to read a simple two-column file (tabs between elements, linefeeds between rows) and place the first column into an x-array and the second column into a y array.
Lets do the following: We have a file path control that needs to be connected via a right-left wire to read the raw text. Now we first need to parse it into an interleaved array, throwing away the distinction between tab and newline. Of course we need to read 2048 points, no matter how many points are in the file. Since we now have an interleaved array, we need to decimate it again into the two colums. (A simple decimate array node with two terminals would be way too simple, we better use two FOR loops and index out the even and odd elements.
or we could just do the following:
Message Edited by altenbach on 08-11-2007 12:43 PM
08-11-2007 03:07 PM - edited 08-11-2007 03:07 PM
Message Edited by altenbach on 08-11-2007 01:08 PM