多步无限撤销及恢复算法与实现

Arithmetics and realization of more steps infinite undo and redo

在传统与改进2种情况下对Undo及Redo算法的需求作了详细分析,结合数据文档编辑为每种情况的解决给出了一套完整的算法,并对无限制撤销恢复的多步算法给出了实例验证。直接借助或使用该方案可以提高软件开发性能,并增强软件应用的灵活性。此外,使用链表顺序存储结构处理树形存储结构,解决了操作序列中出现多叉的关键问题。

On two conditions of traditional and improving, the article analyzes demand of Undo and Redo arithmetics, gives a set of integral arithmetics by eombining data file edit and presents examples about more steps infinite arithmetics. It can improve software developing function, and enhance mobility of soft- ware application. Furthermore, more forks key question ean be solved using linked list storage frame to deal with tree storage frame in the oDerating list.