3 * Implementation of GiNaC's wildcard objects. */
6 * GiNaC Copyright (C) 1999-2003 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
32 GINAC_IMPLEMENT_REGISTERED_CLASS_OPT(wildcard, basic,
33 print_func<print_context>(&wildcard::do_print).
34 print_func<print_tree>(&wildcard::do_print_tree).
35 print_func<print_python_repr>(&wildcard::do_print_python_repr))
38 // default constructor
41 wildcard::wildcard() : inherited(TINFO_wildcard), label(0)
43 setflag(status_flags::evaluated | status_flags::expanded);
50 wildcard::wildcard(unsigned l) : inherited(TINFO_wildcard), label(l)
52 setflag(status_flags::evaluated | status_flags::expanded);
59 wildcard::wildcard(const archive_node &n, lst &sym_lst) : inherited(n, sym_lst)
61 n.find_unsigned("label", label);
62 setflag(status_flags::evaluated | status_flags::expanded);
65 void wildcard::archive(archive_node &n) const
67 inherited::archive(n);
68 n.add_unsigned("label", label);
71 DEFAULT_UNARCHIVE(wildcard)
74 // functions overriding virtual functions from base classes
77 int wildcard::compare_same_type(const basic & other) const
79 GINAC_ASSERT(is_a<wildcard>(other));
80 const wildcard &o = static_cast<const wildcard &>(other);
85 return label < o.label ? -1 : 1;
88 void wildcard::do_print(const print_context & c, unsigned level) const
93 void wildcard::do_print_tree(const print_tree & c, unsigned level) const
95 c.s << std::string(level, ' ') << class_name() << " (" << label << ")"
96 << std::hex << ", hash=0x" << hashvalue << ", flags=0x" << flags << std::dec
100 void wildcard::do_print_python_repr(const print_python_repr & c, unsigned level) const
102 c.s << class_name() << '(' << label << ')';
105 unsigned wildcard::calchash() const
107 // this is where the schoolbook method
108 // (golden_ratio_hash(tinfo()) ^ label)
109 // is not good enough yet...
110 hashvalue = golden_ratio_hash(golden_ratio_hash(tinfo()) ^ label);
111 setflag(status_flags::hash_calculated);
115 bool wildcard::match(const ex & pattern, lst & repl_lst) const
117 // Wildcards must match each other exactly (this is required for
118 // subs() to work properly because in the final step it substitutes
119 // all wildcards by their matching expressions)
120 return is_equal(ex_to<basic>(pattern));