Lines Matching refs:size
47 * Returns a new set of given size containing consecutive
58 assertEquals(n, q.size());
73 assertEquals(5, q.size());
81 assertEquals(0, new TreeSet().size());
159 * size changes when elements added and removed
164 assertEquals(SIZE - i, q.size());
168 assertEquals(i, q.size());
329 assertEquals(0, q.size());
364 assertEquals(SIZE - i, q.size());
377 assertEquals(SIZE - i, q.size());
537 assertEquals(x.size(), y.size());
555 assertEquals(2, sm.size());
572 assertEquals(4, set.size());
573 assertEquals(1, sm.size());
578 assertEquals(3, set.size());
584 assertEquals(1, sm.size());
601 assertEquals(4, set.size());
602 assertEquals(0, sm.size());
605 assertEquals(4, set.size());
630 assertEquals(2, set.size());
661 assertEquals(1, ssm.size());
662 assertEquals(3, sm.size());
663 assertEquals(4, set.size());
704 assertEquals(0, result.size());
717 int size = set.size();
733 // Add entries till we're back to original size
734 while (set.size() < size) {
742 int size = set.size();
758 // Add entries till we're back to original size
759 while (set.size() < size) {
928 int size = 0;
933 size++;
935 assertEquals(size, set.size());
947 assertEquals(size2, size);
958 if (set.size() != 0) {