Sort A Node Array?

I am retrieving a Array of Nodes and looping through them to produce navigation... The problem is that I can't seem to sort them... Here is my code
 
<cm:getNode path="<%=GearboxConstants.BEA_REPOSITORY_DEFAULT_INFO_MENU_NODE%>" id="gearBoxMenuNode"/> 
<%if (gearBoxMenuNode != null) { 
Node gearboxMenus[] = gearBoxMenuNode.getChildren(); 
if (gearboxMenus != null && gearboxMenus.length > 0) {
%> 
<es:forEachInArray id="gearBoxMenuItem" type="com.bea.content.Node" array="<%=gearboxMenus%>"> 
here is what I have tried
Arrays.sort(gearboxMenus) --> It blows up
and also CM:Search but I can only get either all submenus or nothing..
this should be easy but I am missing something...

Chris Whittle wrote:
here is what I have tried
Arrays.sort(gearboxMenus) --> It blows up
and also CM:Search but I can only get either all submenus or nothing.. com.bea.content.Node does not support the Comparable interface which the basic
Array.sort(Object[] array) requires. Create your own comparator implementation
and use Array.sort(Object[] array, Comparator comparator).
Cheers,
Gerald

Similar Messages

Sorting the nodes...

hi group,
the tree has root.The top root has multiple nodes in it..say suppose..nearly 100 nodes in it..
for ex:
abc
def
ghi
jkl
mno
pqr
stu
vwx
xyz
i want to sort these nodes in btn action means it should sort and at the same time it should fix in the root node with sorting order.
Any body has idea on it??
shalini.

if its a DefaultMutableTreeNode, you can get the children Vector (protected variable) and sort it using the Arrays utility class. i think it has a vector or object array sorting method in which you can specify the comparator.
it might be more useful to override the add() method of your node so that when a node is added, you sort the children so the user never has to explicitly do it.

Sort the Nodes and remove duplicate nodes

Hello Experts,
I have a requirement to sort the nodes based on a key value.
e.g.
<Node>
 <Key>2<Key>
 <Value1>name1<Value1>
 <Value2>email1<Value2>
</Node>
<Node>
 <Key>1<Key>
 <Value1>name2<Value1>
 <Value2>email2<Value2>
</Node>
<Node>
 <Key>2<Key>
 <Value1>name3<Value1>
 <Value2>email3<Value2>
</Node>
and the Output should be
<TNode>
 <Key>1<Key>
 <Value1>name2<Value1>
 <Value2>email2<Value2>
</TNode>
<TNode>
 <Key>2<Key>
 <Value1>name3<Value1>
 <Value2>email3<Value2>
</TNode>
I tried using SortByKey function for Node i.e.
Key --> SortByKey , Node --> TNode
But I dont get sorted value for Value1 and Value2.
Can anybody give solution for this?
I have around 25000 records as input and there are around 25 values in structure.
Please help.
Thanks in advance,
Beena.

Beena,
Here you go. If it doesn't helps then let me know.
Mapping.
http://www.flickr.com/photo_zoom.gne?id=2185600055&size=o
http://www.flickr.com/photo_zoom.gne?id=2185600049&size=o
http://www.flickr.com/photo_zoom.gne?id=2185600063&size=o
http://www.flickr.com/photo_zoom.gne?id=2185600067&size=o
Results
http://www.flickr.com/photo_zoom.gne?id=2185600075&size=o

Sorting the nodes of a JTree

Can anyone tell me how to go about sorting the nodes in a JTree?

The best way to do it is thru the treemodel. Either adjust the order in a DefaultTreeModel, or create your own TreeModel.

Newbie trying to sort 2D string array

Dear all,
After read some book chapters, web sites including this, I still don't get the point.
If I have a file like,
1 aaa 213 0.9
3 cbb 514 0.1
2 abc 219 1.3
9 bbc 417 10.4
8 dee 887 2.1
9 bba 111 7.1
and I load into memory as a String[][]
here comes the problem, I sort by column 1 (aaa,...,bba) using an adaptation of the Quicksort algorithm for 2D arrays
* Sort for a 2D String array
* @param a an String 2D array
* @param column column to be sort
public static void sort(String[][] a, int column) throws Exception {
QuickSort(a, 0, a.length - 1, column);
/** Sort elements using QuickSort algorithm
static void QuickSort(String[][] a, int lo0, int hi0, int column) throws Exception {
int lo = lo0;
int hi = hi0;
int mid;
String mitad;
if ( hi0 > lo0) {
/* Arbitrarily establishing partition element as the midpoint of
* the array.
mid = ( lo0 + hi0 ) / 2 ;
mitad = a[mid][column];
// loop through the array until indices cross
while( lo <= hi ) {
/* find the first element that is greater than or equal to
* the partition element starting from the left Index.
while( ( lo < hi0 ) && ( a[lo][column].compareTo(mitad)<0))
++lo;
/* find an element that is smaller than or equal to
* the partition element starting from the right Index.
while( ( hi > lo0 ) && ( a[hi][column].compareTo(mitad)>0))
--hi;
// if the indexes have not crossed, swap
if( lo <= hi )
swap(a, lo, hi);
++lo;
--hi;
/* If the right index has not reached the left side of array
* must now sort the left partition.
if( lo0 < hi )
QuickSort( a, lo0, hi, column );
/* If the left index has not reached the right side of array
* must now sort the right partition.
if( lo < hi0 )
QuickSort( a, lo, hi0, column );
* swap 2D String column
private static void swap(String[][] array, int k1, int k2){
String[] temp = array[k1];
array[k1] = array[k2];
array[k2] = temp;
----- end of the code --------
if I call this from the main module like this
import MyUtil.*;
public class kaka
public static void main(String[] args) throws Exception
String[][]a = MyUtil.fileToArray("array.txt");
MyMatrix.printf(a);
System.out.println("");
MyMatrix.sort(a,1);
MyMatrix.printf(a);
System.out.println("");
MyMatrix.sort(a,3);
MyMatrix.printf(a);
for the first sorting I get
1 aaa 213 0.9
2 abc 219 1.3
9 bba 111 7.1
9 bbc 417 10.4
3 cbb 514 0.1
8 dee 887 2.1
(lexicographic)
but for the second one (column 3) I get
3 cbb 514 0.1
1 aaa 213 0.9
2 abc 219 1.3
9 bbc 417 10.4
8 dee 887 2.1
9 bba 111 7.1
this is not the order I want to apply to this sorting, I would like to create my own one. but or I can't or I don't know how to use a comparator on this case.
I don't know if I am rediscovering the wheel with my (Sort String[][], but I think that has be an easy way to sort arrays of arrays better than this one.
I've been trying to understand the Question of the week 106 (http://developer.java.sun.com/developer/qow/archive/106/) that sounds similar, and perfect for my case. But I don't know how to pass my arrays values to the class Fred().
Any help will be deeply appreciated
Thanks for your help and your attention
Pedro

public class StringArrayComparator implements Comparator {
int sortColumn = 0;
public int setSortColumn(c) { sortColumn = c; }
public int compareTo(Object o1, Object o2) {
 if (o1 == null && o2 == null)
 return 0;
 if (o1 == null)
 return -1;
 if (o2 == null)
 return 1;
 String[] s1 = (String[])o1;
 String[] s2 = (String[])o2;
 // I assume the elements at position sortColumn is
 // not null nor out of bounds.
 return s1[sortColumn].compareTo(s2[sortColumn]);
// Then you can use this to sort the 2D array:
Comparator comparator = new StringArrayComparator();
comparator.setSortColumn(0); // sort by first column
String[][] array = ...
Arrays.sort(array, comparator);I haven't tested the code, so there might be some compiler errors, or an error in the logic.

How to sort Jtree node?

Now, I want to sort tree node by increasing.
for example there are three child node:
[20 -40][
10 - 20]
[30- 60].
they are added to JTree node by different order.but are shown in increasingorder.
like this:
[10 - 20]
[20 -40][
[30- 60].
how to control tree node.

Implement the Comparable interface in t he userobject class and possibly the toString(0 as well.
Ex.
public class UserObject implements java.lang.Comparable{
public int compareTo(Object obj) throws ClassCastException
public String toString()

Sort and Object array of Arrays

Hi,
I have an object array that contains a String[] and an int[].
Object[String[], int[]]
The values in the Strings array must be in the same position in the array as those in the int array i.e
String [0] is the string representation of int[0].
Its for a bar chart.
That is all working beautifully.
Now however I want to sort the int array in descending order by the value of the ints in the array and thus the order or the String array has to mirror this.
I am using a comparator to do this but it just wont work. I'm sure this is the way but how should it look?
Has anybody got any ideas?
Thanks in advance,
L.

use the bubblesort:
 for (int i = a.length; --i >= 0; ) {
 for (int j = 0; j < i; j++) {
 if (a[j][1] > a[j+1][1]) {
 int temp = a[j];
 a[j] = a[j + 1];
 a[j + 1] = temp;
 }

What types of sort performed by sort method of Array class ?

I use normal bubble sort and method Array.sort() to sort some given data of an Array and then count the time.But Array.sort() method takes more time then normal bubble sort.
Can anybody tell me what types of sort performed by sort method of Array class?

I'm pretty sure that in eariler versions (1.2, 1.3
maybe?) List.sort's docs said it used quicksort. Or I
might be on crack.You are actually both correct, and wrong :)
From the documentation of the sort methods hasn't changed in 1.2 -> 1.4 (as far as I can notice), and the documentation for sort(Object[]) says (taken from JDK 1.2 docs):
"This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance, and can approach linear performance on nearly sorted lists."
So, how could you be correct? The documentation for e.g. sort(int[]) (and all other primities) says:
"Sorts the specified array of ints into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", Software-Practice and Experience, Vol. 23(11) P. 1249-1265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance."
Your memory serves you well :)
/Kaj

About the sort method of arrays

Hi,
I found that for primitive types such as int, float, etc., algorithm for sort is a tuned quicksort. However the algorithm for sorting an object array is a modified merge sort according to the java API. What is the purpose of using two different sorting strategy?
Thanks.

The language knows how to compare two ints, two doubles, etc. For Object arrays, however, it's not a simple matter of comparing two reference values as ints or longs. We're not comparing the references. We have to compare the objects, according to the class's compareTo() method (if it implements Comparable) or a provided Comparator. The size of an int is known, fixed, and small. The size of an object is unknown, variable, and essentially unbounded. I don't know for sure that that difference is what drove the different approaches, but it is a significant difference, and mergesort is better suited to use cases where we can't fit the entire array into memory at one time. It seems reasonable that we'd get better locality of reference (fewer cache misses, less need to page) with an array of ints than with an array of objects.
Edited by: jverd on Mar 18, 2011 3:16 AM

Need to sort an object array using an element in the object.

hi all,
i need to sort an object array using an element in the object.can someone throw some light on this.
Edited by: rageeth on Jun 14, 2008 2:32 AM

[http://java.sun.com/docs/books/tutorial/collections/interfaces/order.html]

Sort within an array?

public class Input3
     private String[] input = new String[40];
     private static int StringNum = -1;
     public static final int NUMBER_OF_TEAMS = 3;
     public static final int NUMBER_OF_PLAYERS = 5;
     public Input3()
          //The first six inputs will be for the first team
          input[0] = "LAKERS";
          input[1] = "Kobe Bryant";
          input[2] = "Derek Fisher";
          input[3] = "Shaquille O'Neal";
          input[4] = "Karl Malone";
          input[5] = "Brian Cook";
          //The next six inputs will be for the second team
          input[6] = "MAVERICKS";
          input[7] = "Antoine Walker";
          input[8] = "Dirk Nowitzki";
          input[9] = "Tony Delk";
          input[10] = "Shawn Bradley";
          input[11] = "Travis Best";
          //The next six inputs will be for the third team
          input[12] = "KNICKS";
          input[13] = "Mike Sweetney";
          input[14] = "Allan Houston";
          input[15] = "Howard Eisley";
          input[16] = "Kurt Thomas";
          input[17] = "Shanon Anderson";
     //This method returns the strings one after the other.
     public String getNextString()
          StringNum++;
          return input[StringNum];
}What I'm supposed to do with this is sort that data by last names within each team. By that I mean I have to sort input[1] through input[5] by last names, input[7] through input[11] by last names, and same for the Knicks team. I'm not sure how to do 3 separate sorts within an array.
The output should look like this:
KNICKS:
Sharon Anderson
Howard Eisley
Allan Houston
Mike Sweetney
Kurt Thomas
Any help is greatly appreciated!

Yeah, I don't really understand it. But my professor actually gave us that code to work with to be part of a bigger assignment. I actually just posted another question about the same assignment if you want to look at that to see if it might help.
I dunno how to use the insert link button on here so I'll just let you copy and paste if you are interested in helping me out... Thanks!
It's here >>> http://forum.java.sun.com/thread.jspa?threadID=5268839

Sorting between multiple arrays.

I thought that I had posted this yesterday; however as I can not find my post...
I need assistance with part of a project where I need to sort between multiple arrays; using one of the columns as the sort criteria. The arrays contain integers, strings, and doubles; however I would like to sort and display the arrays alphabetically using the string column. I was told that a bubble array may work, however as I can not find specific information on the use of a bubble array, I really don't know where to start. The arrays look like the following:
productArray[0] = new Product(1, "binder ", 15, 1.5, 0, 0);
productArray[1] = new Product(2, "marker ", 13, .5, 0, 0);
productArray[2] = new Product(3, "paper ", 24, .95, 0, 0);
productArray[3] = new Product(4, "pen ", 5, .25, 0, 0); \
Any assistance that anyone could provide would be greatly appreciated. I am a newbie when it comes to Java and the course materials are extremely vague.
Dman

Thank you for your assistance.
The site that I found to be most helpful was the http://www.onjava.com/lpt/a/3286 site; however I am still experiencing problems. I have added code to the program as noted below:
public class Inventoryprogrampart3
/** Creates a new instance of Main */
* @param args the command line arguments
public static void main(String[] args)
// create Scanner to obtain input from command window
java.util.Scanner input = new java.util.Scanner( System.in );
double totalInventoryValue = 0;
NumberFormat nf = NumberFormat.getCurrencyInstance();
System.out.println(); // Displays a blank line
System.out.println( " Welcome to the Inventory Program - Part 2 " ); // Display the string
System.out.println( " ----------------------------------------- " ); // displays a line of characters
System.out.println(); // Displays a blank line
System.out.println( "This program will output an office supply inventory" ); // Display the string
System.out.println( "listing that includes item numbers for the" ); // Display the string.
System.out.println( "inventoried products, the items product names, the" ); // Display the string.
System.out.println( "quantity of each product in stock, the unit price" ); // Display the string
System.out.println( "for each product, the total value of each products" ); // Display the string
System.out.println( "inventory, and a total value of the entire inventory." ); // Display the string
System.out.println(); // Displays a blank line
System.out.println( "*****************************************************" ); // Displays a line of characters
System.out.println(); // Displays a blank line
Product[] productArray = new Product[ 7 ]; // creates 7 product arrays
// adds data to the 7 arrays
productArray[0] = new Product();
productArray[0].setitemNumber(1);
productArray[0].setproductName ( "binder" );
productArray[0].setitemQuantity(15);
productArray[0].setitemPrice(1.5);
productArray[0].setinventoryValue(0);
productArray[1] = new Product();
productArray[1].setitemNumber(2);
productArray[1].setproductName( "paper" );
productArray[1].setitemQuantity(24);
productArray[1].setitemPrice(.95);
productArray[1].setinventoryValue(0);
productArray[2] = new Product();
productArray[2].setitemNumber(4);
productArray[2].setproductName( "pen" );
productArray[2].setitemQuantity(5);
productArray[2].setitemPrice(.25);
productArray[2].setinventoryValue(0);
productArray[3] = new Product();
productArray[3].setitemNumber(3);
productArray[3].setproductName( "marker" );
productArray[3].setitemQuantity(13);
productArray[3].setitemPrice(.5);
productArray[3].setinventoryValue(0);
productArray[4] = new Product();
productArray[4].setitemNumber(5);
productArray[4].setproductName( "pencil" );
productArray[4].setitemQuantity(28);
productArray[4].setitemPrice(.4);
productArray[4].setinventoryValue(0);
productArray[5] = new Product();
productArray[5].setitemNumber(7);
productArray[5].setproductName( "tape" );
productArray[5].setitemQuantity(14);
productArray[5].setitemPrice(1.65);
productArray[5].setinventoryValue(0);
productArray[6] = new Product();
productArray[6].setitemNumber(6);
productArray[6].setproductName( "staples" );
productArray[6].setitemQuantity(13);
productArray[6].setitemPrice(1.25);
productArray[6].setinventoryValue(0);
System.out.println( "Inventory listing prior to sorting by product name:" );
System.out.println(); // Displays a blank line
System.out.println( "Item #"+"\t"+"Product Name"+"\t"+"Stock"+"\t"+"Price"+"\t"+"Total Value"); // Displays a header line for the inventory array display
System.out.println(); // Displays a blank line
System.out.println( "-----------------------------------------------------" ); // Displays a line of characters
System.out.println(); // Displays a blank line
for (int i=0; i<=6; i++)
Product products = productArray;
String productName = products.getproductName();
int itemNumber = products.getitemNumber();
int itemQuantity = products.getitemQuantity();
double itemPrice = products.getitemPrice();
double inventoryValue = products.getinventoryValue();
System.out.println( productArray[i].getitemNumber() +"\t"+ productArray[i].getproductName() +"\t"+"\t" + productArray[i].getitemQuantity() +"\t"+ nf.format(productArray[i].getitemPrice()) +"\t"+ nf.format(productArray[i].getinventoryValue()) );
Arrays.sort(productArray);
System.out.println( "-----------------------------------------------------" ); // Displays a line of characters
System.out.println(); // Displays a blank line
System.out.println( "Inventory listing after being sorted by product name:" );
System.out.println(); // Displays a blank line
System.out.println( "Item #"+"\t"+"Product Name"+"\t"+"Stock"+"\t"+"Price"+"\t"+"Total Value"); // Displays a header line for the inventory array display
System.out.println(); // Displays a blank line
System.out.println( "-----------------------------------------------------" ); // Displays a line of characters
for(int i=0; i <= 6; i++)
totalInventoryValue = totalInventoryValue + productArray[i].getinventoryValue(); // calculates the total value of the entire products inventory
System.out.println( productArray[i].getitemNumber() +"\t"+ productArray[i].getproductName() +"\t"+"\t"+ productArray[i].getitemQuantity() +"\t"+ nf.format(productArray[i].getitemPrice()) +"\t"+ nf.format(productArray[i].getinventoryValue()) );
}// end for
System.out.println(); // Displays a blank line
System.out.println( "The total value of the entire inventory is: " + nf.format(totalInventoryValue) ); // Displays the entire inventory value
System.out.println(); // Displays a blank line
System.out.println( "*****************************************************" ); // Displays a line of characters
} // end public static void main
}// end public class Inventoryprogrampart3 main
The following utilities have been set:
import java.io.*;
import java.text.*;
import java.util.Scanner;
import java.util.*;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Comparator;
The program compiles, however when I try to run the program I receive the following error (which outputs about 1/2 way through the program:
Exception in thread "main" java.lang.ClassCastException: Product can not be cast to java language comparable.
(along with a listing of other errors - I can't even get my cut and paste to work on my command prompt window).
I've tried about 50 different iterations and nothing seems to work.

Custom Sort for nodes in a hierarchy

Hi All,
I would like to know how to sort nodes according to a specific order in a hierarchy. I know at the hierarchy level you can set the StandardHierSort property to a custom property i.e CustSortOrder.
But for the custom property CustSortOrder, how do i set it up so the nodes in the hierarchy will be sorted according to the custom list?
Thanks
R

This is right out of the MDM_User_guide (Look under Custom Sort Order)
Custom Sort Order
Nodes can also be sorted in any explicit custom sort order (although limbs are always sorted
ahead of leaves.) The sort order can be defined by any property that has a property data type of
SortOrder. (The SortOrder data type is special case of an Integer data type.) By default, any
Hyperion MDM installation includes a property called Sort Order (assigned to the Default
property category) that can be used for this purpose.
To sort a hierarchy according to the value of a node-level sort order property, the hierarchylevel
property StandardHierSort must have its value set to point to the appropriate node-level
property that contains the sort order.
A custom sort order can also be used that applies only to a specific Hyperion MDM user ID,
enabling users to customize their display of Hyperion MDM data without impacting other users
of the same hierarchy. This is controlled by the hierarchy-level property UserHierSort. If this
property has been set to point to a node-level property that has a data type of Sort Order, then
this sort order takes precedence over both the StandardHierSort property and the default sort
order.
If there is no value assigned to the hierarchy-level property StandardHierSort nor to
UserHierSort, then the default sort order is applied.
The value of a custom sort order property can be set in any of the following ways:
1.Sort order values can be loaded into a node-level sort order property when data is initially
imported into Hyperion MDM (see following for details.)
2. Explicit values can be defined for the sort order property for any node.
If a sort order property has been selected for a hierarchy’s StandardHierSort or UserHierSort
properties, then the Order Children menu option is available by right-clicking on any node
in a hierarchy. This opens a dialog box that enables the sort order of limbs and leaves to be
set graphically.
3. A node-level sort order property might be defined as Derived, and so might be automatically
populated with a sort order.

How to sort jTree Nodes

Hi,
I am interested in whats the easiest way to sort jTree Nodes alphabetically. Is there any Method to do this directly or may i use something like quicksort?
Thanks for help
Mirco

Thanks Hamed,
Well, I work in your code, and I post here.
public static DefaultMutableTreeNode sortTree(DefaultMutableTreeNode root) {
 for (int i =0; i<root.getChildCount()-1; i++) {
 DefaultMutableTreeNode node = (DefaultMutableTreeNode) root.getChildAt(i);
 String nt = node.getUserObject().toString();
 for (int j=i+1;j<=root.getChildCount()-1;j++)
 DefaultMutableTreeNode prevNode = (DefaultMutableTreeNode) root.getChildAt(j);
 String np = prevNode.getUserObject().toString();
 System.out.println(nt+" "+np);
 if (nt.compareToIgnoreCase(np)>0) {
 root.insert(node, j);
 root.insert(prevNode, i);
 if (node.getChildCount() > 0) {
 node = sortTree(node);
 return root;
 }and this code I used after include in jtree
public void jTreeSortingBegin()
 dn = (DefaultMutableTreeNode)treeModel.getRoot();
 treeModel.reload();
 dn = sortTree(dn);
 treeModel.reload(dn);
 }for exemple
addObject(jTextField1.getText());
 jTreeSortingBegin();

XML file - Child Nodes Array

Just starting to learn about XML.
I have a simple XML file that I created which is as follows
<?xml version="1.0" encoding="utf-8" ?>
<Probes>
<Probe>
<Location>Ambient</Location>
</Probe>
<Probe>
<Location>panel1</Location>
</Probe>
<Probe>
<Location>panel2</Location>
</Probe>
<Probe>
<Location>panel3</Location>
</Probe>
</Probes>
Using XML Property Node - Child Nodes Array results in an array of 9 elements:
#text
Probe
#text
Probe
#text
Probe
#text
Probe
#text
My question is what are all the #text that are there? Shouldn't the child nodes be just the probes?
Solved!
Go to Solution.

It sounds to me like you may be heading down a dark path. Instead of using the 'Child Nodes Array' and fighting through the complications like extraneous text nodes, let me suggest you look into XPath and use 'Get All Matched Nodes.vi' or 'Get First Matched Node.vi' to get the elements. XPath makes parsing XML a breeze.
For Example:
Of course I hope that using XP does not mean you are using LV8.6 or earlier since the XPath VIs are new to LV9.
If you are using LV8.6 or earlier I suggest looking into the .NET functions to implement XPath. Once you get the hang of it, it still beats trying to parse XML the old fashioned way.
As to the editor, I generate very few XML files by hand, mostly I get them from other programs and parse them in LV. Again, XPath smooths out the rough edges.

Sort A Node Array?

Similar Messages

Maybe you are looking for