public static xBplusTreeBytes ReadOnly(string treefileName, string blockfileName)
{
BplusTreeBytes tree = BplusTreeBytes.ReadOnly(treefileName, blockfileName);
int prefixLength = tree.MaxKeyLength();
return(new xBplusTreeBytes(tree, prefixLength));
}
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));
}
public new static hBplusTreeBytes ReOpen(string treefileName, string blockfileName)
{
BplusTreeBytes tree = BplusTreeBytes.ReOpen(treefileName, blockfileName);
int prefixLength = tree.MaxKeyLength();
return(new hBplusTreeBytes(tree, prefixLength));
}
public new static hBplusTreeBytes ReOpen(Stream treefile, Stream blockfile)
{
BplusTreeBytes tree = BplusTreeBytes.ReOpen(treefile, blockfile);
int prefixLength = tree.MaxKeyLength();
return(new hBplusTreeBytes(tree, prefixLength));
}
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;
}
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;
}
