@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((arrayBlockingQueue == null) ? 0 : arrayBlockingQueue.hashCode());
result = prime * result + ((arrayDeque == null) ? 0 : arrayDeque.hashCode());
result = prime * result + ((arrayList == null) ? 0 : arrayList.hashCode());
result = prime * result + ((bar == null) ? 0 : bar.hashCode());
result = prime * result + ((blockingDeque == null) ? 0 : blockingDeque.hashCode());
result = prime * result + ((blockingQueue == null) ? 0 : blockingQueue.hashCode());
result = prime * result + ((collection == null) ? 0 : collection.hashCode());
result =
prime * result + ((concurrentLinkedQueue == null) ? 0 : concurrentLinkedQueue.hashCode());
result =
prime * result + ((concurrentSkipListSet == null) ? 0 : concurrentSkipListSet.hashCode());
result =
prime * result + ((copyOnWriteArrayList == null) ? 0 : copyOnWriteArrayList.hashCode());
result =
prime * result + ((copyOnWriteArraySet == null) ? 0 : copyOnWriteArraySet.hashCode());
result = prime * result + ((deque == null) ? 0 : deque.hashCode());
result = prime * result + ((hashSet == null) ? 0 : hashSet.hashCode());
result =
prime * result + ((linkedBlockingDeque == null) ? 0 : linkedBlockingDeque.hashCode());
result =
prime * result + ((linkedBlockingQueue == null) ? 0 : linkedBlockingQueue.hashCode());
result = prime * result + ((linkedHashSet == null) ? 0 : linkedHashSet.hashCode());
result = prime * result + ((linkedList == null) ? 0 : linkedList.hashCode());
result = prime * result + ((list == null) ? 0 : list.hashCode());
result = prime * result + ((name == null) ? 0 : name.hashCode());
result = prime * result + ((navigableSet == null) ? 0 : navigableSet.hashCode());
result =
prime * result + ((priorityBlockingQueue == null) ? 0 : priorityBlockingQueue.hashCode());
result = prime * result + ((priorityQueue == null) ? 0 : priorityQueue.hashCode());
result = prime * result + ((queue == null) ? 0 : queue.hashCode());
result = prime * result + ((set == null) ? 0 : set.hashCode());
result = prime * result + ((sortedSet == null) ? 0 : sortedSet.hashCode());
result = prime * result + ((stack == null) ? 0 : stack.hashCode());
result = prime * result + ((treeSet == null) ? 0 : treeSet.hashCode());
result = prime * result + ((vector == null) ? 0 : vector.hashCode());
return result;
}
@Override
public int hashCode() {
return queue.hashCode();
}