Examples of java.util.TreeMap.values()

java.util.TreeMap.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.

            String s = (String) i.next();
            String t = translateDataName(s);
            sorted.put(t, s);
        }
        ArrayList sortedDisplay = new ArrayList(sorted.keySet());
        ArrayList sortedInternal = new ArrayList(sorted.values());
        
        writeEditor(out, fieldName, fieldValue, fieldAttrs, sortedDisplay,
                sortedInternal, onCompleteFunction);
    }

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

                if (extObj instanceof EVTaskDataWriter) {
                    EVTaskDataWriter custom = (EVTaskDataWriter) extObj;
                    customWriters.put(custom.getID(), custom);
                }
            }
            result.addAll(customWriters.values());


            taskDataWriters = Collections.unmodifiableList(result);
        }
        return taskDataWriters;
    }

View Full Code Here

                {
                    assembledPlugins.put( childPlugin.getKey(), childPlugin );
                }
            }


            child.setPlugins( new ArrayList( assembledPlugins.values() ) );


            child.flushReportPluginMap();
        }
    }

View Full Code Here

                {
                    assembledReportSets.put( id, entry.getValue() );
                }
            }


            child.setReportSets( new ArrayList( assembledReportSets.values() ) );


            child.flushReportSetMap();
        }


    }

View Full Code Here


                public void endElement(String uri, String localName, String qname)
                        throws SAXException {
                    if ("dependencies".equals(qname)) {
                        // add the artifacts in the correct order
                        for (Iterator it = revisionsMap.values().iterator(); it.hasNext();) {
                            List artifactReports = (List) it.next();
                            SaxXmlReportParser.this.artifactReports.addAll(artifactReports);
                            for (Iterator iter = artifactReports.iterator(); iter.hasNext();) {
                                ArtifactDownloadReport artifactReport 
                                    = (ArtifactDownloadReport) iter.next();

View Full Code Here

                            }
                            newDeps.remove(dep.getManagementKey());
                        }
                    }
                }
                List deps = new ArrayList(newDeps.values());
                modelDepMgmt.setDependencies(deps);
            }
        }
    }

View Full Code Here

                        }
                    }
                }
                
                // remove null values
                Iterator iterator = nearest.values().iterator();
                while (iterator.hasNext()) {
                    if (iterator.next() == null) iterator.remove();
                }
                
            }

View Full Code Here

              = new Attribute[localCount + nearest.size()];
            for (int i = 0; i < localCount; i++) {
                result[i] = element.getAttribute(i); 
            }
            
            Iterator iterator = nearest.values().iterator();
            for (int j = localCount; j < result.length; j++) {
                result[j] = (Attribute) iterator.next();
            }
            
            Arrays.sort(result, comparator);

View Full Code Here

        }


        // first item in map is the most current directory
        File latestDir = null;
        if (UtilValidate.isNotEmpty(dirMap)) {
            latestDir = (File) dirMap.values().iterator().next();
            if (latestDir != null) {
                File[] dirList = latestDir.listFiles();
                if (dirList.length >= maxFiles) {
                    latestDir = makeNewDirectory(parent);
                }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.