From 77167f76c76e1827e38ad0cb9de333f17fc6744b Mon Sep 17 00:00:00 2001
From: Jeff Hill <johill@lanl.gov>
Date: Wed, 9 Feb 2000 16:41:22 +0000
Subject: [PATCH] fixed problems with the gnu compiler

---
 src/cxxTemplates/test/tsBTreeBench.cc        | 30 ++++++++++----------
 src/libCom/cxxTemplates/test/tsBTreeBench.cc | 30 ++++++++++----------
 2 files changed, 30 insertions(+), 30 deletions(-)

diff --git a/src/cxxTemplates/test/tsBTreeBench.cc b/src/cxxTemplates/test/tsBTreeBench.cc
index 155b9a384..02d41e5f8 100644
--- a/src/cxxTemplates/test/tsBTreeBench.cc
+++ b/src/cxxTemplates/test/tsBTreeBench.cc
@@ -46,37 +46,37 @@ main ()
         clock_t diff;
         double delay;
 	
-	tree.insert(a);
-	list.add(a);
+	tree.insert (a);
+	list.add (a);
 
 	for (i=0u; i<LOOPCOUNT; i++) {
 		pA = new A;
-		assert(pA);
-		tree.insert(*pA);
-		list.add(*pA);
+		assert (pA);
+		tree.insert (*pA);
+		list.add (*pA);
 	}
 
-	clk = clock();
+	clk = clock ();
 	for (i=0u; i<LOOPCOUNT; i++) {
-		assert(tree.verify(a));
+		assert ( tree.verify(a) );
 	}
-	diff = clock() - clk;
+	diff = clock () - clk;
         delay = diff;
         delay = delay/CLOCKS_PER_SEC;
         delay = delay/LOOPCOUNT;
-        printf("delay = %15.10f\n", delay);
+        printf ("delay = %15.10f\n", delay);
 
-	clk = clock();
-	while ( (pA = list.get()) ) {
-		assert(tree.remove(*pA));
+	clk = clock ();
+	while ( ( pA = list.get () ) ) {
+		assert (tree.remove(*pA));
 	}
-	diff = clock() - clk;
+	diff = clock () - clk;
         delay = diff;
         delay = delay/CLOCKS_PER_SEC;
         delay = delay/LOOPCOUNT;
-        printf("delay = %15.10f\n", delay);
+        printf ("delay = %15.10f\n", delay);
 
-	tree.traverse(A::show);
+	tree.traverse (&A::show);
 
 	return 0;
 }
diff --git a/src/libCom/cxxTemplates/test/tsBTreeBench.cc b/src/libCom/cxxTemplates/test/tsBTreeBench.cc
index 155b9a384..02d41e5f8 100644
--- a/src/libCom/cxxTemplates/test/tsBTreeBench.cc
+++ b/src/libCom/cxxTemplates/test/tsBTreeBench.cc
@@ -46,37 +46,37 @@ main ()
         clock_t diff;
         double delay;
 	
-	tree.insert(a);
-	list.add(a);
+	tree.insert (a);
+	list.add (a);
 
 	for (i=0u; i<LOOPCOUNT; i++) {
 		pA = new A;
-		assert(pA);
-		tree.insert(*pA);
-		list.add(*pA);
+		assert (pA);
+		tree.insert (*pA);
+		list.add (*pA);
 	}
 
-	clk = clock();
+	clk = clock ();
 	for (i=0u; i<LOOPCOUNT; i++) {
-		assert(tree.verify(a));
+		assert ( tree.verify(a) );
 	}
-	diff = clock() - clk;
+	diff = clock () - clk;
         delay = diff;
         delay = delay/CLOCKS_PER_SEC;
         delay = delay/LOOPCOUNT;
-        printf("delay = %15.10f\n", delay);
+        printf ("delay = %15.10f\n", delay);
 
-	clk = clock();
-	while ( (pA = list.get()) ) {
-		assert(tree.remove(*pA));
+	clk = clock ();
+	while ( ( pA = list.get () ) ) {
+		assert (tree.remove(*pA));
 	}
-	diff = clock() - clk;
+	diff = clock () - clk;
         delay = diff;
         delay = delay/CLOCKS_PER_SEC;
         delay = delay/LOOPCOUNT;
-        printf("delay = %15.10f\n", delay);
+        printf ("delay = %15.10f\n", delay);
 
-	tree.traverse(A::show);
+	tree.traverse (&A::show);
 
 	return 0;
 }