X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fremember.h;h=2c20cedb0561e901f4ff9d9b2d835108688ea1a3;hp=f9f125406eb31c78a7ead9815b1b9174dd21436b;hb=b5483c25af5d84095ca647390914e3fb63ad96a0;hpb=4e3a4ac2bcb0837611ea31bc8fc05d84a20c33ac

diff --git a/ginac/remember.h b/ginac/remember.h
index f9f12540..2c20cedb 100644
--- a/ginac/remember.h
+++ b/ginac/remember.h
@@ -4,7 +4,7 @@
  *  in GiNaC functions */
 
 /*
- *  GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
  *
  *  This program is free software; you can redistribute it and/or modify
  *  it under the terms of the GNU General Public License as published by
@@ -24,6 +24,7 @@
 #ifndef __GINAC_REMEMBER_H__
 #define __GINAC_REMEMBER_H__
 
+#include <iosfwd>
 #include <vector>
 #include <list>
 
@@ -40,9 +41,9 @@ class remember_table_entry {
 public:
 	remember_table_entry(function const & f, ex const & r);
 	bool is_equal(function const & f) const;
-	ex get_result(void) const { return result; }
-	unsigned long get_last_access(void) const { return last_access; }
-	unsigned long get_successful_hits(void) const { return successful_hits; };
+	ex get_result() const { return result; }
+	unsigned long get_last_access() const { return last_access; }
+	unsigned long get_successful_hits() const { return successful_hits; };
 
 protected:
 	unsigned hashvalue;
@@ -85,11 +86,11 @@ public:
 	remember_table(unsigned s, unsigned as, unsigned strat);
 	bool lookup_entry(function const & f, ex & result) const;
 	void add_entry(function const & f, ex const & result);
-	void clear_all_entries(void);
+	void clear_all_entries();
 	void show_statistics(std::ostream & os, unsigned level) const;
-	static std::vector<remember_table> & remember_tables(void);
+	static std::vector<remember_table> & remember_tables();
 protected:
-	void init_table(void);
+	void init_table();
 	unsigned table_size;
 	unsigned max_assoc_size;
 	unsigned remember_strategy;