Lines Matching refs:set
42 * Returns a new set of given size containing consecutive
59 * Returns a new set of first 5 ints.
74 * A new set has unbounded capacity
488 * iterator of empty set has no elements
527 * A deserialized serialized set has same elements
545 * subSet returns set with keys in requested range
548 ConcurrentSkipListSet set = set5();
549 SortedSet sm = set.subSet(two, four);
568 assertFalse(set.contains(two));
569 assertEquals(4, set.size());
575 assertEquals(3, set.size());
579 ConcurrentSkipListSet set = set5();
580 SortedSet sm = set.subSet(two, three);
597 assertFalse(set.contains(two));
598 assertEquals(4, set.size());
602 assertEquals(4, set.size());
606 * headSet returns set with keys in requested range
609 ConcurrentSkipListSet set = set5();
610 SortedSet sm = set.headSet(four);
627 assertEquals(2, set.size());
628 assertEquals(four, set.first());
632 * tailSet returns set with keys in requested range
635 ConcurrentSkipListSet set = set5();
636 SortedSet sm = set.tailSet(two);
660 assertEquals(4, set.size());
672 NavigableSet<Integer> set = newSet(cl);
675 populate(set, setSize, bs);
676 check(set, 0, setSize - 1, true, bs);
677 check(set.descendingSet(), 0, setSize - 1, false, bs);
679 mutateSet(set, 0, setSize - 1, bs);
680 check(set, 0, setSize - 1, true, bs);
681 check(set.descendingSet(), 0, setSize - 1, false, bs);
683 bashSubSet(set.subSet(0, true, setSize, false),
705 void populate(NavigableSet<Integer> set, int limit, BitSet bs) {
708 put(set, element, bs);
712 void mutateSet(NavigableSet<Integer> set, int min, int max, BitSet bs) {
713 int size = set.size();
718 remove(set, min - 5 + rnd.nextInt(rangeSize + 10), bs);
722 for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
730 while (set.size() < size) {
733 put(set, element, bs);
737 void mutateSubSet(NavigableSet<Integer> set, int min, int max,
739 int size = set.size();
744 remove(set, min - 5 + rnd.nextInt(rangeSize + 10), bs);
748 for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
756 while (set.size() < size) {
759 put(set, element, bs);
762 set.add(element);
769 void put(NavigableSet<Integer> set, int element, BitSet bs) {
770 if (set.add(element))
771 bs.set(element);
774 void remove(NavigableSet<Integer> set, int element, BitSet bs) {
775 if (set.remove(element))
779 void bashSubSet(NavigableSet<Integer> set,
782 check(set, min, max, ascending, bs);
783 check(set.descendingSet(), min, max, !ascending, bs);
785 mutateSubSet(set, min, max, bs);
786 check(set, min, max, ascending, bs);
787 check(set.descendingSet(), min, max, !ascending, bs);
796 NavigableSet<Integer> hm = set.headSet(midPoint, incl);
813 NavigableSet<Integer> tm = set.tailSet(midPoint,incl);
838 NavigableSet<Integer> sm = set.subSet(
847 NavigableSet<Integer> sm = set.subSet(
861 void check(NavigableSet<Integer> set,
930 assertEquals(bsContainsI, set.contains(i));
934 assertEquals(size, set.size());
939 for (int element : set) {
950 assertEq(set.lower(element), rs.lower(element));
951 assertEq(set.floor(element), rs.floor(element));
952 assertEq(set.higher(element), rs.higher(element));
953 assertEq(set.ceiling(element), rs.ceiling(element));
957 if (set.size() != 0) {
958 assertEq(set.first(), rs.first());
959 assertEq(set.last(), rs.last());
964 set.first();
968 set.last();