Node node = deques[priority].addFirst(obj); lookUp.put(obj, node);
return deques[priority].addFirst(obj);
   public void addFirst(Object obj, int priority)   {      Node node = deques[priority].addFirst(obj);        lookUp.put(obj, node);   }