public Collection<QName> keySet() { Set<QName> r = new HashSet<QName>(); for (Entry<V> e : entrySet()) { r.add(e.createQName()); } return r; }
public boolean equals(Object o) { if (!(o instanceof Entry)) return false; Entry e = (Entry)o; String k1 = nsUri; String k2 = e.nsUri; String k3 = localName; String k4 = e.localName; if (k1.equals(k2) && k3.equals(k4)) { Object v1 = getValue(); Object v2 = e.getValue(); if (v1 == v2 || (v1 != null && v1.equals(v2))) return true; } return false; }
if (e.getValue().size() > 1) { LOGGER.warning(ServerMessages.NON_UNIQUE_DISPATCH_QNAME(e.getValue(), e.createQName()));
if (e.getValue().size() > 1) { LOGGER.warning(ServerMessages.NON_UNIQUE_DISPATCH_QNAME(e.getValue(), e.createQName()));
if (e.getValue().size() > 1) { LOGGER.warning(ServerMessages.NON_UNIQUE_DISPATCH_QNAME(e.getValue(), e.createQName()));
/** * Copies all of the mappings from the specified map to this map * These mappings will replace any mappings that * this map had for any of the keys currently in the specified map. * * @param map mappings to be stored in this map. * */ public QNameMap<V> putAll(QNameMap<? extends V> map) { int numKeysToBeAdded = map.size(); if (numKeysToBeAdded == 0) return this; if (numKeysToBeAdded > threshold) { int targetCapacity = numKeysToBeAdded; if (targetCapacity > MAXIMUM_CAPACITY) targetCapacity = MAXIMUM_CAPACITY; int newCapacity = table.length; while (newCapacity < targetCapacity) newCapacity <<= 1; if (newCapacity > table.length) resize(newCapacity); } for( Entry<? extends V> e : map.entrySet() ) put(e.nsUri,e.localName,e.getValue()); return this; }
/** * Copies all of the mappings from the specified map to this map * These mappings will replace any mappings that * this map had for any of the keys currently in the specified map. * * @param map mappings to be stored in this map. * */ public QNameMap<V> putAll(QNameMap<? extends V> map) { int numKeysToBeAdded = map.size(); if (numKeysToBeAdded == 0) return this; if (numKeysToBeAdded > threshold) { int targetCapacity = numKeysToBeAdded; if (targetCapacity > MAXIMUM_CAPACITY) targetCapacity = MAXIMUM_CAPACITY; int newCapacity = table.length; while (newCapacity < targetCapacity) newCapacity <<= 1; if (newCapacity > table.length) resize(newCapacity); } for( Entry<? extends V> e : map.entrySet() ) put(e.nsUri,e.localName,e.getValue()); return this; }
/** * Copies all of the mappings from the specified map to this map * These mappings will replace any mappings that * this map had for any of the keys currently in the specified map. * * @param map mappings to be stored in this map. * */ public QNameMap<V> putAll(QNameMap<? extends V> map) { int numKeysToBeAdded = map.size(); if (numKeysToBeAdded == 0) return this; if (numKeysToBeAdded > threshold) { int targetCapacity = numKeysToBeAdded; if (targetCapacity > MAXIMUM_CAPACITY) targetCapacity = MAXIMUM_CAPACITY; int newCapacity = table.length; while (newCapacity < targetCapacity) newCapacity <<= 1; if (newCapacity > table.length) resize(newCapacity); } for( Entry<? extends V> e : map.entrySet() ) put(e.nsUri,e.localName,e.getValue()); return this; }
public boolean equals(Object o) { if (!(o instanceof Entry)) return false; Entry e = (Entry)o; String k1 = nsUri; String k2 = e.nsUri; String k3 = localName; String k4 = e.localName; if (k1.equals(k2) && k3.equals(k4)) { Object v1 = getValue(); Object v2 = e.getValue(); if (v1 == v2 || (v1 != null && v1.equals(v2))) return true; } return false; }
public boolean equals(Object o) { if (!(o instanceof Entry)) return false; Entry e = (Entry)o; String k1 = nsUri; String k2 = e.nsUri; String k3 = localName; String k4 = e.localName; if (k1.equals(k2) && k3.equals(k4)) { Object v1 = getValue(); Object v2 = e.getValue(); if (v1 == v2 || (v1 != null && v1.equals(v2))) return true; } return false; }
public String toString() { return '"'+nsUri +"\",\"" +localName + "\"=" + getValue(); } }
public String toString() { return '"'+nsUri +"\",\"" +localName + "\"=" + getValue(); } }
/** * Add a new entry with the specified keys, value and hash code to * the specified bucket. It is the responsibility of this * method to resize the table if appropriate. * */ private void addEntry(int hash, String nsUri, String localName, V value, int bucketIndex) { Entry<V> e = table[bucketIndex]; table[bucketIndex] = new Entry<V>(hash, nsUri, localName, value, e); if (size++ >= threshold) resize(2 * table.length); }
public String toString() { return '"'+nsUri +"\",\"" +localName + "\"=" + getValue(); } }
public Collection<QName> keySet() { Set<QName> r = new HashSet<QName>(); for (Entry<V> e : entrySet()) { r.add(e.createQName()); } return r; }
/** * Add a new entry with the specified keys, value and hash code to * the specified bucket. It is the responsibility of this * method to resize the table if appropriate. * */ private void addEntry(int hash, String nsUri, String localName, V value, int bucketIndex) { Entry<V> e = table[bucketIndex]; table[bucketIndex] = new Entry<V>(hash, nsUri, localName, value, e); if (size++ >= threshold) resize(2 * table.length); }
public Collection<QName> keySet() { Set<QName> r = new HashSet<QName>(); for (Entry<V> e : entrySet()) { r.add(e.createQName()); } return r; }
/** * Add a new entry with the specified keys, value and hash code to * the specified bucket. It is the responsibility of this * method to resize the table if appropriate. * */ private void addEntry(int hash, String nsUri, String localName, V value, int bucketIndex) { Entry<V> e = table[bucketIndex]; table[bucketIndex] = new Entry<V>(hash, nsUri, localName, value, e); if (size++ >= threshold) resize(2 * table.length); }