Changes in src/Common/PersistentMap.h [1febef62:fc1a3e2]

File:

• src/Common/PersistentMap.h (modified) (6 diffs)

src/Common/PersistentMap.h

@@ -23 +23 @@
 #include <utility>        // for forward, move
 
-/// Wraps a hash table in a persistent data structure, using a technique based 
-/// on the persistent array in Conchon & Filliatre "A Persistent Union-Find 
+/// Wraps a hash table in a persistent data structure, using a technique based
+/// on the persistent array in Conchon & Filliatre "A Persistent Union-Find
 /// Data Structure"
 
 template<typename Key, typename Val,
-         typename Hash = std::hash<Key>, typename Eq = std::equal_to<Key>>
-class PersistentMap 
+                typename Hash = std::hash<Key>, typename Eq = std::equal_to<Key>>
+class PersistentMap
         : public std::enable_shared_from_this<PersistentMap<Key, Val, Hash, Eq>> {
 public:
@@ -38 +38 @@
 
         /// Types of version nodes
-        enum Mode { 
+        enum Mode {
                 BASE,  ///< Root node of version tree
                 REM,   ///< Key removal node
@@ -63 +63 @@
                 Ptr base;  ///< Modified map
                 Key key;   ///< Key removed
-                
+
                 template<typename P, typename K>
                 Rem(P&& p, K&& k) : base(std::forward<P>(p)), key(std::forward<K>(k)) {}
@@ -155 +155 @@
                                 auto it = base_map.find( self.key );
 
-                                base->template init<Ins>( 
+                                base->template init<Ins>(
                                                 mut_this->shared_from_this(), std::move(self.key), std::move(it->second) );
                                 base->mode = INS;
@@ -175 +175 @@
                                 auto it = base_map.find( self.key );
 
-                                base->template init<Ins>( 
+                                base->template init<Ins>(
                                                 mut_this->shared_from_this(), std::move(self.key), std::move(it->second) );
                                 base->mode = UPD;
@@ -267 +267 @@
         Ptr erase(const Key& k) {
                 reroot();
-                
+
                 // exit early if key does not exist in map
                 if ( ! as<Base>().count( k ) ) return this->shared_from_this();