Pollard's rho algorithm for computing discrete logs.

[u/mdw/catacomb] / daftstory.h

diff --git a/daftstory.h b/daftstory.h
index 8715cdc..c4b1bad 100644 (file)
--- a/daftstory.h
+++ b/daftstory.h
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: daftstory.h,v 1.1 1999/09/03 08:41:11 mdw Exp $
+ * $Id: daftstory.h,v 1.3 1999/12/10 23:29:48 mdw Exp $
  *
  * Daft story for use in test encryptions
  *
@@ -30,13 +30,19 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: daftstory.h,v $
+ * Revision 1.3  1999/12/10 23:29:48  mdw
+ * Change header file guard names.
+ *
+ * Revision 1.2  1999/11/11 00:58:38  mdw
+ * Use fewer copies of the silly story to improve performance.
+ *
  * Revision 1.1  1999/09/03 08:41:11  mdw
  * Initial import.
  *
  */
 
-#ifndef DAFTSTORY_H
-#define DAFTSTORY_H
+#ifndef CATACOMB_DAFTSTORY_H
+#define CATACOMB_DAFTSTORY_H
 
 #ifdef __cplusplus
   extern "C" {
@@ -71,7 +77,7 @@ safety warnings to long dresses.\n\
 \n\
 And the wizard?  Who cares?\n\
 "
-#  define TEXT STORY STORY STORY
+#  define TEXT STORY STORY
 #endif
 
 #define KEY "Penguins rule OK, rhubarb cauliflower"