Making Index implementation by red-black-tree Algorithms

소개글

Making Index implementation by red-black-tree Algorithms에 대한 보고서 자료입니다.

본문내용

public RedBlackTree mkIndex(){
f = f1;
try{
while(!f.equals(null)){
BufferedReader br = new BufferedReader(new FileReader(f));
String word = null;
int lineNum = 0;
StringTokenizer strTok;
while(true){
String line = br.readLine();
lineNum++;
if(line == null) break;
strTok = new StringTokenizer(line,\" ,*$%!\\"`'.\\;:?()- \");
while(strTok.hasMoreTokens()){
word = strTok.nextToken();
noise = noiseCheck.noiseWordCheck(word);
isNum = isNumber(word);
if(!noise && word.length()>2 && !isNum){
node = new Node();
node.setKey(word.toLowerCase());
node.getLineNumber().add(lineNum);
rbtree.RB_Insert(node, lineNum);
}
}
}
br.close();
if(f.equals(f1)){
f=f2;
}else if(f.equals(f2)){
f=f3;
}else if(f.equals(f3)){
f=f4;
}else{
f=null;
}
}
}catch(FileNotFoundException ex){ex.getMessage();}
catch(Exception ez){ez.getMessage();}
rbtree.Postorder_Tree_Del(rbtree.getRoot());
return rbtree;
}

키워드

레드블랙트리,   redblack,   알고리즘,   자료구조,   트리,   redblack tree,   rb tree,   makingindex,   레드블랙,   메이킹인덱스