Fixed bug #275: Leaf node split problem(s).

[idzebra-moved-to-github.git] / isamb / tstisamb.c

diff --git a/isamb/tstisamb.c b/isamb/tstisamb.c
index 7391eea..5adb3e8 100644 (file)
--- a/isamb/tstisamb.c
+++ b/isamb/tstisamb.c
@@ -1,4 +1,4 @@
-/* $Id: tstisamb.c,v 1.16 2005-01-15 19:38:31 adam Exp $
+/* $Id: tstisamb.c,v 1.19 2005-03-21 17:20:54 adam Exp $
    Copyright (C) 1995-2005
    Index Data ApS
 
@@ -20,6 +20,7 @@ Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 02111-1307, USA.
 */
 
+#include <stdlib.h>
 #include <string.h>
 #include <yaz/log.h>
 #include <yaz/xmalloc.h>
@@ -228,6 +229,50 @@ void tst_forward(ISAMB isb, int n)
     isamb_unlink(isb, isamc_p);
 }
 
+void tst_x(ISAMB isb)
+{
+    ISAMC_I isamc_i;
+    ISAMB_P isamb_p = 0;
+    struct read_info ri;
+
+    isamc_i.clientData = &ri;
+    isamc_i.read_item = code_read;
+    ri.no = 1000;
+    ri.step = 1;
+    ri.max = 1500;
+
+    isamb_p = isamb_merge (isb, isamb_p , &isamc_i);
+
+    ri.no = 1;
+    ri.step = 1;
+    ri.max = 500;
+
+    isamb_p = isamb_merge (isb, isamb_p , &isamc_i);
+}
+
+void tst_append(ISAMB isb, int n)
+{
+    ISAMC_I isamc_i;
+    ISAMB_P isamb_p = 0;
+    struct read_info ri;
+    int i;
+    int chunk = 10;
+
+    for (i = 0; i < n; i += chunk)
+    {
+       /* insert a number of entries */
+       ri.no = 0;
+       ri.step = 1;
+       ri.max = i + chunk;
+       ri.insertMode = 1;
+       
+       isamc_i.clientData = &ri;
+       isamc_i.read_item = code_read;
+       
+       isamb_p = isamb_merge (isb, isamb_p , &isamc_i);
+    }
+}
+
 int main(int argc, char **argv)
 {
     BFiles bfs;
@@ -269,7 +314,12 @@ int main(int argc, char **argv)
     tst_insert(isb, 100);
     tst_insert(isb, 500);
     tst_insert(isb, 10000);
+
     tst_forward(isb, 10000);
+
+    tst_x(isb);
+
+    tst_append(isb, 1000);
     /* close isam handle */
     isamb_close(isb);