src/main/java/com/workplacesystems/utilsj/collections/TransactionalHashMap.java
public void rollback()
    {
        
        if (auto_commit)
            return;
        
        String id = getCurrentThreadId();
        
        Entry<K,V> tab[] = table;
        for (int i = 0; i < tab.length ; i++)
        {
            Entry<K,V> prev = table[i];
            Entry<K,V> e = prev;
            
            while (e != null)
            {
                Entry<K,V> next = e.next;
                if (e.is(Entry.ADDED, id))
                {
                    modCount++;
                    size--;
                    if (prev == e)
                        table[i] = next;
                    else
                        prev.next = next;
                }
                else if (e.is(Entry.DELETED, id))
                    e.setStatus(Entry.NO_CHANGE, null);
                
                prev = e;
                e = next;
            }
        }
    }
public void rollback()
    {
        
        if (auto_commit)
            return;
        
        String id = getCurrentThreadId();
        
        Entry<K,V> tab[] = table;
        for (int i = 0; i < tab.length ; i++)
        {
            Entry<K,V> prev = table[i];
            Entry<K,V> e = prev;
            
            while (e != null)
            {
                Entry<K,V> next = e.next;
                if (e.is(Entry.ADDED, id))
                {
                    modCount++;
                    size--;
                    if (prev == e)
                        table[i] = next;
                    else
                        prev.next = next;
                }
                else if (e.is(Entry.DELETED, id))
                    e.setStatus(Entry.NO_CHANGE, null);
                
                prev = e;
                e = next;
            }
        }
    }
public void rollback ( ) { if ( auto_commit ) return ; String id = getCurrentThreadId ( ) ; Entry < K , V > tab [ ] = table ; for ( int i = 0 ; i < tab . length ; i ++ ) { Entry < K , V > prev = table [ i ] ; Entry < K , V > e = prev ; while ( e != null ) { Entry < K , V > next = e . next ; if ( e . is ( Entry . ADDED , id ) ) { modCount ++ ; size -- ; if ( prev == e ) table [ i ] = next ; else prev . next = next ; } else if ( e . is ( Entry . DELETED , id ) ) e . setStatus ( Entry . NO_CHANGE , null ) ; prev = e ; e = next ; } } }
Rolls back the changes to the map.
Rolls back the changes to the map .