1 /*
2 * Licensed to the Apache Software Foundation (ASF) under one
3 * or more contributor license agreements. See the NOTICE file
4 * distributed with this work for additional information
5 * regarding copyright ownership. The ASF licenses this file
6 * to you under the Apache License, Version 2.0 (the
7 * "License"); you may not use this file except in compliance
8 * with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0
11 *
12 * Unless required by applicable law or agreed to in writing,
13 * software distributed under the License is distributed on an
14 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15 * KIND, either express or implied. See the License for the
16 * specific language governing permissions and limitations
17 * under the License.
18 */
19 package org.eclipse.aether.util.filter;
20
21 import java.util.List;
22
23 import org.eclipse.aether.graph.DependencyFilter;
24 import org.eclipse.aether.graph.DependencyNode;
25
26 import static java.util.Objects.requireNonNull;
27
28 /**
29 * A dependency filter that negates another filter.
30 */
31 public final class NotDependencyFilter implements DependencyFilter {
32
33 private final DependencyFilter filter;
34
35 /**
36 * Creates a new filter negatint the specified filter.
37 *
38 * @param filter The filter to negate, must not be {@code null}.
39 */
40 public NotDependencyFilter(DependencyFilter filter) {
41 this.filter = requireNonNull(filter, "dependency filter cannot be null");
42 }
43
44 public boolean accept(DependencyNode node, List<DependencyNode> parents) {
45 return !filter.accept(node, parents);
46 }
47
48 @Override
49 public boolean equals(Object obj) {
50 if (this == obj) {
51 return true;
52 }
53
54 if (obj == null || !getClass().equals(obj.getClass())) {
55 return false;
56 }
57
58 NotDependencyFilter that = (NotDependencyFilter) obj;
59
60 return this.filter.equals(that.filter);
61 }
62
63 @Override
64 public int hashCode() {
65 int hash = getClass().hashCode();
66 hash = hash * 31 + filter.hashCode();
67 return hash;
68 }
69 }