Examples of java.util.SortedSet.tailSet()

java.util.SortedSet.tailSet()
Returns a view of the portion of this set whose elements are greater than or equal to fromElement. The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.
The returned set will throw an IllegalArgumentException on an attempt to insert an element outside its range. @param fromElement low endpoint (inclusive) of the returned set @return a view of the portion of this set whose elements are greaterthan or equal to fromElement @throws ClassCastException if fromElement is not compatiblewith this set's comparator (or, if the set has no comparator, if fromElement does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if fromElement cannot be compared to elements currently in the set. @throws NullPointerException if fromElement is nulland this set does not permit null elements @throws IllegalArgumentException if this set itself has arestricted range, and fromElement lies outside the bounds of the range

            Entry entry = (Entry) refStack.peek();
            String currentRef = (String) entry.getValue();
            Violation v = new Violation();


            v.setPath(currentRef);
            Collection restViolations = violations.tailSet(v);
            Iterator rviter = restViolations.iterator();


            while (rviter.hasNext()) {
                Violation nextViolation = (Violation) rviter.next();

View Full Code Here

            try {
                sset.subSet(makeKey(rangeBegin - 1), makeKey(rangeEnd + 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                sset.tailSet(makeKey(rangeBegin - 1));
                fail();
            }
            catch (IllegalArgumentException e) { }
            try {
                sset.subSet(makeKey(rangeBegin - 1),

View Full Code Here

            try {
                sset.subSet(mapEntry(rangeBegin - 1), mapEntry(rangeEnd + 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                sset.tailSet(mapEntry(rangeBegin - 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                sset.subSet(mapEntry(rangeBegin - 1),
                            mapEntry(rangeBegin)).iterator();

View Full Code Here

                    sset.subSet(makeVal(rangeBegin - 1),
                                makeVal(rangeEnd + 1));
                    fail();
                } catch (IllegalArgumentException e) { }
                try {
                    sset.tailSet(makeVal(rangeBegin - 1));
                    fail();
                }
                catch (IllegalArgumentException e) { }
            }
        }

View Full Code Here

            }
            doProcessBatch = sizer.addToBatch(object);
        }
        Collection subCollection;
        if (set != null) {
            subCollection = (begin == InitialSentinel) ? set : set.tailSet(begin);
        }
        else if (list != null) {
            subCollection = list.subList(beginIdx, list.size());
        }
        else {

View Full Code Here

            try {
                sset.subSet(makeKey(rangeBegin - 1), makeKey(rangeEnd + 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                sset.tailSet(makeKey(rangeBegin - 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                iterator(sset.subSet(makeKey(rangeBegin - 1),
                                     makeKey(rangeBegin)));

View Full Code Here

            try {
                sset.subSet(mapEntry(rangeBegin - 1), mapEntry(rangeEnd + 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                sset.tailSet(mapEntry(rangeBegin - 1));
                fail();
            } catch (IllegalArgumentException e) { }
            try {
                iterator(sset.subSet(mapEntry(rangeBegin - 1),
                                     mapEntry(rangeBegin)));

View Full Code Here

                    sset.subSet(makeVal(rangeBegin - 1),
                                makeVal(rangeEnd + 1));
                    fail();
                } catch (IllegalArgumentException e) { }
                try {
                    sset.tailSet(makeVal(rangeBegin - 1));
                    fail();
                } catch (IllegalArgumentException e) { }
            }
        }

View Full Code Here

  public void testTailSet_throwsClassCastException() {
    SortedSet SortedSet = createNavigableSet();
    SortedSet.add(getKeys()[0]);
    if (isNaturalOrder()) {
      // TODO Why does this succeed with natural ordering when subSet doesn't?
      SortedSet.tailSet(getConflictingKey());
    } else {
      try {
        SortedSet.tailSet(getConflictingKey());
        assertTrue("CCE expected in Development Mode", GWT.isScript());
      } catch (ClassCastException e) {

View Full Code Here

    if (isNaturalOrder()) {
      // TODO Why does this succeed with natural ordering when subSet doesn't?
      SortedSet.tailSet(getConflictingKey());
    } else {
      try {
        SortedSet.tailSet(getConflictingKey());
        assertTrue("CCE expected in Development Mode", GWT.isScript());
      } catch (ClassCastException e) {
        // expected outcome
      }
    }

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.