//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by Fernflower decompiler)
//
package com.sprucetec.tms.utils.util;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Map.Entry;
public class MapList<K, V> {
private Map<K, List<V>> map = new HashMap();
public MapList() {
}
public boolean containsKey(K key) {
return this.map.containsKey(key);
}
public List<V> get(K key) {
return (List)this.map.get(key);
}
public List<V> remove(K key) {
return (List)this.map.remove(key);
}
public Set<K> keySet() {
return this.map.keySet();
}
public Set<Entry<K, List<V>>> entrySet() {
return this.map.entrySet();
}
public void put(K key, V value) {
Object l = (List)this.map.get(key);
if(l == null) {
l = new ArrayList();
this.map.put(key, l);
}
((List)l).add(value);
}
public void putAll(K key, List<V> valueList) {
Object l = (List)this.map.get(key);
if(l == null) {
l = new ArrayList();
this.map.put(key, l);
}
((List)l).addAll(valueList);
}
public int size() {
return this.map.size();
}
public Map<K, List<V>> toMap() {
return this.map;
}
}