the definition of coupled-switches(cs)and the traversal algorithm for css using the depth-first method are proposed.
首先给出分段开关对等相关定义,提出基于深度优先的分段开关对遍历算法。
this later patch contains a reorganization to support a different 「skipping」 queue traversal algorithm of the queue with future patches.
后一个补丁包含对将来补丁中不同的 「跳跃式」队列遍历算法的识别和支持。
note the caching is not really required for the particular traversal algorithm you are using, but i leave it in to show how to do this if it is needed as you expand this tool in the future.
注意,这个缓存对于您使用的特定遍历算法并不真正需要,我在这里使用它只是为了展示当您将来需要扩展这个工具时应该怎样做。
at present , preorder traversal algorithm is wildly used for oid serializing. however, great maintenance overhead is inevitable when we adopt this algorithm.
现在普遍采用的oid序列化方法是前序算法,但是该算法代价很大。