X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Farchive.h;h=1d60f5317748f08d41e818b111acf90ccb56da57;hp=24c6d5d905548a6901eb5f5f842dda46191fe177;hb=5bd3b0d31f5edd478cd699b9d95adb932a4e3024;hpb=4e3a4ac2bcb0837611ea31bc8fc05d84a20c33ac diff --git a/ginac/archive.h b/ginac/archive.h index 24c6d5d9..1d60f531 100644 --- a/ginac/archive.h +++ b/ginac/archive.h @@ -3,7 +3,7 @@ * Archiving of GiNaC expressions. */ /* - * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2007 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 @@ -17,7 +17,7 @@ * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ #ifndef __GINAC_ARCHIVE_H__ @@ -25,21 +25,21 @@ #include "ex.h" +#include #include #include -#include +#include namespace GiNaC { -class lst; class archive; /** Numerical ID value to refer to an archive_node. */ -typedef unsigned int archive_node_id; +typedef unsigned archive_node_id; /** Numerical ID value to refer to a string. */ -typedef unsigned int archive_atom; +typedef unsigned archive_atom; /** This class stores all properties needed to record/retrieve the state @@ -51,55 +51,99 @@ class archive_node friend std::istream &operator>>(std::istream &is, archive_node &ar); public: + /** Property data types */ + enum property_type { + PTYPE_BOOL, + PTYPE_UNSIGNED, + PTYPE_STRING, + PTYPE_NODE + }; + + /** Information about a stored property. A vector of these structures + * is returned by get_properties(). + * @see get_properties */ + struct property_info { + property_info() {} + property_info(property_type t, const std::string &n, unsigned c = 1) : type(t), name(n), count(c) {} + + property_type type; /**< Data type of property. */ + std::string name; /**< Name of property. */ + unsigned count; /**< Number of occurrences. */ + }; + typedef std::vector propinfovector; + + /** Archived property (data type, name and associated data) */ + struct property { + property() {} + property(archive_atom n, property_type t, unsigned v) : type(t), name(n), value(v) {} + + property_type type; /**< Data type of property. */ + archive_atom name; /**< Name of property. */ + unsigned value; /**< Stored value. */ + }; + typedef std::vector::const_iterator archive_node_cit; + 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); - ~archive_node() {} - archive_node(const archive_node &other); const archive_node &operator=(const archive_node &other); - bool has_same_ex_as(const archive_node &other) const; - + /** Add property of type "bool" to node. */ void add_bool(const std::string &name, bool value); - void add_unsigned(const std::string &name, unsigned int value); + + /** Add property of type "unsigned int" to node. */ + void add_unsigned(const std::string &name, unsigned value); + + /** Add property of type "string" to node. */ void add_string(const std::string &name, const std::string &value); + + /** Add property of type "ex" to node. */ void add_ex(const std::string &name, const ex &value); - bool find_bool(const std::string &name, bool &ret) const; - bool find_unsigned(const std::string &name, unsigned int &ret) const; - bool find_string(const std::string &name, std::string &ret) const; - bool find_ex(const std::string &name, ex &ret, const lst &sym_lst, unsigned int index = 0) const; + /** Retrieve property of type "bool" from node. + * @return "true" if property was found, "false" otherwise */ + bool find_bool(const std::string &name, bool &ret, unsigned index = 0) const; - ex unarchive(const lst &sym_lst) const; + /** Retrieve property of type "unsigned" from node. + * @return "true" if property was found, "false" otherwise */ + bool find_unsigned(const std::string &name, unsigned &ret, unsigned index = 0) const; - void forget(void); - void printraw(std::ostream &os) const; + /** Retrieve property of type "string" from node. + * @return "true" if property was found, "false" otherwise */ + bool find_string(const std::string &name, std::string &ret, unsigned index = 0) const; -private: - static archive* dummy_ar_creator(void); + /** Find the location in the vector of properties of the first/last + * 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; - /** Property data types */ - enum property_type { - PTYPE_BOOL, - PTYPE_UNSIGNED, - PTYPE_STRING, - PTYPE_NODE - }; + /** 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; - /** Archived property (data type, name and associated data) */ - struct property { - property() {} - property(archive_atom n, property_type t, unsigned int v) : type(t), name(n), value(v) {} - ~property() {} + /** 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. */ + void find_ex_by_loc(archive_node_cit loc, ex &ret, lst &sym_lst) const; - property(const property &other) : type(other.type), name(other.name), value(other.value) {} - const property &operator=(const property &other); + /** Retrieve property of type "ex" from node, returning the node of + * the sub-expression. */ + const archive_node &find_ex_node(const std::string &name, unsigned index = 0) const; - property_type type; /**< Data type of property. */ - archive_atom name; /**< Name of property. */ - unsigned int value; /**< Stored value. */ - }; + /** Return vector of properties stored in node. */ + void get_properties(propinfovector &v) const; + + ex unarchive(lst &sym_lst) const; + bool has_same_ex_as(const archive_node &other) const; + bool has_ex() const {return has_expression;} + ex get_ex() const {return e;} + + void forget(); + void printraw(std::ostream &os) const; + +private: + static archive* dummy_ar_creator(); /** Reference to the archive to which this node belongs. */ archive &a; @@ -137,18 +181,42 @@ public: /** Construct archive from expression using the specified name. */ archive(const ex &e, const char *n) {archive_ex(e, n);} - archive_node_id add_node(const archive_node &n); - archive_node &get_node(archive_node_id id); - + /** Archive an expression. + * @param e the expression to be archived + * @param name name under which the expression is stored */ void archive_ex(const ex &e, const char *name); + + /** Retrieve expression from archive by name. + * @param sym_lst list of pre-defined symbols + * @param name name of expression */ ex unarchive_ex(const lst &sym_lst, const char *name) const; - ex unarchive_ex(const lst &sym_lst, unsigned int index = 0) const; - ex unarchive_ex(const lst &sym_lst, std::string &name, unsigned int index = 0) const; - unsigned int num_expressions(void) const; - void clear(void); + /** Retrieve expression from archive by index. + * @param sym_lst list of pre-defined symbols + * @param index index of expression + * @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 */ + ex unarchive_ex(const lst &sym_lst, std::string &name, unsigned index = 0) const; + + /** Return number of archived expressions. */ + unsigned num_expressions() const; + + /** Return reference to top node of an expression specified by index. */ + const archive_node &get_top_node(unsigned index = 0) const; + + /** Clear all archived expressions. */ + void clear(); + + archive_node_id add_node(const archive_node &n); + archive_node &get_node(archive_node_id id); - void forget(void); + void forget(); void printraw(std::ostream &os) const; private: @@ -160,8 +228,8 @@ private: archived_ex() {} archived_ex(archive_atom n, archive_node_id node) : name(n), root(node) {} - archive_atom name; /**< Name of expression. */ - archive_node_id root; /**< ID of root node. */ + archive_atom name; /**< Name of expression. */ + archive_node_id root; /**< ID of root node. */ }; /** Vector of archived expression descriptors. */ @@ -174,6 +242,15 @@ public: private: /** Vector of atomized strings (using a vector allows faster unarchiving). */ mutable std::vector atoms; + /** The map of from strings to indices of the atoms vectors allows for + * faster archiving. + */ + typedef std::map::const_iterator inv_at_cit; + mutable std::map inverse_atoms; + + /** Map of stored expressions to nodes for faster archiving */ + typedef std::map::iterator mapit; + mutable std::map exprtable; };