com.github.javaparser.utils.VisitorMap Maven / Gradle / Ivy
/*
* Copyright (C) 2007-2010 Júlio Vilmar Gesser.
* Copyright (C) 2011, 2013-2023 The JavaParser Team.
*
* This file is part of JavaParser.
*
* JavaParser can be used either under the terms of
* a) the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
* b) the terms of the Apache License
*
* You should have received a copy of both licenses in LICENCE.LGPL and
* LICENCE.APACHE. Please refer to those files for details.
*
* JavaParser is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*/
package com.github.javaparser.utils;
import com.github.javaparser.ast.Node;
import com.github.javaparser.ast.visitor.GenericVisitor;
import com.github.javaparser.ast.visitor.Visitable;
import com.github.javaparser.ast.visitor.VoidVisitor;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
/**
* A map that overrides the equals and hashcode calculation of the added nodes
* by using another equals and hashcode visitor for those methods.
*/
public class VisitorMap implements Map {
private final Map innerMap = new HashMap<>();
private final GenericVisitor hashcodeVisitor;
private final GenericVisitor equalsVisitor;
/**
* Pass the visitors to use for equals and hashcode.
*/
public VisitorMap(GenericVisitor hashcodeVisitor, GenericVisitor equalsVisitor) {
this.hashcodeVisitor = hashcodeVisitor;
this.equalsVisitor = equalsVisitor;
}
@Override
public int size() {
return innerMap.size();
}
@Override
public boolean isEmpty() {
return innerMap.isEmpty();
}
@Override
public boolean containsKey(Object key) {
return innerMap.containsKey(new EqualsHashcodeOverridingFacade((N) key));
}
@Override
public boolean containsValue(Object value) {
return innerMap.containsValue(value);
}
@Override
public V get(Object key) {
return innerMap.get(new EqualsHashcodeOverridingFacade((N) key));
}
@Override
public V put(N key, V value) {
return innerMap.put(new EqualsHashcodeOverridingFacade(key), value);
}
private class EqualsHashcodeOverridingFacade implements Visitable {
private final N overridden;
EqualsHashcodeOverridingFacade(N overridden) {
this.overridden = overridden;
}
@Override
public R accept(GenericVisitor v, A arg) {
throw new AssertionError();
}
@Override
public void accept(VoidVisitor v, A arg) {
throw new AssertionError();
}
@Override
public final int hashCode() {
return overridden.accept(hashcodeVisitor, null);
}
@Override
public boolean equals(final Object obj) {
if (obj == null || !(obj instanceof VisitorMap.EqualsHashcodeOverridingFacade)) {
return false;
}
return overridden.accept(equalsVisitor, ((EqualsHashcodeOverridingFacade) obj).overridden);
}
}
@Override
public V remove(Object key) {
return innerMap.remove(new EqualsHashcodeOverridingFacade((N) key));
}
@Override
public void putAll(Map extends N, ? extends V> m) {
m.forEach(this::put);
}
@Override
public void clear() {
innerMap.clear();
}
@Override
public Set keySet() {
return innerMap.keySet().stream().map(k -> k.overridden).collect(Collectors.toSet());
}
@Override
public Collection values() {
return innerMap.values();
}
@Override
public Set> entrySet() {
return innerMap.entrySet().stream().map(e -> new HashMap.SimpleEntry<>(e.getKey().overridden, e.getValue())).collect(Collectors.toSet());
}
}