--- /dev/null
+////////////////////////////////////////////////////////////////////////////////\r
+\r
+// Author: Andy Rushton\r
+// Copyright: (c) Southampton University 1999-2004\r
+// (c) Andy Rushton 2004-2009\r
+// License: BSD License, see ../docs/license.html\r
+\r
+////////////////////////////////////////////////////////////////////////////////\r
+#include "persistent_int.hpp"\r
+\r
+namespace stlplus\r
+{\r
+\r
+ ////////////////////////////////////////////////////////////////////////////////\r
+\r
+ template<typename K, typename P, typename D>\r
+ void dump_multiset(dump_context& context, const std::multiset<K,P>& data, D dump_fn)\r
+ throw(persistent_dump_failed)\r
+ {\r
+ dump_unsigned(context,data.size());\r
+ for (typename std::multiset<K,P>::const_iterator i = data.begin(); i != data.end(); i++)\r
+ dump_fn(context,*i);\r
+ }\r
+\r
+ template<typename K, typename P, typename R>\r
+ void restore_multiset(restore_context& context, std::multiset<K,P>& data, R restore_fn)\r
+ throw(persistent_restore_failed)\r
+ {\r
+ data.clear();\r
+ unsigned size = 0;\r
+ restore_unsigned(context,size);\r
+ typename std::multiset<K,P>::iterator i = data.begin();\r
+ for (unsigned j = 0; j < size; j++)\r
+ {\r
+ K key;\r
+ restore_fn(context,key);\r
+ // inserting using an iterator is O(n) rather than O(n*log(n))\r
+ i = data.insert(i, key);\r
+ }\r
+ }\r
+\r
+ ////////////////////////////////////////////////////////////////////////////////\r
+\r
+} // end namespace stlplus\r