List of headSet() Examples

Examples of headSet()

it.unimi.dsi.fastutil.longs.LongSortedSet.headSet()
java.util.NavigableSet.headSet()
Returns a view of the portion of this set whose elements are less than (or equal to, if {@code inclusive} is true) {@code toElement}. 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 toElement high endpoint of the returned set @param inclusive {@code true} if the high endpointis to be included in the returned view @return a view of the portion of this set whose elements are less than(or equal to, if {@code inclusive} is true) {@code toElement} @throws ClassCastException if {@code toElement} is not compatiblewith this set's comparator (or, if the set has no comparator, if {@code toElement} does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if {@code toElement} cannot be compared to elementscurrently in the set. @throws NullPointerException if {@code toElement} is null andthis set does not permit null elements @throws IllegalArgumentException if this set itself has arestricted range, and {@code toElement} lies outside thebounds of the range
java.util.SortedSet.headSet()
Returns a view of the portion of this set whose elements are strictly less than toElement. 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 toElement high endpoint (exclusive) of the returned set @return a view of the portion of this set whose elements are strictlyless than toElement @throws ClassCastException if toElement is not compatiblewith this set's comparator (or, if the set has no comparator, if toElement does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if toElement cannot be compared to elements currently in the set. @throws NullPointerException if toElement is null andthis set does not permit null elements @throws IllegalArgumentException if this set itself has arestricted range, and toElement lies outside the bounds of the range
java.util.TreeSet.headSet()
@throws ClassCastException {@inheritDoc} @throws NullPointerException if {@code toElement} 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.headSet()

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

View Full Code Here

Examples of java.util.SortedSet.headSet()

                    sset.subSet(makeVal(rangeBegin),
                                makeVal(rangeEnd + 2));
                    fail();
                } catch (IllegalArgumentException e) { }
                try {
                    sset.headSet(makeVal(rangeEnd + 2));
                    fail();
                } catch (IllegalArgumentException e) { }
            }
            if (rangeType != HEAD) {
                try {

View Full Code Here

Examples of java.util.SortedSet.headSet()

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

View Full Code Here

Examples of java.util.SortedSet.headSet()

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

View Full Code Here

Examples of java.util.SortedSet.headSet()

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

View Full Code Here

Examples of java.util.SortedSet.headSet()

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

View Full Code Here

Examples of java.util.SortedSet.headSet()

                    sset.subSet(makeVal(rangeBegin),
                                makeVal(rangeEnd + 2));
                    fail();
                } catch (IllegalArgumentException e) { }
                try {
                    sset.headSet(makeVal(rangeEnd + 2));
                    fail();
                } catch (IllegalArgumentException e) { }
            }
            if (rangeType != HEAD) {
                try {

View Full Code Here

Examples of java.util.TreeSet.headSet()

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


        if ( subset.size() > 0 || set.contains( val ) ) 
        {
            return true;

View Full Code Here

Examples of java.util.TreeSet.headSet()

        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
            // the list after adding val which is not included in headSet.
            SortedSet headset = set.headSet( val );
            ArrayList list = new ArrayList( set.size() + 1 );
            list.addAll( headset );


            // Add largest value (val) if it is in the set.  TreeSet.headSet
            // does not get val if val is in the set.  So we add it now to

View Full Code Here

Examples of java.util.TreeSet.headSet()

        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
            // the list after adding val which is not included in headSet.
            SortedSet headset = set.headSet( val );
            ArrayList list = new ArrayList( set.size() + 1 );
            list.addAll( headset );


            // Add largest value (val) if it is in the set.  TreeSet.headSet
            // does not get val if val is in the set.  So we add it now to

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.