Examples of java.util.Hashtable.entrySet()

java.util.Hashtable.entrySet()
Returns a {@link Set} view of the mappings contained in this map.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, or through the setValue operation on a map entry returned by the iterator) 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. @since 1.2

      projectOptions = new Hashtable();
    }


    // Inherit from JavaCore options if specified
    if (inheritJavaCoreOptions) {
      Iterator propertyNames = projectOptions.entrySet().iterator();
      while (propertyNames.hasNext()) {
        Map.Entry entry = (Map.Entry) propertyNames.next();
        String propertyName = (String) entry.getKey();
        String propertyValue = (String) entry.getValue();
        if (propertyValue != null && javaModelManager.knowsOption(propertyName)){

View Full Code Here

            int length = patternKPList.size();
            propertyKeys = new Object[length];
            propertyValues = new Object[length];


            int i = 0;
            for (Iterator iterator = patternKPList.entrySet().iterator(); iterator.hasNext(); i++)
            {
               Map.Entry entry = (Map.Entry) iterator.next();
               propertyKeys[i] = entry.getKey();
               propertyValues[i] = entry.getValue();
            }

View Full Code Here

                  if (found) set.add(name);
               }
            }
            else
            {
               if (props.entrySet().equals(patternProps.entrySet())) set.add(name);
            }
         }
      }
      return set;
   }

View Full Code Here

      }


      // For each pattern-style renaming operation, find data names that
      // match the pattern and add the corresponding renaming operation to
      // the regular naming operation list.
      i = patternRenamingOperations.entrySet().iterator();
      String re;
      while (i.hasNext()) {
        e = (Map.Entry) i.next();
        name = (String) e.getKey();
        value = (String) e.getValue();

View Full Code Here

    for (Iterator iterator = Docs.iterator(); iterator.hasNext();) {
      int DocNum = (Integer) iterator.next();
      docNumHT.put(DocNum, (Double) querymean.get(DocNum));
    }
    // Put keys and values in to an arraylist using entryset
    ArrayList myArrayList = new ArrayList(docNumHT.entrySet());


    // Sort the values based on values first and then keys.
    Collections.sort(myArrayList, new MyComparator());


    // Show sorted results

View Full Code Here

                result = new Properties();
            } else {
                result = new Hashtable();
            }
            result.putAll(pMap);
            for (Iterator iter = result.entrySet().iterator();  iter.hasNext();  ) {
                Map.Entry entry = (Map.Entry) iter.next();
                Object value = entry.getValue();
                final Integer i;
                if (pMap instanceof Properties) {
                    i = Integer.valueOf((String) value);

View Full Code Here

    }
  }


  private Map shiftMap(Map nested, ViewState state) {
    Map shiftedNested = new Hashtable(nested);
    for (Object obj : shiftedNested.entrySet()) {
      Entry entry = (Entry) obj;
      if (entry.getKey() instanceof DefaultEdge) {
        ArrayList<Point2D.Double> points = (ArrayList<Point2D.Double>) ((Map<Object, Object>) entry
            .getValue()).get("points");
        ArrayList<Point2D.Double> newPoints = new ArrayList<Point2D.Double>();

View Full Code Here

            // return if there is no element
            if (oldMap == null) {
                return;
            }


            Iterator entries = oldMap.entrySet().iterator();
            while (entries.hasNext()) {
                Map.Entry entry = (Map.Entry) entries.next();
                IdentityConstraint id = (IdentityConstraint) entry.getKey();
                ValueStoreBase oldVal = (ValueStoreBase) entry.getValue();
                if (oldVal != null) {

View Full Code Here

            if (null == otherHeaders)
            {
                otherHeaders = new StringBuffer(1024);
            }


            for (java.util.Iterator e = userHeaderTable.entrySet().iterator(); e.hasNext();)
            {


                java.util.Map.Entry me = (java.util.Map.Entry)e.next();
                Object keyObj = me.getKey();
                if (null == keyObj)

View Full Code Here

     *
     * @since Ant 1.7
     */
    private void cleanup() {
        Hashtable entries = (Hashtable) recorderEntries.clone();
        Iterator itEntries = entries.entrySet().iterator();
        while (itEntries.hasNext()) {
            Map.Entry entry = (Map.Entry) itEntries.next();
            RecorderEntry re = (RecorderEntry) entry.getValue();
            if (re.getProject() == getProject()) {
                recorderEntries.remove(entry.getKey());

View Full Code Here

0 1 2 3 4 5 6 7 8

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.