Examples of java.util.SortedMap.values()

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


    public TaskDependency[] getDependencies(Task task) {
        SearchKey fromKey = new RangeSearchFromKey(task);
        SearchKey toKey = new RangeSearchToKey(task);
        SortedMap submap = mySearchKey2dependency.subMap(fromKey, toKey);
        return (TaskDependency[]) submap.values()
                .toArray(new TaskDependency[0]);
    }


    public TaskDependency[] getDependenciesAsDependant(Task dependant) {
        SearchKey fromKey = new SearchKey(SearchKey.DEPENDANT, dependant

View Full Code Here

        SearchKey fromKey = new SearchKey(SearchKey.DEPENDANT, dependant
                .getTaskID(), -1);
        SearchKey toKey = new SearchKey(SearchKey.DEPENDEE, dependant
                .getTaskID(), -1);
        SortedMap submap = mySearchKey2dependency.subMap(fromKey, toKey);
        return (TaskDependency[]) submap.values()
                .toArray(new TaskDependency[0]);
    }


    public TaskDependency[] getDependenciesAsDependee(Task dependee) {
        SearchKey fromKey = new SearchKey(SearchKey.DEPENDEE, dependee

View Full Code Here

        SearchKey fromKey = new SearchKey(SearchKey.DEPENDEE, dependee
                .getTaskID(), -1);
        SearchKey toKey = new SearchKey(Integer.MAX_VALUE,
                dependee.getTaskID(), -1);
        SortedMap submap = mySearchKey2dependency.subMap(fromKey, toKey);
        return (TaskDependency[]) submap.values()
                .toArray(new TaskDependency[0]);
    }


    public TaskDependency createDependency(Task dependant, Task dependee)
            throws TaskDependencyException{

View Full Code Here

          for (ObjectInstance mBean : mBeans) {
            Object key = mBeanInfo.getKey(server, mBean.getObjectName());
            OID index = mBeanInfo.getIndexSupport().mapToIndex(key);
            indexes.put(index, key);
          }
          return indexes.values().iterator();
        }
        else {
          MBeanAttributeKeyProvider keyProvider = mBeanInfo.getKeyProvider();
          return keyProvider.keyIterator(server);
        }

View Full Code Here

            OMAttribute attribute = (OMAttribute) itr.next();
            if (!(attribute.getLocalName().equals("xmlns") ||
                    attribute.getLocalName().startsWith("xmlns:")))
                map.put(getExpandedName(attribute), attribute);
        }
        return map.values();
    }


    /**
     * Gets the valid element collection of an OMDocument. OMElement and OMProcessingInstruction
     * only

View Full Code Here

                        pw.println("Status: " + configs.length + " configurations and "
                            + factories.size() + " factories available");
                    }
                    pw.println();


                    for (Iterator mi = sm.values().iterator(); mi.hasNext();)
                    {
                        this.printConfiguration(pw, (Configuration) mi.next());
                    }
                }
                else

View Full Code Here

        if (logger.traceOn()) {
            logger.trace("filterAttributes", "starts");
        }


        SortedMap map = new TreeMap(attributes);
  purgeUnserializable(map.values());
  hideAttributes(map);
        return map;
    }


    /**

View Full Code Here

                                    inputColHeadCount, readColCount));
                }
                /* Already checked for readColCount too high in prev. block */


                if (constColMap != null) {
                    Iterator it = constColMap.values().iterator();
                    while (it.hasNext()) {
                        dataVals[storeColCount++] = (String) it.next();
                    }
                }
                if (storeColCount != dataVals.length) {

View Full Code Here

        border2.add(x1 + radius);
        border2.add(y1 + radius);


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

View Full Code Here

        SortedMap tasks = new TreeMap(DataComparator.getInstance());
        String ordinalDataName = TASK_ORDINAL_PREFIX + taskListName;
        findTasksInHierarchy(tasks, ordinalDataName, PropertyKey.ROOT);


        // now add each task found to the task list.
        Iterator i = tasks.values().iterator();
        boolean willNeedChangeNotification = (recalcListeners != null);
        while (i.hasNext())
            addTask((String) i.next(), data, hierarchy, null,
                    willNeedChangeNotification);
    }

View Full Code Here

0 1 2

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.