1 if (($#ARGV!=0) and ($#ARGV!=1)) {
2 die 'usage: container.pl type [maxargs] (type=lst or exprseq)';
5 if ($ARGV[0] eq 'lst') {
7 } elsif ($ARGV[0] eq 'exprseq') {
10 die 'only lst and exprseq supported';
16 $maxargs=15; # must be greater or equal than the value used in function.pl
19 if ($type eq 'exprseq') {
21 # settings for exprseq
30 } elsif ($type eq 'lst') {
42 die "invalid type $type";
45 $CONTAINER_UC=uc(${CONTAINER});
46 $STLT="ex".$STLHEADER;
49 $RESERVE_IMPLEMENTATION="#define RESERVE(s,size) (s).reserve(size)";
51 $RESERVE_IMPLEMENTATION="#define RESERVE(s,size) // no reserve needed for ${STLHEADER}";
55 $PREPEND_INTERFACE=<<END_OF_PREPEND_INTERFACE;
56 virtual ${CONTAINER} & prepend(const ex & b);
57 END_OF_PREPEND_INTERFACE
59 $PREPEND_IMPLEMENTATION=<<END_OF_PREPEND_IMPLEMENTATION;
60 ${CONTAINER} & ${CONTAINER}::prepend(const ex & b)
62 ensure_if_modifiable();
66 END_OF_PREPEND_IMPLEMENTATION
68 $PREPEND_INTERFACE=" // no prepend possible for ${CONTAINER}";
69 $PREPEND_IMPLEMENTATION="";
73 $LET_OP_IMPLEMENTATION=<<END_OF_LET_OP_IMPLEMENTATION
74 ex & ${CONTAINER}::let_op(int i)
77 GINAC_ASSERT(i<nops());
79 ${STLT}::iterator it=seq.begin();
80 for (int j=0; j<i; j++) {
85 END_OF_LET_OP_IMPLEMENTATION
87 $LET_OP_IMPLEMENTATION="// ${CONTAINER}::let_op() will be implemented by user elsewhere";
91 my ($seq_template,$n,$separator)=@_;
95 for ($N=1; $N<=$n; $N++) {
96 $res .= eval('"' . $seq_template . '"');
104 sub generate_from_to {
105 my ($template,$seq_template1,$seq_separator1,$seq_template2,
106 $seq_separator2,$from,$to)=@_;
110 for ($N=$from; $N<=$to; $N++) {
111 $SEQ1=generate_seq($seq_template1,$N,$seq_separator1);
112 $SEQ2=generate_seq($seq_template2,$N,$seq_separator2);
113 $res .= eval('"' . $template . '"');
114 $SEQ1=''; # to avoid main::SEQ1 used only once warning
115 $SEQ2=''; # same as above
121 my ($template,$seq_template1,$seq_separator1,$seq_template2,
123 return generate_from_to($template,$seq_template1,$seq_separator1,
124 $seq_template2,$seq_separator2,1,$maxargs);
127 $constructors_interface=generate(
128 ' explicit ${CONTAINER}(${SEQ1});'."\n",
129 'const ex & param${N}',', ','','');
131 $constructors_implementation=generate(
132 <<'END_OF_CONSTRUCTORS_IMPLEMENTATION','const ex & param${N}',', ',' seq.push_back(param${N});',"\n");
133 ${CONTAINER}::${CONTAINER}(${SEQ1}) : basic(TINFO_${CONTAINER})
135 debugmsg(\"${CONTAINER} constructor from ${N}*ex\",LOGLEVEL_CONSTRUCT);
139 END_OF_CONSTRUCTORS_IMPLEMENTATION
141 $interface=<<END_OF_INTERFACE;
142 /** \@file ${CONTAINER}.h
144 * Definition of GiNaC's ${CONTAINER}. */
147 * This file was generated automatically by container.pl.
148 * Please do not modify it directly, edit the perl script instead!
149 * container.pl options: \$CONTAINER=${CONTAINER}
150 * \$STLHEADER=${STLHEADER}
151 * \$reserve=${reserve}
152 * \$prepend=${prepend}
154 * \$open_bracket=${open_bracket}
155 * \$close_bracket=${close_bracket}
156 * \$maxargs=${maxargs}
158 * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
160 * This program is free software; you can redistribute it and/or modify
161 * it under the terms of the GNU General Public License as published by
162 * the Free Software Foundation; either version 2 of the License, or
163 * (at your option) any later version.
165 * This program is distributed in the hope that it will be useful,
166 * but WITHOUT ANY WARRANTY; without even the implied warranty of
167 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
168 * GNU General Public License for more details.
170 * You should have received a copy of the GNU General Public License
171 * along with this program; if not, write to the Free Software
172 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
175 #ifndef __GINAC_${CONTAINER_UC}_H__
176 #define __GINAC_${CONTAINER_UC}_H__
178 #include <${STLHEADER}>
180 // CINT needs <algorithm> to work properly with <vector> and <list>
186 #ifndef NO_NAMESPACE_GINAC
188 #endif // ndef NO_NAMESPACE_GINAC
191 // Cint does not like ${STLHEADER}<..,default_alloc> but malloc_alloc is
192 // unstandardized and not supported by newer GCCs.
193 #if defined(__GNUC__) && ((__GNUC__ == 2) && (__GNUC_MINOR__ < 97))
194 typedef std::${STLHEADER}<ex,malloc_alloc> ${STLT};
196 typedef std::${STLHEADER}<ex> ${STLT};
199 class ${CONTAINER} : public basic
201 GINAC_DECLARE_REGISTERED_CLASS(${CONTAINER}, basic)
206 ${CONTAINER}(${CONTAINER} const & other);
207 ${CONTAINER} const & operator=(${CONTAINER} const & other);
209 void copy(${CONTAINER} const & other);
210 void destroy(bool call_parent);
213 ${CONTAINER}(${STLT} const & s, bool discardable=0);
214 ${CONTAINER}(${STLT} * vp); // vp will be deleted
215 ${constructors_interface}
218 basic * duplicate() const;
219 void printraw(std::ostream & os) const;
220 void print(std::ostream & os, unsigned upper_precedence=0) const;
221 void printtree(std::ostream & os, unsigned indent) const;
222 bool info(unsigned inf) const;
223 unsigned nops() const;
225 ex expand(unsigned options=0) const;
226 bool has(const ex & other) const;
227 ex eval(int level=0) const;
228 ex evalf(int level=0) const;
229 ex normal(lst &sym_lst, lst &repl_lst, int level=0) const;
230 ex derivative(const symbol & s) const;
231 ex subs(const lst & ls, const lst & lr) const;
233 int compare_same_type(const basic & other) const;
234 bool is_equal_same_type(const basic & other) const;
235 unsigned return_type(void) const;
237 // new virtual functions which can be overridden by derived classes
239 virtual ${CONTAINER} & append(const ex & b);
242 virtual void printseq(std::ostream & os, char openbracket, char delim,
243 char closebracket, unsigned this_precedence,
244 unsigned upper_precedence=0) const;
245 virtual ex this${CONTAINER}(${STLT} const & v) const;
246 virtual ex this${CONTAINER}(${STLT} * vp) const;
249 bool is_canonical() const;
250 ${STLT} evalchildren(int level) const;
251 ${STLT} evalfchildren(int level) const;
252 ${STLT} normalchildren(int level) const;
253 ${STLT} diffchildren(const symbol & s) const;
254 ${STLT} * subschildren(const lst & ls, const lst & lr) const;
258 static unsigned precedence;
263 extern const ${CONTAINER} some_${CONTAINER};
264 extern const std::type_info & typeid_${CONTAINER};
267 inline const ${CONTAINER} &ex_to_${CONTAINER}(const ex &e)
269 return static_cast<const ${CONTAINER} &>(*e.bp);
272 inline ${CONTAINER} &ex_to_nonconst_${CONTAINER}(const ex &e)
274 return static_cast<${CONTAINER} &>(*e.bp);
277 #ifndef NO_NAMESPACE_GINAC
279 #endif // ndef NO_NAMESPACE_GINAC
281 #endif // ndef __GINAC_${CONTAINER_UC}_H__
285 $implementation=<<END_OF_IMPLEMENTATION;
286 /** \@file ${CONTAINER}.cpp
288 * Implementation of GiNaC's ${CONTAINER}. */
291 * This file was generated automatically by container.pl.
292 * Please do not modify it directly, edit the perl script instead!
293 * container.pl options: \$CONTAINER=${CONTAINER}
294 * \$STLHEADER=${STLHEADER}
295 * \$reserve=${reserve}
296 * \$prepend=${prepend}
298 * \$open_bracket=${open_bracket}
299 * \$close_bracket=${close_bracket}
300 * \$maxargs=${maxargs}
302 * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
304 * This program is free software; you can redistribute it and/or modify
305 * it under the terms of the GNU General Public License as published by
306 * the Free Software Foundation; either version 2 of the License, or
307 * (at your option) any later version.
309 * This program is distributed in the hope that it will be useful,
310 * but WITHOUT ANY WARRANTY; without even the implied warranty of
311 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
312 * GNU General Public License for more details.
314 * You should have received a copy of the GNU General Public License
315 * along with this program; if not, write to the Free Software
316 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
322 #include "${CONTAINER}.h"
325 #include "debugmsg.h"
327 #ifndef NO_NAMESPACE_GINAC
329 #endif // ndef NO_NAMESPACE_GINAC
331 GINAC_IMPLEMENT_REGISTERED_CLASS(${CONTAINER}, basic)
333 ${RESERVE_IMPLEMENTATION}
336 // default constructor, destructor, copy constructor assignment operator and helpers
341 ${CONTAINER}::${CONTAINER}() : basic(TINFO_${CONTAINER})
343 debugmsg("${CONTAINER} default constructor",LOGLEVEL_CONSTRUCT);
346 ${CONTAINER}::~${CONTAINER}()
348 debugmsg("${CONTAINER} destructor",LOGLEVEL_DESTRUCT);
352 ${CONTAINER}::${CONTAINER}(${CONTAINER} const & other)
354 debugmsg("${CONTAINER} copy constructor",LOGLEVEL_CONSTRUCT);
358 ${CONTAINER} const & ${CONTAINER}::operator=(${CONTAINER} const & other)
360 debugmsg("${CONTAINER} operator=",LOGLEVEL_ASSIGNMENT);
361 if (this != &other) {
370 void ${CONTAINER}::copy(${CONTAINER} const & other)
372 inherited::copy(other);
376 void ${CONTAINER}::destroy(bool call_parent)
379 if (call_parent) inherited::destroy(call_parent);
383 // other constructors
388 ${CONTAINER}::${CONTAINER}(${STLT} const & s, bool discardable) : basic(TINFO_${CONTAINER})
390 debugmsg("${CONTAINER} constructor from ${STLT}", LOGLEVEL_CONSTRUCT);
392 seq.swap(const_cast<${STLT} &>(s));
398 ${CONTAINER}::${CONTAINER}(${STLT} * vp) : basic(TINFO_${CONTAINER})
400 debugmsg("${CONTAINER} constructor from ${STLT} *",LOGLEVEL_CONSTRUCT);
406 ${constructors_implementation}
412 /** Construct object from archive_node. */
413 ${CONTAINER}::${CONTAINER}(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
415 debugmsg("${CONTAINER} constructor from archive_node", LOGLEVEL_CONSTRUCT);
416 for (unsigned int i=0; true; i++) {
418 if (n.find_ex("seq", e, sym_lst, i))
425 /** Unarchive the object. */
426 ex ${CONTAINER}::unarchive(const archive_node &n, const lst &sym_lst)
428 return (new ${CONTAINER}(n, sym_lst))->setflag(status_flags::dynallocated);
431 /** Archive the object. */
432 void ${CONTAINER}::archive(archive_node &n) const
434 inherited::archive(n);
435 ${STLT}::const_iterator i = seq.begin(), iend = seq.end();
443 // functions overriding virtual functions from bases classes
448 basic * ${CONTAINER}::duplicate() const
450 debugmsg("${CONTAINER} duplicate",LOGLEVEL_DUPLICATE);
451 return new ${CONTAINER}(*this);
454 void ${CONTAINER}::printraw(std::ostream & os) const
456 debugmsg("${CONTAINER} printraw",LOGLEVEL_PRINT);
458 os << "${CONTAINER}(";
459 for (${STLT}::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit) {
460 (*cit).bp->printraw(os);
466 void ${CONTAINER}::print(std::ostream & os, unsigned upper_precedence) const
468 debugmsg("${CONTAINER} print",LOGLEVEL_PRINT);
469 // always print brackets around seq, ignore upper_precedence
470 printseq(os,'${open_bracket}',',','${close_bracket}',precedence,precedence+1);
473 void ${CONTAINER}::printtree(std::ostream & os, unsigned indent) const
475 debugmsg("${CONTAINER} printtree",LOGLEVEL_PRINT);
477 os << std::string(indent,' ') << "type=" << class_name()
478 << ", hash=" << hashvalue
479 << " (0x" << std::hex << hashvalue << std::dec << ")"
480 << ", flags=" << flags
481 << ", nops=" << nops() << std::endl;
482 for (${STLT}::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit) {
483 (*cit).printtree(os,indent+delta_indent);
485 os << std::string(indent+delta_indent,' ') << "=====" << std::endl;
488 // ${CONTAINER}::info() will be implemented by user elsewhere";
490 unsigned ${CONTAINER}::nops() const
495 ${LET_OP_IMPLEMENTATION}
497 ex ${CONTAINER}::expand(unsigned options) const
500 RESERVE(s,seq.size());
501 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
502 s.push_back((*it).expand(options));
505 return this${CONTAINER}(s);
508 // a ${CONTAINER} 'has' an expression if it is this expression itself or a child 'has' it
510 bool ${CONTAINER}::has(const ex & other) const
512 GINAC_ASSERT(other.bp!=0);
513 if (is_equal(*other.bp)) return true;
514 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
515 if ((*it).has(other)) return true;
520 ex ${CONTAINER}::eval(int level) const
525 return this${CONTAINER}(evalchildren(level));
528 ex ${CONTAINER}::evalf(int level) const
530 return this${CONTAINER}(evalfchildren(level));
533 /** Implementation of ex::normal() for ${CONTAINER}s. It normalizes the arguments
534 * and replaces the ${CONTAINER} by a temporary symbol.
535 * \@see ex::normal */
536 ex ${CONTAINER}::normal(lst &sym_lst, lst &repl_lst, int level) const
538 ex n=this${CONTAINER}(normalchildren(level));
539 return n.bp->basic::normal(sym_lst,repl_lst,level);
542 ex ${CONTAINER}::derivative(const symbol & s) const
544 return this${CONTAINER}(diffchildren(s));
547 ex ${CONTAINER}::subs(const lst & ls, const lst & lr) const
549 ${STLT} * vp=subschildren(ls,lr);
553 return this${CONTAINER}(vp);
558 int ${CONTAINER}::compare_same_type(const basic & other) const
560 GINAC_ASSERT(is_of_type(other,${CONTAINER}));
561 ${CONTAINER} const & o=static_cast<${CONTAINER} const &>
562 (const_cast<basic &>(other));
564 ${STLT}::const_iterator it1=seq.begin();
565 ${STLT}::const_iterator it2=o.seq.begin();
567 for (; (it1!=seq.end())&&(it2!=o.seq.end()); ++it1, ++it2) {
568 cmpval=(*it1).compare(*it2);
569 if (cmpval!=0) return cmpval;
572 if (it1==seq.end()) {
573 return (it2==o.seq.end() ? 0 : -1);
579 bool ${CONTAINER}::is_equal_same_type(const basic & other) const
581 GINAC_ASSERT(is_of_type(other,${CONTAINER}));
582 ${CONTAINER} const & o=static_cast<${CONTAINER} const &>
583 (const_cast<basic &>(other));
584 if (seq.size()!=o.seq.size()) return false;
586 ${STLT}::const_iterator it1=seq.begin();
587 ${STLT}::const_iterator it2=o.seq.begin();
589 for (; it1!=seq.end(); ++it1, ++it2) {
590 if (!(*it1).is_equal(*it2)) return false;
596 unsigned ${CONTAINER}::return_type(void) const
598 return return_types::noncommutative_composite;
602 // new virtual functions which can be overridden by derived classes
607 ${CONTAINER} & ${CONTAINER}::append(const ex & b)
609 ensure_if_modifiable();
614 ${PREPEND_IMPLEMENTATION}
618 void ${CONTAINER}::printseq(std::ostream & os, char openbracket, char delim,
619 char closebracket, unsigned this_precedence,
620 unsigned upper_precedence) const
622 if (this_precedence<=upper_precedence) os << openbracket;
624 ${STLT}::const_iterator it,it_last;
628 for (; it!=it_last; ++it) {
629 (*it).bp->print(os,this_precedence);
632 (*it).bp->print(os,this_precedence);
634 if (this_precedence<=upper_precedence) os << closebracket;
637 ex ${CONTAINER}::this${CONTAINER}(${STLT} const & v) const
639 return ${CONTAINER}(v);
642 ex ${CONTAINER}::this${CONTAINER}(${STLT} * vp) const
644 return ${CONTAINER}(vp);
648 // non-virtual functions in this class
657 bool ${CONTAINER}::is_canonical() const
659 if (seq.size()<=1) { return 1; }
661 ${STLT}::const_iterator it=seq.begin();
662 ${STLT}::const_iterator it_last=it;
663 for (++it; it!=seq.end(); it_last=it, ++it) {
664 if ((*it_last).compare(*it)>0) {
665 if ((*it_last).compare(*it)>0) {
666 std::cout << *it_last << ">" << *it << "\\n";
675 ${STLT} ${CONTAINER}::evalchildren(int level) const
678 RESERVE(s,seq.size());
683 if (level == -max_recursion_level) {
684 throw(std::runtime_error("max recursion level reached"));
687 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
688 s.push_back((*it).eval(level));
693 ${STLT} ${CONTAINER}::evalfchildren(int level) const
696 RESERVE(s,seq.size());
701 if (level == -max_recursion_level) {
702 throw(std::runtime_error("max recursion level reached"));
705 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
706 s.push_back((*it).evalf(level));
711 ${STLT} ${CONTAINER}::normalchildren(int level) const
714 RESERVE(s,seq.size());
719 if (level == -max_recursion_level) {
720 throw(std::runtime_error("max recursion level reached"));
723 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
724 s.push_back((*it).normal(level));
729 ${STLT} ${CONTAINER}::diffchildren(const symbol & y) const
732 RESERVE(s,seq.size());
733 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
734 s.push_back((*it).diff(y));
739 /* obsolete subschildren
740 ${STLT} ${CONTAINER}::subschildren(const lst & ls, const lst & lr) const
743 RESERVE(s,seq.size());
744 for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
745 s.push_back((*it).subs(ls,lr));
751 ${STLT} * ${CONTAINER}::subschildren(const lst & ls, const lst & lr) const
753 // returns a NULL pointer if nothing had to be substituted
754 // returns a pointer to a newly created epvector otherwise
755 // (which has to be deleted somewhere else)
757 ${STLT}::const_iterator last=seq.end();
758 ${STLT}::const_iterator cit=seq.begin();
760 const ex & subsed_ex=(*cit).subs(ls,lr);
761 if (!are_ex_trivially_equal(*cit,subsed_ex)) {
763 // something changed, copy seq, subs and return it
764 ${STLT} *s=new ${STLT};
765 RESERVE(*s,seq.size());
767 // copy parts of seq which are known not to have changed
768 ${STLT}::const_iterator cit2=seq.begin();
773 // copy first changed element
774 s->push_back(subsed_ex);
778 s->push_back((*cit2).subs(ls,lr));
786 return 0; // nothing has changed
790 // static member variables
795 unsigned ${CONTAINER}::precedence=10;
801 const ${CONTAINER} some_${CONTAINER};
802 const std::type_info & typeid_${CONTAINER} = typeid(some_${CONTAINER});
804 #ifndef NO_NAMESPACE_GINAC
806 #endif // ndef NO_NAMESPACE_GINAC
808 END_OF_IMPLEMENTATION
810 print "Creating interface file ${CONTAINER}.h...";
811 open OUT,">${CONTAINER}.h" or die "cannot open ${CONTAINER}.h";
812 print OUT $interface;
816 print "Creating implementation file ${CONTAINER}.cpp...";
817 open OUT,">${CONTAINER}.cpp" or die "cannot open ${CONTAINER}.cpp";
818 print OUT $implementation;