3 * Interface to GiNaC's light-weight expression handles. */
6 * GiNaC Copyright (C) 1999-2006 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
23 #ifndef __GINAC_EX_H__
24 #define __GINAC_EX_H__
37 /** Helper class to initialize the library. There must be one static object
38 * of this class in every object file that makes use of our flyweights in
39 * order to guarantee proper initialization. Hence we put it into this
40 * file which is included by every relevant file anyways. This is modeled
41 * after section 27.4.2.1.6 of the C++ standard, where cout and friends are
52 /** For construction of flyweights, etc. */
53 static library_init library_initializer;
56 class scalar_products;
58 class const_preorder_iterator;
59 class const_postorder_iterator;
62 /** Lightweight wrapper for GiNaC's symbolic objects. Basically all it does is
63 * to hold a pointer to the other objects, manage the reference counting and
64 * provide methods for manipulation of these objects. (Some people call such
65 * a thing a proxy class.) */
67 friend class archive_node;
68 friend inline bool are_ex_trivially_equal(const ex &, const ex &);
69 template<class T> friend inline const T &ex_to(const ex &);
70 template<class T> friend inline bool is_a(const ex &);
71 template<class T> friend inline bool is_exactly_a(const ex &);
73 // default constructor, copy constructor and assignment operator
79 ex(const basic & other);
86 /** Construct ex from string and a list of symbols. The input grammar is
87 * similar to the GiNaC output format. All symbols and indices to be used
88 * in the expression must be specified in a lst in the second argument.
89 * Undefined symbols and other parser errors will throw an exception. */
90 ex(const std::string &s, const ex &l);
93 // non-virtual functions in this class
95 /** Efficiently swap the contents of two expressions. */
96 void swap(ex & other) throw()
98 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
99 GINAC_ASSERT(other.bp->flags & status_flags::dynallocated);
104 const_iterator begin() const throw();
105 const_iterator end() const throw();
106 const_preorder_iterator preorder_begin() const;
107 const_preorder_iterator preorder_end() const throw();
108 const_postorder_iterator postorder_begin() const;
109 const_postorder_iterator postorder_end() const throw();
112 ex eval(int level = 0) const { return bp->eval(level); }
113 ex evalf(int level = 0) const { return bp->evalf(level); }
114 ex evalm() const { return bp->evalm(); }
115 ex eval_ncmul(const exvector & v) const { return bp->eval_ncmul(v); }
116 ex eval_integ() const { return bp->eval_integ(); }
119 void print(const print_context & c, unsigned level = 0) const;
120 void dbgprint() const;
121 void dbgprinttree() const;
124 bool info(unsigned inf) const { return bp->info(inf); }
127 size_t nops() const { return bp->nops(); }
128 ex op(size_t i) const { return bp->op(i); }
129 ex operator[](const ex & index) const { return (*bp)[index]; }
130 ex operator[](size_t i) const { return (*bp)[i]; }
131 ex & let_op(size_t i);
132 ex & operator[](const ex & index);
133 ex & operator[](size_t i);
137 // complex conjugation
138 ex conjugate() const { return bp->conjugate(); }
141 bool has(const ex & pattern, unsigned options = 0) const { return bp->has(pattern, options); }
142 bool find(const ex & pattern, lst & found) const;
143 bool match(const ex & pattern) const;
144 bool match(const ex & pattern, lst & repl_lst) const { return bp->match(pattern, repl_lst); }
147 ex subs(const exmap & m, unsigned options = 0) const;
148 ex subs(const lst & ls, const lst & lr, unsigned options = 0) const;
149 ex subs(const ex & e, unsigned options = 0) const;
152 ex map(map_function & f) const { return bp->map(f); }
153 ex map(ex (*f)(const ex & e)) const;
155 // visitors and tree traversal
156 void accept(visitor & v) const { bp->accept(v); }
157 void traverse_preorder(visitor & v) const;
158 void traverse_postorder(visitor & v) const;
159 void traverse(visitor & v) const { traverse_preorder(v); }
162 bool is_polynomial(const ex & vars) const;
163 int degree(const ex & s) const { return bp->degree(s); }
164 int ldegree(const ex & s) const { return bp->ldegree(s); }
165 ex coeff(const ex & s, int n = 1) const { return bp->coeff(s, n); }
166 ex lcoeff(const ex & s) const { return coeff(s, degree(s)); }
167 ex tcoeff(const ex & s) const { return coeff(s, ldegree(s)); }
170 ex expand(unsigned options=0) const;
171 ex collect(const ex & s, bool distributed = false) const { return bp->collect(s, distributed); }
173 // differentiation and series expansion
174 ex diff(const symbol & s, unsigned nth = 1) const;
175 ex series(const ex & r, int order, unsigned options = 0) const;
177 // rational functions
178 ex normal(int level = 0) const;
179 ex to_rational(exmap & repl) const;
180 ex to_rational(lst & repl_lst) const;
181 ex to_polynomial(exmap & repl) const;
182 ex to_polynomial(lst & repl_lst) const;
185 ex numer_denom() const;
187 // polynomial algorithms
188 ex unit(const ex &x) const;
189 ex content(const ex &x) const;
190 numeric integer_content() const;
191 ex primpart(const ex &x) const;
192 ex primpart(const ex &x, const ex &cont) const;
193 void unitcontprim(const ex &x, ex &u, ex &c, ex &p) const;
194 ex smod(const numeric &xi) const { return bp->smod(xi); }
195 numeric max_coefficient() const;
198 exvector get_free_indices() const { return bp->get_free_indices(); }
199 ex simplify_indexed(unsigned options = 0) const;
200 ex simplify_indexed(const scalar_products & sp, unsigned options = 0) const;
203 int compare(const ex & other) const;
204 bool is_equal(const ex & other) const;
205 bool is_zero() const { extern const ex _ex0; return is_equal(_ex0); }
208 ex symmetrize() const;
209 ex symmetrize(const lst & l) const;
210 ex antisymmetrize() const;
211 ex antisymmetrize(const lst & l) const;
212 ex symmetrize_cyclic() const;
213 ex symmetrize_cyclic(const lst & l) const;
216 unsigned return_type() const { return bp->return_type(); }
217 tinfo_t return_type_tinfo() const { return bp->return_type_tinfo(); }
219 unsigned gethash() const { return bp->gethash(); }
222 static ptr<basic> construct_from_basic(const basic & other);
223 static basic & construct_from_int(int i);
224 static basic & construct_from_uint(unsigned int i);
225 static basic & construct_from_long(long i);
226 static basic & construct_from_ulong(unsigned long i);
227 static basic & construct_from_double(double d);
228 static ptr<basic> construct_from_string_and_lst(const std::string &s, const ex &l);
229 void makewriteable();
230 void share(const ex & other) const;
235 mutable ptr<basic> bp; ///< pointer to basic object managed by this
239 // performance-critical inlined method implementations
241 // This needs to be a basic* because we don't know that numeric is derived
242 // from basic and we need a basic& for the ex default constructor
243 extern const basic *_num0_bp;
246 ex::ex() throw() : bp(*const_cast<basic *>(_num0_bp))
248 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
252 ex::ex(const basic & other) : bp(construct_from_basic(other))
254 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
258 ex::ex(int i) : bp(construct_from_int(i))
260 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
264 ex::ex(unsigned int i) : bp(construct_from_uint(i))
266 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
270 ex::ex(long i) : bp(construct_from_long(i))
272 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
276 ex::ex(unsigned long i) : bp(construct_from_ulong(i))
278 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
282 ex::ex(double const d) : bp(construct_from_double(d))
284 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
288 ex::ex(const std::string &s, const ex &l) : bp(construct_from_string_and_lst(s, l))
290 GINAC_ASSERT(bp->flags & status_flags::dynallocated);
294 int ex::compare(const ex & other) const
296 #ifdef GINAC_COMPARE_STATISTICS
297 compare_statistics.total_compares++;
299 if (bp == other.bp) // trivial case: both expressions point to same basic
301 #ifdef GINAC_COMPARE_STATISTICS
302 compare_statistics.nontrivial_compares++;
304 const int cmpval = bp->compare(*other.bp);
307 // Expressions point to different, but equal, trees: conserve
308 // memory and make subsequent compare() operations faster by
309 // making both expressions point to the same tree.
317 bool ex::is_equal(const ex & other) const
319 #ifdef GINAC_COMPARE_STATISTICS
320 compare_statistics.total_is_equals++;
322 if (bp == other.bp) // trivial case: both expressions point to same basic
324 #ifdef GINAC_COMPARE_STATISTICS
325 compare_statistics.nontrivial_is_equals++;
327 const bool equal = bp->is_equal(*other.bp);
330 // Expressions point to different, but equal, trees: conserve
331 // memory and make subsequent compare() operations faster by
332 // making both expressions point to the same tree.
342 class const_iterator : public std::iterator<std::random_access_iterator_tag, ex, ptrdiff_t, const ex *, const ex &> {
344 friend class const_preorder_iterator;
345 friend class const_postorder_iterator;
348 const_iterator() throw() {}
351 const_iterator(const ex &e_, size_t i_) throw() : e(e_), i(i_) {}
354 // This should return an ex&, but that would be a reference to a
361 // This should return an ex*, but that would be a pointer to a
363 std::auto_ptr<ex> operator->() const
365 return std::auto_ptr<ex>(new ex(operator*()));
368 ex operator[](difference_type n) const
373 const_iterator &operator++() throw()
379 const_iterator operator++(int) throw()
381 const_iterator tmp = *this;
386 const_iterator &operator+=(difference_type n) throw()
392 const_iterator operator+(difference_type n) const throw()
394 return const_iterator(e, i + n);
397 inline friend const_iterator operator+(difference_type n, const const_iterator &it) throw()
399 return const_iterator(it.e, it.i + n);
402 const_iterator &operator--() throw()
408 const_iterator operator--(int) throw()
410 const_iterator tmp = *this;
415 const_iterator &operator-=(difference_type n) throw()
421 const_iterator operator-(difference_type n) const throw()
423 return const_iterator(e, i - n);
426 inline friend difference_type operator-(const const_iterator &lhs, const const_iterator &rhs) throw()
428 return lhs.i - rhs.i;
431 bool operator==(const const_iterator &other) const throw()
433 return are_ex_trivially_equal(e, other.e) && i == other.i;
436 bool operator!=(const const_iterator &other) const throw()
438 return !(*this == other);
441 bool operator<(const const_iterator &other) const throw()
446 bool operator>(const const_iterator &other) const throw()
448 return other < *this;
451 bool operator<=(const const_iterator &other) const throw()
453 return !(other < *this);
456 bool operator>=(const const_iterator &other) const throw()
458 return !(*this < other);
462 ex e; // this used to be a "const basic *", but in view of object fusion that wouldn't be safe
469 _iter_rep(const ex &e_, size_t i_, size_t i_end_) : e(e_), i(i_), i_end(i_end_) {}
471 bool operator==(const _iter_rep &other) const throw()
473 return are_ex_trivially_equal(e, other.e) && i == other.i;
476 bool operator!=(const _iter_rep &other) const throw()
478 return !(*this == other);
486 } // namespace internal
488 class const_preorder_iterator : public std::iterator<std::forward_iterator_tag, ex, ptrdiff_t, const ex *, const ex &> {
490 const_preorder_iterator() throw() {}
492 const_preorder_iterator(const ex &e, size_t n)
494 s.push(internal::_iter_rep(e, 0, n));
498 reference operator*() const
503 pointer operator->() const
508 const_preorder_iterator &operator++()
514 const_preorder_iterator operator++(int)
516 const_preorder_iterator tmp = *this;
521 bool operator==(const const_preorder_iterator &other) const throw()
526 bool operator!=(const const_preorder_iterator &other) const throw()
528 return !(*this == other);
532 std::stack<internal::_iter_rep, std::vector<internal::_iter_rep> > s;
536 while (!s.empty() && s.top().i == s.top().i_end) {
543 internal::_iter_rep & current = s.top();
545 if (current.i != current.i_end) {
546 const ex & child = current.e.op(current.i);
547 s.push(internal::_iter_rep(child, 0, child.nops()));
552 class const_postorder_iterator : public std::iterator<std::forward_iterator_tag, ex, ptrdiff_t, const ex *, const ex &> {
554 const_postorder_iterator() throw() {}
556 const_postorder_iterator(const ex &e, size_t n)
558 s.push(internal::_iter_rep(e, 0, n));
563 reference operator*() const
568 pointer operator->() const
573 const_postorder_iterator &operator++()
579 const_postorder_iterator operator++(int)
581 const_postorder_iterator tmp = *this;
586 bool operator==(const const_postorder_iterator &other) const throw()
591 bool operator!=(const const_postorder_iterator &other) const throw()
593 return !(*this == other);
597 std::stack<internal::_iter_rep, std::vector<internal::_iter_rep> > s;
601 while (s.top().i != s.top().i_end) {
602 internal::_iter_rep & current = s.top();
603 const ex & child = current.e.op(current.i);
604 s.push(internal::_iter_rep(child, 0, child.nops()));
610 if (s.top().i == s.top().i_end)
619 inline const_iterator ex::begin() const throw()
621 return const_iterator(*this, 0);
624 inline const_iterator ex::end() const throw()
626 return const_iterator(*this, nops());
629 inline const_preorder_iterator ex::preorder_begin() const
631 return const_preorder_iterator(*this, nops());
634 inline const_preorder_iterator ex::preorder_end() const throw()
636 return const_preorder_iterator();
639 inline const_postorder_iterator ex::postorder_begin() const
641 return const_postorder_iterator(*this, nops());
644 inline const_postorder_iterator ex::postorder_end() const throw()
646 return const_postorder_iterator();
652 /** Compare two objects of class quickly without doing a deep tree traversal.
653 * @return "true" if they are equal
654 * "false" if equality cannot be established quickly (e1 and e2 may
655 * still be equal, in this case. */
656 inline bool are_ex_trivially_equal(const ex &e1, const ex &e2)
658 return e1.bp == e2.bp;
661 /* Function objects for STL sort() etc. */
662 struct ex_is_less : public std::binary_function<ex, ex, bool> {
663 bool operator() (const ex &lh, const ex &rh) const { return lh.compare(rh) < 0; }
666 struct ex_is_equal : public std::binary_function<ex, ex, bool> {
667 bool operator() (const ex &lh, const ex &rh) const { return lh.is_equal(rh); }
670 struct op0_is_equal : public std::binary_function<ex, ex, bool> {
671 bool operator() (const ex &lh, const ex &rh) const { return lh.op(0).is_equal(rh.op(0)); }
674 struct ex_swap : public std::binary_function<ex, ex, void> {
675 void operator() (ex &lh, ex &rh) const { lh.swap(rh); }
678 // wrapper functions around member functions
679 inline size_t nops(const ex & thisex)
680 { return thisex.nops(); }
682 inline ex expand(const ex & thisex, unsigned options = 0)
683 { return thisex.expand(options); }
685 inline ex conjugate(const ex & thisex)
686 { return thisex.conjugate(); }
688 inline bool has(const ex & thisex, const ex & pattern, unsigned options = 0)
689 { return thisex.has(pattern, options); }
691 inline bool find(const ex & thisex, const ex & pattern, lst & found)
692 { return thisex.find(pattern, found); }
694 inline bool is_polynomial(const ex & thisex, const ex & vars)
695 { return thisex.is_polynomial(vars); }
697 inline int degree(const ex & thisex, const ex & s)
698 { return thisex.degree(s); }
700 inline int ldegree(const ex & thisex, const ex & s)
701 { return thisex.ldegree(s); }
703 inline ex coeff(const ex & thisex, const ex & s, int n=1)
704 { return thisex.coeff(s, n); }
706 inline ex numer(const ex & thisex)
707 { return thisex.numer(); }
709 inline ex denom(const ex & thisex)
710 { return thisex.denom(); }
712 inline ex numer_denom(const ex & thisex)
713 { return thisex.numer_denom(); }
715 inline ex normal(const ex & thisex, int level=0)
716 { return thisex.normal(level); }
718 inline ex to_rational(const ex & thisex, lst & repl_lst)
719 { return thisex.to_rational(repl_lst); }
721 inline ex to_rational(const ex & thisex, exmap & repl)
722 { return thisex.to_rational(repl); }
724 inline ex to_polynomial(const ex & thisex, exmap & repl)
725 { return thisex.to_polynomial(repl); }
727 inline ex to_polynomial(const ex & thisex, lst & repl_lst)
728 { return thisex.to_polynomial(repl_lst); }
730 inline ex collect(const ex & thisex, const ex & s, bool distributed = false)
731 { return thisex.collect(s, distributed); }
733 inline ex eval(const ex & thisex, int level = 0)
734 { return thisex.eval(level); }
736 inline ex evalf(const ex & thisex, int level = 0)
737 { return thisex.evalf(level); }
739 inline ex evalm(const ex & thisex)
740 { return thisex.evalm(); }
742 inline ex eval_integ(const ex & thisex)
743 { return thisex.eval_integ(); }
745 inline ex diff(const ex & thisex, const symbol & s, unsigned nth = 1)
746 { return thisex.diff(s, nth); }
748 inline ex series(const ex & thisex, const ex & r, int order, unsigned options = 0)
749 { return thisex.series(r, order, options); }
751 inline bool match(const ex & thisex, const ex & pattern, lst & repl_lst)
752 { return thisex.match(pattern, repl_lst); }
754 inline ex simplify_indexed(const ex & thisex, unsigned options = 0)
755 { return thisex.simplify_indexed(options); }
757 inline ex simplify_indexed(const ex & thisex, const scalar_products & sp, unsigned options = 0)
758 { return thisex.simplify_indexed(sp, options); }
760 inline ex symmetrize(const ex & thisex)
761 { return thisex.symmetrize(); }
763 inline ex symmetrize(const ex & thisex, const lst & l)
764 { return thisex.symmetrize(l); }
766 inline ex antisymmetrize(const ex & thisex)
767 { return thisex.antisymmetrize(); }
769 inline ex antisymmetrize(const ex & thisex, const lst & l)
770 { return thisex.antisymmetrize(l); }
772 inline ex symmetrize_cyclic(const ex & thisex)
773 { return thisex.symmetrize_cyclic(); }
775 inline ex symmetrize_cyclic(const ex & thisex, const lst & l)
776 { return thisex.symmetrize_cyclic(l); }
778 inline ex op(const ex & thisex, size_t i)
779 { return thisex.op(i); }
781 inline ex lhs(const ex & thisex)
782 { return thisex.lhs(); }
784 inline ex rhs(const ex & thisex)
785 { return thisex.rhs(); }
787 inline bool is_zero(const ex & thisex)
788 { return thisex.is_zero(); }
790 inline void swap(ex & e1, ex & e2)
793 inline ex ex::subs(const exmap & m, unsigned options) const
795 return bp->subs(m, options);
798 inline ex subs(const ex & thisex, const exmap & m, unsigned options = 0)
799 { return thisex.subs(m, options); }
801 inline ex subs(const ex & thisex, const lst & ls, const lst & lr, unsigned options = 0)
802 { return thisex.subs(ls, lr, options); }
804 inline ex subs(const ex & thisex, const ex & e, unsigned options = 0)
805 { return thisex.subs(e, options); }
808 /* Convert function pointer to function object suitable for map(). */
809 class pointer_to_map_function : public map_function {
811 ex (*ptr)(const ex &);
813 explicit pointer_to_map_function(ex x(const ex &)) : ptr(x) {}
814 ex operator()(const ex & e) { return ptr(e); }
818 class pointer_to_map_function_1arg : public map_function {
820 ex (*ptr)(const ex &, T1);
823 explicit pointer_to_map_function_1arg(ex x(const ex &, T1), T1 a1) : ptr(x), arg1(a1) {}
824 ex operator()(const ex & e) { return ptr(e, arg1); }
827 template<class T1, class T2>
828 class pointer_to_map_function_2args : public map_function {
830 ex (*ptr)(const ex &, T1, T2);
834 explicit pointer_to_map_function_2args(ex x(const ex &, T1, T2), T1 a1, T2 a2) : ptr(x), arg1(a1), arg2(a2) {}
835 ex operator()(const ex & e) { return ptr(e, arg1, arg2); }
838 template<class T1, class T2, class T3>
839 class pointer_to_map_function_3args : public map_function {
841 ex (*ptr)(const ex &, T1, T2, T3);
846 explicit pointer_to_map_function_3args(ex x(const ex &, T1, T2, T3), T1 a1, T2 a2, T3 a3) : ptr(x), arg1(a1), arg2(a2), arg3(a3) {}
847 ex operator()(const ex & e) { return ptr(e, arg1, arg2, arg3); }
850 inline ex ex::map(ex f(const ex &)) const
852 pointer_to_map_function fcn(f);
856 // convenience type checker template functions
858 /** Check if ex is a handle to a T, including base classes. */
860 inline bool is_a(const ex &obj)
862 return is_a<T>(*obj.bp);
865 /** Check if ex is a handle to a T, not including base classes. */
867 inline bool is_exactly_a(const ex &obj)
869 return is_exactly_a<T>(*obj.bp);
872 /** Return a reference to the basic-derived class T object embedded in an
873 * expression. This is fast but unsafe: the result is undefined if the
874 * expression does not contain a T object at its top level. Hence, you
875 * should generally check the type of e first. Also, you shouldn't cache
876 * the returned reference because GiNaC's garbage collector may destroy
877 * the referenced object any time it's used in another expression.
879 * @param e expression
880 * @return reference to object of class T
881 * @see is_exactly_a<class T>() */
883 inline const T &ex_to(const ex &e)
885 GINAC_ASSERT(is_a<T>(e));
886 return static_cast<const T &>(*e.bp);
892 // Specializations of Standard Library algorithms
895 /** Specialization of std::swap() for ex objects. */
897 inline void swap(GiNaC::ex &a, GiNaC::ex &b)
902 /** Specialization of std::iter_swap() for vector<ex> iterators. */
904 inline void iter_swap(vector<GiNaC::ex>::iterator i1, vector<GiNaC::ex>::iterator i2)
909 /** Specialization of std::iter_swap() for list<ex> iterators. */
911 inline void iter_swap(list<GiNaC::ex>::iterator i1, list<GiNaC::ex>::iterator i2)
918 #endif // ndef __GINAC_EX_H__