+uchar *BTree::ReadBlock (uint num)
+{
+ uchar *out = new uchar[header.block_size];
+
+ fseek (fp, num*header.block_size + sizeof (BTreeFileHeader), SEEK_SET);
+ fread (out, 1, header.block_size, fp);
+
+ return out;
+}
+
+std::list<BTreeData> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_header)
+{
+ std::list<BTreeData> keys;
+ node += sizeof (BTreeNodeHeader);
+
+ for (uint i=0; i<node_header.item_count; i++) {
+ /* TODO : El tipo de clave deberia ser usado
+ * dependiendo de algun dato en el header del
+ * arbol
+ */
+ /* TODO : Detectar si estoy en una hoja */
+ BTreeData data(node);
+ node += data.Size ();
+ keys.push_back (data);
+ }
+
+ return keys;
+}
+
+void BTree::WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<BTreeData> &keys)
+{
+ std::list<BTreeData>::iterator it = keys.begin ();
+
+ node += sizeof (BTreeNodeHeader);
+
+ while (it != keys.end ()) {
+ BTreeData d = (*it);
+ memcpy (node, d.ToArray(), d.Size ());
+ node += d.Size ();
+ it++;
+ }
+
+ /* TODO : incrementar node_header.item_count aca o fuera de este metodo? */
+}