List of lastKey() Examples

Examples of lastKey()

com.opengamma.analytics.math.interpolation.data.Interpolator1DDataBundle.lastKey()
edu.stanford.ppl.concurrent.SnapTreeMap.lastKey()
java.util.NavigableMap.lastKey()
java.util.SortedMap.lastKey()
Returns the last (highest) key currently in this map. @return the last (highest) key currently in this map @throws NoSuchElementException if this map is empty
java.util.TreeMap.lastKey()
@throws NoSuchElementException {@inheritDoc}
java.util.concurrent.ConcurrentNavigableMap.lastKey()
org.apache.commons.collections.OrderedBidiMap.lastKey()
org.apache.commons.collections.OrderedMap.lastKey()
Gets the last key currently in this map. @return the last key currently in this map @throws java.util.NoSuchElementException if this map is empty
org.apache.commons.collections.map.LRUMap.lastKey()
org.apache.commons.collections.map.LinkedMap.lastKey()
org.apache.commons.collections.map.ListOrderedMap.lastKey()
Gets the last key in this map by insert order. @return the last key currently in this map @throws NoSuchElementException if this map is empty
org.apache.commons.collections15.OrderedBidiMap.lastKey()
Return the last (highest) key currently in this sorted map. @return the last key in the map
org.apache.commons.collections15.OrderedMap.lastKey()
Gets the last key currently in this map. @return the last key currently in this map @throws java.util.NoSuchElementException if this map is empty

Examples of java.util.SortedMap.lastKey()

        SortedMap sm = (SortedMap) maps[0];
        SortedMap hm = sm.headMap(key);
        if (hm.isEmpty()) {
            return null;
        }
        return hm.lastKey();
    }


    //-----------------------------------------------------------------------
    /**
     * Obtains an ordered map iterator.

View Full Code Here

Examples of java.util.SortedMap.lastKey()

                if (flushAll) {
                    highestFlushLevel =
      envImpl.getDbMapTree().getHighestLevel();
                } else {
                    highestFlushLevel =
                        ((Integer) newDirtyMap.lastKey()).intValue();
                    if (flushExtraLevel) {
                        highestFlushLevel += 1;
                    }
                }
            } else {

View Full Code Here

Examples of java.util.TreeMap.lastKey()

            ListEventToBytes.toListEvent(update, this, byteCoder);
        }


        // prepare the next update id to use
        if(!sequentialUpdates.isEmpty()) {
            nextUpdateId = ((Integer)sequentialUpdates.lastKey()).intValue() + 1;
        }


        // now that we're up-to-date, listen for further events
        source.addListEventListener(this);
    }

View Full Code Here

Examples of java.util.TreeMap.lastKey()

                        // Fill it up using an alphabetical order
                        // and a dumb insert sort
                        ByteChunk tempChunk = new ByteChunk();
                        int n = 0;
                        while (n < size) {
                            Object key = tempMap.lastKey();
                            ArrayList list = (ArrayList) tempMap.get(key);
                            for (int i = 0; i < list.size() && n < size; i++) {
                                ByteEntry entry = (ByteEntry) list.get(i);
                                tempChunk.setBytes(entry.name, 0, entry.name.length);
                                int insertPos = findClosest(tempChunk, tempbcCache, n);

View Full Code Here

Examples of java.util.TreeMap.lastKey()

                        // Fill it up using an alphabetical order
                        // and a dumb insert sort
                        CharChunk tempChunk = new CharChunk();
                        int n = 0;
                        while (n < size) {
                            Object key = tempMap.lastKey();
                            ArrayList list = (ArrayList) tempMap.get(key);
                            for (int i = 0; i < list.size() && n < size; i++) {
                                CharEntry entry = (CharEntry) list.get(i);
                                tempChunk.setChars(entry.name, 0, entry.name.length);
                                int insertPos = findClosest(tempChunk, tempccCache, n);

View Full Code Here

Examples of java.util.TreeMap.lastKey()

        reversedTreeMap.put(new Integer(1).toString(), new Integer(1));
        reversedTreeMap.put(new Integer(2).toString(), new Integer(2));
        assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
                reversedTreeMap.firstKey().equals(new Integer(2).toString()));
        assertTrue("TreeMap does not use comparator (lastKey was incorrect)",
                reversedTreeMap.lastKey().equals(new Integer(1).toString()));


    }


    /**
     * @tests java.util.TreeMap#TreeMap(java.util.Map)

View Full Code Here

Examples of java.util.TreeMap.lastKey()

        assertTrue("New tree map does not answer correct comparator",
                anotherTreeMap.comparator() == comp);
        assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
                anotherTreeMap.firstKey().equals(new Integer(2).toString()));
        assertTrue("TreeMap does not use comparator (lastKey was incorrect)",
                anotherTreeMap.lastKey().equals(new Integer(1).toString()));


    }


    /**
     * @tests java.util.TreeMap#clear()

View Full Code Here

Examples of java.util.TreeMap.lastKey()

        reversedTreeMap.put(new Integer(1).toString(), new Integer(1));
        reversedTreeMap.put(new Integer(2).toString(), new Integer(2));
        assertTrue("TreeMap does not use comparator (firstKey was incorrect)",
                reversedTreeMap.firstKey().equals(new Integer(2).toString()));
        assertTrue("TreeMap does not use comparator (lastKey was incorrect)",
                reversedTreeMap.lastKey().equals(new Integer(1).toString()));
    }


    /**
     * @tests java.util.TreeMap#containsKey(java.lang.Object)
     */

View Full Code Here

Examples of java.util.TreeMap.lastKey()

      sp.segmentName = lastPTname;
      wrapper.setMeta(SEGMENT_PART_KEY, sp.toString());
      output.collect(key, wrapper);
    }
    if (linked.size() > 0) {
      String name = (String)linked.lastKey();
      sp.partName = CrawlDatum.PARSE_DIR_NAME;
      sp.segmentName = name;
      wrapper.setMeta(SEGMENT_PART_KEY, sp.toString());
      ArrayList segLinked = (ArrayList)linked.get(name);
      for (int i = 0; i < segLinked.size(); i++) {

View Full Code Here

Examples of java.util.TreeMap.lastKey()

                        // Fill it up using an alphabetical order
                        // and a dumb insert sort
                        ByteChunk tempChunk = new ByteChunk();
                        int n = 0;
                        while (n < size) {
                            Object key = tempMap.lastKey();
                            ArrayList list = (ArrayList) tempMap.get(key);
                            for (int i = 0; i < list.size() && n < size; i++) {
                                ByteEntry entry = (ByteEntry) list.get(i);
                                tempChunk.setBytes(entry.name, 0, entry.name.length);
                                int insertPos = findClosest(tempChunk, tempbcCache, n);

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.