// Since the queue size is limited, iterating through it to find
// duplicates should yield acceptable performance. Also, we don't
// look for duplicates if the queue is already full.
for (int i=0; i < queue.size(); i++) {
TableDescriptor work = (TableDescriptor)queue.get(i);
if (work.tableNameEquals(table, schema)) {
accept = false;
break;
}
}
}