GiNaC  1.8.0
lst.cpp
Go to the documentation of this file.
1 
5 /*
6  * GiNaC Copyright (C) 1999-2020 Johannes Gutenberg University Mainz, Germany
7  *
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.
12  *
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.
17  *
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
21  */
22 
23 #include "lst.h"
24 #include "archive.h"
25 
26 namespace GiNaC {
27 
30  print_func<print_tree>(&lst::do_print_tree))
31 
32 
33 template <> bool lst::info(unsigned inf) const
34 {
35  if (inf == info_flags::list)
36  return true;
37  else
38  return inherited::info(inf);
39 }
40 
42 
43 } // namespace GiNaC
Definition: add.cpp:38
Archiving of GiNaC expressions.
container< std::list > lst
Definition: lst.h:32
print_func< print_context >(&varidx::do_print). print_func< print_latex >(&varidx
Definition: idx.cpp:45
bool info(unsigned inf) const override
Information about the object.
Definition: container.h:116
#define GINAC_IMPLEMENT_REGISTERED_CLASS_OPT_T(classname, supername, options)
Macro for inclusion in the implementation of each registered class.
Definition: registrar.h:190
void do_print_tree(const print_tree &c, unsigned level) const
Definition: container.h:267
Definition of GiNaC&#39;s lst.
void do_print(const print_context &c, unsigned level) const
Definition: container.h:260
GINAC_BIND_UNARCHIVER(add)

This page is part of the GiNaC developer's reference. It was generated automatically by doxygen. For an introduction, see the tutorial.