* computation, square-free factorization and rational function normalization. */
/*
- * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2011 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
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#ifndef __GINAC_NORMAL_H__
-#define __GINAC_NORMAL_H__
+#ifndef GINAC_NORMAL_H
+#define GINAC_NORMAL_H
#include "lst.h"
{
enum {
/**
- * Usually GiNaC tries heuristic GCD algorithm before PRS.
- * Some people don't like this, so here's a flag to disable it.
+ * Usually GiNaC tries heuristic GCD first, because typically
+ * it's much faster than anything else. Even if heuristic
+ * algorithm fails, the overhead is negligible w.r.t. cost
+ * of computing the GCD by some other method. However, some
+ * people dislike it, so here's a flag which tells GiNaC
+ * to NOT use the heuristic algorithm.
*/
no_heur_gcd = 2,
/**
* factored polynomials. DON'T SET THIS unless you *really*
* know what are you doing!
*/
- no_part_factored = 4
+ no_part_factored = 4,
+ /**
+ * By default GiNaC uses modular GCD algorithm. Typically
+ * it's much faster than PRS (pseudo remainder sequence)
+ * algorithm. This flag forces GiNaC to use PRS algorithm
+ */
+ use_sr_gcd = 8
+
};
};
} // namespace GiNaC
-#endif // ndef __GINAC_NORMAL_H__
+#endif // ndef GINAC_NORMAL_H