C# (CSharp) Advanced.Algorithms.DataStructures BpTree示例

示例#1

        internal BpTreeEnumerator(BpTree <T> tree, bool asc = true)
        {
            this.asc = asc;

            startNode = asc ? tree.BottomLeftNode : tree.BottomRightNode;
            current   = startNode;

            index = asc ? -1 : current.KeyCount;
        }

示例#2

文件： B+Tree.cs 项目： marcellalves/Advanced-Algorithms

 internal BpTreeEnumerator(BpTree <T> tree)
 {
     bottomLeftNode = tree.BottomLeftNode;
     current        = bottomLeftNode;
 }