- gcd(): cofactor computation is faster in partially factorized case

[ginac.git] / ginac / lst_suppl.cpp

diff --git a/ginac/lst_suppl.cpp b/ginac/lst_suppl.cpp
index 71463df7135af932fec5f52f17e29af677769f6a..afc4285e601999923c65c5d19cc483c4833caf01 100644 (file)
--- a/ginac/lst_suppl.cpp
+++ b/ginac/lst_suppl.cpp
@@ -4,7 +4,7 @@
  *  not automatically generated. */
 
 /*
- *  GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2000 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
@@ -23,10 +23,16 @@
 
 #include "lst.h"
 
+#ifndef NO_GINAC_NAMESPACE
+namespace GiNaC {
+#endif // ndef NO_GINAC_NAMESPACE
+
 bool lst::info(unsigned inf) const
 {
     if (inf==info_flags::list) return 1;
     return basic::info(inf);
 }
 
-
+#ifndef NO_GINAC_NAMESPACE
+} // namespace GiNaC
+#endif // ndef NO_GINAC_NAMESPACE