#include <vector>
#include <iostream>
#include "inode.h"
#include "superblock.h"
#include "vfs.h"
#include "btree.h"

using namespace std;

int
main(void) {
  int i = 0;
  ubixfsInode * inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode -> name, "h");
  bTree * tree = new bTree(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "m");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "a");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "b");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "c");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "d");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "e");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "f");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "g");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "j");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  inode = (ubixfsInode *)malloc(sizeof(ubixfsInode));
  memset(inode, 0, sizeof(ubixfsInode));
  strcpy(inode->name, "n");
cout << "---Inserting " << inode->name << "---" << endl;
  tree->Insert(inode);

  ubixfsInode * tmpInode = tree->GetFirstNode();
  if (tmpInode == NULL) cout << "GetFirstNode() returns null" << endl;
  while (tmpInode != NULL) {
    cout << "node[" << i++ << "]: " << tmpInode->name << endl;
    tmpInode = tmpInode->next;
  } // while
  cout << sizeof(struct bNode) << endl;
  tree->Info();
  free(inode);
  return 0;
}