* Implementation of symbolic matrices */
/*
- * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2005 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
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <string>
// that this is not entirely optimal but close to optimal and
// "better" algorithms are much harder to implement. (See Knuth,
// TAoCP2, section "Evaluation of Powers" for a good discussion.)
- while (b!=_num1) {
+ while (b!=*_num1_p) {
if (b.is_odd()) {
C = C.mul(A);
--b;
}
- b /= _num2; // still integer.
+ b /= *_num2_p; // still integer.
A = A.mul(A);
}
return A.mul(C);
Pkey[j] = Pkey[j-1]+1;
} while(fc);
// next column, so change the role of A and B:
- A = B;
+ A.swap(B);
B.clear();
}