ginac/container.pl

   1 if (($#ARGV!=0) and ($#ARGV!=1)) {
   2         die 'usage: container.pl type [maxargs] (type=lst or exprseq)';
   3 }
   4
   5 if ($ARGV[0] eq 'lst') {
   6         $type='lst';
   7 } elsif ($ARGV[0] eq 'exprseq') {
   8         $type='exprseq';
   9 } else {
  10         die 'only lst and exprseq supported';
  11 }
  12
  13 if ($#ARGV==1) {
  14         $maxargs=$ARGV[1];
  15 } else {
  16         $maxargs=15; # must be greater or equal than the value used in function.pl
  17 }
  18
  19 if ($type eq 'exprseq') {
  20
  21         # settings for exprseq
  22         $CONTAINER="exprseq";
  23         $STLHEADER="vector";
  24         $reserve=1;
  25         $prepend=0;
  26         $let_op=0;
  27         $open_bracket='(';
  28         $close_bracket=')';
  29
  30 } elsif ($type eq 'lst') {
  31
  32         # settings for lst
  33         $CONTAINER="lst";
  34         $STLHEADER="list";
  35         $reserve=0;
  36         $prepend=1;
  37         $let_op=1;
  38         $open_bracket='[';
  39         $close_bracket=']';
  40
  41 } else {
  42         die "invalid type $type";
  43 }
  44
  45 $CONTAINER_UC=uc(${CONTAINER});
  46 $STLT="ex".$STLHEADER;
  47
  48 if ($reserve) {
  49         $RESERVE_IMPLEMENTATION="#define RESERVE(s,size) (s).reserve(size)";
  50 } else {
  51         $RESERVE_IMPLEMENTATION="#define RESERVE(s,size) // no reserve needed for ${STLHEADER}";
  52 }
  53
  54 if ($prepend) {
  55         $PREPEND_INTERFACE=<<END_OF_PREPEND_INTERFACE;
  56         virtual ${CONTAINER} & prepend(const ex & b);
  57 END_OF_PREPEND_INTERFACE
  58
  59         $PREPEND_IMPLEMENTATION=<<END_OF_PREPEND_IMPLEMENTATION;
  60 ${CONTAINER} & ${CONTAINER}::prepend(const ex & b)
  61 {
  62         ensure_if_modifiable();
  63         seq.push_front(b);
  64         return *this;
  65 }
  66 END_OF_PREPEND_IMPLEMENTATION
  67 } else {
  68         $PREPEND_INTERFACE="    // no prepend possible for ${CONTAINER}";
  69         $PREPEND_IMPLEMENTATION="";
  70 }
  71
  72 if ($let_op) {
  73         $LET_OP_IMPLEMENTATION=<<END_OF_LET_OP_IMPLEMENTATION
  74 ex & ${CONTAINER}::let_op(int i)
  75 {
  76         GINAC_ASSERT(i>=0);
  77         GINAC_ASSERT(i<nops());
  78
  79         ${STLT}::iterator it=seq.begin();
  80         for (int j=0; j<i; j++) {
  81                 ++it;
  82         }
  83         return *it;
  84 }
  85 END_OF_LET_OP_IMPLEMENTATION
  86 } else {
  87         $LET_OP_IMPLEMENTATION="// ${CONTAINER}::let_op() will be implemented by user elsewhere";
  88 }
  89
  90 sub generate_seq {
  91         my ($seq_template,$n,$separator)=@_;
  92         my ($res,$N);
  93
  94         $res='';
  95         for ($N=1; $N<=$n; $N++) {
  96                 $res .= eval('"' . $seq_template . '"');
  97                 if ($N!=$n) {
  98                         $res .= $separator;
  99                 }
 100         }
 101         return $res;
 102 }
 103
 104 sub generate_from_to {
 105         my ($template,$seq_template1,$seq_separator1,$seq_template2,
 106             $seq_separator2,$from,$to)=@_;
 107         my ($res,$N,$SEQ);
 108
 109         $res='';
 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
 116         }
 117         return $res;
 118 }
 119
 120 sub generate {
 121         my ($template,$seq_template1,$seq_separator1,$seq_template2,
 122             $seq_separator2)=@_;
 123         return generate_from_to($template,$seq_template1,$seq_separator1,
 124                                                         $seq_template2,$seq_separator2,1,$maxargs);
 125 }
 126
 127 $constructors_interface=generate(
 128 '       explicit ${CONTAINER}(${SEQ1});'."\n",
 129 'const ex & param${N}',', ','','');
 130
 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})
 134 {
 135         debugmsg(\"${CONTAINER} constructor from ${N}*ex\",LOGLEVEL_CONSTRUCT);
 136         RESERVE(seq,${N});
 137 ${SEQ2}
 138 }
 139 END_OF_CONSTRUCTORS_IMPLEMENTATION
 140
 141 $interface=<<END_OF_INTERFACE;
 142 /** \@file ${CONTAINER}.h
 143  *
 144  *  Definition of GiNaC's ${CONTAINER}. */
 145
 146 /*
 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}
 153  *                        \$let_op=${let_op}
 154  *                        \$open_bracket=${open_bracket}
 155  *                        \$close_bracket=${close_bracket}
 156  *                        \$maxargs=${maxargs}
 157  *
 158  *  GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany
 159  *
 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.
 164  *
 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.
 169  *
 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
 173  */
 174
 175 #ifndef __GINAC_${CONTAINER_UC}_H__
 176 #define __GINAC_${CONTAINER_UC}_H__
 177
 178 #include <${STLHEADER}>
 179
 180 // CINT needs <algorithm> to work properly with <vector> and <list>
 181 #include <algorithm>
 182
 183 #include "basic.h"
 184 #include "ex.h"
 185
 186 #ifndef NO_NAMESPACE_GINAC
 187 namespace GiNaC {
 188 #endif // ndef NO_NAMESPACE_GINAC
 189
 190 // typedef std::${STLHEADER}<ex> ${STLT};
 191 typedef std::${STLHEADER}<ex,malloc_alloc> ${STLT}; // CINT does not like ${STLHEADER}<...,default_alloc>
 192
 193 class ${CONTAINER} : public basic
 194 {
 195         GINAC_DECLARE_REGISTERED_CLASS(${CONTAINER}, basic)
 196
 197 public:
 198         ${CONTAINER}();
 199         ~${CONTAINER}();
 200         ${CONTAINER}(${CONTAINER} const & other);
 201         ${CONTAINER} const & operator=(${CONTAINER} const & other);
 202 protected:
 203         void copy(${CONTAINER} const & other);
 204         void destroy(bool call_parent);
 205
 206 public:
 207         ${CONTAINER}(${STLT} const & s, bool discardable=0);
 208         ${CONTAINER}(${STLT} * vp); // vp will be deleted
 209 ${constructors_interface}
 210
 211 public:
 212         basic * duplicate() const;
 213         void printraw(std::ostream & os) const;
 214         void print(std::ostream & os, unsigned upper_precedence=0) const;
 215         void printtree(std::ostream & os, unsigned indent) const;
 216         bool info(unsigned inf) const;
 217         unsigned nops() const;
 218         ex & let_op(int i);
 219         ex expand(unsigned options=0) const;
 220         bool has(const ex & other) const;
 221         ex eval(int level=0) const;
 222         ex evalf(int level=0) const;
 223         ex normal(lst &sym_lst, lst &repl_lst, int level=0) const;
 224         ex derivative(const symbol & s) const;
 225         ex subs(const lst & ls, const lst & lr) const;
 226 protected:
 227         int compare_same_type(const basic & other) const;
 228         bool is_equal_same_type(const basic & other) const;
 229         unsigned return_type(void) const;
 230
 231         // new virtual functions which can be overridden by derived classes
 232 public:
 233         virtual ${CONTAINER} & append(const ex & b);
 234 ${PREPEND_INTERFACE}
 235 protected:
 236         virtual void printseq(std::ostream & os, char openbracket, char delim,
 237                               char closebracket, unsigned this_precedence,
 238                               unsigned upper_precedence=0) const;
 239         virtual ex this${CONTAINER}(${STLT} const & v) const;
 240         virtual ex this${CONTAINER}(${STLT} * vp) const;
 241
 242 protected:
 243         bool is_canonical() const;
 244         ${STLT} evalchildren(int level) const;
 245         ${STLT} evalfchildren(int level) const;
 246         ${STLT} normalchildren(int level) const;
 247         ${STLT} diffchildren(const symbol & s) const;
 248         ${STLT} * subschildren(const lst & ls, const lst & lr) const;
 249
 250 protected:
 251         ${STLT} seq;
 252         static unsigned precedence;
 253 };
 254
 255 // global constants
 256
 257 extern const ${CONTAINER} some_${CONTAINER};
 258 extern const std::type_info & typeid_${CONTAINER};
 259
 260 // utility functions
 261 inline const ${CONTAINER} &ex_to_${CONTAINER}(const ex &e)
 262 {
 263         return static_cast<const ${CONTAINER} &>(*e.bp);
 264 }
 265
 266 inline ${CONTAINER} &ex_to_nonconst_${CONTAINER}(const ex &e)
 267 {
 268         return static_cast<${CONTAINER} &>(*e.bp);
 269 }
 270
 271 #ifndef NO_NAMESPACE_GINAC
 272 } // namespace GiNaC
 273 #endif // ndef NO_NAMESPACE_GINAC
 274
 275 #endif // ndef __GINAC_${CONTAINER_UC}_H__
 276
 277 END_OF_INTERFACE
 278
 279 $implementation=<<END_OF_IMPLEMENTATION;
 280 /** \@file ${CONTAINER}.cpp
 281  *
 282  *  Implementation of GiNaC's ${CONTAINER}. */
 283
 284 /*
 285  *  This file was generated automatically by container.pl.
 286  *  Please do not modify it directly, edit the perl script instead!
 287  *  container.pl options: \$CONTAINER=${CONTAINER}
 288  *                        \$STLHEADER=${STLHEADER}
 289  *                        \$reserve=${reserve}
 290  *                        \$prepend=${prepend}
 291  *                        \$let_op=${let_op}
 292  *                        \$open_bracket=${open_bracket}
 293  *                        \$close_bracket=${close_bracket}
 294  *                        \$maxargs=${maxargs}
 295  *
 296  *  GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany
 297  *
 298  *  This program is free software; you can redistribute it and/or modify
 299  *  it under the terms of the GNU General Public License as published by
 300  *  the Free Software Foundation; either version 2 of the License, or
 301  *  (at your option) any later version.
 302  *
 303  *  This program is distributed in the hope that it will be useful,
 304  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 305  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 306  *  GNU General Public License for more details.
 307  *
 308  *  You should have received a copy of the GNU General Public License
 309  *  along with this program; if not, write to the Free Software
 310  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 311  */
 312
 313 #include <iostream>
 314 #include <stdexcept>
 315
 316 #include "${CONTAINER}.h"
 317 #include "ex.h"
 318 #include "archive.h"
 319 #include "debugmsg.h"
 320
 321 #ifndef NO_NAMESPACE_GINAC
 322 namespace GiNaC {
 323 #endif // ndef NO_NAMESPACE_GINAC
 324
 325 GINAC_IMPLEMENT_REGISTERED_CLASS(${CONTAINER}, basic)
 326
 327 ${RESERVE_IMPLEMENTATION}
 328
 329 //////////
 330 // default constructor, destructor, copy constructor assignment operator and helpers
 331 //////////
 332
 333 // public
 334
 335 ${CONTAINER}::${CONTAINER}() : basic(TINFO_${CONTAINER})
 336 {
 337         debugmsg("${CONTAINER} default constructor",LOGLEVEL_CONSTRUCT);
 338 }
 339
 340 ${CONTAINER}::~${CONTAINER}()
 341 {
 342         debugmsg("${CONTAINER} destructor",LOGLEVEL_DESTRUCT);
 343         destroy(false);
 344 }
 345
 346 ${CONTAINER}::${CONTAINER}(${CONTAINER} const & other)
 347 {
 348         debugmsg("${CONTAINER} copy constructor",LOGLEVEL_CONSTRUCT);
 349         copy(other);
 350 }
 351
 352 ${CONTAINER} const & ${CONTAINER}::operator=(${CONTAINER} const & other)
 353 {
 354         debugmsg("${CONTAINER} operator=",LOGLEVEL_ASSIGNMENT);
 355         if (this != &other) {
 356                 destroy(true);
 357                 copy(other);
 358         }
 359         return *this;
 360 }
 361
 362 // protected
 363
 364 void ${CONTAINER}::copy(${CONTAINER} const & other)
 365 {
 366         inherited::copy(other);
 367         seq=other.seq;
 368 }
 369
 370 void ${CONTAINER}::destroy(bool call_parent)
 371 {
 372         seq.clear();
 373         if (call_parent) inherited::destroy(call_parent);
 374 }
 375
 376 //////////
 377 // other constructors
 378 //////////
 379
 380 // public
 381
 382 ${CONTAINER}::${CONTAINER}(${STLT} const & s, bool discardable) :  basic(TINFO_${CONTAINER})
 383 {
 384         debugmsg("${CONTAINER} constructor from ${STLT}", LOGLEVEL_CONSTRUCT);
 385         if (discardable) {
 386                 seq.swap(const_cast<${STLT} &>(s));
 387         } else {
 388                 seq=s;
 389         }
 390 }
 391
 392 ${CONTAINER}::${CONTAINER}(${STLT} * vp) : basic(TINFO_${CONTAINER})
 393 {
 394         debugmsg("${CONTAINER} constructor from ${STLT} *",LOGLEVEL_CONSTRUCT);
 395         GINAC_ASSERT(vp!=0);
 396         seq.swap(*vp);
 397         delete vp;
 398 }
 399
 400 ${constructors_implementation}
 401
 402 //////////
 403 // archiving
 404 //////////
 405
 406 /** Construct object from archive_node. */
 407 ${CONTAINER}::${CONTAINER}(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
 408 {
 409         debugmsg("${CONTAINER} constructor from archive_node", LOGLEVEL_CONSTRUCT);
 410         for (unsigned int i=0; true; i++) {
 411                 ex e;
 412                 if (n.find_ex("seq", e, sym_lst, i))
 413                         seq.push_back(e);
 414                 else
 415                         break;
 416         }
 417 }
 418
 419 /** Unarchive the object. */
 420 ex ${CONTAINER}::unarchive(const archive_node &n, const lst &sym_lst)
 421 {
 422         return (new ${CONTAINER}(n, sym_lst))->setflag(status_flags::dynallocated);
 423 }
 424
 425 /** Archive the object. */
 426 void ${CONTAINER}::archive(archive_node &n) const
 427 {
 428         inherited::archive(n);
 429         ${STLT}::const_iterator i = seq.begin(), iend = seq.end();
 430         while (i != iend) {
 431                 n.add_ex("seq", *i);
 432                 i++;
 433         }
 434 }
 435
 436 //////////
 437 // functions overriding virtual functions from bases classes
 438 //////////
 439
 440 // public
 441
 442 basic * ${CONTAINER}::duplicate() const
 443 {
 444         debugmsg("${CONTAINER} duplicate",LOGLEVEL_DUPLICATE);
 445         return new ${CONTAINER}(*this);
 446 }
 447
 448 void ${CONTAINER}::printraw(std::ostream & os) const
 449 {
 450         debugmsg("${CONTAINER} printraw",LOGLEVEL_PRINT);
 451
 452         os << "${CONTAINER}(";
 453         for (${STLT}::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit) {
 454                 (*cit).bp->printraw(os);
 455                 os << ",";
 456         }
 457         os << ")";
 458 }
 459
 460 void ${CONTAINER}::print(std::ostream & os, unsigned upper_precedence) const
 461 {
 462         debugmsg("${CONTAINER} print",LOGLEVEL_PRINT);
 463         // always print brackets around seq, ignore upper_precedence
 464         printseq(os,'${open_bracket}',',','${close_bracket}',precedence,precedence+1);
 465 }
 466
 467 void ${CONTAINER}::printtree(std::ostream & os, unsigned indent) const
 468 {
 469         debugmsg("${CONTAINER} printtree",LOGLEVEL_PRINT);
 470
 471         os << std::string(indent,' ') << "type=" << class_name()
 472            << ", hash=" << hashvalue
 473            << " (0x" << std::hex << hashvalue << std::dec << ")"
 474            << ", flags=" << flags
 475            << ", nops=" << nops() << std::endl;
 476         for (${STLT}::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit) {
 477                 (*cit).printtree(os,indent+delta_indent);
 478         }
 479         os << std::string(indent+delta_indent,' ') << "=====" << std::endl;
 480 }
 481
 482 // ${CONTAINER}::info() will be implemented by user elsewhere";
 483
 484 unsigned ${CONTAINER}::nops() const
 485 {
 486         return seq.size();
 487 }
 488
 489 ${LET_OP_IMPLEMENTATION}
 490
 491 ex ${CONTAINER}::expand(unsigned options) const
 492 {
 493         ${STLT} s;
 494         RESERVE(s,seq.size());
 495         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 496                 s.push_back((*it).expand(options));
 497         }
 498
 499         return this${CONTAINER}(s);
 500 }
 501
 502 // a ${CONTAINER} 'has' an expression if it is this expression itself or a child 'has' it
 503
 504 bool ${CONTAINER}::has(const ex & other) const
 505 {
 506         GINAC_ASSERT(other.bp!=0);
 507         if (is_equal(*other.bp)) return true;
 508         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 509                 if ((*it).has(other)) return true;
 510         }
 511         return false;
 512 }
 513
 514 ex ${CONTAINER}::eval(int level) const
 515 {
 516         if (level==1) {
 517                 return this->hold();
 518         }
 519         return this${CONTAINER}(evalchildren(level));
 520 }
 521
 522 ex ${CONTAINER}::evalf(int level) const
 523 {
 524         return this${CONTAINER}(evalfchildren(level));
 525 }
 526
 527 /** Implementation of ex::normal() for ${CONTAINER}s. It normalizes the arguments
 528  *  and replaces the ${CONTAINER} by a temporary symbol.
 529  *  \@see ex::normal */
 530 ex ${CONTAINER}::normal(lst &sym_lst, lst &repl_lst, int level) const
 531 {
 532         ex n=this${CONTAINER}(normalchildren(level));
 533         return n.bp->basic::normal(sym_lst,repl_lst,level);
 534 }
 535
 536 ex ${CONTAINER}::derivative(const symbol & s) const
 537 {
 538         return this${CONTAINER}(diffchildren(s));
 539 }
 540
 541 ex ${CONTAINER}::subs(const lst & ls, const lst & lr) const
 542 {
 543         ${STLT} * vp=subschildren(ls,lr);
 544         if (vp==0) {
 545                 return *this;
 546         }
 547         return this${CONTAINER}(vp);
 548 }
 549
 550 // protected
 551
 552 int ${CONTAINER}::compare_same_type(const basic & other) const
 553 {
 554         GINAC_ASSERT(is_of_type(other,${CONTAINER}));
 555         ${CONTAINER} const & o=static_cast<${CONTAINER} const &>
 556                                                                         (const_cast<basic &>(other));
 557         int cmpval;
 558         ${STLT}::const_iterator it1=seq.begin();
 559         ${STLT}::const_iterator it2=o.seq.begin();
 560
 561         for (; (it1!=seq.end())&&(it2!=o.seq.end()); ++it1, ++it2) {
 562                 cmpval=(*it1).compare(*it2);
 563                 if (cmpval!=0) return cmpval;
 564         }
 565
 566         if (it1==seq.end()) {
 567                 return (it2==o.seq.end() ? 0 : -1);
 568         }
 569
 570         return 1;
 571 }
 572
 573 bool ${CONTAINER}::is_equal_same_type(const basic & other) const
 574 {
 575         GINAC_ASSERT(is_of_type(other,${CONTAINER}));
 576         ${CONTAINER} const & o=static_cast<${CONTAINER} const &>
 577                                                                         (const_cast<basic &>(other));
 578         if (seq.size()!=o.seq.size()) return false;
 579
 580         ${STLT}::const_iterator it1=seq.begin();
 581         ${STLT}::const_iterator it2=o.seq.begin();
 582
 583         for (; it1!=seq.end(); ++it1, ++it2) {
 584                 if (!(*it1).is_equal(*it2)) return false;
 585         }
 586
 587         return true;
 588 }
 589
 590 unsigned ${CONTAINER}::return_type(void) const
 591 {
 592         return return_types::noncommutative_composite;
 593 }
 594
 595 //////////
 596 // new virtual functions which can be overridden by derived classes
 597 //////////
 598
 599 // public
 600
 601 ${CONTAINER} & ${CONTAINER}::append(const ex & b)
 602 {
 603         ensure_if_modifiable();
 604         seq.push_back(b);
 605         return *this;
 606 }
 607
 608 ${PREPEND_IMPLEMENTATION}
 609
 610 // protected
 611
 612 void ${CONTAINER}::printseq(std::ostream & os, char openbracket, char delim,
 613                             char closebracket, unsigned this_precedence,
 614                             unsigned upper_precedence) const
 615 {
 616         if (this_precedence<=upper_precedence) os << openbracket;
 617         if (seq.size()!=0) {
 618                 ${STLT}::const_iterator it,it_last;
 619                 it=seq.begin();
 620                 it_last=seq.end();
 621                 --it_last;
 622                 for (; it!=it_last; ++it) {
 623                         (*it).bp->print(os,this_precedence);
 624                         os << delim;
 625                 }
 626                 (*it).bp->print(os,this_precedence);
 627         }
 628         if (this_precedence<=upper_precedence) os << closebracket;
 629 }
 630
 631 ex ${CONTAINER}::this${CONTAINER}(${STLT} const & v) const
 632 {
 633         return ${CONTAINER}(v);
 634 }
 635
 636 ex ${CONTAINER}::this${CONTAINER}(${STLT} * vp) const
 637 {
 638         return ${CONTAINER}(vp);
 639 }
 640
 641 //////////
 642 // non-virtual functions in this class
 643 //////////
 644
 645 // public
 646
 647 // none
 648
 649 // protected
 650
 651 bool ${CONTAINER}::is_canonical() const
 652 {
 653         if (seq.size()<=1) { return 1; }
 654
 655         ${STLT}::const_iterator it=seq.begin();
 656         ${STLT}::const_iterator it_last=it;
 657         for (++it; it!=seq.end(); it_last=it, ++it) {
 658                 if ((*it_last).compare(*it)>0) {
 659                         if ((*it_last).compare(*it)>0) {
 660                                 std::cout << *it_last << ">" << *it << "\\n";
 661                                 return 0;
 662                         }
 663                 }
 664         }
 665         return 1;
 666 }
 667
 668
 669 ${STLT} ${CONTAINER}::evalchildren(int level) const
 670 {
 671         ${STLT} s;
 672         RESERVE(s,seq.size());
 673
 674         if (level==1) {
 675                 return seq;
 676         }
 677         if (level == -max_recursion_level) {
 678                 throw(std::runtime_error("max recursion level reached"));
 679         }
 680         --level;
 681         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 682                 s.push_back((*it).eval(level));
 683         }
 684         return s;
 685 }
 686
 687 ${STLT} ${CONTAINER}::evalfchildren(int level) const
 688 {
 689         ${STLT} s;
 690         RESERVE(s,seq.size());
 691
 692         if (level==1) {
 693                 return seq;
 694         }
 695         if (level == -max_recursion_level) {
 696                 throw(std::runtime_error("max recursion level reached"));
 697         }
 698         --level;
 699         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 700                 s.push_back((*it).evalf(level));
 701         }
 702         return s;
 703 }
 704
 705 ${STLT} ${CONTAINER}::normalchildren(int level) const
 706 {
 707         ${STLT} s;
 708         RESERVE(s,seq.size());
 709
 710         if (level==1) {
 711                 return seq;
 712         }
 713         if (level == -max_recursion_level) {
 714                 throw(std::runtime_error("max recursion level reached"));
 715         }
 716         --level;
 717         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 718                 s.push_back((*it).normal(level));
 719         }
 720         return s;
 721 }
 722
 723 ${STLT} ${CONTAINER}::diffchildren(const symbol & y) const
 724 {
 725         ${STLT} s;
 726         RESERVE(s,seq.size());
 727         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 728                 s.push_back((*it).diff(y));
 729         }
 730         return s;
 731 }
 732
 733 /* obsolete subschildren
 734 ${STLT} ${CONTAINER}::subschildren(const lst & ls, const lst & lr) const
 735 {
 736         ${STLT} s;
 737         RESERVE(s,seq.size());
 738         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 739                 s.push_back((*it).subs(ls,lr));
 740         }
 741         return s;
 742 }
 743 */
 744
 745 ${STLT} * ${CONTAINER}::subschildren(const lst & ls, const lst & lr) const
 746 {
 747         // returns a NULL pointer if nothing had to be substituted
 748         // returns a pointer to a newly created epvector otherwise
 749         // (which has to be deleted somewhere else)
 750
 751         ${STLT}::const_iterator last=seq.end();
 752         ${STLT}::const_iterator cit=seq.begin();
 753         while (cit!=last) {
 754                 const ex & subsed_ex=(*cit).subs(ls,lr);
 755                 if (!are_ex_trivially_equal(*cit,subsed_ex)) {
 756
 757                         // something changed, copy seq, subs and return it
 758                         ${STLT} *s=new ${STLT};
 759                         RESERVE(*s,seq.size());
 760
 761                         // copy parts of seq which are known not to have changed
 762                         ${STLT}::const_iterator cit2=seq.begin();
 763                         while (cit2!=cit) {
 764                                 s->push_back(*cit2);
 765                                 ++cit2;
 766                         }
 767                         // copy first changed element
 768                         s->push_back(subsed_ex);
 769                         ++cit2;
 770                         // copy rest
 771                         while (cit2!=last) {
 772                                 s->push_back((*cit2).subs(ls,lr));
 773                                 ++cit2;
 774                         }
 775                         return s;
 776                 }
 777                 ++cit;
 778         }
 779
 780         return 0; // nothing has changed
 781 }
 782
 783 //////////
 784 // static member variables
 785 //////////
 786
 787 // protected
 788
 789 unsigned ${CONTAINER}::precedence=10;
 790
 791 //////////
 792 // global constants
 793 //////////
 794
 795 const ${CONTAINER} some_${CONTAINER};
 796 const std::type_info & typeid_${CONTAINER} = typeid(some_${CONTAINER});
 797
 798 #ifndef NO_NAMESPACE_GINAC
 799 } // namespace GiNaC
 800 #endif // ndef NO_NAMESPACE_GINAC
 801
 802 END_OF_IMPLEMENTATION
 803
 804 print "Creating interface file ${CONTAINER}.h...";
 805 open OUT,">${CONTAINER}.h" or die "cannot open ${CONTAINER}.h";
 806 print OUT $interface;
 807 close OUT;
 808 print "ok.\n";
 809
 810 print "Creating implementation file ${CONTAINER}.cpp...";
 811 open OUT,">${CONTAINER}.cpp" or die "cannot open ${CONTAINER}.cpp";
 812 print OUT $implementation;
 813 close OUT;
 814 print "ok.\n";
 815
 816 print "done.\n";