* tomar una idea simimar)
*/
+#include <iostream>
#include <string>
+#include <list>
+#include "common.h"
+#include "clave.h"
+#include "clave_fija.h"
+#include "btree_data.h"
/* alias para codear menos :) */
-typedef unsigned char uchar;
/** Encabezado del archivo BTree */
-typedef struct _btree_file_ {
+struct BTreeFileHeader {
uint block_size;
-} BTreeFileHeader;
+};
/** Encabezado de un bloque */
-typedef struct _btree_header_ {
+struct BTreeNodeHeader {
/** Indica a que nivel corresponde un bloque
*
* nivel == 0 : una hoja
/** Cantidad de elementos en el nodo */
unsigned int item_count;
-} BTreeNodeHeader;
+};
/** Crea un nuevo arbol B
*
*/
class BTree {
public:
- BTree (const char *filename, unsigned int block_size, bool create_new_file = false);
+ BTree (const std::string &filename, unsigned int block_size, bool create_new_file = false);
~BTree ();
- void AddKey ();
- void DelKey ();
+ void AddKey (const Clave &k);
+ void DelKey (const Clave &k);
private:
- void write_tree_header ();
- void write_block (uchar *block, uint num);
+ Clave* AddKeyR (const Clave *k, uint node_num, uint &left_child, uint &right_child);
+
+ void WriteFileHeader ();
+
+ void WriteBlock (uchar *block, uint num);
+ uchar *ReadBlock (uint num);
+ uchar *NewBlock (uint &num);
+
void ReadNodoHeader (uchar *node, BTreeNodeHeader *header);
void WriteNodoHeader (uchar *node, BTreeNodeHeader *header);
+ std::list<BTreeData> ReadKeys (uchar *node, BTreeNodeHeader &node_header);
+ void WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<BTreeData> &keys);
+
std::string filename;
BTreeFileHeader header;
* \TODO Ver si vale la pena
*/
FILE *fp;
+
+
+ /* DEBUG */
+ void PrintNode (uint num);
};
#endif // _B_TREE_H