Cross Reference: /external/guava/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

Lines Matching refs:elements
190      * this map would contain the same exact elements as the MinMaxHeap; the
522           @Override protected void verify(List<T> elements) {
523             assertEquals(Sets.newHashSet(elements),
581         ArrayList<Integer> elements = createOrderedList(size);
582         List<Integer> expected = ImmutableList.copyOf(elements);
584         long seed = insertRandomly(elements, q);
586           elements.add(q.pollFirst());
588         assertEquals("Using seed " + seed, expected, elements);
596         ArrayList<Integer> elements = createOrderedList(size);
597         List<Integer> expected = ImmutableList.copyOf(elements);
599         long seed = insertRandomly(elements, q);
601           elements.add(0, q.pollLast());
603         assertEquals("Using seed " + seed, expected, elements);
611       ArrayList<Integer> elements = createOrderedList(size);
612       List<Integer> expected = ImmutableList.copyOf(elements);
614       long seed = insertRandomly(elements, q);
616         elements.add(q.pollFirst());
618       assertEquals("Using seed " + seed, expected, elements);
628     ArrayList<Integer> elements = createOrderedList(size);
629     List<Integer> expected = ImmutableList.copyOf(elements);
631     insertRandomly(elements, q, new Random(seed));
634       elements.add(q.pollFirst());
637     assertEquals("Using seed " + seed, expected, elements);
643       ArrayList<Integer> elements = createOrderedList(size);
644       List<Integer> expected = ImmutableList.copyOf(elements);
646       long seed = insertRandomly(elements, q);
648         elements.add(0, q.pollLast());
650       assertEquals("Using seed " + seed, expected, elements);
688     List<Integer> elements = Lists.newArrayListWithCapacity(size);
708       elements.add(next);
710     assertEquals(expected, elements);
716   private long insertRandomly(ArrayList<Integer> elements,
720     insertRandomly(elements, q, random);
724   private void insertRandomly(ArrayList<Integer> elements, MinMaxPriorityQueue<Integer> q,
726     while (!elements.isEmpty()) {
727       int selectedIndex = random.nextInt(elements.size());
728       q.offer(elements.remove(selectedIndex));
733     ArrayList<Integer> elements = new ArrayList<Integer>(size);
735       elements.add(i);
737     return elements;