Method for decision node relation in expansion mark language file tree |
Title： |
| Method for decision node relation in expansion mark language file tree |
|
Application Number： |
200510115792 |
Application Date： |
2005/11/11 |
Announcement Date： |
2006/04/12 |
Pub. Date： |
|
Publication Number： |
1758254 |
Announcement Number： |
|
Grant Date： |
|
Granted Pub. Date： |
|
ApplicationType： |
Invention |
State/Country： |
11[China|beijing] |
IPC： |
G06F 17/30 |
Applicant(s)： |
Tsinghua Univ. |
Inventor(s)： |
Feng Jianhua, Li Guoliang, Zhou Lizhu, Qian Qian, Liao Yuguo, Ta Na |
Key Words： |
expansion mark, language file tree, node relation, decision method |
Abstract： |
This invention relates to a judgment method for the relation of nodes in an expansible mark language file tree, which codes the file tree and designs the code of its root node as 1, if node D is the leftmost son node of node A, if the code is integral P, then the code of node D is integral 2P, if node R is the direct right brother node of L, its code is integral Q, the code of R is integral 2Q+1, the position of node N in the brother nodes=the number of rightmost continuous 1 in the binary system expression (N.NUM)2 of node N, if (X.NUM ¡¶1=(Y.NUM) (log2(Y.NUM))-log2(X.NUM)¡·-1 is correct, then node X is the forefather of node Y. |
Claim： |
|
Priority： |
|
PCT： |
|
LegalStatus： |
|
 Relevancy information |
|
|
|
| Other Patents of Same Inventor |
|
|
|
|
| Last Update |
|
|
 |
2008-4-17 |
| |
Selected patents owned by Tsinghua University filed in 2005 are loaded. |
|
2008-3-31 |
| |
Selected patents owned by Tsinghua University filed in 2006 and 2007 are load. |
|
|
