Created
May 20, 2012 12:22
-
-
Save brokendish/2757902 to your computer and use it in GitHub Desktop.
NodeDataSet
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package brokendish; | |
import java.util.ArrayList; | |
import java.util.Collections; | |
import java.util.Comparator; | |
public class NodeDataSet { | |
public ArrayList<NodeDataStruct> NodeDataSet(){ | |
ArrayList<NodeDataStruct> nodeData = new ArrayList<NodeDataStruct>(); | |
for (int i=1;i<3;i++){ | |
NodeDataStruct pre = new NodeDataStruct(); | |
//PrefixDataStructにデータをセット | |
pre.setNode("Node000" + i); | |
pre.setLevel("0" + i); | |
pre.setIndex("0000" + i); | |
pre.setTekiyo("ABCDEFG" + i); | |
//ArrayListに追加 | |
nodeData.add(pre); | |
NodeDataStruct preA = new NodeDataStruct(); | |
preA.setNode("NodeAA000" + i); | |
preA.setLevel("0" + i); | |
preA.setIndex("0000" + i); | |
preA.setTekiyo("ABCDEFGああああああ" + i); | |
//ArrayListに追加 | |
nodeData.add(preA); | |
} | |
NodeDataStruct preA = new NodeDataStruct(); | |
preA.setNode("NodeAA0987"); | |
preA.setLevel("01"); | |
preA.setIndex("0000"); | |
preA.setTekiyo("ABCDEFGああああああ"); | |
//ArrayListに追加 | |
nodeData.add(preA); | |
NodeDataStruct preC = new NodeDataStruct(); | |
preC.setNode("NodeAA0986"); | |
preC.setLevel("01"); | |
preC.setIndex("0000"); | |
preC.setTekiyo("ABCDEFGああああああ"); | |
//ArrayListに追加 | |
nodeData.add(preC); | |
NodeDataStruct preB = new NodeDataStruct(); | |
preB.setNode("NodeAA0985"); | |
preB.setLevel("99"); | |
preB.setIndex("0000"); | |
preB.setTekiyo("ABCDEFGああああああ"); | |
//ArrayListに追加 | |
nodeData.add(preB); | |
for(int j=0;j<nodeData.size();j++){ | |
System.out.println("MAE--"+nodeData.get(j).getNode()+ " ---- " +nodeData.get(j).getLevel()); | |
} | |
System.out.println("-------------------------------------------------------------------------------------------------------"); | |
Collections.sort(nodeData, new TreeDataSort()); | |
for(int j=0;j<nodeData.size();j++){ | |
System.out.println("ATO--"+nodeData.get(j).getNode()+ " ---- " +nodeData.get(j).getLevel()); | |
} | |
//--------------------------------------- | |
return nodeData; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment