dicstru.java

简单T9输入法模拟

import java.util.*;
import java.text.*;
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import javax.swing.table.*;
import java.lang.*;
import java.io.*;

class DicStru
{   
	public String[][] end=new String[45453][2];//2d array to store the dictionary
	private	static	BufferedReader infile=null;
	private	static	int i=0,j=0;//i is the main subscript,and the j is the other subscript
	private	static	char[] index;//the letter of the word
	private static  String inline="";//temp string

	public DicStru()
	{
		      try
		{
		FileReader frs=new FileReader("linux.words");
		
		infile=new BufferedReader(frs);
while(j<45452)
			{
		inline=infile.readLine();
		end[j][1]=inline;
		inline=inline.toLowerCase(); 
		index=inline.toCharArray();

		while(i<index.length)
			{
			switch(index[i])
				{
				case 'a': index[i]='2';break;
				case 'b': index[i]='2';break;
				case 'c': index[i]='2';break;
				case 'd': index[i]='3';break;
				case 'e': index[i]='3';break;
				case 'f': index[i]='3';break;
				case 'g': index[i]='4';break;
				case 'h': index[i]='4';break;
				case 'i': index[i]='4';break;
				case 'j': index[i]='5';break;
				case 'k': index[i]='5';break;
				case 'l': index[i]='5';break;
				case 'm': index[i]='6';break;
				case 'n': index[i]='6';break;
				case 'o': index[i]='6';break;
				case 'p': index[i]='7';break;
				case 'q': index[i]='7';break;
				case 'r': index[i]='7';break;
				case 's': index[i]='7';break;
				case 't': index[i]='8';break;
				case 'u': index[i]='8';break;
				case 'v': index[i]='8';break;
				case 'w': index[i]='9';break;
				case 'x': index[i]='9';break;
				case 'y': index[i]='9';break;
				case 'z': index[i]='9';break;
				}
				
			
				i++;
		    }
			i=0;
			end[j][0]=String.valueOf(index);
		
		j++;
		}
		

        }
		catch (FileNotFoundException ex)
		{
			System.out.println("no found");
		}

		catch (IOException ex)
		{
			System.out.println(ex.getMessage());
		}
		try
		{
			if(infile!=null) infile.close();
		}
		catch(IOException ex)
		{
		}

	}
	
}