0% found this document useful (0 votes)
3 views

Pha Ooop

Uploaded by

Phúc Hoàng
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Pha Ooop

Uploaded by

Phúc Hoàng
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

GHI FILE

public void themvaofile() throws IOException{


File f = new File("sinhvien.dat");
FileWriter fw = new FileWriter(f,true);
BufferedWriter bw = new BufferedWriter(fw);
for(Student st: dssv){
bw.write(st.toString());
bw.newLine();
}
bw.close();
fw.close();
}
ĐỌC FILE
public void docFile() throws IOException{
File f = new File("nhanvien.txt");
FileReader fr = new FileReader(f);
BufferedReader br = new BufferedReader(fr);
String line = null;
while((line = br.readLine()) != null){
String[] a = line.split("\\$");
NhanVien nv = new NhanVien(a[0],
Double.parseDouble(a[1]),
Double.parseDouble(a[2]),
Double.parseDouble(a[3]),
a[4],a[5],a[6],
Boolean.parseBoolean(a[7]));
dsnv.add(nv);
}
br.close();
fr.close();
}
viewTable
public void viewTable(){
DefaultTableModel model =
(DefaultTableModel) jTable1.getModel();
for(NhanVien nv: dsnv){
String gt;
if(nv.isGt()) gt = "Nam";
else gt = "Nữ";
model.addRow(new Object[]{
nv.getHoten(),
nv.getNgaysinh(),nv.getDiachi(),
gt,nv.getPhongban(),nv.getHsl(),
nv.getThamnien(),nv.getLuongc
oban(),nv.luongthuctien()
});
}
}
Sắp xếp string trong arraylist
public void sapXepTuDien(){
for(int i =0;i<this.tuDien.size()-1;i++){
for(int j=i+1;j<this.tuDien.size();j++){
if(this.tuDien.get(i).getEn().compareToIgnoreCase
(this.tuDien.get(j).getEn()) > 0){
Word tmp = this.tuDien.get(i);
this.tuDien.set(i,this.tuDien.get(j));
this.tuDien.set(j, tmp);
}}}}

BinarySearch
public int binarySearch(int left,int right,String str){
if(right >= left){
int mid = left + (right - left) / 2;
if(tuDien.get(mid).getEn().compareTo(str)==0){
return mid;}
if(tuDien.get(mid).getEn().compareTo(str) >0 ){
return binarySearch(left, mid-1, str); }
return binarySearch(mid+1, right, str); }
return -1; }
Tìm kiếm dùng binarySearch
public String timKiem(String en){
sapXepTuDien();
int ketqua = binarySearch(0, tuDien.size()-1,
en);
if(ketqua != -1){
return tuDien.get(ketqua).getVn();
}
return "";
}

You might also like