多键值字符串键树的原理及实现

Title Principle and Realization of Multi-key-assignments String Digital Search Tree

允许一个字符串关键字对应多个键值,且字符串关键字又非常多时,用键树保存有关的信息,在算法实现上有很好的时空性能.本文给出了解决该问题的一个实用的C++算法,并对源码作了详细的分析,最后给出了一个该算法在表达式解释系统中的应用实例.

If a string keyword correspond to several key assignments and there are much more string, using digital search tree store concerned information has a very good space time performance. The paper gives a utility C++ arithmetic to solve the question with more detailed analysis of the source code. In conclusion, a instance of expression interpreter system using the arithmetic is gived.