Examples of java.util.SortedSet.last()

java.util.SortedSet.last()
Returns the last (highest) element currently in this set. @return the last (highest) element currently in this set @throws NoSuchElementException if this set is empty

    sortedSet.add(reaperElement);
    sortedSet.add(reaperElement3);
    sortedSet.add(reaperElement2);


    assertEquals(sortedSet.first(), reaperElement3);
    assertEquals(sortedSet.last(), reaperElement);


    // test insertion of timeout=0 is a nullop
    assertTrue(reaper.insert(reapable, 0));
    assertEquals(0, reaper.numberOfTransactions());
                assertEquals(0, reaper.numberOfTimeouts());

View Full Code Here

            // if we have exactly one artifact found
            if (artifactSet.size() == 1) {
                file = repository.getLocation((Artifact) artifactSet.first());                
                return file.getAbsoluteFile();
            } else if (artifactSet.size() > 1) {// if we have more than 1 artifacts found use the latest one.
                file = repository.getLocation((Artifact) artifactSet.last());
                return file.getAbsoluteFile();
            } 
        }
        
        throw new Exception("Missing artifact in repositories: " + artifactQuery.toString());

View Full Code Here


  public boolean add(Object o) {
    DateSpan toAdd=(DateSpan)o;
    SortedSet set=headSet(o);
    if (set.size()>0){
      DateSpan interval=(DateSpan)set.last();
      if (interval.getEnd()>=toAdd.getStart())
        toAdd=mergeIntervals(toAdd,interval);
    }


    set=tailSet(o);

View Full Code Here


  public boolean add(Object o) {
    HasStartAndEnd toAdd=(HasStartAndEnd)o;
    SortedSet set=headSet(o);
    if (set.size()>0){
      HasStartAndEnd interval=(HasStartAndEnd)set.last();
      if (interval.getEnd()>=toAdd.getStart())
        toAdd=mergeIntervals(toAdd,interval);
    }


    set=tailSet(o);

View Full Code Here

        Set set = get(destination);
        if (set == null || set.isEmpty()) {
            return null;
        }
        SortedSet sortedSet = new TreeSet(set);
        return sortedSet.last();
    }


    /**
     * Returns the root node for the given destination type
     */

View Full Code Here

        if (offset > 0) {
            Integer os = Integer.valueOf(offset);


            SortedSet set = mlTextRunSet.headSet(os);
            if (!set.isEmpty()) {
                ml = (MultiLineRun)set.last();
                ml = ml.end() >= offset ? ml : null;
            }
        }


        return ml;

View Full Code Here

     */
    public void testSubSetContents() {
        COWNavigableSet set = set5();
        SortedSet sm = set.subSet(two, four);
        assertEquals(two, sm.first());
        assertEquals(three, sm.last());
        assertEquals(2, sm.size());
        assertFalse(sm.contains(one));
        assertTrue(sm.contains(two));
        assertTrue(sm.contains(three));
        assertFalse(sm.contains(four));

View Full Code Here

    public void testSubSetContents2() {
        COWNavigableSet set = set5();
        SortedSet sm = set.subSet(two, three);
        assertEquals(1, sm.size());
        assertEquals(two, sm.first());
        assertEquals(two, sm.last());
        assertFalse(sm.contains(one));
        assertTrue(sm.contains(two));
        assertFalse(sm.contains(three));
        assertFalse(sm.contains(four));
        assertFalse(sm.contains(five));

View Full Code Here

        assertEquals(five, k);
        assertFalse(i.hasNext());


        SortedSet ssm = sm.tailSet(four);
        assertEquals(four, ssm.first());
        assertEquals(five, ssm.last());
//        assertTrue(ssm.remove(four));
//        assertEquals(1, ssm.size());
//        assertEquals(3, sm.size());
//        assertEquals(4, set.size());
    }

View Full Code Here

                // if we have exactly one artifact found
                if (artifactSet.size() == 1) {
                    file = repository.getLocation((Artifact) artifactSet.first());
                    return file.getAbsoluteFile();
                } else if (artifactSet.size() > 1) {// if we have more than 1 artifacts found use the latest one.
                    file = repository.getLocation((Artifact) artifactSet.last());
                    return file.getAbsoluteFile();
                }
            }
        }

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.