ru.d_shap.conditionalvalues.Values Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of conditional-values Show documentation
Show all versions of conditional-values Show documentation
Conditional values simplify conditional logic and get rid of if-statements in the code
The newest version!
///////////////////////////////////////////////////////////////////////////////////////////////////
// Conditional values simplify conditional logic and get rid of if-statements in the code.
// Copyright (C) 2016 Dmitry Shapovalov.
//
// This file is part of conditional values.
//
// Conditional values 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.
//
// Conditional values 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, see
* The lookup result of the best matching {@link ru.d_shap.conditionalvalues.ValueSet} objects.
*
*
* If {@link ru.d_shap.conditionalvalues.Values} object created from several matchig
* {@link ru.d_shap.conditionalvalues.ValueSet} objects, then values are obtained from every
* one {@link ru.d_shap.conditionalvalues.ValueSet} object.
*
*
* @param generic type for the value.
*
* @author Dmitry Shapovalov
*/
public final class Values {
private final Comparator _comparator;
private final List> _valueSets;
private final Set _ids;
private final List _values;
private final Set _uniqueValues;
private final List _allValues;
private final Set _allUniqueValues;
Values(final Comparator comparator, final List> valueSets, final List allValues) {
super();
_comparator = comparator;
_valueSets = createValueSets(valueSets);
_ids = createIds();
_values = createValues();
_uniqueValues = createSet(_values);
_allValues = createAllValues(allValues);
_allUniqueValues = createSet(_allValues);
}
private List> createValueSets(final List> valueSets) {
List> result = new ArrayList<>();
if (valueSets != null) {
for (ValueSet valueSet : valueSets) {
if (valueSet != null) {
result.add(valueSet);
}
}
}
return Collections.unmodifiableList(result);
}
private Set createIds() {
Set result = new TreeSet<>();
for (ValueSet valueSet : _valueSets) {
String id = valueSet.getId();
if (id != null) {
result.add(id);
}
}
return Collections.unmodifiableSet(result);
}
private List createValues() {
List result = new ArrayList<>();
for (ValueSet valueSet : _valueSets) {
result.addAll(valueSet.getValues());
}
if (_comparator != null) {
Collections.sort(result, _comparator);
}
return Collections.unmodifiableList(result);
}
private List createAllValues(final List allValues) {
List result = new ArrayList<>();
if (allValues != null) {
for (T value : allValues) {
if (value != null) {
result.add(value);
}
}
}
if (_comparator != null) {
Collections.sort(result, _comparator);
}
return Collections.unmodifiableList(result);
}
private Set createSet(final List values) {
Set result;
if (_comparator == null) {
result = new HashSet<>();
} else {
result = new TreeSet<>(_comparator);
}
result.addAll(values);
return result;
}
/**
* Get the IDs of the {@link ru.d_shap.conditionalvalues.ValueSet} objects.
*
* @return the IDs of the {@link ru.d_shap.conditionalvalues.ValueSet} objects.
*/
public Set getIds() {
return _ids;
}
/**
* Check if the result contains no values.
*
* @return true, if the result contains no values.
*/
public boolean isEmpty() {
return _uniqueValues.isEmpty();
}
/**
* Check if the result contains the specified value.
*
* @param value the specified value.
*
* @return true, if the result contains the specified value.
*/
public boolean contains(final T value) {
return _uniqueValues.contains(value);
}
/**
* Check if the result does not contain the specified value.
*
* @param value the specified value.
*
* @return true, if the result does not contain the specified value.
*/
public boolean doesNotContain(final T value) {
return _allUniqueValues.contains(value) && !_uniqueValues.contains(value);
}
/**
* Check if all values contain the specified value.
*
* @param value the specified value.
*
* @return true, if all values contain the specified value.
*/
public boolean allValuesContain(final T value) {
return _allUniqueValues.contains(value);
}
/**
* Check if all values does not contain the specified value.
*
* @param value the specified value.
*
* @return true, if all values does not contain the specified value.
*/
public boolean allValuesDoesNotContain(final T value) {
return !_allUniqueValues.contains(value);
}
/**
* Get the result values.
*
* @return the result values.
*/
public List getValues() {
return _values;
}
/**
* Get the unique result values.
*
* @return the unique result values.
*/
public Set getUniqueValues() {
return _uniqueValues;
}
/**
* Get all values.
*
* @return all values.
*/
public List getAllValues() {
return _allValues;
}
/**
* Get all unique values.
*
* @return all unique values.
*/
public Set getAllUniqueValues() {
return _allUniqueValues;
}
/**
* Perform the specified action on each value.
*
* @param action the specified action.
*
* @return current object for the method chaining.
*/
public Values performAction(final Action action) {
if (action != null) {
for (T value : _values) {
action.perform(value);
}
}
return this;
}
/**
* Perform the specified actions on each value.
*
* @param actions the specified actions.
*
* @return current object for the method chaining.
*/
@SafeVarargs
public final Values performAction(final Action... actions) {
if (actions != null) {
for (T value : _values) {
for (Action action : actions) {
if (action != null) {
action.perform(value);
}
}
}
}
return this;
}
@Override
public String toString() {
return _valueSets.toString();
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy