2
来源:互联网 发布:kruskal算法并查集 编辑:程序博客网 时间:2024/04/29 12:45
package com.xingzhong.ore;
import java.util.ArrayList;
public class Glass {
private String glassId;
private String grade;
private Batch batch;
private Lot lot;
private ArrayList<String[]> glassList = new ArrayList<String[]>();
public Batch getBatch() {
return batch;
}
public void setBatch(Batch batch) {
this.batch = batch;
}
public Lot getLot() {
return lot;
}
public void setLot(Lot lot) {
this.lot = lot;
}
public Glass(String glassId, String grade) {
super();
this.glassId = glassId;
this.grade = grade;
}
public Glass() {
super();
// TODO Auto-generated constructor stub
}
public String getGlassId() {
return glassId;
}
public void setGlassId(String glassId) {
this.glassId = glassId;
}
public String getGrade() {
return grade;
}
public void setGrade(String grade) {
this.grade = grade;
}
public ArrayList addGlass() {
String glass[] = new String[5];
glass[0] = this.glassId;
glass[1] = this.grade;
glass[2] = batch.getBatchID();
glass[3] = String.valueOf(batch.getBatchSize());
glass[4] = lot.getLotId();
glassList.add(glass);
return glassList;
}
public String[] queryGlass(String glassId) {
String glassCopy[] = null;
// =null;
for (String[] glass : glassList) {
if (glass[0].equals(glassId)) {
glassCopy = glass;
} else {
glass[0] = "no data!";
glassCopy = glass;
}
}
return glassCopy;
}
}