org.databene.commons.collection.CaseInsensitiveOrderedNameMap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of databene-commons Show documentation
Show all versions of databene-commons Show documentation
'databene commons' is an open source Java library by Volker Bergmann.
It provides extensions to the Java core library by utility classes, abstract concepts
and concrete implementations.
/*
* Copyright (C) 2004-2015 Volker Bergmann ([email protected]).
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.databene.commons.collection;
import java.util.Map;
import org.databene.commons.NullSafeComparator;
import org.databene.commons.OrderedMap;
/**
* {@link OrderedMap} implementation which assigns name strings to objects preserving the capitalization
* of stored names but allowing retrieval in a different capitalization.
* Created: 12.12.2012 11:12:16
* @param the type of the collection's elements
* @since 0.5.21
* @author Volker Bergmann
*/
public class CaseInsensitiveOrderedNameMap extends OrderedMap {
private static final long serialVersionUID = 5774443959123444148L;
// constructors + factory methods ----------------------------------------------------------------------------------
public CaseInsensitiveOrderedNameMap() {
}
public CaseInsensitiveOrderedNameMap(Map that) {
super(that);
}
// Map interface implementation ------------------------------------------------------------------------------------
@Override
public boolean containsKey(Object key) {
return containsKey((String) key);
}
public boolean containsKey(String key) {
boolean result = super.containsKey(key);
if (result)
return result;
for (String tmp : super.keySet())
if (tmp.equalsIgnoreCase(key))
return true;
return result;
}
@Override
public E get(Object key) {
return get((String) key);
}
public E get(String key) {
E result = super.get(key);
if (result != null)
return result;
for (Map.Entry entry : super.entrySet()) {
String tmp = entry.getKey();
if ((tmp == null && key == null) || (tmp != null && tmp.equalsIgnoreCase(key)))
return entry.getValue();
}
return null;
}
@Override
public Map.Entry getEntry(String key) {
String normalizedKey = key;
E value = super.get(normalizedKey);
if (value != null)
return new MapEntry(key, value);
for (Map.Entry entry : super.entrySet()) {
String tmp = entry.getKey();
if ((tmp == null && key == null) || (tmp != null && tmp.equalsIgnoreCase(key))) {
String resultKey = entry.getKey();
return new MapEntry(resultKey, entry.getValue());
}
}
return null;
}
@Override
public E put(String key, E value) {
return super.put(key, value);
}
public E remove(String key) {
E result = super.remove(key);
if (result != null)
return result;
for (Map.Entry entry : super.entrySet())
if (NullSafeComparator.equals(entry.getKey(), key))
return super.remove(entry.getKey());
return null;
}
}