Comparison of Elements of Two 2D Arrays

Hello!
I am trying to compare elements of two 2D Arrays and find at least one pair of elements that are identical. Browsing the forum I found one method suggested by Altenbach (http://forums.ni.com/t5/LabVIEW/Compare-elements-in-an-array/m-p/458622). However, it works well with 1D Arrays. That is why I rearranged the original code for my case, but unfortunately the attempt was unsuccessful. Could anyone please have a look at my VI and suggest any solution?
Thank you.
Solved!
Go to Solution.
Attachments:
Search and Compare Indices.vi ‏16 KB

Thanks, paul_cardinale !
It works.. Now I see the principle.
Sometimes, the algorithm works perfectly, but sometimes it detects only one common index.
For example,
3 5 and 5 5 6
1 0 0 1 7
In this case (5,0) is common for both arrays. But the algorithm shows that only "5" is common. Why do u think it is happening?
I have attached VI.
Attachments:
Search and Compare Indices.vi ‏19 KB

Similar Messages

Multiplying elements of two different arrays

hey, I have a while loop thats performing two separate operations similtaneously and filling the data elements of two different 1d arrays with data.with each iteration of the loop a new value pass from an operation to an array.
I need to multipy to corresponding elements of the arrays such the first element of one array is skipped. so element i0 * element j1 , element i1 * elemnent j2 etc. how can i acess the elements and make the calculations? arrays could have hundreds of elements.
Thanks.
Brendan

blue silver wrote:
hi Peter,
I have an array of 2,000,000 values (each long int). I need to do an "Moving average" operation which would than:
1) takes average of the first 10 values , plots it
2) remove the first value ,add 11.th value, take average, plots it in the next 100 ms in the chart
3) remove the first value, add 12.th value, take average, plots it in the next 100 ms in the chart
(as you see , it is a kind of shifting) the averaged array elements is always 10 , and after averaging those 10 elements , plot it with 100 ms distance in the graph.
1999989) remove the 1,999,989 th element , add the last element
you have a possible idea ?
your help will be tremendously appreciated.
Regards
Silver
Try this. It iterates 10 times taking a subset of the array each time to sum it to a shift register. When done, divides by the total number of iterations. So it adds i0 to i1 to i2 to i3 to i{N}. For each element from i0 up. It will give you an array where n elements are missing (because elements 0 through n-1 don't have N samples to average to.
Message Edited by Ravens Fan on 11-26-2007 09:26 PM
Attachments:
Example_BD.png ‏4 KB

Set number of elements in a two dimensional array

Hi,
Does anyone know how to set the number of elements in a two dimensional array directly in teststand.
To set a one dimsional array is simple:
SetNumElements( locals.somearray,4)
Is there a method to do this for a two dimensional array?
Sean

From the help file (TestStand 4.2.0):
PropertyObject.SetNumElements
SetNumElements Method
Syntax
PropertyObject.SetNumElements ( numElements, options = 0)
Purpose
Sets the number of elements of a single dimensional array.
Remarks
This method is only valid for single dimensional arrays. The elements in the array retain their values. Use the PropertyObjectType.ArrayDimensions property to set the number of elements in each dimension of a multi-dimensional array.
Parameters
numElements As Long
[In] New number of elements for the array.
options As Long
[In] Pass 0 to specify the default behavior, or pass one or more PropertyOptions constants. Use the bitwise-OR operator to specify multiple options.
This parameter has a default value of 0.
So you could use, for example: Locals.MultidimensionalArray.Type.ArrayDimensions.SetBounds({1,0},{3,4}) to set an array to have three dimensions (1,2,3), each with five elements (0,1,2,3,4).

Combining two StringBuffer array elements into a single array element

I just need to know how to combine two stringBuffer array elements into one
StringBuffer ciphertext [] = new StringBuffer[2];
          StringBuffer s0 = new StringBuffer("11011111111110001001101110110101");
          StringBuffer s1 = new StringBuffer("00010011001101000101011101111001");
          ciphertext[0] = s0;
          ciphertext[1] = s1;
          ciphertext[2] = ciphertext[0].append(ciphertext[1]);I get an array index out of bounds exception:2
Thanks

StringBuffer ciphertext [] = new StringBuffer[3]; // legal index values are: 0,1,2

Printing every possible pair combination of elements in two arrays??

Hi there,
I'm trying to implement the problem of printing every possible pair combination of elements in two arrays. The pattern I have in mind is very simple, I just don't know how to implement it. Here's an example:
g[3] = {'A', 'B', 'C'}
h[3] = {1, 2, 3}
...code...??
Expected Output:
A = 1
B = 2
C = 3
A = 1
B = 3
C = 2
A = 2
B = 1
C = 3
A = 2
B = 3
C = 1
A = 3
B = 1
C = 2
A = 3
B = 2
C = 1
The code should work for any array size, as long as both arrays are the same size. Anybody know how to code this??
Cheers,
Sean

not a big fan of Java recursion, unless tail recursion, otherwise you are bound to have out of stack error. Here is some generic permutation method I wrote a while back:
It is generic enough, should serve your purpose.
* The method returns all permutations of given objects. The input array is a two-dimensionary, with the 1st dimension being
* the number of buckets (or distributions), and the 2nd dimension contains all possible items for each of the buckets.
* When constructing the actual all permutations, the following logic is used:
* take the following example:
* 1    2    3
* a    d    f
* b    e    g
* c
* has 3 buckets (distributions): 1st one has 3 items, 2nd has 2 items and 3rd has 2 items as well.
* All possible permutaions are:
* a    d    f
* a    d    g
* a    e    f
* a    e    g
* b    d    f
* b    d    g
* b    e    f
* b    e    g
* c    d    f
* c    d    g
* c    e    f
* c    e    g
* You can see the pattern, every possiblity of 3rd bucket is repeated once, every possiblity of 2nd bucket is repeated twice,
* and that of 1st is 4. The number of repetition has a pattern to it, ie: the multiplication of permutation of all the
* args after the current one.
* Therefore: 1st bucket has 2*2 = 4 repetition, 2nd has 2*1 = 2 repetition while 3rd being the last one only has 1.
* The method returns another two-dimensional array, with the 1st dimension represent the number of permutations, and the 2nd
* dimension being the actual permutation.
* Note that this method does not purposely filter out duplicated items in each of given buckets in the items, therefore, if
* is any duplicates, then the output permutations will contain duplicates as well. If filtering is needed, use
* filterDuplicates(Obejct[][] items) first before calling this method.
public static Object[][] returnPermutation(Object[][] items)
     int numberOfPermutations = 1;
     int i;
     int repeatNum = 1;
     int m = 0;
     for(i=0;i<items.length;i++)
          numberOfPermutations = numberOfPermutations * items.length;
     int[] dimension = {numberOfPermutations, items.length};
     Object[][] out = (Object[][])Array.newInstance(items.getClass().getComponentType().getComponentType(), dimension);
     for(i=(items.length-1);i>=0;i--)
          m = 0;
          while(m<numberOfPermutations)
               for(int k=0;k<items[i].length;k++)
                    for(int l=0;l<repeatNum;l++)
                         out[m][i] = items[i][k];
                         m++;
          repeatNum = repeatNum*items[i].length;
     return out;
/* This method will filter out any duplicate object in each bucket of the items
public static Object[][] filterDuplicates(Object[][] items)
     int i;
     Class objectClassType = items.getClass().getComponentType().getComponentType();
     HashSet filter = new HashSet();
     int[] dimension = {items.length, 0};
     Object[][] out = (Object[][])Array.newInstance(objectClassType, dimension);
     for(i=0;i<items.length;i++)
          filter.addAll(Arrays.asList(items[i]));
          out[i] = filter.toArray((Object[])Array.newInstance(objectClassType, filter.size()));
          filter.clear();
     return out;

Variable number of two dimensional arrays into one big array

I have a variable number of two dimensional arrays.
The first dimension is variable, the second dimension is always 7.
i.e.:
Object[][] array0 = {
{"tim", "sanchez", 34, 175.5, "bla", "blub", "[email protected]"},
{"alice", "smith", 42, 160.0, "la", "bub", "[email protected]"},
Object[][] array1 = {
{"john", "sdfs", 34, 15.5, "a", "bl", "[email protected]"},
{"joe", "smith", 42, 16.0, "a", "bub", "[email protected]"},
Object[][] arrayi = ...I'm generating these arrays with a for-loop:
     for (int i = 0; i < filter.length; i++) {
          MyClass c = new MyClass(filter);
          //data = c.getData();
Where "filter" is another array which is filled with information that tells "MyClass" how to fill the arrays.
"getData()" gives back one of the i number of arrays.
Now I just need to have everything in one big two dimensional array.
i.e.:Object[][] arrayComplete = {
{"tim", "sanchez", 34, 175.5, "bla", "blub", "[email protected]"},
{"alice", "smith", 42, 160.0, "la", "bub", "[email protected]"},
{"john", "sdfs", 34, 15.5, "a", "bl", "[email protected]"},
{"joe", "smith", 42, 16.0, "a", "bub", "[email protected]"},
Any idea on how to accomplish this? It's blowing my mind right now.

Just brainstorming here:
Why not put your actual data in a class and store that in a LinkedList (so you know the total number of elements for your multi-dimensional array). Then initalize your multi-dimensional array and populate it? Haven't tested the following, but thinking something along the lines of
public class MyData {
     //data here
     public Object[] toArray() {
          //something similar to this
          return new Object[] = {"tim", "sanchez", 34, 175.5, "bla", "blub", "[email protected]"};
LinkedList<MyData> data = new LinkedList<MyData>();
data.add(mydata1);
//however many times you need
Object[][] arrayComplete = new Object[data.size()][7];
for(int i = 0; i < data.size(); i++) {
     arrayComplete[i] = data.removeFirst().toArray();
}Another option for knowing how many rows you would need might be using something like:
int rows = 0;
rows += array1.length;
rows += array2.length;
//etc...But is not entirely useful if you don't know how many variable arrays you have (although reflections might help if the name of the array variable is incremented systematically, someone told me earlier to avoid reflections since it could make debugging a LOT more difficult).
Edited by: bogdana on Apr 1, 2010 10:38 AM

Problem returning a two-dimensional array in web service

Hello. I'm having problems returning a two dimensional array in my web service. The service returns a MyClass[][] correctly, but the client receives a different one.
I've done a test that returns a MyClass[1][1] an the client shows a MyClass[1][20]. All the MyClass objects returned in the array are the same and all it's fields are null. There's even an element of the array containing null instead of the object. As I say, the service creates the array ok, but the client gets other thing.
I have other methods returning one-dimensional arrays MyClass[] and I have no problem.
My system:
WindowsXP
Tomcat 5.5 (Axis 1.3?)
JDK 1.5
Eclipse 3.3
My wsdl is generated with eclipse, although I've had to update my wsdd manually.
Any Ideas?
Thanks.

Does it have to be stored in an array?
Because you could use the java.awt.Point class, and a
java.util.Set to create random points until you have
the correct number of unique points.Of course it is no must to store it in an array. it was just my first thought of approaching the problem. I will try the Point.class. Thanks for that hint.

Array of cluster to array of element - or - Cluster of arrays?

Hi all,
I have a large cluster (lets call it C_data) containing measured data e.g. 10 Temperatures, Pressure, (Temp_1, ...).....
All these data are measured once per second. I now collect all data
measured over a certain time in an array of the aforementioned cluster,
that is
an array of C_data. In order to display time series of data in graphs I
need to extract arrays of elements from this array of C_data.
In a text based programming language this could look like the following:
Struct C_data {Temp_1, Temp_2, P_1.....}
ar_C_data is an array of C_data
now I want to do something like:
array_of_Temp_1 = ar_C_data[*].Temp_1
In some programming languages this works but I cannot unbundle_by_name the array of Temp_1 from ar_data in Labview.
Since my cluster is large and may change in structure (for this reason I use a typedef) a generic solution would be the best.
I know that I could: loop over all elements of ar_C_data, unbundle by
name, index elements into arrays, and use these but this seems very
inefficient if it is done every second on a large cluster (30 elements) with several thousand array elements....
Olaf

You can minimize the overhead of scanning through all elements and extracting if you pre-define the array and use "replace array subset". This avoide having to re-size the array which is costly.
Or you can keep an array separately in memory. When one cluster element is added, the corresponding element is added to the array too. Causes some memory overhead, but you're going to have that anyway if you generate them "on the fly".
I don't see a way to do this other than either search through the array and pick the elements you need -or-
keep a copy of the data in a form you can use.
It's a common question of how to structure data to best suit two sometimes conflicting needs - efficiency and useability.
What might be of interest is to change the "Array" - "Cluster" order and have a single cluster C-Data with arrays of each element required. Might be a bit more difficult to use, it depends on your application.
This way you have all arrays ready at all times, but generating a single cluster requires bundling the individual units on the fly.
Shane.
Using LV 6.1 and 8.2.1 on W2k (SP4) and WXP (SP2)

Read two different arrays and display

I have a text file, which has 1000 of entries in the way mentioned below:
Kozos customer
sabze employee
I am reading the content of text file and saving as an arrays.
$global:Content = get-content info.txt
$global:Name=$Content | foreach {
$hashTab=@{Name="" ; Info=""}
$hashTab.Name, $hashTab.Info=$_.Trim() -split '\s+'
New-Object PSObject -Property $hashTab
$global:Names=$ServerList | select -ExpandProperty Name
$global:Infos=$ServerList | select -ExpandProperty Info
How do I read two arrays, I mean read the values of two arrays one by one and display the result as:
Names Infos
Kozos Customer
sabze employee

We get that you are unable to do this, but it is still not clear precisely what it is that you want, a two-dimensional array, or a structure such as SeanQuinlan suggested? Also:
there seems no reason for any of the variables to be global in scope.
Where is the $serverlist variable defined?
what relationship is there between the file you mention and the data in the $serverlist variable?
Your code has three arrays, $name, $names, and $infos; which two of these do you want to combine into a single array? If $names and $infos, would this work for you:
$namesNinfos = $serverlist | select name,info
I suggest that you describe your situation without trying to state it in powershell (as that is partly where your problem lies). You could, for example, show sample content of the file and each of the two arrays, and show what this would look like in your
desired two-dimensional array, perhaps like this:
file info.txt
Kozos customer
sabze employee
array 1:
Kozos
sabze
array 2:
customer
employee
resultant 2D array
column 1 2
row
1 Kozos customer
2 sabze employee
As an aside, it could be that we are getting confused by the term "array". languages such as fortran and basic support multidimensional arrays in which each element is addressed by a set of integer indices, the most common form being row and column, as in
a spreadsheet.
In Powershell, arrays are generally one dimensional, with a single numerical index being used to select a single element ($row3 = $array[2]). That element can optionally have multiple values if it is defined as an array or a hash. This is referred to as
a "jagged array" as each element of the array may not all have the same number of sub-elements as each other.
Powershell also supports true multidimensional arrays, however, these seem fairly rarely used, I suspect because jagged arrays generally provide more easily used functionality.
You can get more details on this from
here and
here.
This, then, leads to my final question:
what type of two-dimensional array are you looking for, and how will your script be processing it?
Al Dunbar -- remember to 'mark or propose as answer' or 'vote as helpful' as appropriate.

Two dimension array?

Show me the code for two dimension array in JSP!
Thanks in advance!

Hi,
I am new in Java but maybe I can help you:
Two-dimnsional arrays you can declare in following way:
String[][] someArray;
When you want to allocate space for new array you can do something like this:
someArray = new String[5][5];
All Arrays have a data variable called length, which you can inspect to find out how many elements there are in the array.
For multi-dimensional arrays, each dimension has a length property.
int[] [] a1 = {{ 0, 1, 2 },{ 3, 4, 5 }};
for (int i=0; i < a1.length; i++) {
for (int j=0; j < a1.length; j++) {
prt(i + "," + j + "=" + a1[i][j]);
Hope this is of help to you.
Mirkos

Matrix in java using two dimension array

hi!
Everybody here's a problem I have cpould any body out there give nice piece of sourcr code for "matrix in java using two dimension array"I have to give a presentation how it works.Yes I'd appreciate as many example as possible
If anybody can??
Please help
regards
ardent

nice piece of sourcr
code for "matrix in java using two dimension
n arraySure,
int[][] matrix = new int[5][5];
That declares a two-dimensional 5 by 5 array with integer elements. All elements are initially 0.
For further information check you favourite Java textbook.

What I want to do is to get the co-ordinates of the elements of the third array which shows differences between 2 other arrays

Hello,
Ive have got a vi that compares two arrays by element and gives back the location of the elements that are not equal in a third array. What I want to do is to get the co-ordinates of the elements of the third array from the either the first or second array.
Many Thanks
(Labview 7.1)
Please find the vi attached below
Attachments:
ArrayDiff701.vi ‏25 KB

jihn wrote:
What I want to do is to get the co-ordinates of the elements of the third array from the either the first or second array.
Sorry, I don't understand what you mean. What are coordinates in this context?
If you for example want to get an array of all elements from the first array corresponding to the list of indices in the "locations" array, just add another FOR loop as shown.
Your VI has a major flaw! You need to reverse the order of "Add array elements" and "to I32". The "to I32" needs to come first! (see image). If you "add" first, you'll run into problems if you have more that 32k different elements because of overflow in the I16 integer.
Message Edited by altenbach on 02-21-2008 05:22 PM
LabVIEW Champion . Do more with less code and in less time .
Attachments:
Different.png ‏9 KB

Two dim array

hello
it would be really nice if someone could help me with that.
i am trying to sort an array and i have read that i can do that with a statement called sort(), but it doesn't seem to work.
this is what i have tried:
for(int i = 0; i < arr.length; i++)
       for(int j = 0; j < arr.length; j++)
           sort(arr[i][j]);
}the error i get is:
Exercise5W2.java [56:1] No method found matching sort(int)
sort(arr[i][j]);
^
1 error
thanks for ur help!

You can use the java.util.Arrays.sort() with and without
the java.util.Comparator interface.
First you sort all individual one-dim int arrays,
then you sort the whole two-dim array.
Here is how it goes:
// 2-dim int array example
int[][] twoDimIntArray = { { 4, 67, 45 }, { 23, 98, 3}, { 2, 68, 112}, { 333, 5, 21 } };
// First you sort all individual 1-dim int arrays
for (int i = 0; i < twoDimIntArray.length; i++)
    Arrays.sort(twoDimIntArray);
// Then you sort the whole 2-dim array (with an house made Comparator)
Arrays.sort((Object[])twoDimIntArray, new TwoDimIntArrayComparator());
// Print out the result
for (int i = 0; i < twoDimIntArray.length; i++)
for (int j = 0; j < twoDimIntArray[i].length; j++)
System.out.print(twoDimIntArray[i][j] + " ");
System.out.println();
// Here is the Compararor for 2-dim int array objects
class TwoDimIntArrayComparator implements Comparator
public int compare(Object o1, Object o2)
int[] oneDimIntArray1 = (int[])o1;
int[] oneDimIntArray2 = (int[])o2;
// First integer of each array to be different,
// return the comparison
for (int i = 0; i < oneDimIntArray1.length; i++)
if (oneDimIntArray1[i] > oneDimIntArray2[i])
return 1;
else if (oneDimIntArray1[i] < oneDimIntArray2[i])
return -1;
// All integers of the arrays are equal
return 0;
public boolean equals(Object obj)
return false;

Cascade two Build Array functions - what happens?

I found the the code shown in the attachment in a very complex VI that I am overhauling. Would someone explain to me what is happening with the "cascaded" Build Array functions.
I can see that the first Build Array function builds a 1D array of integers which passes to the second Build Array function which outputs a 2D array of integers but, since there is no Element or second Array input, I don't see how this works.
This is part of a subVI that is not embedded in a loop.
All the examples have at least two inputs. With one input there is no Concatenate Inputs option. There is some implicit operation here that I do not understand.
Would someone explain how this works?
Solved!
Go to Solution.
Attachments:
Cascade two build array functions.PNG ‏7 KB

You are taking a scalar value and creating a 1-D array with exactly 1 element.
Then you are taking the 1-D array and building it into a 2-D array, with exactly 1 element.
Since you can't concatenate something with nothing, the only logical mode for the Build Array would be to build it into an array of the next larger dimension.
You could add a third one, then you'd have a 3-D array with exactly 1 element. And so on.

How to get number of rows and columns in a two dimensional array ?

Hello,
What would be the simplest way to get number of rows and columns in a two dimensional array represented as integers ?
I'm looking for another solution as For...Each loop in case of large arrays.
Regards,
Petri

Hi Petri,
See a attached txt file for obtaining two arrays with upper and lower index values
Regards
Ray
Regards
Ray Farmer
Attachments:
Get2DArrayIndex.txt ‏2 KB

Comparison of Elements of Two 2D Arrays

Similar Messages

Maybe you are looking for