software.xdev.mockserver.collections.ImmutableEntry Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of server Show documentation
MockServer NeoLight Netty Server
There is a newer version: 1.0.8
/*
 * Copyright © 2024 XDEV Software (https://xdev.software)
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package software.xdev.mockserver.collections;

import static software.xdev.mockserver.model.NottableString.string;

import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.Set;

import org.apache.commons.lang3.tuple.Pair;

import software.xdev.mockserver.matchers.RegexStringMatcher;
import software.xdev.mockserver.model.NottableString;


public class ImmutableEntry extends Pair
	implements Map.Entry
{
	private final RegexStringMatcher regexStringMatcher;
	private final NottableString key;
	private final NottableString value;
	
	public static ImmutableEntry entry(
		final RegexStringMatcher regexStringMatcher,
		final String key,
		final String value)
	{
		return new ImmutableEntry(regexStringMatcher, key, value);
	}
	
	public static ImmutableEntry entry(
		final RegexStringMatcher regexStringMatcher,
		final NottableString key,
		final NottableString value)
	{
		return new ImmutableEntry(regexStringMatcher, key, value);
	}
	
	ImmutableEntry(final RegexStringMatcher regexStringMatcher, final String key, final String value)
	{
		this.regexStringMatcher = regexStringMatcher;
		this.key = string(key);
		this.value = string(value);
	}
	
	ImmutableEntry(final RegexStringMatcher regexStringMatcher, final NottableString key, final NottableString value)
	{
		this.regexStringMatcher = regexStringMatcher;
		this.key = key;
		this.value = value;
	}
	
	public boolean isOptional()
	{
		return this.getKey().isOptional();
	}
	
	public boolean isNotted()
	{
		return this.getKey().isNot() && !this.getValue().isNot();
	}
	
	public boolean isNotOptional()
	{
		return !this.isOptional();
	}
	
	@Override
	public NottableString getLeft()
	{
		return this.key;
	}
	
	@Override
	public NottableString getRight()
	{
		return this.value;
	}
	
	@Override
	public NottableString setValue(final NottableString value)
	{
		throw new UnsupportedOperationException("ImmutableEntry is immutable");
	}
	
	@Override
	public String toString()
	{
		return "(" + this.key + ": " + this.value + ")";
	}
	
	@Override
	public boolean equals(final Object o)
	{
		if(this == o)
		{
			return true;
		}
		if(o == null || this.getClass() != o.getClass())
		{
			return false;
		}
		final ImmutableEntry that = (ImmutableEntry)o;
		return this.regexStringMatcher.matches(this.key, that.key)
			&& this.regexStringMatcher.matches(this.value, that.value)
			|| (!this.regexStringMatcher.matches(this.key, that.key)
			&& (this.key.isOptional() || that.key.isOptional()));
	}
	
	@Override
	public int hashCode()
	{
		return Objects.hash(this.key, this.value);
	}
	
	public static  boolean listsEqual(final List matcher, final List matched)
	{
		boolean matches = false;
		if(matcher.size() == matched.size())
		{
			final Set matchedIndexes = new HashSet<>();
			final Set matcherIndexes = new HashSet<>();
			for(int i = 0; i < matcher.size(); i++)
			{
				final T matcherItem = matcher.get(i);
				for(int j = 0; j < matched.size(); j++)
				{
					final T matchedItem = matched.get(j);
					if(matcherItem != null && matcherItem.equals(matchedItem))
					{
						matchedIndexes.add(j);
						matcherIndexes.add(i);
					}
				}
			}
			matches = matchedIndexes.size() == matched.size() && matcherIndexes.size() == matcher.size();
		}
		return matches;
	}
	
	@SuppressWarnings("PMD.CognitiveComplexity")
	public static boolean listsEqualWithOptionals(
		final RegexStringMatcher regexStringMatcher,
		final List matcher,
		final List matched)
	{
		final Set matchingMatchedIndexes = new HashSet<>();
		final Set matchingMatcherIndexes = new HashSet<>();
		final Set matcherKeys = new HashSet<>();
		matcher.forEach(matcherItem -> matcherKeys.add(matcherItem.getKey()));
		final Set matchedKeys = new HashSet<>();
		matched.forEach(matchedItem -> matchedKeys.add(matchedItem.getKey()));
		for(int i = 0; i < matcher.size(); i++)
		{
			final ImmutableEntry matcherItem = matcher.get(i);
			if(matcherItem != null)
			{
				for(int j = 0; j < matched.size(); j++)
				{
					final ImmutableEntry matchedItem = matched.get(j);
					if(matchedItem != null)
					{
						if(matcherItem.equals(matchedItem))
						{
							matchingMatchedIndexes.add(j);
							matchingMatcherIndexes.add(i);
						}
						else if(matcherItem.getKey().isOptional() && !contains(
							regexStringMatcher,
							matchedKeys,
							matcherItem.getKey()))
						{
							matchingMatchedIndexes.add(j);
							matchingMatcherIndexes.add(i);
						}
						else if(matchedItem.getKey().isOptional() && !contains(
							regexStringMatcher,
							matcherKeys,
							matchedItem.getKey()))
						{
							matchingMatchedIndexes.add(j);
							matchingMatcherIndexes.add(i);
						}
					}
				}
			}
		}
		return matchingMatchedIndexes.size() == matched.size() && matchingMatcherIndexes.size() == matcher.size();
	}
	
	private static boolean contains(
		final RegexStringMatcher regexStringMatcher,
		final Set matchedKeys,
		final NottableString matcherItem)
	{
		for(final NottableString matchedKey : matchedKeys)
		{
			if(regexStringMatcher.matches(matchedKey, matcherItem))
			{
				return true;
			}
		}
		return false;
	}
}