Cross Reference: /libcore/jsr166-tests/src/test/java/jsr166/TreeSetTest.java

Lines Matching refs:set
47      * Returns a new set of given size containing consecutive
63      * Returns a new set of first 5 ints.
78      * A new set has unbounded capacity
493      * iterator of empty set has no elements
530      * A deserialized serialized set has same elements
548      * subSet returns set with keys in requested range
551         TreeSet set = set5();
552         SortedSet sm = set.subSet(two, four);
571         assertFalse(set.contains(two));
572         assertEquals(4, set.size());
578         assertEquals(3, set.size());
582         TreeSet set = set5();
583         SortedSet sm = set.subSet(two, three);
600         assertFalse(set.contains(two));
601         assertEquals(4, set.size());
605         assertEquals(4, set.size());
609      * headSet returns set with keys in requested range
612         TreeSet set = set5();
613         SortedSet sm = set.headSet(four);
630         assertEquals(2, set.size());
631         assertEquals(four, set.first());
635      * tailSet returns set with keys in requested range
638         TreeSet set = set5();
639         SortedSet sm = set.tailSet(two);
663         assertEquals(4, set.size());
676         NavigableSet<Integer> set = newSet(cl);
679         populate(set, setSize);
680         check(set,                 0, setSize - 1, true);
681         check(set.descendingSet(), 0, setSize - 1, false);
683         mutateSet(set, 0, setSize - 1);
684         check(set,                 0, setSize - 1, true);
685         check(set.descendingSet(), 0, setSize - 1, false);
687         bashSubSet(set.subSet(0, true, setSize, false),
709     void populate(NavigableSet<Integer> set, int limit) {
712             put(set, element);
716     void mutateSet(NavigableSet<Integer> set, int min, int max) {
717         int size = set.size();
722             remove(set, min - 5 + rnd.nextInt(rangeSize + 10));
726         for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
734         while (set.size() < size) {
737             put(set, element);
741     void mutateSubSet(NavigableSet<Integer> set, int min, int max) {
742         int size = set.size();
747             remove(set, min - 5 + rnd.nextInt(rangeSize + 10));
751         for (Iterator<Integer> it = set.iterator(); it.hasNext(); ) {
759         while (set.size() < size) {
762                 put(set, element);
765                     set.add(element);
772     void put(NavigableSet<Integer> set, int element) {
773         if (set.add(element))
774             bs.set(element);
777     void remove(NavigableSet<Integer> set, int element) {
778         if (set.remove(element))
782     void bashSubSet(NavigableSet<Integer> set,
784         check(set, min, max, ascending);
785         check(set.descendingSet(), min, max, !ascending);
787         mutateSubSet(set, min, max);
788         check(set, min, max, ascending);
789         check(set.descendingSet(), min, max, !ascending);
798         NavigableSet<Integer> hm = set.headSet(midPoint, incl);
815         NavigableSet<Integer> tm = set.tailSet(midPoint,incl);
840             NavigableSet<Integer> sm = set.subSet(
849             NavigableSet<Integer> sm = set.subSet(
863     void check(NavigableSet<Integer> set,
931             assertEquals(bsContainsI, set.contains(i));
935         assertEquals(size, set.size());
940         for (int element : set) {
951             assertEq(set.lower(element), rs.lower(element));
952             assertEq(set.floor(element), rs.floor(element));
953             assertEq(set.higher(element), rs.higher(element));
954             assertEq(set.ceiling(element), rs.ceiling(element));
958         if (set.size() != 0) {
959             assertEq(set.first(), rs.first());
960             assertEq(set.last(), rs.last());
965                 set.first();
969                 set.last();