From d2ae13e0d419980609bbaa39ea1f00915b097fe3 Mon Sep 17 00:00:00 2001
From: mdw <mdw>
Date: Wed, 16 Aug 2000 17:56:59 +0000
Subject: [PATCH] (more): Remove spurious function.

---
 maurer.c | 32 ++++----------------------------
 1 file changed, 4 insertions(+), 28 deletions(-)

diff --git a/maurer.c b/maurer.c
index 9846f89..e474175 100644
--- a/maurer.c
+++ b/maurer.c
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: maurer.c,v 1.2 2000/08/11 21:34:59 mdw Exp $
+ * $Id: maurer.c,v 1.3 2000/08/16 17:56:59 mdw Exp $
  *
  * Maurer's universal statistical test
  *
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: maurer.c,v $
+ * Revision 1.3  2000/08/16 17:56:59  mdw
+ * (more): Remove spurious function.
+ *
  * Revision 1.2  2000/08/11 21:34:59  mdw
  * New restartable interface to Maurer testing.
  *
@@ -60,33 +63,6 @@ typedef struct bitscan {
 
 /*----- Main code ---------------------------------------------------------*/
 
-/* --- @more@ --- *
- *
- * Arguments:	@bitscan *b@ = pointer to a bitscanner structure
- *		@unsigned l@ = number of bits wanted
- *
- * Returns:	An integer representing the next @l@ bits of the stream.
- *
- * Use:		Fetches the next @l@ bits of a data stream.  The bitscanner
- *		has no way of knowing whether it's run out of data, so make
- *		sure that doesn't happen.
- */
-
-static unsigned more(bitscan *b, unsigned l)
-{
-  unsigned x, m;
-
-  while (b->b < l) {
-    b->a |= U8(*b->p++) << b->b;
-    b->b += 8;
-  }
-  m = (1 << l) - 1;
-  x = b->a & m;
-  b->a >>= l;
-  b->b -= l;
-  return (x);
-}
-
 /* --- @maurer_init@ --- *
  *
  * Arguments:	@maurer_ctx *m@ = pointer to a context to initialize
-- 
2.11.0