+ typedef std::vector<property>::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);
+
+ const archive_node &operator=(const archive_node &other);
+
+ /** Add property of type "bool" to node. */
+ void add_bool(const std::string &name, bool 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);
+
+ /** 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;
+
+ /** 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;
+
+ /** 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;
+
+ /** 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;
+
+ /** 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. */
+ 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
+ * the sub-expression. */
+ const archive_node &find_ex_node(const std::string &name, unsigned index = 0) const;
+
+ /** 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();