* Archiving of GiNaC expressions. */
/*
- * GiNaC Copyright (C) 1999-2008 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2020 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#ifndef __GINAC_ARCHIVE_H__
-#define __GINAC_ARCHIVE_H__
+#ifndef GINAC_ARCHIVE_H
+#define GINAC_ARCHIVE_H
#include "ex.h"
#include <iosfwd>
+#include <map>
#include <string>
#include <vector>
-#include <map>
namespace GiNaC {
unsigned value; /**< Stored value. */
};
typedef std::vector<property>::const_iterator archive_node_cit;
+ struct archive_node_cit_range {
+ archive_node_cit begin, end;
+ };
- archive_node() : a(*dummy_ar_creator()), has_expression(false) {} // hack for cint which always requires a default constructor
archive_node(archive &ar) : a(ar), has_expression(false) {}
archive_node(archive &ar, const ex &expr);
bool find_string(const std::string &name, std::string &ret, unsigned index = 0) const;
/** Find the location in the vector of properties of the first/last
- * property with a given name. */
+ * property with a given name. */
archive_node_cit find_first(const std::string &name) const;
archive_node_cit find_last(const std::string &name) const;
+ /** Find a range of locations in the vector of properties. The result
+ * begins at the first property with name1 and ends one past the last
+ * property with name2. */
+ archive_node_cit_range find_property_range(const std::string &name1, const std::string &name2) const;
+
/** Retrieve property of type "ex" from node.
* @return "true" if property was found, "false" otherwise */
bool find_ex(const std::string &name, ex &ret, lst &sym_lst, unsigned index = 0) const;
/** Retrieve property of type "ex" from the node if it is known
- * that this node in fact contains such a property at the given
- * location. This is much more efficient than the preceding function. */
+ * that this node in fact contains such a property at the given
+ * location. This is much more efficient than the preceding function. */
void find_ex_by_loc(archive_node_cit loc, ex &ret, lst &sym_lst) const;
/** Retrieve property of type "ex" from node, returning the node of
void printraw(std::ostream &os) const;
private:
- static archive* dummy_ar_creator();
-
/** Reference to the archive to which this node belongs. */
archive &a;
mutable ex e;
};
+typedef basic* (*synthesize_func)();
+typedef std::map<std::string, synthesize_func> unarchive_map_t;
+
+class unarchive_table_t
+{
+ static int usecount;
+ static unarchive_map_t* unarch_map;
+public:
+ unarchive_table_t();
+ ~unarchive_table_t();
+ synthesize_func find(const std::string& classname) const;
+ void insert(const std::string& classname, synthesize_func f);
+};
+static unarchive_table_t unarch_table_instance;
+
+/** Helper macros to register a class with (un)archiving (a.k.a.
+ * (de)serialization).
+ *
+ * Usage: put
+ *
+ * GINAC_DECLARE_UNARCHIVER(myclass);
+ *
+ * into the header file (in the global or namespace scope), and
+ *
+ * GINAC_BIND_UNARCHIVER(myclass);
+ *
+ * into the source file.
+ *
+ * Effect: the `myclass' (being a class derived directly or indirectly
+ * from GiNaC::basic) can be archived and unarchived.
+ *
+ * Note: you need to use GINAC_{DECLARE,BIND}_UNARCHIVER incantations
+ * in order to make your class (un)archivable _even if your class does
+ * not overload `read_archive' method_. Sorry for inconvenience.
+ *
+ * How it works:
+ *
+ * The `basic' class has a `read_archive' virtual method which reads an
+ * expression from archive. Derived classes can overload that method.
+ * There's a small problem, though. On unarchiving all we have is a set
+ * of named byte streams. In C++ the class name (as written in the source
+ * code) has nothing to do with its actual type. Thus, we need establish
+ * a correspondence ourselves. To do so we maintain a `class_name' =>
+ * `function_pointer' table (see the unarchive_table_t class above).
+ * Every function in this table is supposed to create a new object of
+ * the `class_name' type. The `archive_node' class uses that table to
+ * construct an object of correct type. Next it invokes read_archive
+ * virtual method of newly created object, which does the actual job.
+ *
+ * Note: this approach is very simple-minded (it does not handle classes
+ * with same names from different namespaces, multiple inheritance, etc),
+ * but it happens to work surprisingly well.
+ */
+#define GINAC_DECLARE_UNARCHIVER(classname) \
+class classname ## _unarchiver \
+{ \
+ static int usecount; \
+public: \
+ static GiNaC::basic* create(); \
+ classname ## _unarchiver(); \
+ ~ classname ## _unarchiver(); \
+}; \
+static classname ## _unarchiver classname ## _unarchiver_instance
+
+#define GINAC_BIND_UNARCHIVER(classname) \
+classname ## _unarchiver::classname ## _unarchiver() \
+{ \
+ static GiNaC::unarchive_table_t table; \
+ if (usecount++ == 0) { \
+ table.insert(std::string(#classname), \
+ &(classname ## _unarchiver::create)); \
+ } \
+} \
+GiNaC::basic* classname ## _unarchiver::create() \
+{ \
+ return new classname(); \
+} \
+classname ## _unarchiver::~ classname ## _unarchiver() { } \
+int classname ## _unarchiver::usecount = 0
+
/** This class holds archived versions of GiNaC expressions (class ex).
* An archive can be constructed from an expression and then written to
/** Retrieve expression from archive by index.
* @param sym_lst list of pre-defined symbols
* @param index index of expression
- * @see count_expressions */
+ * @see count_expressions */
ex unarchive_ex(const lst &sym_lst, unsigned index = 0) const;
/** Retrieve expression and its name from archive by index.
* @param sym_lst list of pre-defined symbols
* @param name receives the name of the expression
* @param index index of expression
- * @see count_expressions */
+ * @see count_expressions */
ex unarchive_ex(const lst &sym_lst, std::string &name, unsigned index = 0) const;
/** Return number of archived expressions. */
mutable std::map<std::string, archive_atom> inverse_atoms;
/** Map of stored expressions to nodes for faster archiving */
- typedef std::map<ex, archive_node_id, ex_is_less>::iterator mapit;
mutable std::map<ex, archive_node_id, ex_is_less> exprtable;
};
std::ostream &operator<<(std::ostream &os, const archive &ar);
std::istream &operator>>(std::istream &is, archive &ar);
-
} // namespace GiNaC
-#endif // ndef __GINAC_ARCHIVE_H__
+#endif // ndef GINAC_ARCHIVE_H
git://www.ginac.de / ginac.git / blobdiff