- prepared for 1.0.13 release

[ginac.git] / ginac / remember.cpp

diff --git a/ginac/remember.cpp b/ginac/remember.cpp
index 3a9227304363386503deb7e742c04f3bd5814528..cdd346f74e0e1b18e32fe83e608c2c089039493f 100644 (file)
--- a/ginac/remember.cpp
+++ b/ginac/remember.cpp
@@ -4,7 +4,7 @@
  *  in GiNaC functions */
 
 /*
- *  GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2003 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
@@ -44,7 +44,8 @@ bool remember_table_entry::is_equal(function const & f) const
 {
        GINAC_ASSERT(f.seq.size()==seq.size());
        if (f.gethash()!=hashvalue) return false;
-       for (unsigned i=0; i<seq.size(); ++i)
+       unsigned num = seq.size();
+       for (unsigned i=0; i<num; ++i)
                if (!seq[i].is_equal(f.seq[i])) return false;
        ++last_access = access_counter;
        ++successful_hits;
@@ -120,11 +121,13 @@ void remember_table_list::add_entry(function const & f, ex const & result)
 
 bool remember_table_list::lookup_entry(function const & f, ex & result) const
 {
-       for (const_iterator cit=begin(); cit!=end(); ++cit) {
-               if ((*cit).is_equal(f)) {
-                       result = (*cit).get_result();
+       const_iterator i = begin(), iend = end();
+       while (i != iend) {
+               if (i->is_equal(f)) {
+                       result = i->get_result();
                        return true;
                }
+               ++i;
        }
        return false;
 }