Lines Matching refs:deq
464 final Deque<Integer> deq = (Deque<Integer>) q;
470 new Fun(){void f(){ deq.getFirst(); }},
471 new Fun(){void f(){ deq.element(); }},
472 new Fun(){void f(){ deq.iterator().next(); }});
473 check(deq.peekFirst() == null);
474 check(deq.peek() == null);
476 check(deq.getFirst() != e);
477 check(deq.element() != e);
478 check(deq.iterator().next() != e);
479 check(deq.peekFirst() != e);
480 check(deq.peek() != e);
482 check(!deq.contains(e));
483 check(!deq.removeFirstOccurrence(e));
484 check(!deq.removeLastOccurrence(e));
490 case 0: deq.addFirst(e); break;
491 case 1: check(deq.offerFirst(e)); break;
492 case 2: deq.push(e); break;
496 check(deq.peekFirst() == e);
497 check(deq.getFirst() == e);
498 check(deq.element() == e);
499 check(deq.peek() == e);
500 check(deq.iterator().next() == e);
501 check(deq.contains(e));
509 case 0: check(deq.pollFirst() == e); break;
510 case 1: check(deq.removeFirst() == e); break;
511 case 2: check(deq.remove() == e); break;
512 case 3: check(deq.pop() == e); break;
513 case 4: check(deq.removeFirstOccurrence(e)); break;
514 case 5: check(deq.removeLastOccurrence(e)); break;
515 case 6: check(deq.remove(e)); break;
516 case 7: check(deq.removeAll(singleton)); break;
517 case 8: Iterator it = deq.iterator(); it.next(); it.remove(); break;
524 new Fun(){void f(){ deq.getFirst(); }},
525 new Fun(){void f(){ deq.element(); }},
526 new Fun(){void f(){ deq.iterator().next(); }});
527 check(deq.peekFirst() == null);
528 check(deq.peek() == null);
530 check(deq.getFirst() != e);
531 check(deq.element() != e);
532 check(deq.iterator().next() != e);
533 check(deq.peekFirst() != e);
534 check(deq.peek() != e);
536 check(!deq.contains(e));
537 check(!deq.removeFirstOccurrence(e));
538 check(!deq.removeLastOccurrence(e));
544 equal(new ArrayList<Integer>(deq), originalContents);
548 check(deq.peekLast() == null);
550 new Fun(){void f(){ deq.getLast(); }});
552 check(deq.peekLast() != e);
553 check(deq.getLast() != e);
556 case 0: deq.addLast(e); break;
557 case 1: check(deq.offerLast(e)); break;
558 case 2: check(deq.add(e)); break;
559 case 3: deq.addAll(singleton); break;
560 case 4: asList.addAll(deq.size(), singleton); break;
561 case 5: asList.add(deq.size(), e); break;
564 check(deq.peekLast() == e);
565 check(deq.getLast() == e);
566 check(deq.contains(e));
577 case 0: check(deq.pollLast() == e); break;
578 case 1: check(deq.removeLast() == e); break;
579 case 2: check(deq.removeFirstOccurrence(e)); break;
580 case 3: check(deq.removeLastOccurrence(e)); break;
581 case 4: check(deq.remove(e)); break;
582 case 5: check(deq.removeAll(singleton)); break;
592 check(deq.peekLast() == null);
594 new Fun(){void f(){ deq.getLast(); }});
596 check(deq.peekLast() != e);
597 check(deq.getLast() != e);
599 check(!deq.contains(e));
600 equal(new ArrayList<Integer>(deq), originalContents);
604 case 0: deq.clear(); break;
606 Iterator it = deq.iterator();
622 testEmptyCollection(deq);
623 check(!deq.iterator().hasNext());
630 new Fun(){void f(){ deq.iterator().next(); }},
631 new Fun(){void f(){ deq.element(); }},
632 new Fun(){void f(){ deq.getFirst(); }},
633 new Fun(){void f(){ deq.getLast(); }},
634 new Fun(){void f(){ deq.pop(); }},
635 new Fun(){void f(){ deq.remove(); }},
636 new Fun(){void f(){ deq.removeFirst(); }},
637 new Fun(){void f(){ deq.removeLast(); }});
639 check(deq.poll() == null);
640 check(deq.pollFirst() == null);
641 check(deq.pollLast() == null);
642 check(deq.peek() == null);
643 check(deq.peekFirst() == null);
644 check(deq.peekLast() == null);
645 check(!deq.removeFirstOccurrence(e));
646 check(!deq.removeLastOccurrence(e));
648 check(deq.addAll(originalContents) == !isEmpty);
649 equal(new ArrayList<Integer>(deq), originalContents);
650 check(!deq.addAll(Collections.<Integer>emptyList()));
651 equal(new ArrayList<Integer>(deq), originalContents);