private void Init()
{
System.Threading.Tasks.Task.Factory.StartNew(() =>
{
while (true)
{
lock (this)
{
Current_Time = DateTime.Now;
System.Threading.Monitor.Wait(this, 100);
}
}
});
try
{
var buffer = new byte[512];
Metadata_Stream.Seek(0, SeekOrigin.Begin);
Metadata_Stream.Read(buffer, 0, buffer.Length);
var metadata = Metadata.From_Bytes(buffer);
Root = Read_Root(metadata.Root_Address);
if (Root.IsValid)
{
Order = metadata.Order;
_data_Pointer = metadata.DataStream_Length;
_index_Pointer = metadata.IndexStream_Length;
Cluster_Data_Length = metadata.Clustered_Data_Length;
Alignment = metadata.Alignment;
_node_Factory = new Node_Factory <T>(_key_Serializer, Order, Alignment, Cluster_Data_Length);
_block_Size = _node_Factory.Size_In_Bytes(Order);
_data_Serializer = new Data_Serializer <T>(_key_Serializer, Alignment, 2, 1024);
_pending_Changes = new Pending_Changes <T>(_block_Size, _index_Pointer, _data_Pointer, _node_Factory, _data_Serializer);
_metadata = metadata;
return;
}
}
catch (Exception) { }
var root = _node_Factory.Create_New(true);
Write_Node(root);
_pending_Changes.Append_New_Root(root);
}
public Node_Split_Result <T> Split(Node_Factory <T> node_Factory)
{
int size = Keys.Length;
var node_Left = this;
var node_Right = node_Factory.Create_New(node_Left.IsLeaf);
node_Right.Parent = node_Left.Parent;
var mid_Key = node_Left.Keys[size / 2];
node_Right.Key_Num = size - size / 2 - 1;
for (int i = 0; i < node_Right.Key_Num; i++)
{
node_Right.Keys[i] = node_Left.Keys[i + (size / 2 + 1)];
node_Right.Pointers[i] = node_Left.Pointers[i + (size / 2 + 1)];
if (!IsLeaf)
{
node_Right.Children[i] = node_Left.Children[i + (size / 2 + 1)];
}
else
{
for (int j = 0; j < _clustered_Data_Length; j++)
{
node_Right.Data[i, j] = node_Left.Data[i + (size / 2 + 1), j];
}
}
if (node_Right.Children[i] != null)
{
node_Right.Children[i].Parent = node_Right;
}
}
node_Right.Pointers[node_Right.Key_Num] = node_Left.Pointers[size];
node_Right.Children[node_Right.Key_Num] = node_Left.Children[size];
for (int j = 0; j < _clustered_Data_Length; j++)
{
node_Right.Data[node_Right.Key_Num, j] = node_Left.Data[size, j];
}
if (node_Right.Children[node_Right.Key_Num] != null)
{
node_Right.Children[node_Right.Key_Num].Parent = node_Right;
}
node_Left.Key_Num = size / 2;
if (node_Left.IsLeaf)
{
node_Left.Key_Num++;
node_Right.Pointers[0] = node_Left.Pointers[0];
node_Right.Children[0] = node_Left.Children[0];
node_Left.Pointers[0] = node_Right.Address; //TODO double linked list
mid_Key = node_Left.Keys[size / 2 + 1];
}
return(new Node_Split_Result <T> {
Node_Left = node_Left, Node_Right = node_Right, Mid_Key = mid_Key
});
}
