List of tailSet() Examples

Examples of tailSet()

com.sleepycat.je.dbi.INList.tailSet()
it.unimi.dsi.fastutil.longs.LongSortedSet.tailSet()
java.util.NavigableSet.tailSet()
Returns a view of the portion of this set whose elements are greater than (or equal to, if {@code inclusive} is true) {@code 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 {@code IllegalArgumentException}on an attempt to insert an element outside its range. @param fromElement low endpoint of the returned set @param inclusive {@code true} if the low endpointis to be included in the returned view @return a view of the portion of this set whose elements are greaterthan or equal to {@code fromElement} @throws ClassCastException if {@code fromElement} is not compatiblewith this set's comparator (or, if the set has no comparator, if {@code fromElement} does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if {@code fromElement} cannot be compared to elementscurrently in the set. @throws NullPointerException if {@code fromElement} is nulland this set does not permit null elements @throws IllegalArgumentException if this set itself has arestricted range, and {@code fromElement} lies outside thebounds of the range
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
java.util.TreeSet.tailSet()
@throws ClassCastException {@inheritDoc} @throws NullPointerException if {@code fromElement} is null andthis set uses natural ordering, or its comparator does not permit null elements @throws IllegalArgumentException {@inheritDoc} @since 1.6

Examples of java.util.SortedSet.tailSet()

  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

Examples of java.util.SortedSet.tailSet()

    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

Examples of java.util.SortedSet.tailSet()

            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

Examples of java.util.SortedSet.tailSet()

            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

Examples of java.util.SortedSet.tailSet()

            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

Examples of java.util.SortedSet.tailSet()

                    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

Examples of java.util.TreeSet.tailSet()

    s.add(coid);
    coid = new ComparableSnmpObjectId("1.2.3.6.0");
    s.add(coid);
    
    ComparableSnmpObjectId c2 = new ComparableSnmpObjectId("1.2.3.4.1");
    SortedSet subset = s.tailSet(c2);
    assertEquals(2,subset.size());
    
    subset = s.headSet(c2);
    assertEquals(1,subset.size());
  }

View Full Code Here

Examples of java.util.TreeSet.tailSet()

            return false;
        }


        if ( isGreaterThan ) 
        {
            subset = set.tailSet( val );
        } 
        else 
        {
            subset = set.headSet( val );
        }

View Full Code Here

Examples of java.util.TreeSet.tailSet()

        }


        if ( isGreaterThan ) 
        {
            return new TupleEnumeration( key, 
                set.tailSet( val ).iterator() );
        } 
        else 
        {
            // Get all values from the smallest upto val and put them into
            // a list.  They will be in ascending order so we need to reverse

View Full Code Here

Examples of java.util.TreeSet.tailSet()

        }


        if ( isGreaterThan ) 
        {
            return new TupleEnumeration( key, 
                set.tailSet( val ).iterator() );
        } 
        else 
        {
            // Get all values from the smallest upto val and put them into
            // a list.  They will be in ascending order so we need to reverse

View Full Code Here

0 1 2 3 4 5

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.