Examples of java.util.TreeMap.containsKey()

java.util.TreeMap.containsKey()
Returns true if this map contains a mapping for the specified key. @param key key whose presence in this map is to be tested @return true if this map contains a mapping for thespecified key @throws ClassCastException if the specified key cannot be comparedwith the keys currently in the map @throws NullPointerException if the specified key is nulland this map uses natural ordering, or its comparator does not permit null keys

          interestingHeaders.put(lk, concatenateList(s));
        }
      }
    }


    if (interestingHeaders.containsKey(ALTERNATIVE_DATE_HEADER)) {
      interestingHeaders.put("date", "");
    }


    // if the expires is non-null, use that for the date field. this
    // trumps the x-amz-date behavior.

View Full Code Here

      interestingHeaders.put("date", expires);
    }


    // these headers require that we still put a new line in after them,
    // even if they don't exist.
    if (!interestingHeaders.containsKey("content-type")) {
      interestingHeaders.put("content-type", "");
    }
    if (!interestingHeaders.containsKey("content-md5")) {
      interestingHeaders.put("content-md5", "");
    }

View Full Code Here

    // these headers require that we still put a new line in after them,
    // even if they don't exist.
    if (!interestingHeaders.containsKey("content-type")) {
      interestingHeaders.put("content-type", "");
    }
    if (!interestingHeaders.containsKey("content-md5")) {
      interestingHeaders.put("content-md5", "");
    }


    // Finally, add all the interesting headers (i.e.: all that startwith x-amz-
    // ;-))

View Full Code Here

      firstMap.put(s[0], new Integer(c.intValue()+1));
    } else {
      firstMap.put(s[0], new Integer(1));
    }


    if (secondMap.containsKey(s[1])) {
      Integer c = (Integer) secondMap.get(s[1]);
      secondMap.put(s[1], new Integer(c.intValue()+1));
    } else {
      secondMap.put(s[1], new Integer(1));
    }

View Full Code Here

      composeLookupMax = Math.max(composeLookupMax, Integer.parseInt(s[0], 16));
    } else if (second.intValue() == 1) {
      singleSecondComposition.put(s[1], new String[] { s[0], k });
      composeLookupMax = Math.max(composeLookupMax, Integer.parseInt(s[1], 16));
    } else {
      if (complexComposition.containsKey(s[0])) {
        TreeMap m = (TreeMap) complexComposition.get(s[0]);
        if (m.containsKey(s[1])) {
    System.err.println("? ambiguous canonical mapping for "+s[0]);
    System.exit(1);
        }

View Full Code Here

      singleSecondComposition.put(s[1], new String[] { s[0], k });
      composeLookupMax = Math.max(composeLookupMax, Integer.parseInt(s[1], 16));
    } else {
      if (complexComposition.containsKey(s[0])) {
        TreeMap m = (TreeMap) complexComposition.get(s[0]);
        if (m.containsKey(s[1])) {
    System.err.println("? ambiguous canonical mapping for "+s[0]);
    System.exit(1);
        }
        m.put(s[1], k);
      } else {

View Full Code Here

    maxIndex = Math.max(maxIndex, ((Integer) indices.get(s1i)).intValue());
  }


  w.print("    { ");
  for (int j = multiSecondStart; j <= maxIndex; j++) {
    if (line.containsKey(new Integer(j))) {
      String s = (String) line.get(new Integer(j));
      w.print("'"+toJavaString(s)+"', ");
    } else {
      w.print("       0, ");
    }

View Full Code Here

                }


                for ( Iterator it = parentDepMgmt.getDependencies().iterator(); it.hasNext(); )
                {
                    Dependency dep = (Dependency) it.next();
                    if ( !mappedChildDeps.containsKey( dep.getManagementKey() ) )
                    {
                        childDepMgmt.addDependency( dep );
                    }
                }
            }

View Full Code Here


            for ( Iterator it = profilePlugins.values().iterator(); it.hasNext(); )
            {
                Plugin profilePlugin = (Plugin) it.next();


                if ( !mergedPlugins.containsKey( profilePlugin.getKey() ) )
                {
                    mergedPlugins.put( profilePlugin.getKey(), profilePlugin );
                }
            }

View Full Code Here

            {
                Map.Entry entry = (Map.Entry) it.next();


                String id = (String) entry.getKey();


                if ( !executions.containsKey( id ) )
                {
                    executions.put( id, entry.getValue() );
                }
            }

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.