From 9f7df14e416d678943e6abfe314d312b9cc7113c Mon Sep 17 00:00:00 2001
From: Pixel <>
Date: Sun, 4 Mar 2001 00:42:54 +0000
Subject: Ca a l'air bien...

---
 src/test.cc | 11 +++--------
 1 file changed, 3 insertions(+), 8 deletions(-)

(limited to 'src/test.cc')

diff --git a/src/test.cc b/src/test.cc
index 924cba3..5a1bce5 100644
--- a/src/test.cc
+++ b/src/test.cc
@@ -33,13 +33,11 @@ void DoCombTest(int number)
 	cerr << _("Creation of a priority list and adding ") << number << _(" random entrie(s)...");
 	T = newlist();
 	for (i = 1; i <= number; i++) {
-		T->Dump(cerr);
 		T->Insert(rand() % P_INFINITY, NULL);
 	}
 	cerr << _("Ok.\nDeleting the list...");
 	oK = P_INFINITY;
 	for (i = number; i >= 1; i--) {
-		T->Dump(cerr);
 		if (T->n() != i) {
 			cerr << _("List has ") << T->n() << _(" keys. Expecting ") << i << endl;
 			exception(1, _("List corrupted."));
@@ -75,13 +73,11 @@ void FullTest(void)
 	cerr << _("Size of a BinHeap header   : ") << sizeof(BinHeap) << endl;
 	cerr << _("Size of a BinHeap cell     : ") << sizeof(binheap_t) << endl;
 
-/*
 	DoCombTest(0);
 	DoCombTest(10);
 	DoCombTest(70);
-*/
-//  DoCombTest(1000);
-//  DoCombTest(10000);
+  DoCombTest(1000);
+  DoCombTest(10000);
 #ifdef BT
 	DoCombTest(100000);
 #ifdef VBT
@@ -92,8 +88,7 @@ void FullTest(void)
 	cerr << _("Creating a priority list and adding keys:\n");
 	T = newlist();
 	for (i = 0; i < 30; i++) {
-		T->Dump(cerr);
-		fprintf(stderr, "%i \n", N[i]);
+		fprintf(stderr, "%i ", N[i]);
 		T->Insert(N[i], NULL);
 	}
 
-- 
cgit v1.2.3