org.sonarsource.analyzer.commons.collections.PMap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of sonar-analyzer-commons Show documentation
Show all versions of sonar-analyzer-commons Show documentation
Logic useful for a language plugin
/*
* SonarSource Analyzers Commons
* Copyright (C) 2009-2024 SonarSource SA
* mailto:info AT sonarsource DOT com
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of 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.
*
* This program 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.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
package org.sonarsource.analyzer.commons.collections;
import java.util.Map;
import javax.annotation.Nullable;
import java.util.function.BiConsumer;
/**
* Persistent (functional) Map.
*
* @author Evgeny Mandrikov
* @param the type of keys maintained by this map
* @param the type of mapped values
*/
public interface PMap {
/**
* @return new map with added key-value pair, or this if map already contains given key-value pair
*/
PMap put(K key, V value);
/**
* @return new map with removed key, or this if map does not contain given key
*/
PMap remove(K key);
/**
* @return value associated with given key, or null if not found
*/
@Nullable
V get(K key);
/**
* Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.
*/
void forEach(BiConsumer action);
/**
* @return true if this map contains no elements
*/
boolean isEmpty();
/**
* The string representation consists of a list of key-value mappings in the ascending order of hash codes of keys.
* If two keys have same hash code, then their relative order is arbitrary, but stable.
*
* @return a string representation of this map
*/
@Override
String toString();
Iterable> entries();
/**
* @return a set view of the keys contained in the map.
*/
PSet keySet();
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy