test.java

这是用java写的c++扫描程序

/*
 * test.java
 *
 * Created on 2007年3月12日, 下午11:36
 *
 * To change this template, choose Tools | Template Manager
 * and open the template in the editor.
 */

package CCodeSearch;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.TreeMap;

/**
 *
 * @author Administrator
 */
public class test {
    
    /** Creates a new instance of test */
    public test() {
    }
    public static void main(String args[]){
        String str[];
        TreeMap tree=new TreeMap();
        String context;
        try{
                BufferedReader in =new BufferedReader(new FileReader("FilterFile.txt"));
                while((context=in.readLine())!=null){
                    //System.out.println(context);
                    str=context.split(" ");
                    tree.put(str[0],str[1]);
                    //System.out.println(str[0]);
                }
                in.close();
            }catch(IOException e){
                e.printStackTrace();
            }
        if(tree.containsKey("int"))
            System.out.println("tre");
           /*String[][] code={{"bool","基本数据类型"},{"char","基本数据类型"},{"unsigned","基本数据类型"},{"short","基本数据类型"}
    ,{"int","基本数据类型"},{"long","基本数据类型"},{"float","基本数据类型"},{"double","基本数据类型"},{"class","关键字"},{"include","关键字"}
    ,{"cin","关键字"},{"main","关键字"},{"cout","关键字"},{"main","关键字"},{"public","关键字"},{"private","关键字"}
    ,{"protected","关键字"},{"friend","关键字"},{"void","关键字"},{"if","关键字"},{"else","关键字"},{"do","关键字"}
    ,{"while","关键字"},{"for","关键字"},{"break","关键字"},{"switch","关键字"},{"case","关键字"},{"default","关键字"}
    ,{"!","特殊符号"},{"#","特殊符号"},{"%","特殊符号"},{"^","特殊符号"},{"&","特殊符号"},{"*","特殊符号"}
    ,{"_","特殊符号"},{"+","特殊符号"},{"=","特殊符号"},{":","特殊符号"},{"-","特殊符号"},{"~","特殊符号"}
    ,{"<","特殊符号"},{">","特殊符号"},{"/","特殊符号"},{"\\","特殊符号"},{"'","特殊符号"},{"\"","特殊符号"}
    ,{";","特殊符号"},{".","特殊符号"},{"(","特殊符号"},{")","特殊符号"},{"{","特殊符号"},{"}","特殊符号"}
    ,{"[","特殊符号"},{"]","特殊符号"}
    };
        TreeMap tree =new TreeMap();
        Vector v=new Vector();
        v.add("a");
        v.add("b");
        v.add("c");
        if(v.contains("a"))
            System.out.println("dd");
        
        String s="abc";*/
        //System.out.println();
       /* int i=0;
        for(i=0;i<code.length;i++)
            tree.put(code[i][0],code[i][1]);
        System.out.println(code.length);
        System.out.println(tree.size());
        if(tree.containsKey("d"))
            System.out.println("tre");*/
    }
}