3 * The methods .print() are responsible for the nice default-output of
4 * objects. All related helper-functions go in here as well. */
7 * GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
30 #include "expairseq.h"
39 #include "relational.h"
46 void ex::print(ostream & os, unsigned upper_precedence) const
48 debugmsg("ex print",LOGLEVEL_PRINT);
50 bp->print(os,upper_precedence);
53 void ex::dbgprint(void) const
55 debugmsg("ex dbgprint",LOGLEVEL_PRINT);
60 void basic::print(ostream & os, unsigned upper_precedence) const
62 debugmsg("basic print",LOGLEVEL_PRINT);
63 os << "[basic object]";
66 void basic::dbgprint(void) const
72 void symbol::print(ostream & os, unsigned upper_precedence) const
74 debugmsg("symbol print",LOGLEVEL_PRINT);
78 void constant::print(ostream & os, unsigned upper_precedence) const
80 debugmsg("constant print",LOGLEVEL_PRINT);
84 void power::print(ostream & os, unsigned upper_precedence) const
86 debugmsg("power print",LOGLEVEL_PRINT);
87 if (precedence<=upper_precedence) os << "(";
88 basis.print(os,precedence);
90 exponent.print(os,precedence);
91 if (precedence<=upper_precedence) os << ")";
94 void fail::print(ostream & os, unsigned upper_precedence) const
96 debugmsg("fail print",LOGLEVEL_PRINT);
100 void expairseq::printpair(ostream & os, expair const & p, unsigned upper_precedence) const
103 p.rest.bp->print(os,precedence);
105 p.coeff.bp->print(os,precedence);
109 void expairseq::printseq(ostream & os, char delim, unsigned this_precedence,
110 unsigned upper_precedence) const
112 if (this_precedence<=upper_precedence) os << "(";
113 epvector::const_iterator it,it_last;
116 for (it=seq.begin(); it!=it_last; ++it) {
117 printpair(os,*it,this_precedence);
120 printpair(os,*it,this_precedence);
121 if (!overall_coeff.is_equal(default_overall_coeff())) {
122 os << delim << overall_coeff;
124 if (this_precedence<=upper_precedence) os << ")";
127 void expairseq::print(ostream & os, unsigned upper_precedence) const
129 debugmsg("expairseq print",LOGLEVEL_PRINT);
131 printseq(os,',',precedence,upper_precedence);
135 void add::print(ostream & os, unsigned upper_precedence) const
137 debugmsg("add print",LOGLEVEL_PRINT);
138 if (precedence<=upper_precedence) os << "(";
141 for (epvector::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit) {
142 coeff = ex_to_numeric(cit->coeff);
144 if (coeff.csgn()==-1) os << '-'; else os << '+';
146 if (coeff.csgn()==-1) os << '-';
149 if (!coeff.is_equal(numONE()) &&
150 !coeff.is_equal(numMINUSONE())) {
151 if (coeff.csgn()==-1)
152 (numMINUSONE()*coeff).print(os, precedence);
154 coeff.print(os, precedence);
159 // print the overall numeric coefficient, if present:
160 if (!overall_coeff.is_zero()) {
161 if (overall_coeff > 0) os << '+';
164 if (precedence<=upper_precedence) os << ")";
167 void mul::print(ostream & os, unsigned upper_precedence) const
169 debugmsg("mul print",LOGLEVEL_PRINT);
170 if (precedence<=upper_precedence) os << "(";
172 // first print the overall numeric coefficient:
173 if (ex_to_numeric(overall_coeff).csgn()==-1) os << '-';
174 if (!overall_coeff.is_equal(exONE()) &&
175 !overall_coeff.is_equal(exMINUSONE())) {
176 if (ex_to_numeric(overall_coeff).csgn()==-1)
177 (numMINUSONE()*overall_coeff).print(os, precedence);
179 overall_coeff.print(os, precedence);
182 // then proceed with the remaining factors:
183 for (epvector::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit) {
189 recombine_pair_to_ex(*cit).print(os,precedence);
191 if (precedence<=upper_precedence) os << ")";
194 void ncmul::print(ostream & os, unsigned upper_precedence) const
196 debugmsg("ncmul print",LOGLEVEL_PRINT);
197 printseq(os,'(','%',')',precedence,upper_precedence);
200 /*void function::print(ostream & os, unsigned upper_precedence) const
202 * debugmsg("function print",LOGLEVEL_PRINT);
204 * printseq(os,'(',',',')',exprseq::precedence,function::precedence);
207 void series::print(ostream &os, unsigned upper_precedence) const
209 debugmsg("symbol print", LOGLEVEL_PRINT);
210 convert_to_poly().print(os, upper_precedence);
213 void relational::print(ostream & os, unsigned upper_precedence) const
215 debugmsg("relational print",LOGLEVEL_PRINT);
216 if (precedence<=upper_precedence) os << "(";
217 lh.print(os,precedence);
234 case greater_or_equal:
238 os << "(INVALID RELATIONAL OPERATOR)";
240 rh.print(os,precedence);
241 if (precedence<=upper_precedence) os << ")";
244 void matrix::print(ostream & os, unsigned upper_precedence) const
246 debugmsg("matrix print",LOGLEVEL_PRINT);
248 for (int r=0; r<row-1; ++r) {
250 for (int c=0; c<col-1; ++c) {
251 os << m[r*col+c] << ",";
253 os << m[col*(r+1)-1] << "]], ";
256 for (int c=0; c<col-1; ++c) {
257 os << m[(row-1)*col+c] << ",";
259 os << m[row*col-1] << "]] ]]";