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

      while (i.hasNext())
      {
         ObjectInstance instance = (ObjectInstance)i.next();
         ObjectName name = instance.getObjectName();
         String domain = name.getDomain();
         if (domains.containsKey(domain))
         {
            ((Set)domains.get(domain)).add(name);
         }
         else
         {

View Full Code Here

        Integer key;
        for (int i=0;i<results.size();i++) {
            queryresult=(double[]) results.get(i);                
            for (int j=0;j<queryresult.length;j++) {   
                key = new Integer(j);
                if (rpcurve.containsKey(key))
                    value=new Double(queryresult[j] + ((Double)rpcurve.get(key)).floatValue());
                else
                    value=new Double(queryresult[j]);
                rpcurve.put(key, value);
            }

View Full Code Here

                    index = Integer.parseInt(result.group(3));
                } catch (NumberFormatException e) {
                    index = 0;
                }


                if (!names.containsKey(name)) {
                    names.put(name, new TreeMap());
                }


                Object value = props.get(key);

View Full Code Here

                            // this element already has that attribute
                            continue;
                        } else if (v11 && "id".equals(name)) { // Don't inherit xml:id in C14N 1.1
                            continue;
                        }
                        if (! nearest.containsKey(name)) {
                            if (!v11 || "lang".equals(name) || "space".equals(name)) {
                                Element parent = (Element) a.getParent();
                                if (! nodes.contains(parent)) {
                                    nearest.put(name, a);
                                }

View Full Code Here

            Property property = propIter.nextProperty();
            properties.put(property.getName(), property);
        }


        // serialize jcr:primaryType, jcr:mixinTypes & jcr:uuid first:
        if (properties.containsKey(jcrPrimaryType)) {
            process((Property) properties.remove(jcrPrimaryType), level + 1);
        } else {
            throw new RepositoryException(
                    "Missing jcr:primaryType property: " + node.getPath());
        }

View Full Code Here

            process((Property) properties.remove(jcrPrimaryType), level + 1);
        } else {
            throw new RepositoryException(
                    "Missing jcr:primaryType property: " + node.getPath());
        }
        if (properties.containsKey(jcrMixinTypes)) {
            process((Property) properties.remove(jcrMixinTypes), level + 1);
        }
        if (properties.containsKey(jcrUUID)) {
            process((Property) properties.remove(jcrUUID), level + 1);
        }

View Full Code Here

                    "Missing jcr:primaryType property: " + node.getPath());
        }
        if (properties.containsKey(jcrMixinTypes)) {
            process((Property) properties.remove(jcrMixinTypes), level + 1);
        }
        if (properties.containsKey(jcrUUID)) {
            process((Property) properties.remove(jcrUUID), level + 1);
        }


        // serialize remaining properties
        Iterator iterator = properties.values().iterator();

View Full Code Here

                            // throw new IllegalArgumentException("key '" + key + "' missing a value.");
                            continue;
                        }
                        if (m == null) {
                            m = new TreeMap(getKeyComparator());
                        } else if (m.containsKey(key)) {
                            // throw new IllegalArgumentException("key '" + key + "' already has a value.");
                            continue;
                        }
                        m.put(key, value);
                    } while (next() == ITEM_SEPARATOR);

View Full Code Here

                    );
                    civ = new Integer(99);
                }


                // Store in case label map.
                if (caseLabelMap.containsKey(civ)) {
                    this.compileError("Duplicate \"case\" switch label value", rv.getLocation());
                }
                caseLabelMap.put(civ, sbsgOffsets[i]);
            }
            if (sbsg.hasDefaultLabel) {

View Full Code Here

        } while (targets.hasNext());


        for (Iterator ds = danglers.iterator(); ds.hasNext();) {
            baseAccess.checkCancelled();
            File file = (File) ds.next();
            if (!commitables.containsKey(file)) {
                SVNErrorMessage err = SVNErrorMessage.create(SVNErrorCode.ILLEGAL_TARGET, 
                        "''{0}'' is not under version control\n"
                        + "and is not part of the commit, \n"
                        + "yet its child is part of the commit", file);
                SVNErrorManager.error(err, SVNLogType.WC);

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.