public class CircleMenuCanvas extends Canvas implements Runnable{
double pi = Math.PI
public final int MENURIGHT = 1
public final int MENULEFT = 0
Image menuImage[] = new Image[6]
int []jiaodu = {330,30,90,150,210,270}
String menuName[] = {"新游戲","繼續(xù)游戲","游戲設(shè)置","高分榜","游戲幫助","退出游戲"}
int x = getWidth()/2
int y = getHeight()/2
int count = 0
int local
int index = 0
Font f
boolean running = false
/**
* 構(gòu)造方法
*
*/
This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.
