Examples of java.util.SortedMap

java.util.SortedMap
A {@link Map} that further provides a total ordering on its keys.The map is ordered according to the {@linkplain Comparable naturalordering} of its keys, or by a {@link Comparator} typicallyprovided at sorted map creation time. This order is reflected when iterating over the sorted map's collection views (returned by the entrySet, keySet and values methods). Several additional operations are provided to take advantage of the ordering. (This interface is the map analogue of {@link SortedSet}.)
All keys inserted into a sorted map must implement the Comparable interface (or be accepted by the specified comparator). Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) (or comparator.compare(k1, k2)) must not throw a ClassCastException for any keys k1 and k2 in the sorted map. Attempts to violate this restriction will cause the offending method or constructor invocation to throw a ClassCastException.
Note that the ordering maintained by a sorted map (whether or not an explicit comparator is provided) must be consistent with equals if the sorted map is to correctly implement the Map interface. (See the Comparable interface or Comparator interface for a precise definition of consistent with equals.) This is so because the Map interface is defined in terms of the equals operation, but a sorted map performs all key comparisons using its compareTo (or compare) method, so two keys that are deemed equal by this method are, from the standpoint of the sorted map, equal. The behavior of a tree map is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Map interface.
All general-purpose sorted map implementation classes should provide four "standard" constructors: 1) A void (no arguments) constructor, which creates an empty sorted map sorted according to the natural ordering of its keys. 2) A constructor with a single argument of type Comparator, which creates an empty sorted map sorted according to the specified comparator. 3) A constructor with a single argument of type Map, which creates a new map with the same key-value mappings as its argument, sorted according to the keys' natural ordering. 4) A constructor with a single argument of type SortedMap, which creates a new sorted map with the same key-value mappings and the same ordering as the input sorted map. There is no way to enforce this recommendation, as interfaces cannot contain constructors.
Note: several methods return submaps with restricted key ranges. Such ranges are half-open, that is, they include their low endpoint but not their high endpoint (where applicable). If you need a closed range (which includes both endpoints), and the key type allows for calculation of the successor of a given key, merely request the subrange from lowEndpoint to successor(highEndpoint). For example, suppose that m is a map whose keys are strings. The following idiom obtains a view containing all of the key-value mappings in m whose keys are between low and high, inclusive:
```
 SortedMap<String, V> sub = m.subMap(low, high+"\0");
```
A similar technique can be used to generate an open range (which contains neither endpoint). The following idiom obtains a view containing all of the key-value mappings in m whose keys are between low and high, exclusive:
```
 SortedMap<String, V> sub = m.subMap(low+"\0", high);
```
This interface is a member of the Java Collections Framework. @param < K> the type of keys maintained by this map @param < V> the type of mapped values @author Josh Bloch @version 1.28, 04/21/06 @see Map @see TreeMap @see SortedSet @see Comparator @see Comparable @see Collection @see ClassCastException @since 1.2


   @SuppressWarnings("unchecked")
   private void readObject(ObjectInputStream in) throws IOException, ClassNotFoundException
   {
      ObjectInputStream.GetField getField = in.readFields();
      SortedMap contents = (SortedMap) getField.get("contents", null);
      CompositeMetaType compositeType = (CompositeMetaType) getField.get("metaType", null);
      try
      {
         init(compositeType, contents);
      }

View Full Code Here

        assertEquals(m1.size(), m2.size());
        assertEquals(m1, m2);
    }


    public void testCopySortedMaps() {
        SortedMap orig = new TreeMap();
        populate(orig);
        assertSortedMapsEqual(orig, (SortedMap) _mgr.copyMap(orig));


        orig = new TreeMap(new CustomComparator());
        populate(orig);

View Full Code Here


        // store the updates in a persistent map
        storage = new PersistentMap(file);


        // sequence the updates
        SortedMap sequentialUpdates = new TreeMap();
        for(Iterator k = storage.keySet().iterator(); k.hasNext(); ) {
            Integer key = (Integer)k.next();
            Bufferlo valueBuffer = ((Chunk)storage.get(key)).getValue();
            sequentialUpdates.put(key, valueBuffer);
        }


        // replay all the updates from the file
        for(Iterator u = sequentialUpdates.keySet().iterator(); u.hasNext(); ) {
            Integer key = (Integer)u.next();
            Bufferlo update = (Bufferlo)sequentialUpdates.get(key);
            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

            if ((maxRows != -1) && (processedRows == maxRows)) {
                isLimited = true; 
                break;
            }
            Object[] columns = new Object[noOfColumns];
            SortedMap columnMap = 
                new TreeMap(String.CASE_INSENSITIVE_ORDER);


            // JDBC uses 1 as the lowest index!
            for (int i = 1; i <= noOfColumns; i++) {
                Object value =  rs.getObject(i);
                if (rs.wasNull()) {
                    value = null;
                }
                columns[i-1] = value;
                columnMap.put(columnNames[i-1], value);
            }
            rowMap.add(columnMap);
            rowByIndex.add(columns);
            processedRows++;
        }

View Full Code Here

    * @return a <code>TermPositionVector</code> for the given text.
    */
   private TermPositionVector createTermPositionVector(String text)
   {
      // term -> TermVectorOffsetInfo[]
      final SortedMap termMap = new TreeMap();
      Reader r = new StringReader(text);
      TokenStream ts = index.getTextAnalyzer().tokenStream("", r);
      Token t = new Token();
      try
      {
         while ((t = ts.next(t)) != null)
         {
            String termText = t.term();
            TermVectorOffsetInfo[] info = (TermVectorOffsetInfo[])termMap.get(termText);
            if (info == null)
            {
               info = new TermVectorOffsetInfo[1];
            }
            else
            {
               TermVectorOffsetInfo[] tmp = info;
               info = new TermVectorOffsetInfo[tmp.length + 1];
               System.arraycopy(tmp, 0, info, 0, tmp.length);
            }
            info[info.length - 1] = new TermVectorOffsetInfo(t.startOffset(), t.endOffset());
            termMap.put(termText, info);
         }
      }
      catch (IOException e)
      {
         if (LOG.isTraceEnabled())
         {
            LOG.trace("An exception occurred: " + e.getMessage());
         }
      }


      return new TermPositionVector()
      {


         private String[] terms = (String[])termMap.keySet().toArray(new String[termMap.size()]);


         public int[] getTermPositions(int index)
         {
            return null;
         }


         public TermVectorOffsetInfo[] getOffsets(int index)
         {
            TermVectorOffsetInfo[] info = TermVectorOffsetInfo.EMPTY_OFFSET_INFO;
            if (index >= 0 && index < terms.length)
            {
               info = (TermVectorOffsetInfo[])termMap.get(terms[index]);
            }
            return info;
         }


         public String getField()
         {
            return "";
         }


         public int size()
         {
            return terms.length;
         }


         public String[] getTerms()
         {
            return terms;
         }


         public int[] getTermFrequencies()
         {
            int[] freqs = new int[terms.length];
            for (int i = 0; i < terms.length; i++)
            {
               freqs[i] = ((TermVectorOffsetInfo[])termMap.get(terms[i])).length;
            }
            return freqs;
         }


         public int indexOf(String term)

View Full Code Here


  @Override
  @SuppressWarnings("unchecked")
  public SortedMap subMap(Object fromKey, Object toKey) {
    read();
    final SortedMap subMap = ( (SortedMap) map ).subMap( fromKey, toKey );
    return new SortedSubMap( subMap );
  }

View Full Code Here


  @Override
  @SuppressWarnings("unchecked")
  public SortedMap headMap(Object toKey) {
    read();
    final SortedMap headMap = ( (SortedMap) map ).headMap( toKey );
    return new SortedSubMap( headMap );
  }

View Full Code Here


  @Override
  @SuppressWarnings("unchecked")
  public SortedMap tailMap(Object fromKey) {
    read();
    final SortedMap tailMap = ( (SortedMap) map ).tailMap( fromKey );
    return new SortedSubMap( tailMap );
  }

View Full Code Here

    }


    @Override
    @SuppressWarnings("unchecked")
    public SortedMap subMap(Object fromKey, Object toKey) {
      final SortedMap subMap = this.subMap.subMap( fromKey, toKey );
      return new SortedSubMap( subMap );
    }

View Full Code Here

    }


    @Override
    @SuppressWarnings("unchecked")
    public SortedMap headMap(Object toKey) {
      final SortedMap headMap = subMap.headMap( toKey );
      return new SortedSubMap( headMap );
    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.SortedMap

com.caucho.jstl.ResultImpl

com.evernote.thrift.TBaseHelper

com.google.common.collect.Maps

com.google.common.collect.TreeBasedTable$TreeRow

com.google.gwt.emultest.java.util.TreeMapTest

com.ibm.icu.impl.ICUService

com.ibm.icu.impl.ICUService$LocaleRef

com.sleepycat.je.recovery.Checkpointer

com.sun.facelets.util.DevTools

com.sun.jdmk.comm.internal.EnvHelp

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.