static void Main(string[] args)
{
Console.Write("Please select your file:");
string FilePath = string.Empty;
// Prompt the user to get the .dat file
using (OpenFileDialog openFileDialog = new OpenFileDialog())
{
openFileDialog.InitialDirectory = Environment.CurrentDirectory;
if (openFileDialog.ShowDialog() == DialogResult.OK)
{
FilePath = openFileDialog.FileName;
}
}
// Filepath string
Console.WriteLine(FilePath);
// Heap Size
Console.Write("Please enter heap size:");
int MAX_HEAP_SIZE = Convert.ToInt32(Console.ReadLine());
Console.Write("Please Enter Merge Amount(k):");
int MERGE_K = Convert.ToInt32(Console.ReadLine());
if (string.IsNullOrEmpty(FilePath))
{
Console.WriteLine("Not a valid file path.");
return;
}
bool bDisplayValues = false;
// Ask to display sorted values
Console.WriteLine("Do you want to display sorted results? ([Y]/[N])");
// Display the sorted values
if (Console.ReadLine().ToLower() == "y")
{
bDisplayValues = true;
}
// Create Heap
Heap <int> BinaryHeap = new Heap <int>();
// Read in our Binary data file, Int32 at a time.
BinaryReader binaryReader = new BinaryReader(File.Open(FilePath, FileMode.OpenOrCreate));
int Counter = 0; // Counter for Records in a Heap <= MAX_HEAP
int FileCounter = 0; // Naming convention FileName = FileTotal + 1
// Read all the binary data
while (binaryReader.PeekChar() != -1)
{
if (Counter >= MAX_HEAP_SIZE)
{
BinaryHeap.WriteToFile("data_" + FileCounter.ToString() + ".bin");
FileCounter++;
Counter = 0;
}
BinaryHeap.Insert(binaryReader.ReadInt32());
Counter++;
}
binaryReader.Close();
// Write out the final Heap
BinaryHeap.WriteToFile("data_" + FileCounter.ToString() + ".bin");
FileCounter++;
BinStruct[] binStructs = new BinStruct[MERGE_K];
Heap <BinStruct> fileHeap = new Heap <BinStruct>();
int TOTAL_JUMPS = FileCounter / 2;
//
// Now start the Merging files process to form 1 sorted file
// Merge = k
int counter = 0;
// Merge Files:
while (true)
{
Console.WriteLine($"Jumps to do: {TOTAL_JUMPS}");
for (int jumpIndex = 0; jumpIndex < TOTAL_JUMPS; jumpIndex++)
{
for (int i = 0; i < MERGE_K; i++)
{
// Build our struct
binStructs[i] = new BinStruct(new BinaryFile("data_" + counter + ".bin", false));
binStructs[i].id = binStructs[i].file.binInFile.ReadInt32();
Console.WriteLine($"Opening file #{counter} - {binStructs[i].file.binInFile.BaseStream.Length}bytes (Position: {binStructs[i].file.binInFile.BaseStream.Position})");
fileHeap.Insert(binStructs[i]);
counter++;
}
BinaryWriter binaryWriter =
new BinaryWriter(File.Open("data_" + FileCounter + ".bin", FileMode.OpenOrCreate));
// PROBLEM LIES HERE
// Next File is being read even tho it shouldn't be read yet.
int badFile = 0;
while (true)
{
// Break when all files have been read to the end
if (badFile == MERGE_K)
{
break;
}
BinStruct value = fileHeap.ExtractMin();
binaryWriter.Write(value.id);
// Read next int
if (value.file.binInFile.BaseStream.Position == value.file.binInFile.BaseStream.Length)
{
Console.WriteLine($"\t {value.file.binInFile.BaseStream.Position} - {value.file.binInFile.BaseStream.Length}");
badFile++;
continue;
}
value.id = value.file.binInFile.ReadInt32();
fileHeap.Insert(value);
}
while (fileHeap.Count > 0)
{
BinStruct value = fileHeap.ExtractMin();
Console.WriteLine(value.id);
binaryWriter.Write(value.id);
}
Console.WriteLine($"{FileCounter} : {binaryWriter.BaseStream.Length} bytes Heap: {fileHeap.Count}");
binaryWriter.Close();
FileCounter++;
fileHeap.Flush();
// Close our files
for (int i = 0; i < MERGE_K; i++)
{
// Build our struct
binStructs[i].file.Close();
}
}
if (TOTAL_JUMPS <= 0)
{
break;
}
TOTAL_JUMPS = TOTAL_JUMPS / 2;
}
// Display our final sorted file values:
if (bDisplayValues)
{
BinaryReader bwBinaryReader = new BinaryReader(File.Open("data_" + (FileCounter - 1) + ".bin", FileMode.OpenOrCreate));
int newCount = 0;
while (bwBinaryReader.PeekChar() != -1)
{
Console.WriteLine($"[{newCount}] - {bwBinaryReader.ReadInt32()}");
newCount++;
}
bwBinaryReader.Close();
}
// Cleanup
CleanupFiles(FileCounter);
Console.ReadLine();
}
public int CompareTo(Object Item)
{
BinStruct that = (BinStruct)Item;
return(this.id.CompareTo(that.id));
}