package fr.pandacube.util;

import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Set;
import java.util.function.BiConsumer;

public class BiMap<K, V> implements Iterable<Entry<K, V>> {

    HashMap<K, V> map = new HashMap<>();
    HashMap<V, K> inversedMap = new HashMap<>();

    public synchronized void put(K k, V v) {
    	if (map.containsKey(k) || inversedMap.containsKey(v)) {
    		map.remove(k);
    		inversedMap.remove(v);
    	}
        map.put(k, v);
        inversedMap.put(v, k);
    }

    public synchronized V get(K k) {
        return map.get(k);
    }

    public synchronized K getKey(V v) {
        return inversedMap.get(v);
    }
    
    public synchronized boolean containsKey(K k) {
    	return map.containsKey(k);
    }
    
    public synchronized boolean containsValue(V v) {
    	return inversedMap.containsKey(v);
    }
    
    public synchronized V remove(K k) {
    	V v = map.remove(k);
    	inversedMap.remove(v);
    	return v;
    }
    
    public synchronized K removeValue(V v) {
    	K k = inversedMap.remove(v);
    	map.remove(k);
    	return k;
    }
    
    @Override
    public Iterator<Entry<K, V>> iterator() {
    	return Collections.unmodifiableSet(map.entrySet()).iterator();
    }
    
    public Set<K> keySet() {
    	return Collections.unmodifiableSet(map.keySet());
    }
    
    public Set<V> valuesSet() {
    	return Collections.unmodifiableSet(inversedMap.keySet());
    }
    
    public synchronized void forEach(BiConsumer<K, V> c) {
    	for(Entry<K, V> entry : this) {
    		c.accept(entry.getKey(), entry.getValue());
    	}
    }
    
    public int size() {
    	return map.size();
    }
    
    public synchronized void clear() {
    	map.clear();
    	inversedMap.clear();
    }

}