Replace build array with replace subset array
Currently I am using a build array function, but would like to replace it with a replace array subset, but I am new to labview and having a lot of trouble. I've attached a screen shot of the code I am struggling with. Does anyone have any ideas?
Attachments:
Build array code.JPG 29 KB
First, I'm assuming this is inside some sort of loop. Second, I would recommend cleaning up the code a bit so the feedback node is not overhanging the edge of the case structure. It's unclear as to what is wired to what. Third, I would recommend using shift registers instead of the feedback node.
Fourth, and the main thing is that you are currently initializing a 64 element 1-D array and appending it to your array on every iteration with the build array.
If you want to use the replace array subset. Initialize the array to the size you want outside of the loop. Feed it into the left hand shift register. Replace each row (or column) with your new data. You will need to track the iterations, and possibly add special code to shift the array, or enlarge the array in the event you have more data come in then the original size of your array.
Similar Messages
-
How can i combine a string array with a waveform array and write this to a file.
I am trying to set my VI up so that I can enter test information (notes to myself) and combine that with the time and date then write this as well as the waveform data from the daq to a spreadsheet file. I am sure this is a simple task but I am new to LabView so any help would be very appreciated.
An XML file is not a spreadsheet-formatted file, so that's not likely to help...
Simply call the Write To Spreadsheet File twice. The first time you wire in a 1D array of strings
which is your test information. Then, you call it when you're writing out
your data. Make sure you wire a True constant to the "append" input for
that function. -
How to get the array with in the array in plsql?
Hi,
I have a table contains the data like below strcture.
LINE_NUMBER TAG_NUMBER NOTES TORQUE_1 TORQUE_2 TORQUE_3
1 SSS SUCCESS 2000 3000 4000
1 SSS SUCCESS 4000 5000 6000
1 SSS SUCCESS 7000 4000 8000
2 YYY FAIL 200 300 400
2 YYY FAIL 400 500 600
2 YYY FAIL 700 400 800From the above table data line_number, tag_number and notes are the commom values for the particular line number. If you see the line number 1, we have three records torque values with different torque values for one line number. Now i have to create a stored procedure to store the line_number, tag_number and notes in one array then remaining torque column for another array. The output should be the below. The output will be for line number 1 is for array1 and remaining torque values for that lin number is another array2. The same line number 2 is will come in array1 and torque information of line number 2 is for another array2. This will be structure.
Array_1 Count :2
Array_2 Count :6
1: LINE_NUMBER: 1: TAG_NUMBER: SSS, NOTES: SUCCESS
1: TORQUE_1:2000, TORQUE_2:3000, TORQUE_3:4000
2: TORQUE_1:4000, TORQUE_2:5000, TORQUE_3:6000
3: TORQUE_1:7000, TORQUE_2:4000, TORQUE_3:8000
2: LINE_NUMBER: 2: TAG_NUMBER: YYY, CUST_NUMBER: FAIL
1: TORQUE_1:200, TORQUE_2:300, TORQUE_3:400
2: TORQUE_1:400, TORQUE_2:500, TORQUE_3:600
3: TORQUE_1:700, TORQUE_2:400, TORQUE_3:800Can anyone share with your thoughts?
Thanks
Edited by: orasuriya on Jul 10, 2009 10:33 AMNot sure why you need pl/sql
WITH YOUR_TABLE AS
SELECT 1 LINE_NUMBER, 'SSS' TAG_NUMBER, 'SUCCESS' NOTES, 2000 TORQUE_1, 3000 TORQUE_2, 4000 TORQUE_3 FROM DUAL
UNION ALL
SELECT 1,'SSS','SUCCESS',4000,5000,6000 FROM DUAL
UNION ALL
SELECT 1,'SSS','SUCCESS',7000,4000,8000 FROM DUAL
UNION ALL
SELECT 2,'YYY','FAIL',200,300,400 FROM DUAL
UNION ALL
SELECT 2,'YYY','FAIL',400,500,600 FROM DUAL
UNION ALL
SELECT 2,'YYY','FAIL',700,4000,800 FROM DUAL
SELECT DECODE (rn, 0, line_number, rn) || ':',
col_val3,
col_val2,
col_val3
FROM (SELECT 0 rn,
line_number,
tag_number,
notes,
'LINE_NUMBER:' || line_number col_val1,
'TAG_NUMBER:' || tag_number col_val2,
'NOTES:' || notes col_val3
FROM your_table
UNION
SELECT ROW_NUMBER ()
OVER (PARTITION BY line_number, tag_number, notes
ORDER BY ROWNUM
line_number,
tag_number,
notes,
'TORQUE_1:' || torque_1,
'TORQUE_2:' || torque_2,
'TORQUE_3:' || torque_3
FROM your_table)
ORDER BY line_number, tag_number, notes, rn -
How to integrate an Array with the other Array???
Hi guys,
I have such a problem that need your help!!
I have two columns, the first column is Time (x): 1, 1.2, 1.5, 1.7, 1.8... which is uneven array.
The second column is Y : 3, 5, 7, 8....
X and Y have the same length, but the x is uneven. Now I want to do the integration of Y on x. When I use the uneven numeric integration, I found that the integration result is only one value instead of an array. But what I need is the third column which shows the integration results C. So I could plot C against x, and know how the integration goes.
Does anyone has such an experience, thanks a lot!
Basically, what I need is just like the integration what the Origin Pro does.
Tao
Solved!
Go to Solution.Is this what you are looking for?
Attachments:
Integration.vi 12 KB -
Search given string array and replace with another string array using Regex
Hi All,
I want to search the given string array and replace with another string array using regex in java
for example,
String news = "If you wish to search for any of these characters, they must be preceded by the character to be interpreted"
String fromValue[] = {"you", "search", "for", "any"}
String toValue[] = {"me", "dont search", "never", "trip"}
so the string "you" needs to be converted to "me" i.e you --> me. Similarly
you --> me
search --> don't search
for --> never
any --> trip
I want a SINGLE Regular Expression with search and replaces and returns a SINGLE String after replacing all.
I don't like to iterate one by one and applying regex for each from and to value. Instead i want to iterate the array and form a SINGLE Regulare expression and use to replace the contents of the Entire String.
One Single regular expression which matches the pattern and solve the issue.
the output should be as:
If me wish to don't search never trip etc...,
Please help me to resolve this.
Thanks In Advance,
KathirAs stated, no, it can't be done. But that doesn't mean you have to make a separate pass over the input for each word you want to replace. You can employ a regex that matches any word, then use the lower-level Matcher methods to replace the word or not depending on what was matched. Here's an example: import java.util.*;
import java.util.regex.*;
public class Test
static final List<String> oldWords =
Arrays.asList("you", "search", "for", "any");
static final List<String> newWords =
Arrays.asList("me", "dont search", "never", "trip");
public static void main(String[] args) throws Exception
String str = "If you wish to search for any of these characters, "
+ "they must be preceded by the character to be interpreted";
System.out.println(doReplace(str));
public static String doReplace(String str)
Pattern p = Pattern.compile("\\b\\w+\\b");
Matcher m = p.matcher(str);
StringBuffer sb = new StringBuffer();
while (m.find())
int pos = oldWords.indexOf(m.group());
if (pos > -1)
m.appendReplacement(sb, "");
sb.append(newWords.get(pos));
m.appendTail(sb);
return sb.toString();
} This is just a demonstration of the technique; a real-world solution would require a more complicated regex, and I would probably use a Map instead of the two Lists (or arrays). -
How to build a array with collected data
Hi,
I have collected data from serial port with VISA. Now I want to build a array with 100 date points. Should I connect VISA Read with Build Array directly? How to do it?
PS: All of them are in a While Structure.
Thank you!An inefficient way to create the array is to use the build array and a shift register as shown below. It's more effecient in terms of memory management to create the array and then use the replace array subset as shown in the other image. Of course, if you don't need the array inside the loop, just wire the value out of the while loop and on the exit tunnel, right click and select 'Enable Indexing'.
Message Edited by Dennis Knutson on 07-03-2007 10:25 PM
Message Edited by Dennis Knutson on 07-03-2007 10:26 PM
Attachments:
Crude Build Array.PNG 4 KB
Better Build Array.PNG 6 KB -
How to build a array with high sampling rates 1K
Hi All:
Now I am trying to develop a project with CRio.
But I am not sure how to build a array with high sampling rates signal, like >1K. (Sigle-point data)
Before, I would like to use "Build Arrary" and "Shift Register" to build a arrary, but I found it is not working for high sampling rates.
Is there anyother good way to build a data arrary for high sampling rates??
Thanks
Attachments:
Building_Array_high_rates.JPG 120 KBCan't give a sample of the FPGA right now but here is a sample bit of RT code I recently used. I am acquiring data at 51,200 samples every second. I put the data in a FIFO on the FPGA side, then I read from that FIFO on the RT side and insert the data into a pre-initialized array using "Replace Array subset" NOT "Insert into array". I keep a count of the data I have read/inserted, and once I am at 51,200 samples, I know I have 1 full second of data. At this point, I add it to a queue which sends it to another loop to be processed. Also, I don't use the new index terminal in my subVI because I know I am always adding 6400 elements so I can just multiply my counter by 6400, but if you use the method described further down below , you will want to use the "new index" to return a value because you may not always read the same number of elements using that method.
The reason I use a timeout of 0 and a wait until next ms multiple is because if you use a timeout wired to the FIFO read node, it spins a loop in the background that polls for data, which rails your processor. Depending on what type of acquisition you are doing, you can also use the method of reading 0 elements, then using the "elements remaining" variable, to wire up another node as is shown below. This was not an option for me because of my programs architecture and needing chunks of 1 second data. Had I used this method it would have overcomplicated things if I read more elements then I had available in my 51,200 buffer.
Let me knwo if you have more qeustions
CLA, LabVIEW Versions 2010-2013
Attachments:
RT.PNG 36 KB
FIFO read.PNG 4 KB -
Replace a character in a String array
I have an array of strings and am trying to replace the ' character with a space. I keep getting either a cannot be applied or cannot resolve symbol error. Can anyone help?
String arrayList = request.getParameter("field");
String newList = arrayList.replace("\'", " ");the replace method of the String class takes two parameters and both of them are characters not strings use it like this
arrayList.replace('\'', ' ');that should fix it -
I have a string array with elements as follows:
00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00
00 00 00 00 5E 00 00 00
00 00 50 00 30 00 33 00
34 00 39 00 00 00 00 00
00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00
The array I want to use to replace values with is:
43 4E 31 30 30 33 30 30 31 41
Where 43 goes in the 3rd row fifth position
Where 4E goes in the 3rd row seventh position
Where 31 goes in the 4th row first position
Where 30 goes in the 4th row third position
Where 30 goes in the 4th row fifth position
Where 33 goes in the 4th row seventh position
Where 30 goes in the 5th row first position
Where 30 goes in the 5th row third position
Where 31 goes in the 5th row fifth position
Where 41 goes in the 5th row seventh position
So the final array looks as follows:
00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00
00 00 00 00 43 00 4E 00
31 00 30 00 30 00 33 00
30 00 30 00 31 00 41 00
00 00 00 00 00 00 00 00
00 00 00 00 00 00 00 00
Is there an easy way to replace an element of a string within an array with another element of a string within a different array?
Thank you.
Solved!
Go to Solution.
Attachments:
CMM_Add_SCAN_SN_2_PAT_DATA (temp).vi 13 KBTry this
Omar
Message Edited by Omar II on 03-24-2010 03:25 PM
Omar
Attachments:
CMM_Add_SCAN_SN_2_PAT_DATA%20(temp)[1].vi 17 KB -
Is it possible to create a 1 D array with the "build array VI"? when receiving random number
Hello all,
Is it possible to create a 1 D array with the "build array VI" when receiving random number?
I am receiving random data and the build array VI always create a 2D array which might cause some problem if you want to compute certain type of operation after.
Any example will be welcomed.
Thank you,
IsraelHello Lynn and Yamaeda
First I want to Thank you Lynn for your linguistic contribution indeed "Build Array" is a primitive and not VI, thank you for the education. In reality what I am doing is simple.
I have two arrays of complex elements Array1 and Array2.
Array1 conains the complex elements ""(a0+ib0) ; (a1+ib1) ;...(an+ibn) ;
Array2 conains the complex elements ""(c0+id0) ; (c1+id1) ;...(cn+idn)
What I want to do is the multiplication of the first array by the conjugate of the second array element.
Array1*(Conjugate Array 2)" for the first element the results is "(a0.C0-b0.d0) + i(b0c0-a0d0)" and the etc...
and then taking the square root ([(a0.C0-b0.d0) power of 2]) + [(b0c0-a0d0) power of 2])
I was wondering if there were some dedicate primitive that could solve the computation above which is the cross correlation in Frequency domain.
Thank you very much.
Israel -
Dealing With Non Uniform Array Sizes
Would it be possible to store data such as
1 2 3 4 5 6
0 2 4
3 1 4 1 5 9 2 6 5 3 5 8 9
Where each row is not nessicarly the same length. I need to later call a specific row by row number and plot the 1D array. I have figured out arrays wont deal with the non uniform length and will instead fill in the extra elements so they all match in length. Is there any way around this?
ThanksIt is generally better to use Repalce Array Subset or autoindexing to build an array. Insert into Array may cause memory allocation problems. Here are two mnodifications to your VI which show both methods. If you need to see the results as you go, the Replace Array Subset is best. If you do not need the data until the for loop completes, autoindexing is the preferred choice.
Note that you may need to initialize your shift register. Run the VI multiple times and watch the results.
Lynn
Attachments:
Variable Length Arrays.2.vi 15 KB -
Replacing shift registers with queues or notifiers?
Hello World,
I'm using labView 7.1 with my first application, which is essentially a spectrum analyser and comparison to limits. now due to the parameters of the sampling 12000 samples/sec with 4096 point I have quite large chunks of data involved in rolling averages of 1 minute and rolling buffers that are an hour long. I'm pretty new to labview but I'm finding pretty easy to pick up except when it comes to optimisation and performance (I've been used to the microsoft approach until now) due to the fact that the instrument I'm building has to run in psuedo "real time".
I've been looking at replacing the shift registers with either queues or notifiers but I'm unsure if these techniques would result in improvements or not.
I'll attach a jpg of my main loop, I've only got the one but it is separated into three separate tasks but they are all governed by the data flow, DAQ then PROCESSING then REPORTING.
I've been told that by separating the loops and making them run in parallel LV will be able to compile it more efficeintly, but I'm unsure how to do that .
Cheers
Andrew
90% of all experts aggree that 1 out of 10 experts are wrong
Attachments:
Step 14 -Post Course Mk4d.jpg 376 KBFat Controller wrote:
Hello World,
I'm using labView 7.1 with my first application, which is essentially a spectrum analyser and comparison to limits. now due to the parameters of the sampling 12000 samples/sec with 4096 point I have quite large chunks of data involved in rolling averages of 1 minute and rolling buffers that are an hour long. I'm pretty new to labview but I'm finding pretty easy to pick up except when it comes to optimisation and performance (I've been used to the microsoft approach until now) due to the fact that the instrument I'm building has to run in psuedo "real time".
I've been looking at replacing the shift registers with either queues or notifiers but I'm unsure if these techniques would result in improvements or not.
I'll attach a jpg of my main loop, I've only got the one but it is separated into three separate tasks but they are all governed by the data flow, DAQ then PROCESSING then REPORTING.
I've been told that by separating the loops and making them run in parallel LV will be able to compile it more efficeintly, but I'm unsure how to do that .
Cheers
Andrew
Don't convert shift registers into queues or other things for performance reasons! LabVIEW has a lot of internal optimization logic when compiling your code which works best on shift registers. On a queue you will always copy the entire data of a message in or out even if you only need one byte of it.
Try to look at your architecture. You do want to do as much as possible in place. Try to completely avoid Append Array or Append String inside loops if possible. They are costly operations as they have to reallocate memory each time and often copy the entire data from the first array into the resized array. Better is to once preallocate an array of the necessary size, keep it in your shift register all the time and then use Replace Array Subset, Index Array and Array Subset nodes only on this. You will also have to maintian some index shich tells you up to where you have currently filled that array and that one is usualy best put into a shift register as well.
Rolf Kalbermatter
Rolf Kalbermatter
CIT Engineering Netherlands
a division of Test & Measurement Solutions -
Auto-indexing is slow for arrays with 1 dimensions
Hi,
I was looking at the performance of operations on all individual elements in 3D arrays, especially the difference between auto-indexing (left image) and manual-indexing (right image, calling "Index array" and "Replace array subset" in the innermost loop). I'm a bit puzzled by the results and post it here for discussion and hopefully somebody's benefit in the future.
Left: auto-indexing; right: manual-indexing
In the tests I added a different random number to all individual elements in a 3D array. I found that auto-indexing is 1.2 to 1.5 times slower than manual-indexing. I also found that the performance of auto-indexing is much more dependent on the size the dimensions: an array with 1000x200x40 elements is 20% slower than an array with 1000x40x200 elements. For manual-indexing there is hardly any difference. The detailed results can be found at the end of this post.
I was under the impression that auto-indexing was the preferred method for this kind of operation: it achieves exactly the same result and it is much clearer in the block diagram. I also expected that auto-indexing would have been optimized in LabView, but the the tests show this is clearly not the case.
What is auto-indexing doing?
With two tests I looked at how auto-index works.
First, I looked if auto-indexing reorganizes the data in an inefficient way. To do this I made a method "fake-auto-indexing" which calls "Array subset" and "Reshape array" (or "Index array" for a 1D-array) when it enters _every_ loop and calls "Replace array subset" when exiting _every_ loop (as opposed to manual-indexing, where I do this only in the inner loop). I replicated this in a test (calling it fake-auto-indexing) and found that the performance is very similar to auto-indexing, especially looking at the trend for the different array lengths.
Fake-auto-indexing
Second, I looked if Locality of reference (how the 3D array is stored in memory and how efficiently you can iterate over that) may be an issue. Auto-indexing loops over pages-rows-columns (i.e. pages in the outer for-loop, rows in the middle for-loop, columns in the inner for-loop). This can't be changed for auto-indexing, but I did change it for manual and fake-indexing. The performance of manual-indexing is now similar to auto-indexing, except for two cases that I can't explain. Fake-auto-indexing performs way worse in all cases.
It seems that the performance problem with auto-indexing is due to inefficient data organization.
Other tests
I did the same tests for 1D and 2D arrays. For 1D arrays the three methods perform identical. For 2D arrays auto-indexing is 15% slower than manual-indexing, while fake-auto-indexing is 8% slower than manual-indexing. I find it interesting that auto-indexing is the slowest of the three methods.
Finally, I tested the performance of operating on entire columns (instead of every single element) of a 3D array. In all cases it is a lot faster than iterating over individual elements. Auto-indexing is more than 1.8 to 3.4 times slower than manual-indexing, while fake-auto-indexing is about 1.5 to 2.7 times slower. Because of the number of iterations that has to be done, the effect of the size of the column is important: an array with 1000x200x40 elements is in all cases much slower than an array with 1000x40x200 elements.
Discussion & conclusions
In all the cases I tested, auto-indexing is significantly slower than manual-indexing. Because auto-indexing is the standard way of indexing arrays in LabView I expected the method to be highly optimized. Judging by the tests I did, that is not the case. I find this puzzling.
Does anybody know any best practices when it comes to working with >1D arrays? It seems there is a lack of documentation about the performance, surprising given the significant differences I found.
It is of course possible that I made mistakes. I tried to keep the code as straightforward as possible to minimize that risk. Still, I hope somebody can double-check the work I did.
Results
I ran the tests on a computer with a i5-4570 @ 3.20 GHz processor (4 cores, but only 1 is used), 8 GB RAM running Windows 7 64-bit and LabView 2013 32-bit. The tests were averaged 10 times. The results are in milliseconds.
3D-arrays, iterate pages-rows-columns
pages x rows x cols : auto manual fake
40 x 200 x 1000 : 268.9 202.0 268.8
40 x 1000 x 200 : 276.9 204.1 263.8
200 x 40 x 1000 : 264.6 202.8 260.6
200 x 1000 x 40 : 306.9 205.0 300.0
1000 x 40 x 200 : 253.7 203.1 259.3
1000 x 200 x 40 : 307.2 206.2 288.5
100 x 100 x 100 : 36.2 25.7 33.9
3D-arrays, iterate columns-rows-pages
pages x rows x cols : manual fake
40 x 200 x 1000 : 277.6 457
40 x 1000 x 200 : 291.6 461.5
200 x 40 x 1000 : 277.4 431.9
200 x 1000 x 40 : 452.5 572.1
1000 x 40 x 200 : 298.1 460.4
1000 x 200 x 40 : 460.5 583.8
100 x 100 x 100 : 31.7 51.9
2D-arrays, iterate rows-columns
rows x cols : auto manual fake
200 x 20000 : 123.5 106.1 113.2
20000 x 200 : 119.5 106.1 115.0
10000 x 10000 : 3080.25 2659.65 2835.1
1D-arrays, iterate over columns
cols : auto manual fake
500000 : 11.5 11.8 11.6
3D-arrays, iterate pages-rows, operate on columns
pages x rows x cols : auto manual fake
40 x 200 x 1000 : 83.9 23.3 62.9
40 x 1000 x 200 : 89.6 31.9 69.0
200 x 40 x 1000 : 74.3 27.6 62.2
200 x 1000 x 40 : 135.6 76.2 107.1
1000 x 40 x 200 : 75.3 31.2 68.6
1000 x 200 x 40 : 133.6 71.7 108.7
100 x 100 x 100 : 13.0 5.4 9.9
VI's
I attached the VI's I used for testing. "ND_add_random_number.vi" (where N is 1, 2 or 3) is where all the action happens, taking a selector with a method and an array with the N dimensions as input. It returns the result and time in milliseconds. Using "ND_add_random_number_automated_test.vi" I run this for a few different situations (auto/manual/fake-indexing, interchanging the dimensions). The VI's starting with "3D_locality_" are used for the locality tests. The VI's starting with "3D_norows_" are used for the iterations over pages and columns only.
Attachments:
3D_arrays_2.zip 222 KBRobert,
the copy-thing is not specific for auto-indexing. It is common for all tunnels. A tunnel is first of all a unique data space.
This sounds hard, but there is an optimization in the compiler trying to reduce the number of copies the VI will create. This optimization is called "in-placeness".
The in-placeness algorithm checks, if the wire passing data to the is connected to anything else ("branch"). If there is no other connection then the tunnel, chance is high that the tunnel won't create an additional copy.
Speaking of loops, tunnels always copies. The in-placeness algorithm cannot opt that out.
You can do a small test to elaborate on this: Simply wire "0" (or anything less than the array sizy of the input array) to the 'N' terminal.......
Norbert
PS: Auto-indexing is perfect for a "by element" operation of analysis without modification of the element in the array. If you want to modify values, use shift registers and Replace Array Subset.
CEO: What exactly is stopping us from doing this?
Expert: Geometry
Marketing Manager: Just ignore it. -
I have read 118 files from a directory using the list.vi. Each file has 2 cols with 2088rows. Now I have the data in a 2 D array with 2cols and 246384rows (118files * 2088rows). However I want to put each file in the same array but each file in separate columns. then I would have 236 columns (2cols for each of the 118 files) by 2088 rows. thank you very much in advance.
Hiya,
here's a couple of .vi's that might help out. I've taken a minimum manipulation approach by using replace array subset, and I'm not bothering to strip out the 1D array before inserting it. Instead I flip the array of filenames, and from this fill in the end 2-D array from the right, overwriting the column that will eventually become the "X" data values (same for each file) and appear on the right.
The second .vi is a sub.vi I posted elsewhere on the discussion group to get the number of lines in a file. If you're sure that you know the number of data points is always going to be 2088, then replace this sub vi with a constant to speed up the program. (by about 2 seconds!)
I've also updated the .vi to work as a sub.vi if you wa
nt it to, complete with error handling.
Hope this helps.
S.
// it takes almost no time to rate an answer
Attachments:
read_files_updated.vi 81 KB
Num_Lines_in_File.vi 62 KB -
Unable to plot 1-D array with a cluster of 2 elements on an XY graph
I'm Unable to plot a 1-D array with a cluster of 2 elements on an XY graph. The data appears at the input to the graph but nothing is plotted. I'm trying to plot a line connecting each point generated.
Solved!
Go to Solution.
Attachments:
TEST11.vi 13 KBChuck,
0. Do not post VIs with infinite loops! Change the True constant to a control. One of the regular participants on these Forums has commented that using the Abort button to stop a VI is like using a tree to stop a car. It works, but may have undesired consequences!
1. Use a shift register on the For loop also.
2. Inserting into an empty array leaves you with an empty array. Initialize the array outside the loop to a size greater or equal to the maximum size you will be using. Then use Replace Array Subest inside the loop.
3. Just make an array of the cluster of points. No need for the extra cluster.
Lynn
Attachments:
TEST11.2.vi 11 KB
Maybe you are looking for
-
General Hierachy in Report Painter
All, Is it posible to use my own hierachy create in transaction MCK1 in Report Painter ( GRR1 / GRR2 )? If yes, how can I do it? Pat.
-
Performance issue while generating Query
Hi BI Gurus. I am facing performance issue while generating query on 0IC_C03. It has a variable as (from & to) for generating the report for a particular time duration. if the variable (from & to) fields is filled then after taking a long time it sho
-
Help if you can, student and need phone now.
Hi, yesterday morning when I unplugged my phone from the wall charger I noticed there were too small black oval shapes on the top center of my screen. Being late for school I didn't really mind it.. Through out the day do, it's as if it extended to m
-
I had to replace the hard drive on my laptop due to a total hard drive failure. Is there a way to transfer all my music (non purchased) and play lists back to the new drive?
-
Never could get Photoshop CS4 Extended to launch in Tiger or Leopard on my G5
I have the Adobe Creative Suite installed on my Powermac DP 1.8 MHz (2004). I have 1.5 GB RAM, and the system runs pretty well. I do have some 3rd party RAM added, and added a new graphics card recently. I cannot get Photoshop to launch at all. It cr