BPlus tree implementation mapping strings to bytes with fixed key length
Inheritance: IByteTree
Esempio n. 1
0
 public static xBplusTreeBytes Initialize(string treefileName, string blockfileName, int PrefixLength, int CultureId,
                                          int nodesize, int buffersize)
 {
     return(new xBplusTreeBytes(
                BplusTreeBytes.Initialize(treefileName, blockfileName, PrefixLength, CultureId, nodesize, buffersize),
                PrefixLength));
 }
Esempio n. 2
0
 public static xBplusTreeBytes Initialize(System.IO.Stream treefile, System.IO.Stream blockfile, int PrefixLength, int CultureId,
                                          int nodesize, int buffersize)
 {
     return(new xBplusTreeBytes(
                BplusTreeBytes.Initialize(treefile, blockfile, PrefixLength, CultureId, nodesize, buffersize),
                PrefixLength));
 }
Esempio n. 3
0
        public static BplusTree Initialize(Stream treefile, Stream blockfile, int keyLength, int cultureId,
                                           int nodesize, int buffersize)
        {
            BplusTreeBytes tree = BplusTreeBytes.Initialize(treefile, blockfile, keyLength, cultureId, nodesize, buffersize);

            return(new BplusTree(tree));
        }
Esempio n. 4
0
        public static xBplusTreeBytes ReadOnly(string treefileName, string blockfileName)
        {
            BplusTreeBytes tree         = BplusTreeBytes.ReadOnly(treefileName, blockfileName);
            int            prefixLength = tree.MaxKeyLength();

            return(new xBplusTreeBytes(tree, prefixLength));
        }
Esempio n. 5
0
        public new static hBplusTreeBytes ReOpen(Stream treefile, Stream blockfile)
        {
            BplusTreeBytes tree         = BplusTreeBytes.ReOpen(treefile, blockfile);
            int            prefixLength = tree.MaxKeyLength();

            return(new hBplusTreeBytes(tree, prefixLength));
        }
Esempio n. 6
0
        public static xBplusTreeBytes ReOpen(System.IO.Stream treefile, System.IO.Stream blockfile)
        {
            BplusTreeBytes tree         = BplusTreeBytes.ReOpen(treefile, blockfile);
            int            prefixLength = tree.MaxKeyLength();

            return(new xBplusTreeBytes(tree, prefixLength));
        }
Esempio n. 7
0
        public static BplusTree Initialize(System.IO.Stream treefile, System.IO.Stream blockfile, int KeyLength, int CultureId,
                                           int nodesize, int buffersize)
        {
            BplusTreeBytes tree = BplusTreeBytes.Initialize(treefile, blockfile, KeyLength, CultureId, nodesize, buffersize);

            return(new BplusTree(tree));
        }
Esempio n. 8
0
        public new static hBplusTreeBytes ReOpen(string treefileName, string blockfileName)
        {
            BplusTreeBytes tree         = BplusTreeBytes.ReOpen(treefileName, blockfileName);
            int            prefixLength = tree.MaxKeyLength();

            return(new hBplusTreeBytes(tree, prefixLength));
        }
Esempio n. 9
0
 public new static hBplusTreeBytes Initialize(Stream treefile, Stream blockfile, int PrefixLength, int cultureId,
                                              int nodesize, int buffersize)
 {
     return(new hBplusTreeBytes(
                BplusTreeBytes.Initialize(treefile, blockfile, PrefixLength, cultureId, nodesize, buffersize),
                PrefixLength));
 }
Esempio n. 10
0
        public static BplusTree Initialize(string treefileName, string blockfileName, int KeyLength, int CultureId,
                                           int nodesize, int buffersize)
        {
            BplusTreeBytes tree = BplusTreeBytes.Initialize(treefileName, blockfileName, KeyLength, CultureId, nodesize, buffersize);

            return(new BplusTree(tree));
        }
Esempio n. 11
0
 public xBplusTreeBytes(BplusTreeBytes tree, int prefixLength)
 {
     if (prefixLength<3)
     {
         throw new BplusTreeException("prefix cannot be smaller than 3 :: "+prefixLength);
     }
     if (prefixLength>tree.MaxKeyLength())
     {
         throw new BplusTreeException("prefix length cannot exceed keylength for internal tree");
     }
     this.tree = tree;
     this.prefixLength = prefixLength;
 }
Esempio n. 12
0
 public xBplusTreeBytes(BplusTreeBytes tree, int prefixLength)
 {
     if (prefixLength < 3)
     {
         throw new BplusTreeException("prefix cannot be smaller than 3 :: " + prefixLength);
     }
     if (prefixLength > tree.MaxKeyLength())
     {
         throw new BplusTreeException("prefix length cannot exceed keylength for internal tree");
     }
     this.tree         = tree;
     this.prefixLength = prefixLength;
 }
Esempio n. 13
0
        public static BplusTree Initialize(string treefileName, string blockfileName, int keyLength, int cultureId)
        {
            BplusTreeBytes tree = BplusTreeBytes.Initialize(treefileName, blockfileName, keyLength, cultureId);

            return(new BplusTree(tree));
        }
Esempio n. 14
0
 public static xBplusTreeBytes Initialize(System.IO.Stream treefile, System.IO.Stream blockfile, int PrefixLength)
 {
     return(new xBplusTreeBytes(
                BplusTreeBytes.Initialize(treefile, blockfile, PrefixLength),
                PrefixLength));
 }
Esempio n. 15
0
 public hBplusTreeBytes(BplusTreeBytes tree, int hashLength) : base(tree, hashLength)
 {
     // null out the culture context to use the naive comparison
     this.tree.NoCulture();
 }
Esempio n. 16
0
 public new static hBplusTreeBytes Initialize(Stream treefile, Stream blockfile, int PrefixLength)
 {
     return(new hBplusTreeBytes(
                BplusTreeBytes.Initialize(treefile, blockfile, PrefixLength),
                PrefixLength));
 }
Esempio n. 17
0
 public new static hBplusTreeBytes Initialize(string treefileName, string blockfileName, int PrefixLength, int cultureId)
 {
     return(new hBplusTreeBytes(
                BplusTreeBytes.Initialize(treefileName, blockfileName, PrefixLength, cultureId),
                PrefixLength));
 }
Esempio n. 18
0
        public static BplusTree ReOpen(System.IO.Stream treefile, System.IO.Stream blockfile)
        {
            BplusTreeBytes tree = BplusTreeBytes.ReOpen(treefile, blockfile);

            return(new BplusTree(tree));
        }
Esempio n. 19
0
        public static BplusTree Initialize(string treefileName, string blockfileName, int KeyLength)
        {
            BplusTreeBytes tree = BplusTreeBytes.Initialize(treefileName, blockfileName, KeyLength);

            return(new BplusTree(tree));
        }
Esempio n. 20
0
 public hBplusTreeBytes(BplusTreeBytes tree, int hashLength)
     : base(tree, hashLength)
 {
     // null out the culture context to use the naive comparison
     this.tree.NoCulture();
 }
Esempio n. 21
0
        public static BplusTree Initialize(System.IO.Stream treefile, System.IO.Stream blockfile, int KeyLength)
        {
            BplusTreeBytes tree = BplusTreeBytes.Initialize(treefile, blockfile, KeyLength);

            return(new BplusTree(tree));
        }
Esempio n. 22
0
 public static xBplusTreeBytes Initialize(string treefileName, string blockfileName, int PrefixLength)
 {
     return(new xBplusTreeBytes(
                BplusTreeBytes.Initialize(treefileName, blockfileName, PrefixLength),
                PrefixLength));
 }
Esempio n. 23
0
        public static BplusTree ReadOnly(string treefileName, string blockfileName)
        {
            BplusTreeBytes tree = BplusTreeBytes.ReadOnly(treefileName, blockfileName);

            return(new BplusTree(tree));
        }
Esempio n. 24
0
 public new static hBplusTreeBytes Initialize(System.IO.Stream treefile, System.IO.Stream blockfile, int PrefixLength, int CultureId)
 {
     return(new hBplusTreeBytes(
                BplusTreeBytes.Initialize(treefile, blockfile, PrefixLength, CultureId),
                PrefixLength));
 }