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} ctor 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-2001 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 namespace GiNaC {
 187
 188
 189 // Cint currently does not like ${STLHEADER}<..,default_alloc> but malloc_alloc is
 190 // unstandardized and not supported by newer GCCs.  This ugly hack will go
 191 // away soon!
 192 #if (defined(__GNUC__) && (__GNUC__ == 2) && (__GNUC_MINOR__ < 97)) || (defined(G__GNUC) && (G__GNUC == 2) && (G__GNUC_MINOR < 97))
 193 typedef std::${STLHEADER}<GiNaC::ex,malloc_alloc> ${STLT};
 194 #else
 195 typedef std::${STLHEADER}<ex> ${STLT};
 196 #endif
 197
 198 class ${CONTAINER} : public basic
 199 {
 200         GINAC_DECLARE_REGISTERED_CLASS(${CONTAINER}, basic)
 201
 202 public:
 203         ${CONTAINER}(${STLT} const & s, bool discardable=0);
 204         ${CONTAINER}(${STLT} * vp); // vp will be deleted
 205 ${constructors_interface}
 206
 207 public:
 208         void print(const print_context & c, unsigned level = 0) const;
 209         unsigned precedence(void) const {return 10;}
 210         bool info(unsigned inf) const;
 211         unsigned nops() const;
 212         ex & let_op(int i);
 213         ex expand(unsigned options=0) const;
 214         ex eval(int level=0) const;
 215         ex evalf(int level=0) const;
 216         ex normal(lst &sym_lst, lst &repl_lst, int level=0) const;
 217         ex derivative(const symbol & s) const;
 218         ex subs(const lst & ls, const lst & lr, bool no_pattern = false) const;
 219 protected:
 220         bool is_equal_same_type(const basic & other) const;
 221         unsigned return_type(void) const;
 222
 223         // new virtual functions which can be overridden by derived classes
 224 public:
 225         virtual ${CONTAINER} & append(const ex & b);
 226 ${PREPEND_INTERFACE}
 227 protected:
 228         virtual void printseq(const print_context & c, char openbracket, char delim,
 229                               char closebracket, unsigned this_precedence,
 230                               unsigned upper_precedence = 0) const;
 231         virtual ex this${CONTAINER}(${STLT} const & v) const;
 232         virtual ex this${CONTAINER}(${STLT} * vp) const;
 233
 234 protected:
 235         bool is_canonical() const;
 236         ${STLT} evalchildren(int level) const;
 237         ${STLT} evalfchildren(int level) const;
 238         ${STLT} normalchildren(int level) const;
 239         ${STLT} diffchildren(const symbol & s) const;
 240         ${STLT} * subschildren(const lst & ls, const lst & lr, bool no_pattern = false) const;
 241
 242 protected:
 243         ${STLT} seq;
 244 };
 245
 246 // utility functions
 247 inline const ${CONTAINER} &ex_to_${CONTAINER}(const ex &e)
 248 {
 249         return static_cast<const ${CONTAINER} &>(*e.bp);
 250 }
 251
 252 inline ${CONTAINER} &ex_to_nonconst_${CONTAINER}(const ex &e)
 253 {
 254         return static_cast<${CONTAINER} &>(*e.bp);
 255 }
 256
 257 } // namespace GiNaC
 258
 259 #endif // ndef __GINAC_${CONTAINER_UC}_H__
 260
 261 END_OF_INTERFACE
 262
 263 $implementation=<<END_OF_IMPLEMENTATION;
 264 /** \@file ${CONTAINER}.cpp
 265  *
 266  *  Implementation of GiNaC's ${CONTAINER}. */
 267
 268 /*
 269  *  This file was generated automatically by container.pl.
 270  *  Please do not modify it directly, edit the perl script instead!
 271  *  container.pl options: \$CONTAINER=${CONTAINER}
 272  *                        \$STLHEADER=${STLHEADER}
 273  *                        \$reserve=${reserve}
 274  *                        \$prepend=${prepend}
 275  *                        \$let_op=${let_op}
 276  *                        \$open_bracket=${open_bracket}
 277  *                        \$close_bracket=${close_bracket}
 278  *                        \$maxargs=${maxargs}
 279  *
 280  *  GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
 281  *
 282  *  This program is free software; you can redistribute it and/or modify
 283  *  it under the terms of the GNU General Public License as published by
 284  *  the Free Software Foundation; either version 2 of the License, or
 285  *  (at your option) any later version.
 286  *
 287  *  This program is distributed in the hope that it will be useful,
 288  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 289  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 290  *  GNU General Public License for more details.
 291  *
 292  *  You should have received a copy of the GNU General Public License
 293  *  along with this program; if not, write to the Free Software
 294  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 295  */
 296
 297 #include <iostream>
 298 #include <stdexcept>
 299
 300 #include "${CONTAINER}.h"
 301 #include "ex.h"
 302 #include "print.h"
 303 #include "archive.h"
 304 #include "debugmsg.h"
 305
 306 namespace GiNaC {
 307
 308 GINAC_IMPLEMENT_REGISTERED_CLASS(${CONTAINER}, basic)
 309
 310 ${RESERVE_IMPLEMENTATION}
 311
 312 //////////
 313 // default ctor, dtor, copy ctor assignment operator and helpers
 314 //////////
 315
 316 // public
 317
 318 ${CONTAINER}::${CONTAINER}() : basic(TINFO_${CONTAINER})
 319 {
 320         debugmsg("${CONTAINER} default ctor",LOGLEVEL_CONSTRUCT);
 321 }
 322
 323 // protected
 324
 325 void ${CONTAINER}::copy(${CONTAINER} const & other)
 326 {
 327         inherited::copy(other);
 328         seq=other.seq;
 329 }
 330
 331 void ${CONTAINER}::destroy(bool call_parent)
 332 {
 333         seq.clear();
 334         if (call_parent) inherited::destroy(call_parent);
 335 }
 336
 337 //////////
 338 // other ctors
 339 //////////
 340
 341 // public
 342
 343 ${CONTAINER}::${CONTAINER}(${STLT} const & s, bool discardable) :  basic(TINFO_${CONTAINER})
 344 {
 345         debugmsg("${CONTAINER} ctor from ${STLT}", LOGLEVEL_CONSTRUCT);
 346         if (discardable) {
 347                 seq.swap(const_cast<${STLT} &>(s));
 348         } else {
 349                 seq=s;
 350         }
 351 }
 352
 353 ${CONTAINER}::${CONTAINER}(${STLT} * vp) : basic(TINFO_${CONTAINER})
 354 {
 355         debugmsg("${CONTAINER} ctor from ${STLT} *",LOGLEVEL_CONSTRUCT);
 356         GINAC_ASSERT(vp!=0);
 357         seq.swap(*vp);
 358         delete vp;
 359 }
 360
 361 ${constructors_implementation}
 362
 363 //////////
 364 // archiving
 365 //////////
 366
 367 /** Construct object from archive_node. */
 368 ${CONTAINER}::${CONTAINER}(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
 369 {
 370         debugmsg("${CONTAINER} ctor from archive_node", LOGLEVEL_CONSTRUCT);
 371         for (unsigned int i=0; true; i++) {
 372                 ex e;
 373                 if (n.find_ex("seq", e, sym_lst, i))
 374                         seq.push_back(e);
 375                 else
 376                         break;
 377         }
 378 }
 379
 380 /** Unarchive the object. */
 381 ex ${CONTAINER}::unarchive(const archive_node &n, const lst &sym_lst)
 382 {
 383         return (new ${CONTAINER}(n, sym_lst))->setflag(status_flags::dynallocated);
 384 }
 385
 386 /** Archive the object. */
 387 void ${CONTAINER}::archive(archive_node &n) const
 388 {
 389         inherited::archive(n);
 390         ${STLT}::const_iterator i = seq.begin(), iend = seq.end();
 391         while (i != iend) {
 392                 n.add_ex("seq", *i);
 393                 i++;
 394         }
 395 }
 396
 397 //////////
 398 // functions overriding virtual functions from bases classes
 399 //////////
 400
 401 // public
 402
 403 void ${CONTAINER}::print(const print_context & c, unsigned level) const
 404 {
 405         debugmsg("${CONTAINER} print", LOGLEVEL_PRINT);
 406
 407         if (is_of_type(c, print_tree)) {
 408
 409                 c.s << std::string(level, ' ') << class_name()
 410                     << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
 411                     << ", nops=" << nops()
 412                     << std::endl;
 413                 unsigned delta_indent = static_cast<const print_tree &>(c).delta_indent;
 414                 for (${STLT}::const_iterator cit=seq.begin(); cit!=seq.end(); ++cit)
 415                         cit->print(c, level + delta_indent);
 416                 c.s << std::string(level + delta_indent,' ') << "=====" << std::endl;
 417
 418         } else {
 419                 // always print brackets around seq, ignore upper_precedence
 420                 printseq(c, '${open_bracket}', ',', '${close_bracket}', precedence(), precedence()+1);
 421         }
 422 }
 423
 424 // ${CONTAINER}::info() will be implemented by user elsewhere";
 425
 426 unsigned ${CONTAINER}::nops() const
 427 {
 428         return seq.size();
 429 }
 430
 431 ${LET_OP_IMPLEMENTATION}
 432
 433 ex ${CONTAINER}::expand(unsigned options) const
 434 {
 435         ${STLT} s;
 436         RESERVE(s,seq.size());
 437         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 438                 s.push_back((*it).expand(options));
 439         }
 440
 441         return this${CONTAINER}(s);
 442 }
 443
 444 ex ${CONTAINER}::eval(int level) const
 445 {
 446         if (level==1) {
 447                 return this->hold();
 448         }
 449         return this${CONTAINER}(evalchildren(level));
 450 }
 451
 452 ex ${CONTAINER}::evalf(int level) const
 453 {
 454         return this${CONTAINER}(evalfchildren(level));
 455 }
 456
 457 /** Implementation of ex::normal() for ${CONTAINER}s. It normalizes the arguments
 458  *  and replaces the ${CONTAINER} by a temporary symbol.
 459  *  \@see ex::normal */
 460 ex ${CONTAINER}::normal(lst &sym_lst, lst &repl_lst, int level) const
 461 {
 462         ex n=this${CONTAINER}(normalchildren(level));
 463         return n.bp->basic::normal(sym_lst,repl_lst,level);
 464 }
 465
 466 ex ${CONTAINER}::derivative(const symbol & s) const
 467 {
 468         return this${CONTAINER}(diffchildren(s));
 469 }
 470
 471 ex ${CONTAINER}::subs(const lst & ls, const lst & lr, bool no_pattern) const
 472 {
 473         ${STLT} *vp = subschildren(ls, lr, no_pattern);
 474         if (vp)
 475                 return this${CONTAINER}(vp).bp->basic::subs(ls, lr, no_pattern);
 476         else
 477                 return basic::subs(ls, lr, no_pattern);
 478 }
 479
 480 // protected
 481
 482 int ${CONTAINER}::compare_same_type(const basic & other) const
 483 {
 484         GINAC_ASSERT(is_of_type(other,${CONTAINER}));
 485         ${CONTAINER} const & o=static_cast<${CONTAINER} const &>
 486                                                                         (const_cast<basic &>(other));
 487         int cmpval;
 488         ${STLT}::const_iterator it1=seq.begin();
 489         ${STLT}::const_iterator it2=o.seq.begin();
 490
 491         for (; (it1!=seq.end())&&(it2!=o.seq.end()); ++it1, ++it2) {
 492                 cmpval=(*it1).compare(*it2);
 493                 if (cmpval!=0) return cmpval;
 494         }
 495
 496         if (it1==seq.end()) {
 497                 return (it2==o.seq.end() ? 0 : -1);
 498         }
 499
 500         return 1;
 501 }
 502
 503 bool ${CONTAINER}::is_equal_same_type(const basic & other) const
 504 {
 505         GINAC_ASSERT(is_of_type(other,${CONTAINER}));
 506         ${CONTAINER} const & o=static_cast<${CONTAINER} const &>
 507                                                                         (const_cast<basic &>(other));
 508         if (seq.size()!=o.seq.size()) return false;
 509
 510         ${STLT}::const_iterator it1=seq.begin();
 511         ${STLT}::const_iterator it2=o.seq.begin();
 512
 513         for (; it1!=seq.end(); ++it1, ++it2) {
 514                 if (!(*it1).is_equal(*it2)) return false;
 515         }
 516
 517         return true;
 518 }
 519
 520 unsigned ${CONTAINER}::return_type(void) const
 521 {
 522         return return_types::noncommutative_composite;
 523 }
 524
 525 //////////
 526 // new virtual functions which can be overridden by derived classes
 527 //////////
 528
 529 // public
 530
 531 ${CONTAINER} & ${CONTAINER}::append(const ex & b)
 532 {
 533         ensure_if_modifiable();
 534         seq.push_back(b);
 535         return *this;
 536 }
 537
 538 ${PREPEND_IMPLEMENTATION}
 539
 540 // protected
 541
 542 void ${CONTAINER}::printseq(const print_context & c, char openbracket, char delim,
 543                             char closebracket, unsigned this_precedence,
 544                             unsigned upper_precedence) const
 545 {
 546         if (this_precedence <= upper_precedence)
 547                 c.s << openbracket;
 548
 549         if (seq.size() != 0) {
 550                 ${STLT}::const_iterator it = seq.begin(), itend = seq.end();
 551                 --itend;
 552                 while (it != itend) {
 553                         it->print(c, this_precedence);
 554                         c.s << delim;
 555                         it++;
 556                 }
 557                 it->print(c, this_precedence);
 558         }
 559
 560         if (this_precedence <= upper_precedence)
 561                 c.s << closebracket;
 562 }
 563
 564 ex ${CONTAINER}::this${CONTAINER}(${STLT} const & v) const
 565 {
 566         return ${CONTAINER}(v);
 567 }
 568
 569 ex ${CONTAINER}::this${CONTAINER}(${STLT} * vp) const
 570 {
 571         return ${CONTAINER}(vp);
 572 }
 573
 574 //////////
 575 // non-virtual functions in this class
 576 //////////
 577
 578 // public
 579
 580 // none
 581
 582 // protected
 583
 584 bool ${CONTAINER}::is_canonical() const
 585 {
 586         if (seq.size()<=1) { return 1; }
 587
 588         ${STLT}::const_iterator it=seq.begin();
 589         ${STLT}::const_iterator it_last=it;
 590         for (++it; it!=seq.end(); it_last=it, ++it) {
 591                 if ((*it_last).compare(*it)>0) {
 592                         if ((*it_last).compare(*it)>0) {
 593                                 std::cout << *it_last << ">" << *it << "\\n";
 594                                 return 0;
 595                         }
 596                 }
 597         }
 598         return 1;
 599 }
 600
 601
 602 ${STLT} ${CONTAINER}::evalchildren(int level) const
 603 {
 604         ${STLT} s;
 605         RESERVE(s,seq.size());
 606
 607         if (level==1) {
 608                 return seq;
 609         }
 610         if (level == -max_recursion_level) {
 611                 throw(std::runtime_error("max recursion level reached"));
 612         }
 613         --level;
 614         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 615                 s.push_back((*it).eval(level));
 616         }
 617         return s;
 618 }
 619
 620 ${STLT} ${CONTAINER}::evalfchildren(int level) const
 621 {
 622         ${STLT} s;
 623         RESERVE(s,seq.size());
 624
 625         if (level==1) {
 626                 return seq;
 627         }
 628         if (level == -max_recursion_level) {
 629                 throw(std::runtime_error("max recursion level reached"));
 630         }
 631         --level;
 632         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 633                 s.push_back((*it).evalf(level));
 634         }
 635         return s;
 636 }
 637
 638 ${STLT} ${CONTAINER}::normalchildren(int level) const
 639 {
 640         ${STLT} s;
 641         RESERVE(s,seq.size());
 642
 643         if (level==1) {
 644                 return seq;
 645         }
 646         if (level == -max_recursion_level) {
 647                 throw(std::runtime_error("max recursion level reached"));
 648         }
 649         --level;
 650         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 651                 s.push_back((*it).normal(level));
 652         }
 653         return s;
 654 }
 655
 656 ${STLT} ${CONTAINER}::diffchildren(const symbol & y) const
 657 {
 658         ${STLT} s;
 659         RESERVE(s,seq.size());
 660         for (${STLT}::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
 661                 s.push_back((*it).diff(y));
 662         }
 663         return s;
 664 }
 665
 666 ${STLT} * ${CONTAINER}::subschildren(const lst & ls, const lst & lr, bool no_pattern) const
 667 {
 668         // returns a NULL pointer if nothing had to be substituted
 669         // returns a pointer to a newly created epvector otherwise
 670         // (which has to be deleted somewhere else)
 671
 672         ${STLT}::const_iterator last=seq.end();
 673         ${STLT}::const_iterator cit=seq.begin();
 674         while (cit!=last) {
 675                 const ex & subsed_ex=(*cit).subs(ls,lr,no_pattern);
 676                 if (!are_ex_trivially_equal(*cit,subsed_ex)) {
 677
 678                         // something changed, copy seq, subs and return it
 679                         ${STLT} *s=new ${STLT};
 680                         RESERVE(*s,seq.size());
 681
 682                         // copy parts of seq which are known not to have changed
 683                         ${STLT}::const_iterator cit2=seq.begin();
 684                         while (cit2!=cit) {
 685                                 s->push_back(*cit2);
 686                                 ++cit2;
 687                         }
 688                         // copy first changed element
 689                         s->push_back(subsed_ex);
 690                         ++cit2;
 691                         // copy rest
 692                         while (cit2!=last) {
 693                                 s->push_back((*cit2).subs(ls,lr,no_pattern));
 694                                 ++cit2;
 695                         }
 696                         return s;
 697                 }
 698                 ++cit;
 699         }
 700
 701         return 0; // nothing has changed
 702 }
 703
 704 } // namespace GiNaC
 705
 706 END_OF_IMPLEMENTATION
 707
 708 print "Creating interface file ${CONTAINER}.h...";
 709 open OUT,">${CONTAINER}.h" or die "cannot open ${CONTAINER}.h";
 710 print OUT $interface;
 711 close OUT;
 712 print "ok.\n";
 713
 714 print "Creating implementation file ${CONTAINER}.cpp...";
 715 open OUT,">${CONTAINER}.cpp" or die "cannot open ${CONTAINER}.cpp";
 716 print OUT $implementation;
 717 close OUT;
 718 print "ok.\n";
 719
 720 print "done.\n";