Toques finales.

[z.facultad/75.52/treemulator.git] / src / btree.cpp

diff --git a/src/btree.cpp b/src/btree.cpp
index ddcb14c49e65f23a19845d77553235da5c9d75d9..3f6fba6e3c2a7f39ca0a33d7d3e1cc3a45e1ea79 100644 (file)
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -143,7 +143,7 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint
 
                while (it != node_keys.end ()) {
                        datait = (*it);
-                       if (tree_type == TYPE_UNIQUE) {
+                       if (tree_type == TYPE_IDENTIFICACION) {
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
@@ -184,7 +184,7 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);
-                       if (tree_type == TYPE_UNIQUE) {
+                       if (tree_type == TYPE_IDENTIFICACION) {
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
@@ -284,7 +284,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
        posterior = it;
 
        while (it != node_keys.end ()) {
-               if (tree_type == TYPE_UNIQUE) {
+               if (tree_type == TYPE_IDENTIFICACION) {
                        /* Verifico que la clave no existea ya en el arbol */
                        if ((*data) == (*(*it))) {
                                throw new AddException ();
@@ -320,7 +320,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
 
                while (it != node_keys.end ()) {
                        datait = (*it);
-                       if (tree_type == TYPE_UNIQUE) {
+                       if (tree_type == TYPE_IDENTIFICACION) {
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
@@ -362,7 +362,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);
-                       if (tree_type == TYPE_UNIQUE) {
+                       if (tree_type == TYPE_IDENTIFICACION) {
                                /* Verifico que la clave no existea ya en el arbol */
                                if ((*data) == (*datait)) {
                                        throw new AddException ();
@@ -1235,3 +1235,8 @@ void BTree::DeleteKeys (std::list<BTreeData *> &keys)
                it++;
        }
 }
+
+int BTree::type () const
+{
+       return key_type;
+}