Examples of java.util.SortedMap.keySet()

java.util.SortedMap.keySet()
Returns a {@link Set} view of the keys contained in this map.The set's iterator returns the keys in ascending order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations. @return a set view of the keys contained in this map, sorted inascending order

        nbh.add(labWhite);


        for (int i = 0; i < classNumbers; i++) {


          SortedMap s = ts[i].subMap(border1, border2);
          Iterator it_s = s.keySet().iterator();
          while (it_s.hasNext()) {
            key_row2 = (Vector<Double>) it_s.next();
            x2 = key_row2.elementAt(0);
            y2 = key_row2.elementAt(1);

View Full Code Here

        


          for (int i = 0; i < classNumbers; i++) {


            SortedMap s = ts[i].subMap(border1, border2);
            Iterator it_s = s.keySet().iterator();
            while (it_s.hasNext()) {
              key_row2 = (Vector<Double>) it_s.next();
              x2 = key_row2.elementAt(0);
              y2 = key_row2.elementAt(1);

View Full Code Here

            rootsCopy.put(k,k);
          }
        }
      }
      logger.info("Identified the following sub-trees "+rootsCopy);
      for (Iterator it = rootsCopy.keySet().iterator(); it.hasNext();) {
        OID root = (OID) it.next();
        ArrayList subtree = new ArrayList();
        for (Iterator vit = l.iterator(); vit.hasNext(); ) {
          VariableBinding vb = (VariableBinding) vit.next();
          if (vb.getOid().size() >= root.size()) {

View Full Code Here

  public OID find(MOScope range) {
    SortedMap tail = vbs.tailMap(range.getLowerBound());
    OID first = (OID) tail.firstKey();
    if (range.getLowerBound().equals(first) && (!range.isLowerIncluded())) {
      if (tail.size() > 1) {
        Iterator it = tail.keySet().iterator();
        it.next();
        return (OID) it.next();
      }
    }
    else {

View Full Code Here

    MOScope scope = request.getQuery().getScope();
    SortedMap tail = vbs.tailMap(scope.getLowerBound());
    OID first = (OID) tail.firstKey();
    if (scope.getLowerBound().equals(first) && (!scope.isLowerIncluded())) {
      if (tail.size() > 1) {
        Iterator it = tail.keySet().iterator();
        it.next();
        first = (OID)it.next();
      }
      else {
        return false;

View Full Code Here

        // no tests I can think of
    }
    
    public void testFirstKey() {
        SortedMap sm = (SortedMap) makeFullMap();
        assertSame(sm.keySet().iterator().next(), sm.firstKey());
    }
    
    public void testLastKey() {
        SortedMap sm = (SortedMap) makeFullMap();
        Object obj = null;

View Full Code Here

    }
    
    public void testLastKey() {
        SortedMap sm = (SortedMap) makeFullMap();
        Object obj = null;
        for (Iterator it = sm.keySet().iterator(); it.hasNext();) {
            obj = (Object) it.next();
        }
        assertSame(obj, sm.lastKey());
    }

View Full Code Here

    }


    public void testShouldReturnImmutableNullCollectionsForNullSortedMap() throws Exception {
        SortedMap map = (SortedMap)Null.object(SortedMap.class, getFactory());


        assertSame(Collections.EMPTY_SET, map.keySet());
        assertSame(Collections.EMPTY_LIST, map.values());
        assertSame(Collections.EMPTY_SET, map.entrySet());
    }


    public interface InterfaceWithInterfaceMethod {

View Full Code Here

                if( lastKey.isParent(key) == true )
                    tmp = (ArrayList) namespacePerms.get(lastKey);
                else
                {
                    PermissionName[] keys = {};
                    keys = (PermissionName[]) headMap.keySet().toArray(keys);
                    for(int k = keys.length-1; k >= 0; k --)
                    {
                        lastKey = keys[k];
                        if( lastKey.isParent(key) == true )
                        {

View Full Code Here

    
    int n = path.getElementCount() + 1;
    SortedMap map = getPagesMap(path);
    
    if (map != null) {
      Iterator iter = map.keySet().iterator();
      
      while (iter.hasNext()) {
        Path p = (Path) iter.next();
        
        if (p.getElementCount() == n) {

View Full Code Here

0 1 2 3 4 5 6 7

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.