org.eclipse.jetty.util.HostMap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jetty-util Show documentation
Show all versions of jetty-util Show documentation
Utility classes for Jetty
//
// ========================================================================
// Copyright (c) 1995 Mort Bay Consulting Pty Ltd and others.
//
// This program and the accompanying materials are made available under the
// terms of the Eclipse Public License v. 2.0 which is available at
// https://www.eclipse.org/legal/epl-2.0, or the Apache License, Version 2.0
// which is available at https://www.apache.org/licenses/LICENSE-2.0.
//
// SPDX-License-Identifier: EPL-2.0 OR Apache-2.0
// ========================================================================
//
package org.eclipse.jetty.util;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
/**
* @param the element type
*/
@SuppressWarnings("serial")
public class HostMap extends HashMap
{
/**
* Construct empty HostMap.
*/
public HostMap()
{
super(11);
}
/**
* Construct empty HostMap.
*
* @param capacity initial capacity
*/
public HostMap(int capacity)
{
super(capacity);
}
@Override
public TYPE put(String host, TYPE object)
throws IllegalArgumentException
{
return super.put(host, object);
}
@Override
public TYPE get(Object key)
{
return super.get(key);
}
/**
* Retrieve a lazy list of map entries associated with specified
* hostname by taking into account the domain suffix matches.
*
* @param host hostname
* @return lazy list of map entries
*/
public Object getLazyMatches(String host)
{
if (host == null)
return LazyList.getList(super.entrySet());
int idx = 0;
String domain = host.trim();
HashSet domains = new HashSet();
do
{
domains.add(domain);
if ((idx = domain.indexOf('.')) > 0)
{
domain = domain.substring(idx + 1);
}
}
while (idx > 0);
Object entries = null;
for (Map.Entry entry : super.entrySet())
{
if (domains.contains(entry.getKey()))
{
entries = LazyList.add(entries, entry);
}
}
return entries;
}
}