All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.eclipse.jetty.util.IncludeExcludeSet Maven / Gradle / Ivy

There is a newer version: 11.0.0.beta1
Show newest version
//
//  ========================================================================
//  Copyright (c) 1995-2017 Mort Bay Consulting Pty. Ltd.
//  ------------------------------------------------------------------------
//  All rights reserved. This program and the accompanying materials
//  are made available under the terms of the Eclipse Public License v1.0
//  and Apache License v2.0 which accompanies this distribution.
//
//      The Eclipse Public License is available at
//      http://www.eclipse.org/legal/epl-v10.html
//
//      The Apache License v2.0 is available at
//      http://www.opensource.org/licenses/apache2.0.php
//
//  You may elect to redistribute this code under either of these licenses.
//  ========================================================================
//

package org.eclipse.jetty.util;

import java.util.HashSet;
import java.util.Set;


/** Utility class to maintain a set of inclusions and exclusions.
 * 

Maintains a set of included and excluded elements. The method {@link #matches(Object)} * will return true IFF the passed object is not in the excluded set AND ( either the * included set is empty OR the object is in the included set) *

The type of the underlying {@link Set} used may be passed into the * constructor, so special sets like Servlet PathMap may be used. *

* @param

The type of element of the set (often a pattern) * @param The type of the instance passed to the predicate */ public class IncludeExcludeSet implements Predicate { private final Set

_includes; private final Predicate _includePredicate; private final Set

_excludes; private final Predicate _excludePredicate; private static class SetContainsPredicate implements Predicate { private final Set set; public SetContainsPredicate(Set set) { this.set = set; } @Override public boolean test(T item) { return set.contains(item); } } /** * Default constructor over {@link HashSet} */ public IncludeExcludeSet() { this(HashSet.class); } /** * Construct an IncludeExclude * @param setClass The type of {@link Set} to using internally to hold patterns. Two instances will be created. * one for include patterns and one for exclude patters. If the class is also a {@link Predicate}, * then it is also used as the item test for the set, otherwise a {@link SetContainsPredicate} instance * is created. * @param The type of a set to use as the backing store */ public > IncludeExcludeSet(Class setClass) { try { _includes = setClass.newInstance(); _excludes = setClass.newInstance(); if(_includes instanceof Predicate) { _includePredicate = (Predicate)_includes; } else { _includePredicate = new SetContainsPredicate(_includes); } if(_excludes instanceof Predicate) { _excludePredicate = (Predicate)_excludes; } else { _excludePredicate = new SetContainsPredicate(_excludes); } } catch (InstantiationException | IllegalAccessException e) { throw new RuntimeException(e); } } /** * Construct an IncludeExclude * * @param includeSet the Set of items that represent the included space * @param includePredicate the Predicate for included item testing (null for simple {@link Set#contains(Object)} test) * @param excludeSet the Set of items that represent the excluded space * @param excludePredicate the Predicate for excluded item testing (null for simple {@link Set#contains(Object)} test) * @param The type of a set to use as the backing store */ public > IncludeExcludeSet(Set

includeSet, Predicate includePredicate, Set

excludeSet, Predicate excludePredicate) { _includes = includeSet; _includePredicate = includePredicate; _excludes = excludeSet; _excludePredicate = excludePredicate; } public void include(P element) { _includes.add(element); } public void include(P... element) { for (P e: element) _includes.add(e); } public void exclude(P element) { _excludes.add(element); } public void exclude(P... element) { for (P e: element) _excludes.add(e); } public boolean matches(T t) { return test(t); } public boolean test(T t) { if (!_includes.isEmpty() && !_includePredicate.test(t)) return false; return !_excludePredicate.test(t); } public int size() { return _includes.size()+_excludes.size(); } public Set

getIncluded() { return _includes; } public Set

getExcluded() { return _excludes; } public void clear() { _includes.clear(); _excludes.clear(); } @Override public String toString() { return String.format("%s@%x{i=%s,ip=%s,e=%s,ep=%s}",this.getClass().getSimpleName(),hashCode(),_includes,_includePredicate,_excludes,_excludePredicate); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy